{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061264383,0.00004263124,0.98821676,0.0029587583,0.0003764099,0.0003186444,0.000005268077,0.00013477833,0.001820304],"genre_scores_gemma":[0.782694,0.000053924792,0.21681778,0.00023721164,0.00007423011,0.000055264434,0.000021798603,0.000010936781,0.000034858884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981007,0.000057703877,0.00052220304,0.00059730234,0.00043864048,0.00028344942],"domain_scores_gemma":[0.999119,0.000076481105,0.00019203448,0.00025556036,0.0002550707,0.0001018986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034435076,0.00020847644,0.00018389407,0.0003107193,0.00009617296,0.00027460975,0.0007747442,0.00010492676,0.000015061366],"category_scores_gemma":[0.00010512136,0.00021906692,0.000031848987,0.00037916895,0.00004844379,0.0005099229,0.00015129102,0.00025775115,0.0000884649],"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.000009803503,0.000050204075,0.00007857305,0.0000033507697,0.0000048074317,0.000014870804,0.0004952874,0.57490367,0.00085316866,0.41738465,0.0000016789119,0.006199914],"study_design_scores_gemma":[0.00009548797,0.000071993345,0.00012458456,0.00017221627,0.0000022715903,0.00001567024,0.000069739246,0.9178684,0.0047882944,0.07655707,0.000016394752,0.00021792376],"about_ca_topic_score_codex":0.00008632523,"about_ca_topic_score_gemma":0.000010045487,"teacher_disagreement_score":0.7765676,"about_ca_system_score_codex":0.00014633799,"about_ca_system_score_gemma":0.00011914559,"threshold_uncertainty_score":0.89332896},"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":"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.059400417,0.000005228566,0.91266024,0.0025177938,0.0020533807,0.0002299092,0.000015155861,0.0004270718,0.022690823],"genre_scores_gemma":[0.9214683,0.000013321075,0.077299386,0.00056452485,0.0003086029,0.000033700417,0.000007035608,0.000017154909,0.0002879764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977038,0.000070803784,0.00056907185,0.0006470617,0.000601257,0.00040800552],"domain_scores_gemma":[0.9984893,0.000113056536,0.00019242987,0.00052406295,0.000507681,0.00017346135],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004899346,0.00025706796,0.00020543055,0.00035845666,0.00024661014,0.0009800972,0.0017383056,0.00014695812,0.0014131594],"category_scores_gemma":[0.0002913236,0.00025924743,0.00011176735,0.00031742232,0.00016139055,0.00096298615,0.00022758805,0.00063656515,0.00050695497],"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.000013948539,0.00008647685,0.00006835589,0.0000041815747,0.0000142113495,0.000022879782,0.00022332543,0.000024172521,0.16258992,0.643945,0.00009225936,0.19291528],"study_design_scores_gemma":[0.000041577325,0.00011337633,0.00009976321,0.00014605199,0.0000052657106,0.000061756065,0.00017630949,0.34498364,0.49311927,0.1595985,0.001215874,0.00043861268],"about_ca_topic_score_codex":0.00018794155,"about_ca_topic_score_gemma":0.00020770138,"teacher_disagreement_score":0.8620679,"about_ca_system_score_codex":0.00008369925,"about_ca_system_score_gemma":0.0001561785,"threshold_uncertainty_score":0.999986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021996133,0.000016873491,0.9446753,0.0034697126,0.005345717,0.00024284955,0.000009170333,0.00017613279,0.02406811],"genre_scores_gemma":[0.949638,0.000017617876,0.04942181,0.00021618315,0.0003982041,0.000048510417,0.000005977069,0.000009113733,0.0002445878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848354,0.000033730706,0.0004162369,0.0005085243,0.00028510738,0.000272839],"domain_scores_gemma":[0.9984199,0.00029593162,0.00014630154,0.00046169703,0.00058626663,0.000089923844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037397337,0.0001739711,0.00015242129,0.00021590141,0.00017523201,0.0003387,0.0016260947,0.000117094016,0.00018134712],"category_scores_gemma":[0.00051782874,0.00016270224,0.00010181739,0.00019731549,0.00016098747,0.00039065827,0.00013375451,0.0002684826,0.00026162528],"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.000015316904,0.000102175494,0.00008266109,0.000003687301,0.000010197954,0.0000019509316,0.00024975286,0.000029989249,0.03447199,0.8462817,0.000101431615,0.11864915],"study_design_scores_gemma":[0.0000310167,0.000060237457,0.00037412767,0.000028629613,0.0000043690884,0.0000116226975,0.00021078902,0.6549356,0.03703841,0.3036484,0.0034444225,0.0002123767],"about_ca_topic_score_codex":0.000038725044,"about_ca_topic_score_gemma":0.00021852108,"teacher_disagreement_score":0.92764187,"about_ca_system_score_codex":0.00004804103,"about_ca_system_score_gemma":0.00023773331,"threshold_uncertainty_score":0.6634805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012925245,0.00005095628,0.9757844,0.0033343772,0.00218307,0.0006996951,0.000017961676,0.0002057677,0.016431252],"genre_scores_gemma":[0.9743148,0.000014507978,0.024861645,0.0003408974,0.00028946617,0.00011268763,0.000016587872,0.000013020254,0.000036359437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747634,0.000090033405,0.00084915076,0.0006615075,0.0005207466,0.00040221933],"domain_scores_gemma":[0.9985066,0.00021734416,0.0002506261,0.00035589575,0.0005609622,0.00010857292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058305927,0.00025166894,0.00030053133,0.00033639962,0.00015605356,0.0002998628,0.0013267905,0.00012643929,0.000014067469],"category_scores_gemma":[0.00018941866,0.00024620543,0.00013350639,0.00033648722,0.0000773676,0.00039760035,0.000107205844,0.00020810409,0.0001541601],"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.000067613655,0.000095746254,0.000040007046,0.000009568849,0.000014157339,0.000010104686,0.00018738757,0.37696257,0.00013919869,0.6124916,0.000008738858,0.009973297],"study_design_scores_gemma":[0.00023510204,0.0001822752,0.0000965386,0.00023945869,0.000003862058,0.000016399797,0.00046616732,0.8359201,0.0008158495,0.16172859,0.000051884086,0.00024375968],"about_ca_topic_score_codex":0.00017694752,"about_ca_topic_score_gemma":0.000061185296,"teacher_disagreement_score":0.9730223,"about_ca_system_score_codex":0.0006170139,"about_ca_system_score_gemma":0.00021537967,"threshold_uncertainty_score":0.99999905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094220145,0.00000376845,0.98185265,0.00456352,0.0022390103,0.0005651997,0.000013781072,0.00012996666,0.0012101028],"genre_scores_gemma":[0.88361925,0.0000055026303,0.115870185,0.00014414103,0.0002112572,0.00008546425,0.000007031337,0.000009508149,0.00004769015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984654,0.000026016643,0.00043275658,0.00043314236,0.00037670927,0.0002659507],"domain_scores_gemma":[0.9985967,0.00016868961,0.00012241543,0.0003219307,0.0007071781,0.00008307422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042427648,0.00018125716,0.00012797055,0.00013510739,0.00031226798,0.0007114011,0.00084355864,0.00008615825,0.00023183484],"category_scores_gemma":[0.00020362128,0.00014546809,0.00011021737,0.0002071206,0.00017639186,0.00038596475,0.00011140329,0.00032535786,0.000034438763],"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.00001842289,0.000040604646,0.000011099714,0.0000025169306,0.000017344488,0.0000012047756,0.00021501454,0.09124373,0.003913176,0.61849034,0.000003992481,0.28604257],"study_design_scores_gemma":[0.000040866686,0.000041106312,0.000012299628,0.000025858479,0.000006847022,0.00003654994,0.0002674717,0.9645073,0.003587562,0.031103197,0.00019337454,0.00017757578],"about_ca_topic_score_codex":0.00009795476,"about_ca_topic_score_gemma":0.00017036572,"teacher_disagreement_score":0.8741972,"about_ca_system_score_codex":0.000048520535,"about_ca_system_score_gemma":0.00022092846,"threshold_uncertainty_score":0.6860058},"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":"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.54299694,0.0005473406,0.0010330642,0.0009541475,0.0003035093,0.0006184298,0.000006330088,0.00003924909,0.453501],"genre_scores_gemma":[0.9959658,0.00020798935,0.00006850719,0.000013068378,0.000098438555,0.000027987977,0.0000028652662,0.000007041515,0.0036083006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866885,0.000074296506,0.00044397791,0.00023583825,0.0003808073,0.00019625436],"domain_scores_gemma":[0.9992662,0.00019695467,0.00016361929,0.00017600402,0.00016288189,0.000034334786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000901065,0.00012507115,0.00014630049,0.00013035898,0.0004875162,0.0001697072,0.0005883979,0.000036095593,0.00004676358],"category_scores_gemma":[0.000036151825,0.00009296663,0.00004718493,0.00015022108,0.00085281505,0.000088062836,0.0002628256,0.00010698015,0.000007818017],"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.000030073586,0.000045007815,0.000447005,0.000025181578,0.000044894132,0.0000012291147,0.002327792,0.00011755783,0.00013036247,0.9782989,0.000035057386,0.018496951],"study_design_scores_gemma":[0.00094408804,0.00031250448,0.054401778,0.0014353035,0.00023204109,0.000002332609,0.0573107,0.014002688,0.013886543,0.8270503,0.029375697,0.0010460016],"about_ca_topic_score_codex":0.0006703542,"about_ca_topic_score_gemma":0.0017526061,"teacher_disagreement_score":0.45296884,"about_ca_system_score_codex":0.00003360218,"about_ca_system_score_gemma":0.000008372666,"threshold_uncertainty_score":0.3791069},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051487465,0.000015285144,0.975944,0.0026429922,0.0020966465,0.0001430841,0.000005291218,0.00019339238,0.013810565],"genre_scores_gemma":[0.9835947,0.00003429233,0.01544761,0.000607268,0.0001847456,0.000006791197,0.0000058842156,0.0000100564475,0.0001086381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982052,0.000072422896,0.00048752033,0.00048470378,0.00044193162,0.00030824705],"domain_scores_gemma":[0.9989782,0.000088957095,0.00018334032,0.00030775266,0.0003099879,0.00013174347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001882244,0.00020633181,0.00015515198,0.00022885064,0.0001972973,0.00056374166,0.00083064794,0.00008765304,0.0038411017],"category_scores_gemma":[0.00011549356,0.00021578274,0.00009080074,0.0003072351,0.00021971195,0.0006721452,0.00012982954,0.0002728802,0.00023258448],"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.000008275985,0.000074233925,0.0004128498,0.00000141853,0.000016685954,0.000024702173,0.00024925618,0.07209103,0.00035997547,0.5199147,0.00006770665,0.40677917],"study_design_scores_gemma":[0.000033826447,0.00004294781,0.00008052506,0.000031904496,0.000002919857,0.00004195965,0.000106753985,0.9910805,0.00093450636,0.007321035,0.00009608331,0.00022703454],"about_ca_topic_score_codex":0.00003501057,"about_ca_topic_score_gemma":0.000034900237,"teacher_disagreement_score":0.97844595,"about_ca_system_score_codex":0.00010430185,"about_ca_system_score_gemma":0.00003641148,"threshold_uncertainty_score":0.99706954},"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":"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.007771687,0.000022546874,0.95058787,0.01045649,0.0038090763,0.00012927435,0.000030336942,0.00017366001,0.027019067],"genre_scores_gemma":[0.9813822,0.000018278688,0.017324012,0.00040258546,0.00031014995,0.000008450164,0.00004353058,0.000008543234,0.00050228107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804544,0.00010256531,0.0003947896,0.0006216738,0.00058657984,0.00024891985],"domain_scores_gemma":[0.99856293,0.00009305102,0.00010260773,0.000839043,0.0002618054,0.00014056808],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077933806,0.00015709635,0.00015108862,0.00022643889,0.00004323593,0.00026958028,0.0032987816,0.000061656,0.00012777052],"category_scores_gemma":[0.0005261524,0.00014937411,0.000027094387,0.00033718284,0.00006573142,0.000567861,0.0006599154,0.00034333277,0.0010341299],"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.000031749725,0.00017503399,0.00036969496,0.0000020310576,0.000008455731,0.00006799668,0.00047540187,0.006262293,0.00013503613,0.7434086,0.00033123037,0.24873243],"study_design_scores_gemma":[0.000040230105,0.000068533736,0.00012561835,0.000043541986,9.329747e-7,0.0000094216275,0.00015266142,0.91821426,0.0013422491,0.07453032,0.0052982126,0.00017404258],"about_ca_topic_score_codex":0.00030717833,"about_ca_topic_score_gemma":0.00027023302,"teacher_disagreement_score":0.97361046,"about_ca_system_score_codex":0.00006566132,"about_ca_system_score_gemma":0.00020591321,"threshold_uncertainty_score":0.9997437},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016805308,0.00008275609,0.81554645,0.0012507279,0.0024667396,0.0002393873,0.0000064872993,0.00025925363,0.16334286],"genre_scores_gemma":[0.9955771,0.000024439189,0.0030121894,0.00012562303,0.00025064714,0.000046844296,0.0000070823235,0.000009883068,0.0009462227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978253,0.000096112606,0.00036555808,0.0005872956,0.0008113168,0.0003144005],"domain_scores_gemma":[0.9980987,0.00007991788,0.00016465025,0.00047521348,0.00094258774,0.00023897925],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040250676,0.00023354072,0.00020647496,0.00017673883,0.0000939775,0.00076448685,0.0018398317,0.00008437965,0.00008952783],"category_scores_gemma":[0.00017503969,0.00017571912,0.000049142756,0.0002909465,0.00013904147,0.00057386287,0.00018429308,0.00022207825,0.0010560704],"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.000049009206,0.00012238049,0.00018103268,0.0000035787968,0.000026863685,0.000028452081,0.00089159934,0.002696176,0.0002028456,0.9693423,0.00015747511,0.026298294],"study_design_scores_gemma":[0.00009099526,0.0007338932,0.00019930239,0.00015037954,0.000007503865,0.000050518243,0.0011093852,0.733997,0.0080846045,0.25135946,0.003708932,0.0005080592],"about_ca_topic_score_codex":0.00017040355,"about_ca_topic_score_gemma":0.000103399674,"teacher_disagreement_score":0.97877175,"about_ca_system_score_codex":0.000110645946,"about_ca_system_score_gemma":0.00030676604,"threshold_uncertainty_score":0.9997217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033231203,0.0000197209,0.94003385,0.0067575667,0.0038439054,0.0006365278,0.000043281245,0.00048851303,0.044853523],"genre_scores_gemma":[0.9125475,0.000030359268,0.08324226,0.0009664151,0.001946631,0.00014924543,0.00007346783,0.000042847412,0.0010012187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584144,0.00018390887,0.0010389887,0.0010597318,0.001058321,0.0008175834],"domain_scores_gemma":[0.99654025,0.0007817853,0.00036354383,0.0007657153,0.0011186273,0.00043005095],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011225794,0.00043520305,0.0004443931,0.00028764913,0.00028233477,0.00077719364,0.0030008985,0.00019979136,0.00037697848],"category_scores_gemma":[0.0009957586,0.00043688374,0.00021891705,0.00046974703,0.00035718264,0.0007294715,0.0004633765,0.0003843583,0.0014728224],"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.0003970435,0.00016651969,0.000060699414,0.0000046992814,0.00006120111,0.000027135346,0.0017357765,0.025775723,0.0039594965,0.8764124,0.008610667,0.08278864],"study_design_scores_gemma":[0.00005760931,0.0003553838,0.000034679724,0.00007741375,0.000007981005,0.000009313992,0.00028968547,0.5718582,0.006375813,0.41198173,0.008559006,0.00039316545],"about_ca_topic_score_codex":0.000113541115,"about_ca_topic_score_gemma":0.000039648017,"teacher_disagreement_score":0.90922445,"about_ca_system_score_codex":0.0002374428,"about_ca_system_score_gemma":0.00042359796,"threshold_uncertainty_score":0.9998083},"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":"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.06834313,0.0000052602572,0.8633815,0.053611632,0.0007468738,0.00031562246,0.00003756429,0.00006861489,0.013489786],"genre_scores_gemma":[0.99758357,0.0000069005923,0.0006304573,0.0014663766,0.000059802467,0.000016556622,0.000023946432,0.000004800297,0.00020759841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983341,0.00021517402,0.0003912608,0.0002799604,0.00063861796,0.00014088888],"domain_scores_gemma":[0.99854356,0.00043636077,0.000161205,0.00035490462,0.00042602594,0.000077933706],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060532254,0.00013600306,0.0001353419,0.000088353554,0.00015708421,0.00015132557,0.00079191936,0.00004923665,0.0018096351],"category_scores_gemma":[0.0003145398,0.00008447043,0.00009082298,0.00022084886,0.0004316933,0.00018094966,0.00008728573,0.0001836602,0.00085781195],"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.0004307224,0.0002119581,0.000008897613,0.0000011113725,0.000023146042,0.0000030671458,0.0019203828,0.006158304,0.0014212149,0.9505467,0.0013659223,0.037908603],"study_design_scores_gemma":[0.00021377325,0.00021826958,0.000042035343,0.000028231045,0.000005146046,0.000009786028,0.00021696671,0.810227,0.024628347,0.16381851,0.00047465155,0.00011732139],"about_ca_topic_score_codex":0.000023457715,"about_ca_topic_score_gemma":0.000051945775,"teacher_disagreement_score":0.9292404,"about_ca_system_score_codex":0.000103710845,"about_ca_system_score_gemma":0.0001166683,"threshold_uncertainty_score":0.9999201},"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":"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.0044065444,0.0000060894367,0.98968744,0.0019410605,0.0023017593,0.0003800312,0.0006195767,0.00010783319,0.00054968265],"genre_scores_gemma":[0.9475125,0.0000040085833,0.050281007,0.00024390768,0.0007880368,0.000030602336,0.0009362191,0.000024666948,0.00017904489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99376225,0.0002783758,0.00094492425,0.0012935129,0.0033866675,0.00033424352],"domain_scores_gemma":[0.9939064,0.0008321519,0.00028307026,0.0013963308,0.0030613337,0.0005207506],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001136442,0.0002538388,0.00027804595,0.0006525925,0.00015869412,0.0011473913,0.0038332914,0.00010449083,0.0013217934],"category_scores_gemma":[0.0064566536,0.00023015635,0.000041924683,0.0009842662,0.00012891152,0.0016830021,0.00047968415,0.00026245526,0.0029675874],"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.00020276857,0.00026945776,0.00006843404,3.5112726e-7,0.00002409525,0.000014064668,0.0023329153,0.24619266,0.00069298066,0.01552535,0.00063751574,0.7340394],"study_design_scores_gemma":[0.000055943627,0.00019696068,0.00019064154,0.000019996673,0.0000033973001,0.0000016765846,0.0025174352,0.79627603,0.0021130352,0.19794065,0.00046860537,0.00021565573],"about_ca_topic_score_codex":0.00032421798,"about_ca_topic_score_gemma":0.00032440363,"teacher_disagreement_score":0.94310594,"about_ca_system_score_codex":0.00023283002,"about_ca_system_score_gemma":0.00035740717,"threshold_uncertainty_score":0.9998895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022938395,0.0000046705763,0.9790244,0.009318966,0.0008388709,0.00060244085,0.00006723712,0.00018002854,0.00973398],"genre_scores_gemma":[0.8838123,0.000024431536,0.11368883,0.0015969841,0.00021798626,0.00007525568,0.00013603688,0.000015446234,0.00043274305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973545,0.000105510335,0.0006185113,0.0006616646,0.00084256515,0.00041723004],"domain_scores_gemma":[0.99771845,0.00016702851,0.00019676615,0.00048475093,0.001269374,0.00016362644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085897,0.00022504044,0.00020173004,0.00038012787,0.00017524343,0.00067343755,0.001553237,0.00010060954,0.00043975093],"category_scores_gemma":[0.00045844528,0.00022625332,0.00011108938,0.0004544793,0.000076432756,0.00044422058,0.00008707345,0.00019766518,0.000317511],"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.000061728075,0.0006105954,0.00001773965,0.000009482887,0.000012186954,0.0000047224394,0.0004088564,0.020616265,0.00071938586,0.90109974,0.0002702839,0.07616899],"study_design_scores_gemma":[0.00012746107,0.00030353965,0.000029710827,0.00005821129,0.0000026325065,0.0000018815267,0.000049898208,0.8652788,0.015027209,0.11686165,0.0020493767,0.00020964295],"about_ca_topic_score_codex":0.0000060845414,"about_ca_topic_score_gemma":0.000021940214,"teacher_disagreement_score":0.8835829,"about_ca_system_score_codex":0.00010931997,"about_ca_system_score_gemma":0.00021070444,"threshold_uncertainty_score":0.9226343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033675697,0.00000910497,0.9622842,0.001267278,0.0015644904,0.00030695883,0.00003423813,0.0001119516,0.0007460897],"genre_scores_gemma":[0.75075704,0.0000024626547,0.24782005,0.0009468147,0.0003130109,0.000030583295,0.00004597706,0.000012741717,0.000071307644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980918,0.000082535815,0.00040820288,0.00057881046,0.00047958258,0.00035906347],"domain_scores_gemma":[0.99826515,0.00021030131,0.00015209058,0.00030452578,0.00077655393,0.00029136124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698927,0.00019353037,0.00016121358,0.00018467235,0.00018863927,0.0004852446,0.0010221963,0.00009193793,0.000026968422],"category_scores_gemma":[0.00039393269,0.00019842162,0.00006418958,0.00024098394,0.000032300384,0.00061017834,0.00013542533,0.00020149408,0.00014699003],"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.00030388642,0.000054999913,0.00002418603,0.0000017566523,0.00000874896,0.0000067096207,0.0015786766,0.68435353,0.00029575767,0.092903905,0.0005116263,0.21995619],"study_design_scores_gemma":[0.000036391306,0.00028440706,0.0000036468634,0.0001038817,0.0000036221625,0.0000064651276,0.00013378524,0.7103404,0.001201148,0.28755754,0.00014755869,0.00018118258],"about_ca_topic_score_codex":0.00007224689,"about_ca_topic_score_gemma":0.000095040086,"teacher_disagreement_score":0.71708137,"about_ca_system_score_codex":0.00013492533,"about_ca_system_score_gemma":0.0002058624,"threshold_uncertainty_score":0.80913985},"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":"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.0020669652,0.000014050995,0.9585082,0.010536942,0.0015484409,0.00015659412,0.0000037974262,0.00017014738,0.026994841],"genre_scores_gemma":[0.9745465,0.0000055563637,0.023269173,0.0014000334,0.00021224545,0.00002663043,0.000006203727,0.000012482849,0.00052115973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979071,0.00014076245,0.00033609115,0.00046462164,0.0008570382,0.00029438347],"domain_scores_gemma":[0.99845773,0.0002445073,0.00020367537,0.00038928638,0.0005416984,0.00016309619],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007815921,0.000199833,0.00014678929,0.00013574258,0.00022002879,0.0007910318,0.0015429616,0.000058533566,0.00026789962],"category_scores_gemma":[0.0002327968,0.00014134441,0.000052522846,0.0003851583,0.00015260393,0.0004716445,0.00017007971,0.00040886467,0.0008837957],"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.0000445347,0.000051741787,0.000031692845,7.419229e-7,0.000022224465,0.000021774926,0.0029799019,0.003433993,0.000052071064,0.57073426,0.00016512272,0.42246196],"study_design_scores_gemma":[0.00010199076,0.00028325923,0.00023100348,0.000057267778,0.0000059276417,0.000047734462,0.0026937912,0.92739296,0.0035447096,0.059245925,0.006062551,0.00033287724],"about_ca_topic_score_codex":0.00017083256,"about_ca_topic_score_gemma":0.000103511484,"teacher_disagreement_score":0.9724795,"about_ca_system_score_codex":0.000086477616,"about_ca_system_score_gemma":0.00024194323,"threshold_uncertainty_score":0.99989414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039808895,0.0000037220636,0.89545816,0.0012849355,0.00025460534,0.00023915221,0.000011328404,0.000028443284,0.06291074],"genre_scores_gemma":[0.9993763,0.0000034467014,0.00020926217,0.000068574,0.00023490316,0.000029167408,0.0000498752,0.0000040186587,0.000024435785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989423,0.000064196,0.00044931137,0.00010920821,0.00030006643,0.00013487891],"domain_scores_gemma":[0.99923396,0.00005218414,0.00023103172,0.000113731956,0.0003432025,0.00002589111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042780556,0.000095120835,0.00012007806,0.0001283456,0.00006051225,0.000101726284,0.00034227897,0.000030205312,0.0002621349],"category_scores_gemma":[0.00003174046,0.00007809948,0.000058015466,0.00025263388,0.00007177333,0.0002852392,0.00007119997,0.0001806517,0.000034315577],"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.00005500895,0.000051668943,0.0013704556,8.836553e-7,0.0000149666685,2.184508e-7,0.00060191844,0.01357504,0.000056986682,0.8021387,0.00014053249,0.18199365],"study_design_scores_gemma":[0.00004665949,0.00004412773,0.000753136,0.000038215065,0.000006956003,2.643975e-7,0.001268321,0.6153225,0.0041211927,0.37771207,0.000562095,0.00012449994],"about_ca_topic_score_codex":0.00026988867,"about_ca_topic_score_gemma":0.000054008528,"teacher_disagreement_score":0.9595674,"about_ca_system_score_codex":0.000057345616,"about_ca_system_score_gemma":0.00006324516,"threshold_uncertainty_score":0.31848046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12338957,0.00008069753,0.80480343,0.0051627057,0.00096735044,0.0005196997,0.000015053085,0.00017874668,0.06488273],"genre_scores_gemma":[0.99261594,0.000020594602,0.007087782,0.00003759974,0.00001798519,0.000018767176,0.0000028070576,0.0000060971406,0.00019241356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821246,0.00012354333,0.00044314322,0.00044426767,0.00058047636,0.00019610405],"domain_scores_gemma":[0.9984549,0.00014597915,0.00014408314,0.00041384884,0.0006858453,0.00015531057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083749543,0.00013375153,0.00016630632,0.00021307277,0.00004300589,0.000108515625,0.0010728575,0.00006395599,0.00007025305],"category_scores_gemma":[0.00057445397,0.00012220832,0.00004250528,0.00037425398,0.0003674854,0.00044550785,0.00030094493,0.00022736528,0.00007571125],"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.000038831906,0.00011948537,0.00021194917,0.000005303242,0.00001281962,0.000003781215,0.0008568929,0.00045214372,0.0016833247,0.8976069,0.0000082858305,0.099000245],"study_design_scores_gemma":[0.000043267926,0.00023141499,0.0001499383,0.000034760407,0.0000012024278,0.000009157118,0.00017645735,0.1479452,0.017885007,0.83333844,0.00007663423,0.00010849525],"about_ca_topic_score_codex":0.000035958194,"about_ca_topic_score_gemma":0.000021053464,"teacher_disagreement_score":0.8692264,"about_ca_system_score_codex":0.00006111022,"about_ca_system_score_gemma":0.00013115736,"threshold_uncertainty_score":0.49835104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005164538,0.000020273965,0.97094744,0.022015784,0.00055641955,0.0003695682,0.00005016095,0.00009648011,0.0007793117],"genre_scores_gemma":[0.83085847,0.000022439986,0.16790357,0.000892152,0.00014639644,0.000024490257,0.00007573344,0.000008535213,0.00006818705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771464,0.00009920887,0.00038977442,0.00063196535,0.00082548463,0.00033891408],"domain_scores_gemma":[0.99833137,0.00024889596,0.00009629682,0.00029284784,0.0008612314,0.00016935766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005058412,0.00020580602,0.00018703248,0.0003441211,0.00021885308,0.0006874585,0.00083179923,0.000093058254,0.00022648514],"category_scores_gemma":[0.0002970785,0.00019452993,0.00006229133,0.00025556685,0.00010637281,0.0003552733,0.00011246443,0.00024939838,0.000043163855],"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.00014092222,0.0002150159,0.0000077898285,0.000007855455,0.000015704843,0.00000839204,0.000111025794,0.01884008,0.0038899044,0.5830807,0.00006114141,0.39362147],"study_design_scores_gemma":[0.00010363434,0.0004248149,0.00016606555,0.00006718887,0.0000029219705,0.000008681429,0.000021154901,0.87017816,0.03968703,0.08902707,0.0001225053,0.00019078293],"about_ca_topic_score_codex":0.000031820327,"about_ca_topic_score_gemma":0.000008777807,"teacher_disagreement_score":0.8513381,"about_ca_system_score_codex":0.0000937826,"about_ca_system_score_gemma":0.0002441261,"threshold_uncertainty_score":0.79327005},"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":"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.011540448,0.0000055153046,0.98476386,0.0016198705,0.00012332096,0.00036358097,0.0010474637,0.000071063725,0.0004648492],"genre_scores_gemma":[0.5200741,0.00001557202,0.47946987,0.00010205012,0.00006601763,0.00006517777,0.00007583005,0.000015118381,0.0001162674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758244,0.000084770014,0.0007040729,0.0006521509,0.0005980244,0.0003785346],"domain_scores_gemma":[0.99484205,0.0036873508,0.00019511649,0.00037199116,0.0007265686,0.00017690673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004238858,0.0002971719,0.00063297816,0.0002874932,0.00014797728,0.00012489481,0.00042716155,0.00008870831,0.0011178538],"category_scores_gemma":[0.004653149,0.00023094758,0.00022796322,0.0007084951,0.00021298495,0.00012872515,0.000052640262,0.00020572284,0.000025332929],"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.00046447167,0.00036089236,0.00011963562,0.000018011213,0.0013017905,0.000012842037,0.00043857054,0.015304431,0.00081050926,0.97296286,0.000008571305,0.008197403],"study_design_scores_gemma":[0.000106917614,0.00028978012,0.00017083608,0.000033753153,0.0010571141,8.099545e-7,0.00040311326,0.21121481,0.0068962383,0.7794929,0.000065526976,0.00026819328],"about_ca_topic_score_codex":0.00032593228,"about_ca_topic_score_gemma":0.0014973333,"teacher_disagreement_score":0.50853366,"about_ca_system_score_codex":0.00011312777,"about_ca_system_score_gemma":0.000100294645,"threshold_uncertainty_score":0.99979526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09689573,0.00005027964,0.90039176,0.0002215771,0.00023149585,0.00026837987,0.000020059431,0.000022950459,0.0018977837],"genre_scores_gemma":[0.984829,0.000009958138,0.013375478,0.00009321735,0.00049670634,0.00015808805,0.00047691114,0.00002392681,0.00053672265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985767,0.000034646735,0.00038130305,0.00049585657,0.0002658937,0.0002455763],"domain_scores_gemma":[0.9991649,0.000014152117,0.00010137078,0.00028631638,0.00037536983,0.000057924175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191318,0.00018982371,0.00015138587,0.00011407546,0.00009558046,0.00009647978,0.00041171713,0.00012645454,0.00007559266],"category_scores_gemma":[0.000042478707,0.00019685212,0.00018944996,0.000100863814,0.000064886786,0.000006103943,0.000046564568,0.00008542163,0.000025692927],"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.00012048649,0.00023655414,0.0001409399,0.0000053880335,0.00003323831,0.0000012875958,0.000005926555,0.8938645,0.066827156,0.035820883,0.00011213994,0.002831509],"study_design_scores_gemma":[0.000046399407,0.00009484772,0.000018253508,0.000009262215,0.000034554145,0.000002243353,0.00005113145,0.88813835,0.1069256,0.0042842655,0.00019296445,0.00020213204],"about_ca_topic_score_codex":0.000059853755,"about_ca_topic_score_gemma":0.00007261434,"teacher_disagreement_score":0.88793325,"about_ca_system_score_codex":0.00003982678,"about_ca_system_score_gemma":0.00009333386,"threshold_uncertainty_score":0.8027397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057264934,0.00008063644,0.94681984,0.00039024602,0.0012627132,0.00028796488,0.0000013507134,0.0002397251,0.045191016],"genre_scores_gemma":[0.9652528,0.000333541,0.02432028,0.00004650475,0.0002542607,0.000070466886,0.000005240046,0.000020762509,0.009696139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980131,0.0001083515,0.0004668507,0.00066253165,0.0003564605,0.0003927017],"domain_scores_gemma":[0.99891144,0.00026224868,0.00019525706,0.00016891462,0.00035128038,0.000110839224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005486794,0.0002465565,0.00021738741,0.00031486872,0.0006777769,0.00034878522,0.0006866692,0.000075446165,0.00005536698],"category_scores_gemma":[0.00017330731,0.00025194793,0.00009854821,0.00019518395,0.00008114106,0.00038846835,0.0002908929,0.00041902522,0.00016098318],"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.000025603735,0.000050507602,0.00018967963,0.000018815825,0.00003939084,0.000028428873,0.0019689067,0.0032457176,0.0011117589,0.88913697,0.0000162906,0.10416794],"study_design_scores_gemma":[0.00014163271,0.0005651709,0.00013953824,0.0006124532,0.000013311159,0.000092795555,0.004412033,0.8818538,0.020347694,0.018511929,0.07251478,0.00079486414],"about_ca_topic_score_codex":0.00001598388,"about_ca_topic_score_gemma":0.0000035933147,"teacher_disagreement_score":0.9595263,"about_ca_system_score_codex":0.00010669372,"about_ca_system_score_gemma":0.00005278046,"threshold_uncertainty_score":0.99999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.141801,0.000024759123,0.84335685,0.0050011207,0.00075406174,0.000097045864,0.000053723066,0.00012277014,0.008788683],"genre_scores_gemma":[0.99873084,0.000040060877,0.0002893506,0.0003753125,0.00028166242,0.0000069341677,0.00024459368,0.000010171583,0.000021101307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985152,0.0000058678943,0.00046312902,0.00041044873,0.00046607986,0.00013927212],"domain_scores_gemma":[0.9986187,0.000020492575,0.0002552737,0.00043065572,0.00066259695,0.000012288492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030026247,0.00014282105,0.00023747634,0.0008870702,0.00007760652,0.0001975295,0.00088802323,0.000056093722,0.0008181855],"category_scores_gemma":[0.000117501695,0.00013676728,0.00011428628,0.0013173786,0.00008736033,0.0012269152,0.00008879588,0.00012247905,0.0002216795],"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.0001490449,0.00047813368,0.00043811803,0.000033047814,0.0007385024,0.0000066325583,0.00014966397,0.20794816,0.0035515516,0.7068806,0.000027349617,0.079599164],"study_design_scores_gemma":[0.000055491044,0.000010332884,0.00025739596,0.000082201586,0.0006047782,2.6986672e-7,0.00090737845,0.89964765,0.004077116,0.09373861,0.0003722489,0.00024654102],"about_ca_topic_score_codex":0.00065233675,"about_ca_topic_score_gemma":0.00083906145,"teacher_disagreement_score":0.85692984,"about_ca_system_score_codex":0.000031056763,"about_ca_system_score_gemma":0.000051439416,"threshold_uncertainty_score":0.8958558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019422512,0.00015902185,0.98990065,0.0012747754,0.0016820402,0.00018871995,0.000015915377,0.0004788091,0.0043578437],"genre_scores_gemma":[0.80090284,0.0010541703,0.19744197,0.00009464166,0.0003952565,0.00003348183,0.00000696575,0.000034842975,0.00003582092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863756,0.000019240511,0.00036455778,0.00025520308,0.00032337013,0.0004000824],"domain_scores_gemma":[0.9991103,0.00029619905,0.000066689354,0.00026539838,0.00019887065,0.00006256562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016018446,0.00021041838,0.00015243277,0.0000677259,0.00026328702,0.00021727203,0.0006768507,0.000109853056,0.00011683495],"category_scores_gemma":[0.00032167352,0.00017197824,0.00005451292,0.00028118343,0.00030131591,0.00018084483,0.00009100236,0.0003130575,0.00011285064],"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.000012314836,0.000015756308,0.0000028389081,0.00000111962,0.000022416429,0.000008260988,0.000017823804,0.68352705,0.00011787569,0.22000381,0.000029236115,0.09624151],"study_design_scores_gemma":[0.000015261638,0.000041778323,0.0000037626648,0.00010837828,0.0000053769572,0.000008128964,0.0001558636,0.88032943,0.0032192434,0.11520382,0.0007225006,0.00018647926],"about_ca_topic_score_codex":0.00001343964,"about_ca_topic_score_gemma":0.000045733213,"teacher_disagreement_score":0.7989606,"about_ca_system_score_codex":0.00022206375,"about_ca_system_score_gemma":0.0000443473,"threshold_uncertainty_score":0.70130694},"labels":[],"label_agreement":null}]}