{"meta":{"query_hash":"6ec81676fb52","filters":{"venue":"Artificial Intelligence"},"cohort_total":109,"direct_labels_cover":0,"predictions_cover":109,"exported":109,"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/6ec81676fb52","api":"https://metacan.xera.ac/api/v1/cohort?venue=Artificial+Intelligence"},"results":[{"id":"W100055074","doi":"10.1016/j.artint.2009.11.005","title":"Book review","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"","field":"","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":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.07495265727052909,"score_gpt":0.36079933455227586,"score_spread":0.2858466772817468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100055074","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056080765,0.9024135,0.018539073,0.02402176,0.0005490498,0.001236969,0.000020885964,0.001113649,0.051544327],"genre_scores_gemma":[0.43331894,0.07804596,0.0023951028,0.4755596,0.0010863374,0.000076799,0.00004670754,0.00016931367,0.009301246],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984061,0.000071555995,0.0004910053,0.00033831608,0.0003104033,0.0003826199],"domain_scores_gemma":[0.99908704,0.000054534612,0.000103098646,0.0005010401,0.00012374458,0.0001305328],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042931683,0.00016931462,0.00022750116,0.000068375455,0.000102762344,0.000041498974,0.0003640483,0.000045877092,0.0071627796],"category_scores_gemma":[0.00034208046,0.00016062899,0.000108384076,0.0005773564,0.00008854323,0.00027024632,0.000025294054,0.00016593472,0.06480122],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00002055417,0.00014053861,0.0000033403571,0.00003796143,0.000006071126,0.000023672204,0.00008177254,0.000030655076,0.0069253705,0.037693467,0.68165433,0.27338225],"study_design_scores_gemma":[0.000006412158,0.00013633141,0.00005773068,0.00059055205,0.000032152846,0.000017273514,0.00002032046,0.0005438923,0.10927639,0.029804768,0.8592036,0.00031060635],"about_ca_topic_score_codex":0.000011325529,"about_ca_topic_score_gemma":0.0000066018783,"teacher_disagreement_score":0.8243675,"about_ca_system_score_codex":0.000051604675,"about_ca_system_score_gemma":0.000038274487,"threshold_uncertainty_score":0.9937448},"labels":[],"label_agreement":null},{"id":"W1471542436","doi":"10.1016/j.artint.2016.04.003","title":"ASlib: A benchmark library for algorithm selection","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Microsoft","keywords":"Computer science; Selection (genetic algorithm); Benchmark (surveying); Exploit; Task (project management); Set (abstract data type); Variety (cybernetics); Data mining; Selection algorithm; Range (aeronautics); Algorithm; Machine learning; Artificial intelligence","score_opus":0.03557090669313157,"score_gpt":0.2896685730587838,"score_spread":0.25409766636565223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1471542436","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.00044737195,0.00002938727,0.99184793,0.0058845244,0.00036812163,0.0001658798,0.000013701611,0.0004050903,0.00083799567],"genre_scores_gemma":[0.5623511,0.000055587003,0.4345994,0.00048638158,0.0005113457,0.000110128436,0.000030273088,0.000025659905,0.0018301213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989007,0.00005807035,0.00025066326,0.00040951683,0.00013970886,0.00024130863],"domain_scores_gemma":[0.9991292,0.00030362158,0.000089393216,0.00034090734,0.000059872014,0.00007701524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025150017,0.000103176346,0.00008998041,0.00009371611,0.00016738655,0.00017523777,0.0005738222,0.00005737556,0.00009852841],"category_scores_gemma":[0.00018132811,0.00007481756,0.00005431535,0.0003639259,0.000041376003,0.0010159276,0.00009440875,0.00006722178,0.00031740163],"study_design_candidate":"design_other","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.0000054190177,0.00001888919,0.00010103071,0.0000023921834,0.0000030929175,3.6359455e-7,0.00005350524,0.000005301852,0.0024094472,0.25131747,0.0013626167,0.74472046],"study_design_scores_gemma":[0.00004508579,0.00026516162,0.0006474656,0.000038482416,0.000006659929,0.000010697849,0.000030850246,0.39547384,0.18033926,0.27782172,0.14498769,0.00033308775],"about_ca_topic_score_codex":0.000013045817,"about_ca_topic_score_gemma":0.000006431769,"teacher_disagreement_score":0.7443874,"about_ca_system_score_codex":0.000019475341,"about_ca_system_score_gemma":0.000060299928,"threshold_uncertainty_score":0.40796617},"labels":[],"label_agreement":null},{"id":"W1519196800","doi":"10.1016/s0004-3702(02)00209-6","title":"Learning cost-sensitive active classifiers☆☆This extends the short conference paper [19].","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":164,"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 Alberta","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Pattern recognition (psychology)","score_opus":0.0815979204633624,"score_gpt":0.30553699911299526,"score_spread":0.22393907864963286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519196800","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.005762571,0.00013062195,0.9348206,0.009754586,0.0009635849,0.00038944377,0.0000039801903,0.0004653013,0.047709342],"genre_scores_gemma":[0.9926005,0.00011530507,0.002716369,0.0010313699,0.00025268612,0.000038182734,0.0000028474064,0.000017629434,0.003225112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974682,0.0003959344,0.00038792434,0.0006903132,0.00048297126,0.00057468],"domain_scores_gemma":[0.9982096,0.0006073795,0.00012065091,0.0006257695,0.00024370247,0.0001929279],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000567401,0.0002726226,0.00023639991,0.00009913158,0.0008106562,0.0004300268,0.0010887169,0.00011266144,0.0009394268],"category_scores_gemma":[0.0005289872,0.00020509439,0.00012936663,0.0006568098,0.00034328125,0.0005659686,0.00030440805,0.0010123524,0.0013388863],"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.0000092379805,0.000060677994,0.000071149305,0.0000026058497,0.00002210851,0.000043334127,0.0067729186,0.0014787742,0.0008297494,0.07999275,0.00061679806,0.9100999],"study_design_scores_gemma":[0.000024505289,0.00021445107,0.00036264255,0.000029452953,0.000014890913,0.000055518754,0.0020499502,0.9418425,0.01747693,0.0076693157,0.029827869,0.00043196836],"about_ca_topic_score_codex":0.0002439927,"about_ca_topic_score_gemma":0.00006124699,"teacher_disagreement_score":0.9868379,"about_ca_system_score_codex":0.000066643726,"about_ca_system_score_gemma":0.00004871639,"threshold_uncertainty_score":0.99997383},"labels":[],"label_agreement":null},{"id":"W1863869622","doi":"10.1016/s0004-3702(01)00166-7","title":"World-championship-caliber Scrabble☆☆SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the USA by Hasbro Inc., in Canada by Hasbro Canada Corporation, and throughout the rest of the world by J.W. Spear &amp; Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc.","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Championship; Corporation; Intellectual property; Computer science; Operations research; Advertising; Engineering; Business; Political science; Law","score_opus":0.08528845174103022,"score_gpt":0.2779775682452863,"score_spread":0.19268911650425607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863869622","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.9489109,0.0010891567,0.0027228591,0.0444956,0.00031825848,0.0018910262,0.00027595687,0.000015338159,0.0002809327],"genre_scores_gemma":[0.9961819,0.00013704186,0.00019311577,0.0025985993,0.000033974433,0.00008357159,0.000010534722,0.000022607315,0.0007386657],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947277,0.0010943767,0.0017537907,0.00077478914,0.0009791916,0.0006701743],"domain_scores_gemma":[0.9949433,0.0026565893,0.00069600076,0.001344992,0.00021548186,0.0001436014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001484654,0.00043342743,0.0006228986,0.00024187966,0.0002542924,0.00017189275,0.0022431435,0.000114013215,0.00007629303],"category_scores_gemma":[0.00088021724,0.00022794848,0.00006217267,0.0028106875,0.0008260583,0.00037466123,0.00041562348,0.00077527185,0.00000751165],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010254098,0.0015976463,0.1834137,0.00027042086,0.00021620862,0.00009652704,0.18490204,0.0027714933,0.011458408,0.009207872,0.5683075,0.036732752],"study_design_scores_gemma":[0.0010421998,0.0006955852,0.045884956,0.002845495,0.00017086261,0.00014077293,0.030574398,0.17627668,0.3934809,0.031900287,0.31321135,0.0037764932],"about_ca_topic_score_codex":0.9640157,"about_ca_topic_score_gemma":0.9996327,"teacher_disagreement_score":0.3820225,"about_ca_system_score_codex":0.00030775837,"about_ca_system_score_gemma":0.00056337577,"threshold_uncertainty_score":0.9295469},"labels":[],"label_agreement":null},{"id":"W1878518276","doi":"10.1016/j.artint.2016.09.006","title":"The Configurable SAT Solver Challenge (CSSC)","year":2016,"lang":"en","type":"preprint","venue":"Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Solver; Boolean satisfiability problem; Benchmark (surveying); Computer science; Competition (biology); Satisfiability; Problem solver; Series (stratigraphy); Theoretical computer science; Programming language; Software engineering","score_opus":0.11914121672198162,"score_gpt":0.34931248735861137,"score_spread":0.23017127063662973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878518276","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.0003258523,0.0008730126,0.969776,0.0050126333,0.0055456934,0.0004921553,0.000008937476,0.00029209326,0.01767363],"genre_scores_gemma":[0.8233229,0.0022385712,0.17050263,0.00046857086,0.0011962816,0.0004036368,0.000009214188,0.000066923094,0.0017912507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969116,0.0003109743,0.0007456567,0.0008866445,0.0005361286,0.00060901616],"domain_scores_gemma":[0.99611413,0.0005929897,0.0004066399,0.0024345536,0.00032374568,0.00012795762],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018438551,0.0003394797,0.00028039108,0.00009042708,0.00052224967,0.0006722731,0.0039178655,0.000317596,0.00006046448],"category_scores_gemma":[0.0005714842,0.00022341976,0.0001797625,0.00021714329,0.0003720122,0.00037428437,0.0015343423,0.000668329,0.0019284844],"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.00000791613,0.000024998511,0.0000020123036,0.0000130881,0.000014643584,0.0000028606098,0.00040920393,0.000088545676,0.00030621982,0.66272944,0.00027125806,0.3361298],"study_design_scores_gemma":[0.000009520721,0.000055541856,0.00002716256,0.000106888365,0.000008330531,0.000004110394,0.00007742041,0.06197793,0.07335153,0.8402766,0.023723315,0.00038164255],"about_ca_topic_score_codex":0.000052452222,"about_ca_topic_score_gemma":0.00005050739,"teacher_disagreement_score":0.8229971,"about_ca_system_score_codex":0.00013381874,"about_ca_system_score_gemma":0.000221185,"threshold_uncertainty_score":0.9988486},"labels":[],"label_agreement":null},{"id":"W1966851629","doi":"10.1016/j.artint.2007.10.019","title":"Duality in permutation state spaces and the dual search algorithm","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":37,"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 Alberta","funders":"","keywords":"Duality (order theory); Dual (grammatical number); Heuristic; Permutation (music); State (computer science); Mathematics; Algorithm; Class (philosophy); Symmetry (geometry); Search algorithm; Mathematical optimization; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence","score_opus":0.046170881111703185,"score_gpt":0.31920800882190936,"score_spread":0.27303712771020616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966851629","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.20567614,0.00015356138,0.79205835,0.0015321261,0.00013338952,0.00012331171,0.0000015662129,0.00004346162,0.00027810756],"genre_scores_gemma":[0.9801557,0.000019875675,0.01953451,0.00017595779,0.00004438972,0.000003652642,0.0000015407716,0.0000039804086,0.000060407925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986933,0.00017632046,0.00030260815,0.0002731249,0.00024758425,0.000307046],"domain_scores_gemma":[0.9987649,0.0008459803,0.00005441915,0.00020832682,0.00006681159,0.000059570066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781391,0.000091121794,0.00010816031,0.000091924325,0.00018599427,0.00023653862,0.00026058694,0.000036741792,0.00000662544],"category_scores_gemma":[0.00011324667,0.00006820273,0.0000226244,0.00043573236,0.00019768321,0.00026288355,0.00011552332,0.00021997497,0.000037609196],"study_design_candidate":"design_other","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.000048072907,0.000028012708,0.001221608,0.000007825295,0.0000051448833,0.000047287635,0.021022968,0.0025958251,0.00015026216,0.1089396,0.00001426578,0.8659191],"study_design_scores_gemma":[0.000097087825,0.00007701322,0.0053868396,0.000039610382,0.000003177742,0.000024526726,0.0019665393,0.81436,0.02643365,0.15120852,0.00017976093,0.0002232482],"about_ca_topic_score_codex":0.0012042657,"about_ca_topic_score_gemma":0.00052207743,"teacher_disagreement_score":0.8656959,"about_ca_system_score_codex":0.000022826423,"about_ca_system_score_gemma":0.000046483183,"threshold_uncertainty_score":0.2781227},"labels":[],"label_agreement":null},{"id":"W1971439026","doi":"10.1016/s0004-3702(01)00109-6","title":"Sokoban: Enhancing general single-agent search methods using domain knowledge","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":102,"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 Alberta","funders":"","keywords":"Exploit; Computer science; Domain (mathematical analysis); Search algorithm; Domain knowledge; Artificial intelligence; Machine learning; Genetic programming; Algorithm; Mathematics","score_opus":0.1859338231043957,"score_gpt":0.40765015742581884,"score_spread":0.22171633432142313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971439026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10831059,0.0005781307,0.8874222,0.00044387678,0.00090764003,0.00015724165,0.0000010552006,0.0002254973,0.0019537765],"genre_scores_gemma":[0.46624103,0.000011984379,0.5330067,0.00015576686,0.00032197963,0.000006442948,0.000002048762,0.000018572011,0.00023543122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969739,0.00057269866,0.0006120668,0.00070669263,0.0003220712,0.00081261765],"domain_scores_gemma":[0.99831855,0.00048082546,0.00011621829,0.00066320295,0.00019055553,0.00023064743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023111503,0.00026565194,0.00027316262,0.0002357477,0.0005470171,0.0004214053,0.0010453723,0.00012858794,0.00009511221],"category_scores_gemma":[0.0001347584,0.00026824878,0.00012502357,0.0011238051,0.00011183809,0.00047023478,0.00038686075,0.00035687347,0.0003327486],"study_design_candidate":"bench_or_experimental","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.000022565804,0.00021419107,0.00028937816,0.00002608001,0.000029688657,0.00010641919,0.007415156,0.02138928,0.26034656,0.07931235,0.00009348032,0.6307548],"study_design_scores_gemma":[0.000021642627,0.00011695165,0.000017722181,0.00008551352,0.000008388375,0.00007282623,0.00029749156,0.56251276,0.4034798,0.028995592,0.004007576,0.00038370967],"about_ca_topic_score_codex":0.00026907303,"about_ca_topic_score_gemma":0.000108015985,"teacher_disagreement_score":0.63037115,"about_ca_system_score_codex":0.0001939415,"about_ca_system_score_gemma":0.00020481326,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W1971508608","doi":"10.1016/j.artint.2004.11.004","title":"Partition-based logical reasoning for first-order and propositional theories","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":116,"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":"Soundness; Axiom; Computer science; Theoretical computer science; Completeness (order theory); Propositional calculus; Propositional formula; Automated reasoning; Satisfiability; Propositional variable; Mathematics; Algorithm; Description logic; Intermediate logic; Programming language","score_opus":0.0351189575418359,"score_gpt":0.2849085808585126,"score_spread":0.2497896233166767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971508608","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.011153048,0.00015885443,0.984601,0.0023757122,0.00026051316,0.00026761994,0.000004590949,0.00014178894,0.0010368639],"genre_scores_gemma":[0.9314735,0.00000925173,0.06788866,0.00034867917,0.00015017122,0.00008710659,0.000006935243,0.000006858597,0.000028859251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884576,0.000029957448,0.0002377821,0.00041341264,0.00016657583,0.00030653446],"domain_scores_gemma":[0.9990992,0.00029185938,0.000065816275,0.00021924508,0.0002208805,0.000103005856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030644043,0.00014326663,0.00013615651,0.000050137638,0.00047093537,0.00023350737,0.00032195766,0.00007517128,0.000036776637],"category_scores_gemma":[0.00039420294,0.00011824862,0.000060472685,0.0002658741,0.0002369781,0.00026947938,0.00007585249,0.00009380431,0.00007021648],"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.000023226361,0.00011033565,0.00016293621,0.000012441974,0.000005514824,0.0000051276547,0.0005507009,0.0021038,0.00015528029,0.9871186,0.000024453144,0.009727564],"study_design_scores_gemma":[0.000069009715,0.00026352768,0.00024898243,0.000046166002,0.000007188963,0.000011171201,0.00007792222,0.07026698,0.030755227,0.897495,0.00054529874,0.00021354845],"about_ca_topic_score_codex":0.0000251138,"about_ca_topic_score_gemma":0.00011695346,"teacher_disagreement_score":0.92032045,"about_ca_system_score_codex":0.000041207244,"about_ca_system_score_gemma":0.00013445181,"threshold_uncertainty_score":0.48220387},"labels":[],"label_agreement":null},{"id":"W1973749650","doi":"10.1016/j.artint.2012.04.006","title":"Reinforcement learning with limited reinforcement: Using Bayes risk for active learning in POMDPs","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Reinforcement learning; Computer science; Markov decision process; Task (project management); Artificial intelligence; Machine learning; Action (physics); Variety (cybernetics); Bayes' theorem; Bayesian probability; Markov chain; Markov process; Markov model; Mathematics","score_opus":0.06131471456678903,"score_gpt":0.3031917075469479,"score_spread":0.24187699298015888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973749650","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.035592463,0.000054159667,0.96144897,0.00008047197,0.00035120203,0.0007710181,4.1696802e-7,0.00033131652,0.0013699684],"genre_scores_gemma":[0.94815445,0.00006331709,0.05106556,0.00009206697,0.00017084808,0.00007032926,0.000013403844,0.000041981202,0.00032806848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965747,0.00021393634,0.00084035087,0.0005583704,0.0006031219,0.0012095358],"domain_scores_gemma":[0.99777204,0.0006275699,0.0006263431,0.00051088247,0.00024289613,0.00022024463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012825058,0.00038812828,0.0003617155,0.0004226545,0.00062472915,0.00027932014,0.00077022833,0.00014500126,0.00004995654],"category_scores_gemma":[0.00072865124,0.00036873273,0.000114263916,0.0010442369,0.00010117913,0.0017003538,0.00032874063,0.0008035433,0.0000954072],"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.00010931322,0.000049305272,0.005010305,0.000025183703,0.000052225772,0.0000031516795,0.0058900253,0.9379852,0.00047468042,0.02871855,0.000004299323,0.021677755],"study_design_scores_gemma":[0.00014760297,0.00065458025,0.00032310086,0.00010860251,0.000035951114,0.000008079205,0.0012780357,0.9719432,0.022901662,0.00043776765,0.0016681461,0.00049325865],"about_ca_topic_score_codex":0.00023304726,"about_ca_topic_score_gemma":0.000023811364,"teacher_disagreement_score":0.91256195,"about_ca_system_score_codex":0.000348397,"about_ca_system_score_gemma":0.00013708434,"threshold_uncertainty_score":0.99987644},"labels":[],"label_agreement":null},{"id":"W1976639815","doi":"10.1016/s0004-3702(00)00049-7","title":"Expressing preferences in default logic","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Default logic; Default; Default rule; Non-monotonic logic; Preference; Computer science; Context (archaeology); Mathematical economics; Representation (politics); Artificial intelligence; Mathematics; Economics; Multimodal logic; Autoepistemic logic; Microeconomics; Finance","score_opus":0.07587255919728449,"score_gpt":0.30667607919206763,"score_spread":0.23080351999478316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976639815","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.37090474,0.00086693646,0.50148517,0.00054152304,0.00065751286,0.00027799953,0.0000012235425,0.00037959058,0.12488528],"genre_scores_gemma":[0.99146724,0.00006974011,0.0076909256,0.0001854118,0.00009370198,0.000016868167,8.9626e-7,0.0000057956913,0.00046942566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842626,0.00010097968,0.00036265026,0.00048576685,0.00020502126,0.0004193425],"domain_scores_gemma":[0.9992387,0.00014744618,0.00005543124,0.0004156879,0.00005308149,0.00008960322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032192757,0.00015682154,0.00017100232,0.000096823285,0.00013895577,0.0002551609,0.0010223628,0.000086572894,0.00058050785],"category_scores_gemma":[0.00010039441,0.00013335662,0.000055980396,0.00057294965,0.000106213934,0.0005145587,0.00011010238,0.00018273124,0.0014454147],"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.000009724455,0.00012634673,0.0006699209,0.0000050969197,0.000002683618,0.000026544129,0.0026085335,0.00093390816,0.00062460115,0.17932041,0.000074439355,0.8155978],"study_design_scores_gemma":[0.000039313385,0.00015735801,0.0024365473,0.00009264892,0.0000040722884,0.000019053734,0.00032588805,0.12183957,0.060073487,0.81158596,0.002902733,0.00052334805],"about_ca_topic_score_codex":0.00020330638,"about_ca_topic_score_gemma":0.00036539786,"teacher_disagreement_score":0.81507444,"about_ca_system_score_codex":0.000034367364,"about_ca_system_score_gemma":0.000062520056,"threshold_uncertainty_score":0.9993321},"labels":[],"label_agreement":null},{"id":"W1977070092","doi":"10.1016/s0004-3702(02)00378-8","title":"On the undecidability of probabilistic planning and related stochastic optimization problems","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":241,"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 British Columbia; University of Alberta","funders":"","keywords":"Undecidable problem; Probabilistic logic; Markov decision process; Computer science; Partially observable Markov decision process; Markov chain; Class (philosophy); Mathematical optimization; State (computer science); Decision problem; Mathematics; Markov process; Artificial intelligence; Theoretical computer science; Decidability; Markov model; Algorithm; Machine learning","score_opus":0.05360566751266353,"score_gpt":0.2694234057961437,"score_spread":0.21581773828348016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977070092","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.025824364,0.00011166522,0.9720697,0.0003974023,0.00015583742,0.00032885655,0.0000011092852,0.00006455543,0.00104655],"genre_scores_gemma":[0.99008024,0.0000012005762,0.009817971,0.000052193693,0.000005387605,0.000017369022,0.0000010408835,0.0000062168574,0.000018407483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987026,0.00020004835,0.00037847614,0.00032308284,0.00019486123,0.00020096058],"domain_scores_gemma":[0.9979774,0.001348518,0.00014904345,0.00037666262,0.00009677036,0.000051653347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659457,0.0001193153,0.00012808574,0.000060191527,0.00021472543,0.00008505073,0.00030973507,0.000060804257,0.000037800935],"category_scores_gemma":[0.0013755205,0.00008780354,0.000029488372,0.0004467982,0.0001522645,0.00013374543,0.000047158373,0.00018434673,0.000012664597],"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.0000038834078,0.000025234047,0.000059240738,0.000009003177,0.0000040124023,7.26627e-7,0.0007607871,0.57437164,0.00004171914,0.423344,0.0000054622665,0.001374272],"study_design_scores_gemma":[0.0000112856205,0.00011439842,0.000034176475,0.00008647182,0.00000444626,0.0000051946786,0.00007623654,0.61517185,0.0014322073,0.38297498,0.00000398459,0.00008479357],"about_ca_topic_score_codex":0.000016990078,"about_ca_topic_score_gemma":0.0000027383137,"teacher_disagreement_score":0.96425587,"about_ca_system_score_codex":0.00002439322,"about_ca_system_score_gemma":0.0000655177,"threshold_uncertainty_score":0.35805246},"labels":[],"label_agreement":null},{"id":"W1977283395","doi":"10.1016/j.artint.2002.02.001","title":"A formal analysis of why heuristic functions work","year":2005,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":22,"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 Windsor; Carleton University","funders":"","keywords":"Heuristics; Computer science; Heuristic; Mathematical proof; Range (aeronautics); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.042325289150734316,"score_gpt":0.28950778667921073,"score_spread":0.24718249752847643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977283395","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.007559648,0.00012203702,0.99096084,0.00030179988,0.0002217385,0.00007395511,0.00001855538,0.000075039454,0.000666413],"genre_scores_gemma":[0.9413253,0.000008724898,0.058276203,0.00014769733,0.0000851921,0.000012272152,0.000009820293,0.0000042211063,0.00013055214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987993,0.000033078206,0.00044571862,0.00026922225,0.0002037146,0.00024895588],"domain_scores_gemma":[0.99899095,0.00012542524,0.0001302069,0.000561804,0.000121697856,0.0000699238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023086969,0.00010215331,0.00021349141,0.00025025132,0.00013544055,0.00003315242,0.00032616005,0.000032203858,0.000110038214],"category_scores_gemma":[0.00008711631,0.00009326343,0.00012906744,0.0022175808,0.000084675994,0.0007792668,0.00014465017,0.000078542136,0.00016300938],"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.0000145792765,0.0000838719,0.00034806365,0.0000056620665,0.0001234735,0.0000029126018,0.0006750301,0.03261251,0.00034001336,0.71430624,0.0003028186,0.25118485],"study_design_scores_gemma":[0.000049561557,0.00025582584,0.0025170026,0.00008455765,0.00048693336,0.000011538208,0.0009699818,0.7651272,0.048123803,0.013104779,0.16836415,0.00090467505],"about_ca_topic_score_codex":0.000096340584,"about_ca_topic_score_gemma":0.0004495898,"teacher_disagreement_score":0.93376565,"about_ca_system_score_codex":0.000022289367,"about_ca_system_score_gemma":0.000027564169,"threshold_uncertainty_score":0.38031724},"labels":[],"label_agreement":null},{"id":"W1978078764","doi":"10.1016/j.artint.2006.05.003","title":"Generating and evaluating evaluative arguments","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":191,"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 British Columbia","funders":"","keywords":"Argumentation theory; Argument (complex analysis); Computer science; Process (computing); Computational linguistics; Test (biology); Natural (archaeology); Computational model; Natural language; Artificial intelligence; Natural language generation; Selection (genetic algorithm); Management science; Psychology; Epistemology","score_opus":0.08029450825717041,"score_gpt":0.3471274194884037,"score_spread":0.2668329112312333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978078764","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.34774473,0.00027011323,0.6484743,0.00021881222,0.0005083913,0.00022096791,0.0000012919726,0.00010827419,0.0024531817],"genre_scores_gemma":[0.94363165,0.0000025842096,0.05583405,0.00012214144,0.00027739734,0.000022572924,0.000002606815,0.0000064396445,0.000100583995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983996,0.00014247141,0.00038502633,0.00041171015,0.00036845088,0.00029272598],"domain_scores_gemma":[0.99922854,0.00016309542,0.000114203795,0.0002886542,0.00013931282,0.00006620207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092712196,0.00012869979,0.00013280632,0.00007371054,0.00023904924,0.00028927208,0.0003263114,0.00004521676,0.000020161375],"category_scores_gemma":[0.00020713173,0.00012094827,0.000033816166,0.00029906866,0.000059671627,0.00034470746,0.00014525781,0.000082888844,0.0001905016],"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.000011108206,0.00008178495,0.0008602143,0.000011589706,0.0000131574725,0.000014571356,0.0012462803,0.0056258426,0.094262436,0.30605742,0.0002170078,0.5915986],"study_design_scores_gemma":[0.000030743824,0.00012781337,0.000573109,0.000021594124,0.0000055021346,0.000012568458,0.00015253917,0.72224027,0.11025352,0.16630694,0.000070200214,0.0002052065],"about_ca_topic_score_codex":0.00045983127,"about_ca_topic_score_gemma":0.00011388138,"teacher_disagreement_score":0.7166144,"about_ca_system_score_codex":0.000035081277,"about_ca_system_score_gemma":0.000057474987,"threshold_uncertainty_score":0.49321273},"labels":[],"label_agreement":null},{"id":"W1979750001","doi":"10.1016/j.artint.2004.09.004","title":"A general stability analysis on regional and national voting schemes against noise—why is an electoral college more stable than a direct popular election?","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voting; Cardinal voting systems; Disapproval voting; Anti-plurality voting; Stability (learning theory); Margin (machine learning); Instant-runoff voting; Voting behavior; Econometrics; Ranked voting system; Bullet voting; Probabilistic logic; Statistics; Computer science; Political science; Mathematics; Politics; Law","score_opus":0.08906049420113245,"score_gpt":0.2904039379392588,"score_spread":0.20134344373812635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979750001","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.9873297,0.00024692123,0.010535465,0.00055025046,0.0001519166,0.00021034096,0.00020681629,0.000068384936,0.0007001602],"genre_scores_gemma":[0.99828225,0.000013150818,0.00068608887,0.0005889583,0.00020990019,0.000024992838,0.000045066292,0.00001988666,0.00012969108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980229,0.000064997024,0.00070149516,0.0007058987,0.000138024,0.00036667843],"domain_scores_gemma":[0.99913,0.00006479135,0.00028675562,0.00025564374,0.00013614258,0.0001266545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608355,0.00021290165,0.00042471124,0.000364997,0.00037855114,0.00012895714,0.0001914484,0.00010960053,0.00010832781],"category_scores_gemma":[0.0002316634,0.0002418086,0.00016631401,0.0010724775,0.00012715749,0.00030415115,0.00003139942,0.00018913107,0.000065405664],"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.00011094705,0.0004191026,0.09034716,0.000023476101,0.00028848884,0.0000040477394,0.001285996,0.0108635565,0.0011837161,0.8950493,0.00007613174,0.0003480781],"study_design_scores_gemma":[0.00054574525,0.0011946777,0.047472052,0.0001542993,0.00019382696,0.000021073623,0.0023834158,0.32629636,0.12625371,0.48591956,0.006925303,0.0026399759],"about_ca_topic_score_codex":0.0014963412,"about_ca_topic_score_gemma":0.0011079982,"teacher_disagreement_score":0.40912974,"about_ca_system_score_codex":0.00024160685,"about_ca_system_score_gemma":0.000055804074,"threshold_uncertainty_score":0.9860668},"labels":[],"label_agreement":null},{"id":"W1981270069","doi":"10.1016/j.artint.2015.02.005","title":"Semantical considerations on multiagent only knowing","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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":"Computer science; Non-monotonic logic; Propositional calculus; Fragment (logic); Semantics (computer science); Autoepistemic logic; Monotonic function; Artificial intelligence; Knowledge base; Theoretical computer science; Description logic; Algorithm; Mathematics; Programming language; Multimodal logic","score_opus":0.15193001930258454,"score_gpt":0.33450861366739076,"score_spread":0.18257859436480622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981270069","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.018362612,0.000116950585,0.9440327,0.0023217194,0.0015671822,0.00021719401,0.000001315122,0.0003002766,0.033079997],"genre_scores_gemma":[0.9850421,0.0000049143678,0.01372457,0.0006357828,0.00022016148,0.000009487337,0.0000012010571,0.000008234339,0.0003535576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.00010338845,0.0003258861,0.0004376677,0.00030433078,0.000344402],"domain_scores_gemma":[0.9986447,0.000340541,0.000055122586,0.0004871192,0.000215882,0.0002566467],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004561654,0.00015437792,0.00015784104,0.00008958819,0.00021713304,0.00028604345,0.00043252672,0.00007171139,0.000052726544],"category_scores_gemma":[0.0009788702,0.00013509733,0.000074342024,0.00027132462,0.0001048536,0.00028950485,0.00017899887,0.00018167144,0.0030627325],"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.000005205716,0.00016841205,0.000109080465,0.0000020207285,0.0000073564843,0.000049469938,0.0023115892,0.0006342635,0.00023239251,0.94907355,0.0017367731,0.04566987],"study_design_scores_gemma":[0.000084606036,0.0005191067,0.00032210836,0.00005705631,0.00001566408,0.00009273389,0.0005790561,0.3889104,0.10045444,0.4989456,0.009393097,0.0006261198],"about_ca_topic_score_codex":0.000051631498,"about_ca_topic_score_gemma":0.00015582936,"teacher_disagreement_score":0.96667945,"about_ca_system_score_codex":0.00006288259,"about_ca_system_score_gemma":0.00024375734,"threshold_uncertainty_score":0.9977135},"labels":[],"label_agreement":null},{"id":"W1983690667","doi":"10.1016/s0004-3702(02)00191-1","title":"Learning Bayesian networks from data: An information-theory based approach","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":803,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Carnegie Mellon University; University of Washington","keywords":"Bayesian network; Computer science; Conditional independence; Machine learning; Artificial intelligence; Bayesian probability; Independence (probability theory); Variable-order Bayesian network; Data mining; Bayesian inference; Theoretical computer science; Mathematics","score_opus":0.09874819574461036,"score_gpt":0.2791029661627809,"score_spread":0.18035477041817055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983690667","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.00081672164,0.00007910019,0.9957353,0.0002295862,0.00030994436,0.000110272464,0.000008188528,0.00037763626,0.0023332366],"genre_scores_gemma":[0.8958138,0.000018617697,0.10314099,0.0006752023,0.00017048951,0.00001074624,0.0001192138,0.000010138815,0.00004080522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793077,0.00026200784,0.00050093624,0.0005797857,0.00032045713,0.0004060351],"domain_scores_gemma":[0.99785626,0.00024891456,0.00014447639,0.0014299761,0.00011903721,0.00020136034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099904,0.00020540963,0.0001812016,0.00010983597,0.00033142473,0.00071732,0.002327131,0.00013208824,0.00019121505],"category_scores_gemma":[0.00018799194,0.00020502158,0.000043899217,0.0005119735,0.00010123707,0.0030615418,0.00030403654,0.00044650133,0.0004080354],"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.000007735311,0.00010071351,0.000040659368,0.0000033475549,0.0000087101835,0.0000028946013,0.0011378172,0.21972473,0.000024379618,0.14625062,0.00014187573,0.6325565],"study_design_scores_gemma":[0.000017750204,0.00007111989,0.00001801567,0.000013430819,0.0000071533477,0.000002062553,0.00020637775,0.96755606,0.00035516394,0.030860275,0.0006331733,0.00025944505],"about_ca_topic_score_codex":0.00014500844,"about_ca_topic_score_gemma":0.00001679648,"teacher_disagreement_score":0.89499706,"about_ca_system_score_codex":0.000024120056,"about_ca_system_score_gemma":0.00003915205,"threshold_uncertainty_score":0.8360538},"labels":[],"label_agreement":null},{"id":"W1984853564","doi":"10.1016/s0004-3702(01)00151-5","title":"Local search characteristics of incomplete SAT procedures","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Weighting; Local search (optimization); Descent (aeronautics); Computer science; Mathematical optimization; Linear search; Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.05189737654584579,"score_gpt":0.29738629103301784,"score_spread":0.24548891448717206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984853564","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.057806052,0.000010916709,0.9404442,0.0007069555,0.00019448578,0.000101237965,0.000002479107,0.00007244054,0.0006612394],"genre_scores_gemma":[0.98891675,0.00004196765,0.010824395,0.00012943945,0.000037657966,0.000003557601,0.0000037853088,0.000004809631,0.0000376481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989676,0.00004008409,0.00034966916,0.00022350992,0.00023139654,0.00018777305],"domain_scores_gemma":[0.9993275,0.00008068798,0.00007876271,0.0002564258,0.00018689546,0.000069761976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883961,0.00008786216,0.00012306363,0.000108549735,0.00008542923,0.00006629685,0.00036193372,0.000043445467,0.0001586185],"category_scores_gemma":[0.00009104061,0.000087247325,0.000041091094,0.00046764172,0.00015841324,0.000237102,0.00010034769,0.00009530167,0.00016877629],"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.00001739539,0.00005878888,0.0039642733,0.000014516184,0.000006502678,0.000009593444,0.00060188794,0.0026636107,0.0023305945,0.18149917,0.000020126987,0.8088135],"study_design_scores_gemma":[0.000036939207,0.00017497121,0.031472836,0.00006165062,0.0000073160127,0.00007438603,0.0004710605,0.87349504,0.070851214,0.022241404,0.000764386,0.00034880982],"about_ca_topic_score_codex":0.000052862913,"about_ca_topic_score_gemma":0.00008575604,"teacher_disagreement_score":0.9311107,"about_ca_system_score_codex":0.000025916164,"about_ca_system_score_gemma":0.000103799386,"threshold_uncertainty_score":0.35578427},"labels":[],"label_agreement":null},{"id":"W1985813166","doi":"10.1016/s0004-3702(02)00361-2","title":"Approximate inference in Boltzmann machines","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":83,"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; University of New Brunswick","funders":"","keywords":"Belief propagation; Boltzmann constant; Inference; Boltzmann machine; Mathematics; Applied mathematics; Energy (signal processing); Boltzmann distribution; Statistical physics; Order (exchange); Mathematical optimization; Physics; Quantum mechanics; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.08489014672356088,"score_gpt":0.32148816983871753,"score_spread":0.23659802311515665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985813166","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.03657854,0.00017082153,0.95443845,0.0010582788,0.00047609466,0.00021648432,7.7549595e-7,0.00065305695,0.006407482],"genre_scores_gemma":[0.95704776,0.000045598863,0.042455435,0.00023166009,0.000046535963,0.00003480531,3.582179e-7,0.000011360107,0.00012650726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982949,0.00008340986,0.0004477435,0.00050919165,0.00025060953,0.00041418514],"domain_scores_gemma":[0.99876857,0.00029688378,0.000096945056,0.00068775483,0.00007486792,0.00007500857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040903583,0.00018295014,0.00018394744,0.00024609937,0.00009533291,0.00018044398,0.0013024705,0.00007866979,0.000103821876],"category_scores_gemma":[0.0005055718,0.00018202244,0.00005371639,0.00095451326,0.000079164034,0.00041838296,0.00031018307,0.000286656,0.0005101363],"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.0000035839164,0.00019362092,0.0024981906,0.000012344099,0.0000031635775,0.000048031543,0.0028081157,0.0006131789,0.002779621,0.29009455,0.0001483933,0.7007972],"study_design_scores_gemma":[0.000009530394,0.0000623563,0.00018966722,0.000039509025,0.0000012407297,0.0000083248915,0.000042118605,0.8127038,0.041029375,0.14539218,0.00026668698,0.00025524962],"about_ca_topic_score_codex":0.0002714321,"about_ca_topic_score_gemma":0.0003950034,"teacher_disagreement_score":0.9204692,"about_ca_system_score_codex":0.000050503822,"about_ca_system_score_gemma":0.000014705946,"threshold_uncertainty_score":0.74226594},"labels":[],"label_agreement":null},{"id":"W1994685255","doi":"10.1016/s0004-3702(01)00152-7","title":"Games solved: Now and in the future","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":253,"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 Alberta","funders":"","keywords":"Computer science; Exploit; State (computer science); Space (punctuation); State space; Domain (mathematical analysis); Combinatorial game theory; Brute force; Game complexity; Game theory; Sequential game; Computational complexity theory; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Mathematical economics; Worst-case complexity; Computer security","score_opus":0.05601123108821538,"score_gpt":0.28864093309208705,"score_spread":0.23262970200387167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994685255","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.22025867,0.006603092,0.6940303,0.064126655,0.0027986001,0.0010884823,0.0000049172386,0.00048051495,0.010608797],"genre_scores_gemma":[0.9921971,0.0006120502,0.005134101,0.0015034748,0.00036441447,0.000036144,4.3802729e-7,0.000011057282,0.00014124473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787086,0.00016207859,0.00050832325,0.00056226726,0.00039691248,0.00049955334],"domain_scores_gemma":[0.99855626,0.00040952384,0.000094042276,0.000778372,0.00007426018,0.00008751871],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006563566,0.0002206578,0.00019252634,0.00016017986,0.00021984385,0.0004433803,0.0016093254,0.00010892993,0.00015739613],"category_scores_gemma":[0.00012331775,0.00016419223,0.000067680536,0.0009067923,0.00027900585,0.00064505136,0.000220306,0.0003632396,0.0008813222],"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.0000068255104,0.00016548503,0.0009766718,0.0000074676227,0.0000060313637,0.00006455004,0.008065276,0.00022955955,0.0004528014,0.28780857,0.001613179,0.7006036],"study_design_scores_gemma":[0.00002946287,0.00024629867,0.0021564146,0.000060659546,0.000012208307,0.00013605754,0.008764655,0.47095442,0.04161439,0.43429685,0.040853858,0.0008747182],"about_ca_topic_score_codex":0.000041872278,"about_ca_topic_score_gemma":0.0011956058,"teacher_disagreement_score":0.7719384,"about_ca_system_score_codex":0.000027776847,"about_ca_system_score_gemma":0.000016059308,"threshold_uncertainty_score":0.9998966},"labels":[],"label_agreement":null},{"id":"W1996632823","doi":"10.1016/j.artint.2014.04.002","title":"Erratum to ‘A logic for reasoning about ambiguity’ [Artificial Intelligence 209 (2014) 1–10]","year":2014,"lang":"en","type":"erratum","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","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":"Kellogg's (Canada)","funders":"","keywords":"Ambiguity; Artificial intelligence; Computer science; Cognitive science; Automated reasoning; Psychology; Programming language","score_opus":0.06924589181398444,"score_gpt":0.32274997403646344,"score_spread":0.253504082222479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996632823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017428338,0.001387309,0.94595736,0.0034358867,0.033815105,0.0012734463,0.00012821385,0.00078633666,0.013198941],"genre_scores_gemma":[0.06162513,0.0007575392,0.5913235,0.013088715,0.0284595,0.002037895,0.0016635624,0.0009155994,0.30012858],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99102324,0.00044294796,0.0022053155,0.0029061346,0.0012018966,0.0022204916],"domain_scores_gemma":[0.99320674,0.0012753115,0.0009808968,0.0026338978,0.0011222328,0.0007809329],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003436327,0.0012903808,0.0013785112,0.0007901237,0.0012500304,0.0018077864,0.0053604557,0.0013170684,0.000437482],"category_scores_gemma":[0.003062168,0.0013376351,0.00060605205,0.0015152722,0.00030135363,0.00058466924,0.0010280643,0.0020427979,0.004336634],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008329713,0.00009860701,0.0000032011264,0.00015725456,0.00005294111,0.000030451785,0.0010705631,0.0034175348,0.00010650746,0.18507205,0.59815454,0.21175307],"study_design_scores_gemma":[0.00002230423,0.0012150989,0.000010524044,0.0014103155,0.00010929481,0.00003085828,0.0002961113,0.27961922,0.0077244127,0.36014688,0.34700948,0.002405496],"about_ca_topic_score_codex":0.00043185876,"about_ca_topic_score_gemma":0.0006320801,"teacher_disagreement_score":0.35463384,"about_ca_system_score_codex":0.00029594713,"about_ca_system_score_gemma":0.0009429892,"threshold_uncertainty_score":0.9999848},"labels":[],"label_agreement":null},{"id":"W1997477668","doi":"10.1016/s0004-3702(00)00033-3","title":"Stochastic dynamic programming with factored representations","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":365,"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 British Columbia; University of Toronto","funders":"","keywords":"Markov decision process; Computer science; Representation (politics); Dynamic programming; Generalization; Decision tree; State space; Computation; Influence diagram; Exploit; Stochastic programming; State (computer science); Dynamic Bayesian network; Dynamic decision-making; Mathematical optimization; Bayesian network; Theoretical computer science; Artificial intelligence; Markov process; Mathematics; Algorithm","score_opus":0.04257783472299416,"score_gpt":0.3077484925454908,"score_spread":0.26517065782249666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997477668","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.03201635,0.000034995697,0.9660396,0.0005613202,0.000087455075,0.00017313499,0.000001534468,0.00028798444,0.0007976373],"genre_scores_gemma":[0.94816774,0.0000062771455,0.05137221,0.000087730514,0.000025372346,0.00003403551,0.000003422335,0.0000098602395,0.0002933305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861467,0.000041057963,0.00027540443,0.00046570317,0.00025901824,0.0003441499],"domain_scores_gemma":[0.9991296,0.0000842823,0.000051022493,0.0005195706,0.00009610877,0.00011943583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012871534,0.00014709221,0.00012349091,0.000068374866,0.00021004981,0.0002945182,0.00063219236,0.00004709756,0.00015879182],"category_scores_gemma":[0.000029180124,0.00012626711,0.000040784464,0.0005541858,0.00011518886,0.00041851238,0.00004387207,0.00016394786,0.000479123],"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.000013691071,0.00007304455,0.000016724614,0.0000028168688,0.000009571366,0.000011535375,0.0010157881,0.028759256,0.0002262696,0.056074977,0.000008744263,0.9137876],"study_design_scores_gemma":[0.000023318986,0.00018612375,0.00017250008,0.000043291522,0.000010178903,0.00003213372,0.00020583977,0.9336369,0.0026866356,0.06252094,0.00015726297,0.00032488361],"about_ca_topic_score_codex":0.00012900581,"about_ca_topic_score_gemma":0.00012262365,"teacher_disagreement_score":0.9161514,"about_ca_system_score_codex":0.000027911048,"about_ca_system_score_gemma":0.000075064,"threshold_uncertainty_score":0.6158317},"labels":[],"label_agreement":null},{"id":"W1998496300","doi":"10.1016/j.artint.2007.04.011","title":"PickPocket: A computer billiards shark","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"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 Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Table (database); Domain (mathematical analysis); Olympiad; Task (project management); Machine learning; Mathematics; Data mining; Engineering","score_opus":0.06163264361899398,"score_gpt":0.3233859235981768,"score_spread":0.26175327997918285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998496300","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.025221933,0.00011708364,0.9653444,0.0010980866,0.002336473,0.0003170734,0.0000027399128,0.0006322313,0.004929965],"genre_scores_gemma":[0.8925405,0.000021551194,0.10516263,0.0012436868,0.00076877105,0.000014153352,0.0000025065917,0.00003055775,0.00021561766],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959968,0.000087694476,0.0011077662,0.0009884272,0.0007308263,0.001088487],"domain_scores_gemma":[0.99720865,0.0006039138,0.00021722965,0.0012546583,0.00035528842,0.00036022687],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018242634,0.0003781618,0.00033785345,0.00036630357,0.00036027667,0.00044792957,0.0023921765,0.00019485928,0.00026038027],"category_scores_gemma":[0.00022453177,0.00036075266,0.00021290228,0.0014512956,0.00033156434,0.00087718177,0.00058849395,0.00040537774,0.0037391116],"study_design_candidate":"bench_or_experimental","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.000017593738,0.00013191011,0.0002506733,0.0000056182785,0.000015840398,0.000080062426,0.0012699128,0.00043798378,0.0019969468,0.3892047,0.0005158262,0.6060729],"study_design_scores_gemma":[0.000019619416,0.00032413664,0.00070357794,0.000052915857,0.000011537373,0.00006488436,0.00042093772,0.15345144,0.650782,0.17816207,0.015128887,0.0008780063],"about_ca_topic_score_codex":0.00018789114,"about_ca_topic_score_gemma":0.0003177353,"teacher_disagreement_score":0.8673186,"about_ca_system_score_codex":0.00013065082,"about_ca_system_score_gemma":0.00011126919,"threshold_uncertainty_score":0.9998844},"labels":[],"label_agreement":null},{"id":"W2003757888","doi":"10.1016/j.artint.2013.02.002","title":"Constraint propagation as information maximization","year":2013,"lang":"en","type":"article","venue":"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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Constraint satisfaction dual problem; Maximization; Constraint (computer-aided design); Constraint satisfaction; Mathematics; Local consistency; Constraint logic programming; Tuple; Predicate (mathematical logic); Computation; Mathematical optimization; Semantics (computer science); Computer science; Theoretical computer science; Algorithm; Constraint programming; Artificial intelligence; Discrete mathematics","score_opus":0.020297814730055125,"score_gpt":0.2455150153078151,"score_spread":0.22521720057775999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003757888","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.00506476,0.000003885264,0.9832853,0.0026497068,0.00037978383,0.00042588342,8.6805676e-7,0.00025958713,0.007930222],"genre_scores_gemma":[0.96323365,0.000011469466,0.03590124,0.0007067184,0.0000322309,0.000049046048,0.000016879638,0.000003771274,0.000044964505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989498,0.000043406726,0.00040740002,0.0001808509,0.0002375963,0.0001809016],"domain_scores_gemma":[0.9991312,0.000046567035,0.00014084407,0.00025181004,0.00034522163,0.000084372325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015814455,0.00010669636,0.00007936286,0.00015699142,0.00015475384,0.0005228494,0.00026079628,0.00006365246,0.000897909],"category_scores_gemma":[0.00019029374,0.000105560306,0.000035362504,0.000455164,0.00007520119,0.0032632353,0.000055275403,0.00009154292,0.0045421477],"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.0000012639209,0.000011963942,0.00006731763,0.000002722038,0.0000023647838,3.0934117e-7,0.00040447898,0.0033133095,0.00036827594,0.41084316,0.00008774294,0.5848971],"study_design_scores_gemma":[0.000028472383,0.00006484957,0.0009555072,0.000013233203,0.0000031622083,0.000024935356,0.0004648736,0.8388101,0.034633312,0.12397118,0.0008027941,0.00022759612],"about_ca_topic_score_codex":0.00013335419,"about_ca_topic_score_gemma":0.000011280038,"teacher_disagreement_score":0.9581689,"about_ca_system_score_codex":0.000049547503,"about_ca_system_score_gemma":0.00008855707,"threshold_uncertainty_score":0.9962329},"labels":[],"label_agreement":null},{"id":"W2006754637","doi":"10.1016/j.artint.2010.11.021","title":"Specifying and computing preferred plans","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"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":"Planner; Computer science; Semantics (computer science); Preference; Plan (archaeology); Situation calculus; Bounded function; Order (exchange); Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.06177651901621427,"score_gpt":0.2950130996349307,"score_spread":0.23323658061871644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006754637","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.25527588,0.00006865319,0.728252,0.00028760397,0.0014186676,0.00012054322,0.0000011027485,0.00023006539,0.014345497],"genre_scores_gemma":[0.9799225,0.000010677675,0.019548124,0.0001026267,0.00030969994,0.0000022671136,8.825771e-7,0.0000072886164,0.000095961426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880266,0.000033429405,0.00026030847,0.00042261637,0.00015312506,0.0003278517],"domain_scores_gemma":[0.9991346,0.00020553751,0.00007344644,0.00038452173,0.00007216199,0.0001297478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003702143,0.00013714071,0.00013963494,0.000070611764,0.00026162658,0.000302873,0.0006359881,0.00007967214,0.00003951884],"category_scores_gemma":[0.00017390323,0.00012350423,0.000039196653,0.00024825256,0.00012304641,0.0002843139,0.0003073819,0.00030244747,0.00024962734],"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.0000037648388,0.000043528245,0.0013083323,0.0000065449294,0.000005319371,0.00001236591,0.0025562474,0.0000279807,0.008824262,0.6460552,0.000077310986,0.34107912],"study_design_scores_gemma":[0.00006731407,0.00018967835,0.008271938,0.000054054562,0.000012852256,0.00014915707,0.000567842,0.5000758,0.20001474,0.27940297,0.010330082,0.00086353853],"about_ca_topic_score_codex":0.000045716104,"about_ca_topic_score_gemma":0.00033433994,"teacher_disagreement_score":0.72464657,"about_ca_system_score_codex":0.000009514912,"about_ca_system_score_gemma":0.000035902383,"threshold_uncertainty_score":0.50363564},"labels":[],"label_agreement":null},{"id":"W2012061263","doi":"10.1016/s0004-3702(01)00165-5","title":"Games, computers, and artificial intelligence","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Artificial intelligence; Computer science; Artificial Sweetener; Biology","score_opus":0.08793558553946206,"score_gpt":0.2975744220529197,"score_spread":0.2096388365134576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012061263","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.010355269,0.0011533272,0.97618324,0.005939893,0.001923509,0.00052149507,0.000007679502,0.00076259795,0.0031530056],"genre_scores_gemma":[0.94351333,0.00047442288,0.05411265,0.0010553619,0.00048966723,0.000049718525,0.0000031265758,0.000048938477,0.00025278688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945994,0.00023733907,0.0015137864,0.0016016599,0.00082988234,0.0012179329],"domain_scores_gemma":[0.99648213,0.0008334204,0.00032918045,0.0015127361,0.00032322304,0.0005193254],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008379681,0.000632952,0.0005791581,0.00045897238,0.000619312,0.0010770622,0.0024588918,0.00027949244,0.0006680625],"category_scores_gemma":[0.0005219692,0.0006478434,0.00020850982,0.0015528136,0.00087838044,0.0014568779,0.0009309169,0.00063923345,0.0034786405],"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.000008021105,0.00016324648,0.000041795978,0.000010265412,0.000017602673,0.0000490008,0.0017724604,0.00049411005,0.00067746174,0.44959635,0.0004430857,0.5467266],"study_design_scores_gemma":[0.000007943509,0.0002457774,0.00003604279,0.000057894857,0.000015507276,0.00009144581,0.0006711804,0.53465277,0.08217529,0.37780708,0.0034921684,0.00074685575],"about_ca_topic_score_codex":0.00018248288,"about_ca_topic_score_gemma":0.00014709984,"teacher_disagreement_score":0.93315804,"about_ca_system_score_codex":0.00011230525,"about_ca_system_score_gemma":0.000053234435,"threshold_uncertainty_score":0.9999599},"labels":[],"label_agreement":null},{"id":"W2021003968","doi":"10.1016/j.artint.2011.10.001","title":"Parallel belief revision: Revising by sets of formulas","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Counterfactual thinking; Iterated function; Set (abstract data type); State (computer science); Belief structure; Function (biology); Mathematics; Mathematical economics; Epistemology; Computer science; Artificial intelligence; Algorithm; Philosophy","score_opus":0.08553203347805895,"score_gpt":0.29661412308617197,"score_spread":0.21108208960811303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021003968","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.010825321,0.0014393853,0.9677943,0.00014041094,0.00044845493,0.00020031513,0.0000023756434,0.00012629994,0.019023128],"genre_scores_gemma":[0.9539167,0.00019960655,0.04547087,0.00014448368,0.00005723162,0.000004715727,0.0000019896179,0.000010169175,0.00019419346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832714,0.000072771916,0.00055423286,0.00043478934,0.00025443616,0.00035665373],"domain_scores_gemma":[0.9987062,0.00011027767,0.00020857266,0.00066041725,0.00018949929,0.0001249969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137761,0.00017445772,0.0002608539,0.00007269565,0.00014359398,0.00006780051,0.0010739965,0.00008881096,0.00016604002],"category_scores_gemma":[0.00020074558,0.00014995843,0.000118580465,0.00044926754,0.00012237624,0.00045542972,0.00027412007,0.00013928651,0.00041793825],"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.000018342882,0.00019580963,0.00019926568,0.000034265984,0.000013787356,0.000011558065,0.005452082,0.000013104769,0.0013801345,0.5083279,0.001795331,0.4825584],"study_design_scores_gemma":[0.00008807015,0.0008553188,0.00043168667,0.00040103213,0.0000348681,0.000043344065,0.00041005228,0.04713413,0.5147312,0.40952715,0.02534619,0.0009969112],"about_ca_topic_score_codex":0.00008916912,"about_ca_topic_score_gemma":0.000013056278,"teacher_disagreement_score":0.9430914,"about_ca_system_score_codex":0.00002330948,"about_ca_system_score_gemma":0.00005111588,"threshold_uncertainty_score":0.6115128},"labels":[],"label_agreement":null},{"id":"W2025270539","doi":"10.1016/j.artint.2010.04.005","title":"A semantic characterization of a useful fragment of the situation calculus with knowledge","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":43,"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":"Situation calculus; Correctness; Fragment (logic); Calculus (dental); Embedding; Determinacy; Mathematics; Computer science; Algebra over a field; Artificial intelligence; Algorithm; Pure mathematics","score_opus":0.023592062439281004,"score_gpt":0.2558285231445378,"score_spread":0.2322364607052568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025270539","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.5738916,0.000009251605,0.42482015,0.00011523767,0.00038035316,0.0001528877,0.0000010932545,0.000020882222,0.00060856953],"genre_scores_gemma":[0.99875695,0.000004474223,0.001049007,0.000021009893,0.000059061196,0.000010474571,0.0000015301817,0.000005647406,0.000091851245],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990308,0.000057043842,0.00031827387,0.00022911227,0.00020754698,0.00015721573],"domain_scores_gemma":[0.99886286,0.00007136408,0.00023092303,0.00049900135,0.00029450352,0.00004136889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794861,0.00010404094,0.00014616044,0.0000614695,0.0000902387,0.000037478283,0.00062633434,0.00005877891,0.000025834453],"category_scores_gemma":[0.00010585693,0.00006678567,0.000057908623,0.000571395,0.00015885774,0.0001995392,0.00014558621,0.00013137571,0.000038976574],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000017656384,0.00034228235,0.002907355,0.000039853447,0.000016489008,0.0000011161081,0.008992702,0.000056366287,0.52806616,0.38321906,0.0000061210903,0.07633483],"study_design_scores_gemma":[0.000027710688,0.00012392747,0.015504699,0.000055670807,0.0000138679525,0.0000059076283,0.00007223616,0.07402309,0.90427196,0.0055693905,0.00020938792,0.00012212392],"about_ca_topic_score_codex":0.0000482354,"about_ca_topic_score_gemma":0.00051482295,"teacher_disagreement_score":0.42486537,"about_ca_system_score_codex":0.000013010378,"about_ca_system_score_gemma":0.00012102112,"threshold_uncertainty_score":0.27234408},"labels":[],"label_agreement":null},{"id":"W2026953637","doi":"10.1016/j.artint.2011.01.004","title":"The expansion continues: Stitching together the breadth of disciplines impinging on Artificial Intelligence","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"University of Alberta","funders":"","keywords":"Image stitching; Artificial intelligence; Computer science; Cognitive science; Psychology","score_opus":0.16928189402080177,"score_gpt":0.3264121645148946,"score_spread":0.1571302704940928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026953637","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.625486,0.0007371743,0.3358515,0.005430891,0.0070211524,0.0017553866,0.000029950785,0.0004725905,0.02321533],"genre_scores_gemma":[0.997658,0.00008446947,0.00025947226,0.0005240454,0.0012506563,0.00004194206,0.000009823577,0.000046529807,0.00012504478],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699324,0.000053359967,0.0011150247,0.00058501307,0.0005996521,0.0006536808],"domain_scores_gemma":[0.997431,0.00054615317,0.0006040709,0.0009810663,0.00040851018,0.000029233079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001514987,0.0003968531,0.000331354,0.00020842957,0.0011276341,0.0004982693,0.0016399828,0.00012549078,0.00040867057],"category_scores_gemma":[0.000795946,0.00023203537,0.00019584951,0.0011067544,0.00078186026,0.0009322407,0.0005146883,0.00042513624,0.00060498895],"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.000277218,0.00019691222,0.000484595,0.00003859055,0.00003212319,0.0000064155934,0.0013384824,0.000379102,0.0025604554,0.4775303,0.00023211437,0.51692367],"study_design_scores_gemma":[0.00003612247,0.00014708994,0.002133275,0.00078431517,0.00019025149,0.000012058579,0.021414936,0.052248634,0.21542998,0.68822944,0.018080113,0.0012937624],"about_ca_topic_score_codex":0.0015660647,"about_ca_topic_score_gemma":0.0013001873,"teacher_disagreement_score":0.5156299,"about_ca_system_score_codex":0.000028493021,"about_ca_system_score_gemma":0.000045908087,"threshold_uncertainty_score":0.94621277},"labels":[],"label_agreement":null},{"id":"W2028246200","doi":"10.1016/s0004-3702(03)00111-5","title":"A consistency-based approach for belief change","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Disjoint sets; Computer science; Knowledge base; Sentence; Consistency (knowledge bases); Theoretical computer science; Implementation; Artificial intelligence; Natural language processing; Programming language; Mathematics; Discrete mathematics","score_opus":0.13670357145101936,"score_gpt":0.30438745971050946,"score_spread":0.1676838882594901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028246200","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.00042463883,0.00038771133,0.9783598,0.00024145599,0.0005476163,0.0005328815,0.0000033618414,0.00017415144,0.019328393],"genre_scores_gemma":[0.8480442,0.0000077111,0.15068541,0.0006821096,0.00013472635,0.00025752882,0.0000046179393,0.000012335081,0.00017132975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984038,0.00008486493,0.000312435,0.0005477384,0.00018742624,0.0004637586],"domain_scores_gemma":[0.99879146,0.00022619145,0.000094787094,0.0005512748,0.00020177422,0.00013453623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005737065,0.00018446667,0.00020312128,0.000096908756,0.00027830066,0.0001604101,0.0006882597,0.000094951036,0.000032507687],"category_scores_gemma":[0.00039306594,0.00016568202,0.00014213761,0.0004655912,0.00012828968,0.00024093619,0.000055862678,0.00010654964,0.00015882874],"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.000007052035,0.00020980257,0.00009802264,0.000020534702,0.0000069193843,0.000002885166,0.00078458246,0.00010025589,0.00022020635,0.94358605,0.00016850146,0.05479521],"study_design_scores_gemma":[0.00013285087,0.00054571993,0.000077699806,0.000033987828,0.000027092627,0.00002164997,0.0004194283,0.54558194,0.15464047,0.2679626,0.029698372,0.00085817894],"about_ca_topic_score_codex":0.00002998464,"about_ca_topic_score_gemma":0.000031316493,"teacher_disagreement_score":0.8476196,"about_ca_system_score_codex":0.000036476944,"about_ca_system_score_gemma":0.00015127758,"threshold_uncertainty_score":0.6756317},"labels":[],"label_agreement":null},{"id":"W2039987681","doi":"10.1016/j.artint.2014.03.007","title":"On our best behaviour","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"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":"Clearance; Computer science; Epistemology; Context (archaeology); Cognitive science; Artificial intelligence; Artificial general intelligence; Psychology; Data science; Philosophy; History","score_opus":0.052468964991108834,"score_gpt":0.30392796302351216,"score_spread":0.25145899803240335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039987681","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.043095727,0.000035994355,0.92316735,0.00095294375,0.0015362513,0.000121317615,9.062776e-7,0.0002275796,0.030861951],"genre_scores_gemma":[0.99511576,0.000006139389,0.0033762883,0.00040360543,0.00026926797,0.000011591582,0.0000010066985,0.000009870496,0.00080644625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986047,0.00008202311,0.00026344747,0.0004682058,0.00021223254,0.00036938288],"domain_scores_gemma":[0.9989179,0.00012680075,0.00007599498,0.0006302624,0.00010521096,0.00014388024],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003965579,0.00016376795,0.00015306738,0.0000886005,0.00019784983,0.00020850704,0.0010179853,0.00007922139,0.000036311914],"category_scores_gemma":[0.00029585438,0.00014222851,0.000085216816,0.00031751662,0.000039278075,0.00021454135,0.00016939422,0.00018172758,0.0057570627],"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.0000039051856,0.00014711342,0.00024175228,0.0000019699282,0.0000025948439,0.000004923684,0.00039586335,0.00010947281,0.00023088155,0.8130439,0.0005151495,0.18530245],"study_design_scores_gemma":[0.000054770644,0.0012127247,0.0009235966,0.00007005421,0.000018081844,0.00002555242,0.00043302562,0.1305547,0.1314179,0.7271287,0.0073186457,0.00084225636],"about_ca_topic_score_codex":0.00007594478,"about_ca_topic_score_gemma":0.00008904487,"teacher_disagreement_score":0.95202005,"about_ca_system_score_codex":0.00003075236,"about_ca_system_score_gemma":0.000035989997,"threshold_uncertainty_score":0.99501705},"labels":[],"label_agreement":null},{"id":"W2042145505","doi":"10.1016/s0004-3702(02)00366-1","title":"Robustness of regional matching scheme over global matching scheme","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"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 Northern British Columbia","funders":"","keywords":"Robustness (evolution); Voting; Pixel; Artificial intelligence; Principal component analysis; Pattern recognition (psychology); Computer science; Clutter; Mathematics; Computer vision; Radar","score_opus":0.04898738547814663,"score_gpt":0.2899518753897909,"score_spread":0.24096448991164426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042145505","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.51447046,0.00022464943,0.48211387,0.000021760643,0.00030676322,0.00007916456,0.0000031390755,0.00029772258,0.0024824764],"genre_scores_gemma":[0.94872,0.000039367347,0.051058,0.000045522094,0.00009125782,0.000005323093,0.0000026322468,0.00002540226,0.000012496699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998801,0.00003391118,0.000398606,0.00022478787,0.00024012988,0.00030158204],"domain_scores_gemma":[0.9994148,0.000057106372,0.00006715712,0.00031149708,0.000082356644,0.000067075925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017031288,0.0001931102,0.00021861908,0.000059478472,0.00007587222,0.000045314133,0.0002243961,0.00010613082,0.00010756922],"category_scores_gemma":[0.0000373898,0.00020765979,0.00009296129,0.00030186374,0.00008559863,0.00017136207,0.00003984995,0.00018489652,0.000024755476],"study_design_candidate":"bench_or_experimental","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.000032970776,0.000114543494,0.00059115124,0.00006608764,0.00009461149,0.00002476562,0.0004308081,0.36846736,0.13757768,0.47823602,0.0010651306,0.013298889],"study_design_scores_gemma":[0.00003849508,0.000037166403,0.00019497555,0.00030535334,0.000019568195,0.00004749129,0.00058369845,0.20672056,0.6160998,0.17413722,0.0012211414,0.0005945409],"about_ca_topic_score_codex":0.000104560604,"about_ca_topic_score_gemma":0.00004492345,"teacher_disagreement_score":0.4785221,"about_ca_system_score_codex":0.00006146978,"about_ca_system_score_gemma":0.000026741212,"threshold_uncertainty_score":0.846812},"labels":[],"label_agreement":null},{"id":"W2045700601","doi":"10.1016/j.artint.2014.07.002","title":"On the value of using group discounts under price competition","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":9,"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":"Vendor; Regret; Profit (economics); Microeconomics; Schedule; Exploit; Order (exchange); Value (mathematics); Competition (biology); Business; Computer science; Operations research; Economics; Marketing; Mathematics","score_opus":0.2135851433888851,"score_gpt":0.41520736189018304,"score_spread":0.20162221850129794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045700601","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.33361515,0.0000028573106,0.6617534,0.0008609515,0.00015412761,0.0000866573,0.0000031779828,0.000009080407,0.0035146126],"genre_scores_gemma":[0.99891764,0.0000013415867,0.00044580697,0.00042573456,0.00008177428,0.000006501648,9.42797e-7,0.0000045503975,0.00011570693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984448,0.0002640578,0.00043535928,0.00023343739,0.0005061352,0.000116192416],"domain_scores_gemma":[0.99675095,0.002394885,0.00021856157,0.00046763849,0.00013268457,0.000035249857],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002147954,0.00007243698,0.000105898114,0.00006711597,0.0002930276,0.00007720472,0.00046524015,0.000033569304,0.00082875445],"category_scores_gemma":[0.0010147791,0.000044390214,0.000061218874,0.0005517853,0.0002889249,0.00012253861,0.00004957166,0.0000916765,0.0007972947],"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.000012166831,0.00005435717,0.00002116577,5.3938726e-7,0.0000022125635,3.5807844e-8,0.00014966997,0.013601209,0.0050510545,0.9725933,0.00004029333,0.008473995],"study_design_scores_gemma":[0.000004919122,0.000027300299,0.00024824604,0.000009821175,0.0000036967333,0.0000010116291,0.0011382432,0.055732083,0.02966951,0.912441,0.00067125435,0.000052917923],"about_ca_topic_score_codex":0.000035208814,"about_ca_topic_score_gemma":0.000018639532,"teacher_disagreement_score":0.6653025,"about_ca_system_score_codex":0.000017046465,"about_ca_system_score_gemma":0.000014120897,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W2045716498","doi":"10.1016/j.artint.2012.10.005","title":"How to progress a database III","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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":"Axiom; Conjecture; Closing (real estate); Class (philosophy); Mathematics; Order (exchange); Action (physics); Calculus (dental); Property (philosophy); Computer science; Axiomatic system; First-order logic; Mathematical economics; Algebra over a field; Epistemology; Artificial intelligence; Discrete mathematics; Pure mathematics; Philosophy","score_opus":0.07326986236854748,"score_gpt":0.3126493991198949,"score_spread":0.23937953675134743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045716498","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.015080425,0.00059653126,0.9768736,0.0021896444,0.0014080079,0.0002816065,0.0000027358126,0.00024431208,0.0033231617],"genre_scores_gemma":[0.96893233,0.000008303037,0.029501947,0.00034030536,0.00052714016,0.000047384212,0.0000024932513,0.000009666948,0.00063045847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840665,0.000058255875,0.00021239402,0.00039832928,0.00026974693,0.000654648],"domain_scores_gemma":[0.99862015,0.00008715808,0.00006534201,0.0007264367,0.00012307521,0.00037782433],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004866947,0.00016835165,0.00015606324,0.00010200691,0.00018388948,0.00039748847,0.0010914955,0.00005434972,0.000039457773],"category_scores_gemma":[0.00021270003,0.00014327413,0.00006236316,0.00065426383,0.00008922855,0.0010570544,0.00050557696,0.00013055689,0.0012745496],"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.000008621265,0.00018640685,0.0006620433,0.0000068811673,0.0000070382725,0.000008890424,0.003377027,0.0000046883474,0.0010462102,0.6820074,0.0012190018,0.3114658],"study_design_scores_gemma":[0.00009268103,0.00054306706,0.0014068261,0.00012716398,0.000034328034,0.0000952605,0.0017334162,0.03577365,0.7187237,0.05009859,0.1895568,0.0018144816],"about_ca_topic_score_codex":0.000030308358,"about_ca_topic_score_gemma":0.000048924667,"teacher_disagreement_score":0.9538519,"about_ca_system_score_codex":0.000035906054,"about_ca_system_score_gemma":0.00004584795,"threshold_uncertainty_score":0.9995031},"labels":[],"label_agreement":null},{"id":"W2052020474","doi":"10.1016/j.artint.2014.07.005","title":"Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Rensselaer Polytechnic Institute; Australian Research Council; Alexander von Humboldt-Stiftung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Voting; Heuristic; Computer science; Computational complexity theory; Algorithm; Artificial intelligence","score_opus":0.18400626271027948,"score_gpt":0.2990024360764078,"score_spread":0.11499617336612833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052020474","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.59158623,0.000480056,0.4068998,0.00022976767,0.00015881284,0.00019481288,0.000041522762,0.00000819912,0.00040074755],"genre_scores_gemma":[0.9979415,0.000018928275,0.0019156093,0.000016397988,0.000067003675,0.0000059006325,0.0000022470385,0.0000065028726,0.000025888745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992353,0.000024502708,0.0004547439,0.00016050178,0.000021313972,0.000103680424],"domain_scores_gemma":[0.99906665,0.00044523005,0.00030920314,0.0001203026,0.00003858872,0.000020027033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013289549,0.00006585804,0.0002162395,0.00004570629,0.000100862075,0.000022307653,0.00009463635,0.00003730147,0.000012983909],"category_scores_gemma":[0.00030732545,0.000059150712,0.000036762234,0.00006131053,0.0002374239,0.00006384213,0.000028272874,0.00004051861,0.000005809832],"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.000013917188,0.000013903616,0.0048875622,0.00006103236,0.000010568715,2.0969539e-8,0.0005349107,0.00015830292,0.00014978553,0.96683383,0.0000032252633,0.027332956],"study_design_scores_gemma":[0.00003892695,0.000105204905,0.013440838,0.00003859117,0.00000862055,0.0000015310776,0.00043599296,0.40197787,0.006588459,0.5765177,0.0007397468,0.00010650441],"about_ca_topic_score_codex":0.0003016874,"about_ca_topic_score_gemma":0.00005124876,"teacher_disagreement_score":0.40635526,"about_ca_system_score_codex":0.0000047426347,"about_ca_system_score_gemma":0.0000023874366,"threshold_uncertainty_score":0.2412096},"labels":[],"label_agreement":null},{"id":"W2057434766","doi":"10.1016/j.artint.2004.01.004","title":"Towards a practical theory of reformulation for reasoning about physical systems","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"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":"Terminology; Computer science; Class (philosophy); Context (archaeology); Physical system; Artificial intelligence; Theoretical computer science; Management science","score_opus":0.07585639535785717,"score_gpt":0.3487610667369615,"score_spread":0.27290467137910435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057434766","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.025576718,0.00008343617,0.9726188,0.0004380788,0.0003086594,0.0002299694,0.000004032611,0.000098398166,0.00064188725],"genre_scores_gemma":[0.9215557,0.0000025172758,0.07819429,0.000039944178,0.00015065822,0.000024967221,0.0000036544684,0.000008074941,0.000020208443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881184,0.000072404706,0.00033880523,0.00028656312,0.00023529743,0.00025511283],"domain_scores_gemma":[0.9988303,0.00042464506,0.0001784151,0.0003184885,0.00018095748,0.00006716771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008905794,0.00011341162,0.00017891893,0.000065215565,0.00014400338,0.0001066828,0.00032586989,0.0000654456,0.0000019463107],"category_scores_gemma":[0.0005324376,0.00009892458,0.00008039893,0.00026901622,0.00006300594,0.0004052851,0.00006358565,0.00013163516,0.000024859579],"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.000039847528,0.00006618518,0.0000125519155,0.000030066818,0.000009997566,0.000002790454,0.0021826136,0.029229319,0.0011212858,0.9142706,0.000009069311,0.05302571],"study_design_scores_gemma":[0.00003941859,0.00026000728,0.000055403838,0.00019599091,0.000012918414,0.000013022353,0.00028063694,0.45779762,0.07123188,0.4697893,0.00015775529,0.00016603299],"about_ca_topic_score_codex":0.00012033451,"about_ca_topic_score_gemma":0.000004512985,"teacher_disagreement_score":0.895979,"about_ca_system_score_codex":0.000055734185,"about_ca_system_score_gemma":0.00018376825,"threshold_uncertainty_score":0.40340272},"labels":[],"label_agreement":null},{"id":"W2058792175","doi":"10.1016/j.artint.2005.09.002","title":"Finding optimal satisficing strategies for and-or trees","year":2005,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":50,"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; University of Alberta","funders":"","keywords":"Probabilistic logic; Tree (set theory); Set (abstract data type); Node (physics); Computer science; Outcome (game theory); Satisficing; Class (philosophy); Mathematical optimization; Task (project management); Mathematics; Test (biology); Algorithm; Artificial intelligence; Combinatorics; Mathematical economics","score_opus":0.1111722750895888,"score_gpt":0.3551924202138077,"score_spread":0.2440201451242189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058792175","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.025787469,0.000090979695,0.9704144,0.0006043756,0.00013032567,0.00015299086,0.0000014713897,0.0025850404,0.00023296509],"genre_scores_gemma":[0.5816385,0.000007863377,0.41808605,0.000092564136,0.00010067169,0.000021498321,4.25616e-7,0.000006025655,0.000046373527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989613,0.000021348418,0.000283408,0.00033671598,0.00011914449,0.00027807715],"domain_scores_gemma":[0.9986823,0.00085809437,0.00007423992,0.0002593611,0.000065765926,0.000060216917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003602173,0.00012726043,0.00012899183,0.00009536944,0.00023077491,0.0003140036,0.00039983474,0.0000515634,0.000015239736],"category_scores_gemma":[0.0004386803,0.000109034314,0.00003829261,0.00021281818,0.000072392104,0.0005480224,0.000114427974,0.00008312765,0.000015671827],"study_design_candidate":"design_other","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.000015349053,0.000027932278,0.00012007261,0.000010422661,0.0000051156653,0.0000023870089,0.0017797283,0.0014043787,0.0006412611,0.23692097,0.0008986727,0.7581737],"study_design_scores_gemma":[0.00002079747,0.0002795601,0.00011686592,0.0000755281,0.0000066423804,0.000023770408,0.00022962013,0.6461015,0.04040637,0.31114063,0.0013041927,0.00029456543],"about_ca_topic_score_codex":0.00006946571,"about_ca_topic_score_gemma":0.00012590928,"teacher_disagreement_score":0.75787914,"about_ca_system_score_codex":0.00002326712,"about_ca_system_score_gemma":0.000068810645,"threshold_uncertainty_score":0.444629},"labels":[],"label_agreement":null},{"id":"W2062205093","doi":"10.1016/s0004-3702(00)00031-x","title":"ConGolog, a concurrent programming language based on the situation calculus","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":496,"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; York University","funders":"","keywords":"Concurrency; Programming language; Computer science; Axiom; Rotation formalisms in three dimensions; Situation calculus; Process calculus; Semantics (computer science); Operational semantics; Pi calculus; Theoretical computer science; Mathematics","score_opus":0.04249999969817588,"score_gpt":0.29459508375138727,"score_spread":0.2520950840532114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062205093","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.08359794,0.00016519129,0.89818007,0.002315505,0.0005928445,0.00052979833,0.0000020649584,0.00032724446,0.014289322],"genre_scores_gemma":[0.99788684,0.0000056488316,0.0009915842,0.0006736718,0.00012116177,0.000048613852,0.000003273624,0.0000063665466,0.00026282665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987012,0.00013726318,0.0002406394,0.0003543532,0.0002466197,0.00031993905],"domain_scores_gemma":[0.99899983,0.00033485665,0.00006269055,0.0004543365,0.00007269608,0.00007558332],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004602241,0.0001414918,0.00011526191,0.000045047385,0.0002474463,0.00022606543,0.0006977887,0.000056226687,0.00045762197],"category_scores_gemma":[0.00019774828,0.00009506336,0.0000786523,0.00039531663,0.00012853743,0.00013189035,0.00004820349,0.00017120937,0.0014235333],"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.0000064201267,0.000104925464,0.000026242438,0.0000025378806,0.0000035111318,0.000010999046,0.0025367995,0.0005337514,0.00017942194,0.22898927,0.00011496339,0.76749116],"study_design_scores_gemma":[0.000038643786,0.00026856342,0.00017696741,0.00003710843,0.000008433713,0.000005670474,0.00041333173,0.94695044,0.038138486,0.005427385,0.008262656,0.00027234558],"about_ca_topic_score_codex":0.000096614254,"about_ca_topic_score_gemma":0.0001226708,"teacher_disagreement_score":0.9464167,"about_ca_system_score_codex":0.00004014642,"about_ca_system_score_gemma":0.00006562571,"threshold_uncertainty_score":0.99935395},"labels":[],"label_agreement":null},{"id":"W2065446266","doi":"10.1016/s0004-3702(01)00119-9","title":"A comparison of point-based approaches to qualitative temporal reasoning","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semantic reasoner; Computer science; Graph; Theoretical computer science; Heuristic; Point (geometry); Artificial intelligence; Mathematics","score_opus":0.30808437359377266,"score_gpt":0.3989348752321367,"score_spread":0.09085050163836406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065446266","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.03505759,0.0000150457945,0.96121764,0.0019963249,0.0001419913,0.00016735203,0.0000015519245,0.000087646105,0.0013148718],"genre_scores_gemma":[0.8207944,6.9624e-7,0.179027,0.0001218471,0.000017136123,0.000009892142,0.000002891578,0.00000436632,0.000021764828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987328,0.00013327399,0.00043812642,0.00028632442,0.00022732197,0.00018216472],"domain_scores_gemma":[0.9991851,0.0001940205,0.00014449879,0.00028067338,0.000100595185,0.00009510282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046700003,0.00010475776,0.00017843618,0.00015967754,0.00009196312,0.0000728161,0.00032541036,0.00004164398,0.00007637628],"category_scores_gemma":[0.0002116858,0.000106534535,0.00005524757,0.000758908,0.00007856626,0.0002485794,0.00005678901,0.00008830518,0.00008402113],"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.000055849672,0.00021782985,0.0077266544,0.000010211418,0.000012027689,0.0000036102651,0.02998817,0.07183792,0.00078961445,0.5197497,0.000088338646,0.3695201],"study_design_scores_gemma":[0.000024998053,0.00016886453,0.00046941862,0.00003811103,0.0000040580776,0.0000027708115,0.007185714,0.9129878,0.06905611,0.009651261,0.0002157989,0.00019505434],"about_ca_topic_score_codex":0.00012373504,"about_ca_topic_score_gemma":0.0001858713,"teacher_disagreement_score":0.8411499,"about_ca_system_score_codex":0.000032306514,"about_ca_system_score_gemma":0.00007103555,"threshold_uncertainty_score":0.43443522},"labels":[],"label_agreement":null},{"id":"W2068627087","doi":"10.1016/j.artint.2007.01.003","title":"Multi-agent learning for engineers","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Position paper; Appeal; Position (finance); Management science; Engineering; Economics; World Wide Web; Political science","score_opus":0.2702281220202754,"score_gpt":0.4568198104691339,"score_spread":0.18659168844885848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068627087","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.03261343,0.000024155452,0.96557766,0.00037345706,0.00040315642,0.00020306006,0.0000023111545,0.0000694502,0.00073329435],"genre_scores_gemma":[0.9831682,0.000002653727,0.013807796,0.00011497679,0.00016402751,0.000023438715,0.0000022411762,0.000008054536,0.0027086409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985796,0.000037133832,0.0005267111,0.0003105813,0.0003056723,0.00024027216],"domain_scores_gemma":[0.9977105,0.0015831277,0.000120390636,0.00025301593,0.00023195265,0.000100968056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035059922,0.000082217506,0.000104041894,0.00013754934,0.00032474496,0.000091457725,0.0003679517,0.000051150146,0.0003628757],"category_scores_gemma":[0.0028413518,0.00006965244,0.00009783934,0.00055950123,0.00009788085,0.00011988387,0.000034601493,0.000115289266,0.0015848713],"study_design_candidate":"design_other","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.00004629935,0.00008833701,0.00019397662,0.0000013610787,0.0000068128365,0.0000011685856,0.001374225,0.022972418,0.012151466,0.27466708,0.00034990034,0.68814695],"study_design_scores_gemma":[0.000037111226,0.00009930192,0.0006929577,0.0000060584275,0.0000109618095,0.0000052449855,0.014425389,0.13515231,0.33160144,0.3617004,0.15597266,0.0002961624],"about_ca_topic_score_codex":0.000007913448,"about_ca_topic_score_gemma":0.000037303325,"teacher_disagreement_score":0.9517699,"about_ca_system_score_codex":0.000022255663,"about_ca_system_score_gemma":0.000017161303,"threshold_uncertainty_score":0.99919254},"labels":[],"label_agreement":null},{"id":"W2070060452","doi":"10.1016/j.artint.2007.02.005","title":"A hierarchy of prescriptive goals for multiagent learning","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"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 Alberta","funders":"","keywords":"Regret; Hierarchy; Computer science; Adversary; Multi-agent system; Mathematical optimization; Minification; Artificial intelligence; Mathematics; Machine learning; Economics; Computer security","score_opus":0.3355190226677535,"score_gpt":0.4874850102189569,"score_spread":0.15196598755120339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070060452","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.2896335,0.000032022355,0.7075385,0.00017909282,0.0001245391,0.00030730106,0.000008513156,0.000022552085,0.0021539973],"genre_scores_gemma":[0.9924872,0.0000027133399,0.006201555,0.000057154437,0.000078779696,0.000028779601,0.0000017688848,0.000007125675,0.001134916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981508,0.000092304166,0.0007636056,0.0003270596,0.00041585963,0.00025035167],"domain_scores_gemma":[0.9956357,0.0032624213,0.00024382478,0.00032900172,0.00044158747,0.0000874877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046134945,0.0000882699,0.00017691702,0.00015913465,0.00018016744,0.000051884548,0.0005213873,0.000050463725,0.0002856359],"category_scores_gemma":[0.00457586,0.00007188604,0.000120826095,0.0005728393,0.00023224483,0.00012554102,0.00007080656,0.00011121523,0.00032829805],"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.00016097323,0.00011584848,0.0003798169,0.000003059658,0.000008929238,8.1693804e-7,0.0028807751,0.0019147025,0.052218124,0.5172825,0.00013693079,0.42489752],"study_design_scores_gemma":[0.000014946966,0.000108119246,0.0004718765,0.000007178317,0.000005988984,7.6273267e-7,0.0037441344,0.00491879,0.49749514,0.48089382,0.012258588,0.000080651604],"about_ca_topic_score_codex":0.000029732315,"about_ca_topic_score_gemma":0.000058108984,"teacher_disagreement_score":0.7028537,"about_ca_system_score_codex":0.000015045865,"about_ca_system_score_gemma":0.000028037466,"threshold_uncertainty_score":0.54780626},"labels":[],"label_agreement":null},{"id":"W2070368455","doi":"10.1016/s0004-3702(02)00365-x","title":"Knowledge, action, and the frame problem","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":276,"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":"National Science Foundation","keywords":"Action (physics); Computer science; GRASP; Frame (networking); Frame problem; Knowledge representation and reasoning; Artificial intelligence; Object (grammar); Affect (linguistics); Successor cardinal; Cognitive science; Knowledge management; Mathematics; Programming language; Psychology; Communication","score_opus":0.060709685827284116,"score_gpt":0.3073802869727568,"score_spread":0.2466706011454727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070368455","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.0032667974,0.0013360112,0.9192292,0.00085101934,0.0007617224,0.00026735014,2.8206213e-7,0.00014833115,0.07413927],"genre_scores_gemma":[0.9916534,0.000131566,0.0068485695,0.00018554668,0.00010016687,0.000031339714,2.1712385e-7,0.0000070799224,0.001042138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987569,0.00020079628,0.00026141206,0.00036259822,0.00013085855,0.00028742643],"domain_scores_gemma":[0.99891585,0.0003603835,0.00007439051,0.00041794594,0.00014323318,0.0000882191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079012313,0.00013780168,0.00014879939,0.000050839524,0.00035549433,0.00028047716,0.0005425801,0.00006820034,0.00005116957],"category_scores_gemma":[0.00035444446,0.000089578156,0.00005890813,0.00046378045,0.00031518374,0.0002802049,0.00012723691,0.00019161312,0.00054709055],"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.0000056080275,0.00004860659,0.00007262434,0.000005156349,0.0000067585925,0.000001257147,0.0025478983,0.00001310424,0.0001164204,0.9068983,0.00028014614,0.09000407],"study_design_scores_gemma":[0.00006394892,0.00005873701,0.00007871917,0.000015254751,0.00000938523,0.0000362045,0.00040082508,0.023718772,0.026682619,0.90726286,0.041449152,0.00022350582],"about_ca_topic_score_codex":0.000035005727,"about_ca_topic_score_gemma":0.0001375377,"teacher_disagreement_score":0.9883866,"about_ca_system_score_codex":0.000021242407,"about_ca_system_score_gemma":0.000082147184,"threshold_uncertainty_score":0.7031925},"labels":[],"label_agreement":null},{"id":"W2079680557","doi":"10.1016/j.artint.2010.04.018","title":"Positive approximation: An accelerator for attribute reduction in rough set theory","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":652,"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 Alberta","funders":"","keywords":"Rough set; Reduct; Reduction (mathematics); Heuristic; Attribute domain; Feature selection; Computer science; Set (abstract data type); Consistency (knowledge bases); Set theory; Data mining; Process (computing); Algorithm; Artificial intelligence; Feature (linguistics); Selection (genetic algorithm); Reduction strategy; Mathematics; Machine learning","score_opus":0.08146691489297207,"score_gpt":0.32949558346503327,"score_spread":0.24802866857206118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079680557","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.13417992,0.000015140412,0.86269945,0.000976928,0.0011032963,0.00043626165,0.000014885517,0.000098004544,0.00047613715],"genre_scores_gemma":[0.9489469,0.00000381554,0.050451614,0.00017133456,0.00030429926,0.00007153168,0.000023561313,0.000008209262,0.000018756004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998666,0.00010191851,0.0003292823,0.00045641512,0.00014884594,0.00029755663],"domain_scores_gemma":[0.99907875,0.00015320825,0.00008992637,0.0004507327,0.00014682523,0.000080572616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009863079,0.00013321075,0.00013763305,0.000095265415,0.00018068806,0.00019410289,0.00064378406,0.00010668118,0.00002709125],"category_scores_gemma":[0.00013427249,0.00012248254,0.000051238527,0.0004387513,0.00008418876,0.0010210492,0.00008021743,0.00021977632,0.000056965204],"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.00003269155,0.000114819086,0.000034860335,0.0000041023754,0.0000037884222,0.0000030433446,0.0023510787,0.00031021403,0.0053366465,0.7751657,0.000041553027,0.2166015],"study_design_scores_gemma":[0.000041618263,0.00023695441,0.0005874944,0.000010622236,0.0000046905357,0.000018416766,0.00059489155,0.13632202,0.14442228,0.7170666,0.00039961466,0.00029481342],"about_ca_topic_score_codex":0.000043138505,"about_ca_topic_score_gemma":0.00009817699,"teacher_disagreement_score":0.81476694,"about_ca_system_score_codex":0.000028167035,"about_ca_system_score_gemma":0.000057837093,"threshold_uncertainty_score":0.4994693},"labels":[],"label_agreement":null},{"id":"W2089730874","doi":"10.1016/j.artint.2008.11.003","title":"Practical solution techniques for first-order MDPs","year":2008,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":76,"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":"Arity; Generality; Computer science; Markov decision process; Theoretical computer science; Probabilistic logic; Domain (mathematical analysis); Answer set programming; First-order logic; Domain theory; Mathematical optimization; Logic programming; Artificial intelligence; Markov process; Programming language; Mathematics; Discrete mathematics","score_opus":0.13610002940544252,"score_gpt":0.349719729616963,"score_spread":0.2136197002115205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089730874","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.0006043845,0.00005016002,0.99053377,0.007173088,0.00029229512,0.00025156984,0.0000023683167,0.00038040758,0.00071193493],"genre_scores_gemma":[0.5304516,0.000022882605,0.46886742,0.00032752444,0.00014370917,0.00005578026,0.0000038111896,0.00000857127,0.000118736076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987353,0.000042223885,0.00030127238,0.0003728014,0.00019542825,0.00035295295],"domain_scores_gemma":[0.9988122,0.0004578495,0.00009335816,0.000349738,0.00020403681,0.000082807586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044434998,0.00012899721,0.00012697683,0.00007948294,0.00055549695,0.000086160166,0.00040217515,0.00009913143,0.00002196184],"category_scores_gemma":[0.00045518795,0.00012613152,0.000062976185,0.00035266657,0.00012473998,0.00046581656,0.00009475487,0.00016532927,0.0001463954],"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.00007546754,0.00029686576,0.00041108727,0.00004452235,0.000025495689,0.00006996693,0.003155779,0.0008822137,0.0025547142,0.7449472,0.02711193,0.22042477],"study_design_scores_gemma":[0.000024899504,0.00040702146,0.0000504741,0.00006185134,0.000009978397,0.00013088586,0.00005780235,0.67121655,0.18397167,0.106671624,0.03694557,0.00045165536],"about_ca_topic_score_codex":0.000074590185,"about_ca_topic_score_gemma":0.000037373815,"teacher_disagreement_score":0.67033434,"about_ca_system_score_codex":0.000035319747,"about_ca_system_score_gemma":0.00013106978,"threshold_uncertainty_score":0.5143494},"labels":[],"label_agreement":null},{"id":"W2092974662","doi":"10.1016/j.artint.2009.07.001","title":"Stonian p-ortholattices: A new approach to the mereotopology<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mi mathvariant=\"italic\">RT</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math>","year":2009,"lang":"lv","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Toronto","funders":"","keywords":"Scroll; Computer graphics (images); Computer science; Artificial intelligence; Mathematics; Philosophy; Theology","score_opus":0.03425697352376484,"score_gpt":0.26916251627399984,"score_spread":0.234905542750235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092974662","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.5354584,0.0005578533,0.41191655,0.006201847,0.0041567395,0.0002503168,0.00017456927,0.0003933406,0.0408904],"genre_scores_gemma":[0.97607315,0.00033610716,0.018131252,0.0034877353,0.0011199994,0.00018072384,0.00016526807,0.0001375476,0.00036819206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939567,0.00032042188,0.0014676319,0.0015492688,0.0012927128,0.0014132896],"domain_scores_gemma":[0.99556804,0.00063963205,0.00096795656,0.0019242072,0.00018100164,0.00071918656],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014883882,0.00064300775,0.00033319168,0.00031121384,0.0015303107,0.0016887977,0.002005948,0.0008763477,0.004516817],"category_scores_gemma":[0.00080118806,0.0008477444,0.0006980502,0.0013777073,0.0008270655,0.0012811386,0.0008436389,0.0010518383,0.0039767837],"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.00028206993,0.00028909976,0.00001220678,0.00009545961,0.00022967803,0.00017976634,0.00623024,0.015375627,0.0005532347,0.92414373,0.0059395283,0.046669375],"study_design_scores_gemma":[0.0002174379,0.000678841,0.00011780747,0.0002771929,0.0003199803,0.0005333327,0.002208495,0.9197358,0.0680211,0.0019196346,0.005107915,0.00086249044],"about_ca_topic_score_codex":0.0015180414,"about_ca_topic_score_gemma":0.002153612,"teacher_disagreement_score":0.9222241,"about_ca_system_score_codex":0.000031724165,"about_ca_system_score_gemma":0.0010661324,"threshold_uncertainty_score":0.99976957},"labels":[],"label_agreement":null},{"id":"W2097688288","doi":"10.1016/j.artint.2007.09.004","title":"Quantifying the uncertainty of a belief net response: Bayesian error-bars for belief net inference","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"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 Alberta","funders":"","keywords":"Bayesian network; Conditional probability distribution; Inference; Random variable; Mathematics; Computer science; Belief propagation; Prior probability; Joint probability distribution; Algorithm; Bayesian probability; Statistics; Artificial intelligence","score_opus":0.12601509982172704,"score_gpt":0.37232002900024613,"score_spread":0.2463049291785191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097688288","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.044088125,0.00022832537,0.9515634,0.0025908286,0.00062281574,0.00048170635,0.000016085805,0.00015894708,0.0002497766],"genre_scores_gemma":[0.96274,0.00002768362,0.03631932,0.0006364711,0.00013103057,0.000038324226,0.000005272327,0.000022343373,0.000079572674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964524,0.00023764421,0.0011208943,0.00075590337,0.00055664463,0.00087650656],"domain_scores_gemma":[0.995035,0.0026870922,0.00037222652,0.0011780872,0.0005184735,0.00020915651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0043008868,0.00034144352,0.00038532555,0.00021589127,0.0004997179,0.00024549064,0.0022028773,0.00019374749,0.000027819082],"category_scores_gemma":[0.0012174572,0.00027385587,0.00020086477,0.0011020128,0.0004093946,0.00039577959,0.00031347718,0.00039976827,0.00005377757],"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.0005980462,0.0002214735,0.00022547823,0.000042334195,0.000038181624,0.000012529647,0.0043421746,0.022709727,0.013483696,0.6784403,0.00024995464,0.27963614],"study_design_scores_gemma":[0.0000882142,0.0008194951,0.00090134825,0.00017645504,0.000029153056,0.000016993594,0.0010805236,0.74074775,0.0866215,0.1669088,0.0019743415,0.0006354527],"about_ca_topic_score_codex":0.00052057195,"about_ca_topic_score_gemma":0.0007610289,"teacher_disagreement_score":0.9186519,"about_ca_system_score_codex":0.000070676244,"about_ca_system_score_gemma":0.00034370704,"threshold_uncertainty_score":0.9999714},"labels":[],"label_agreement":null},{"id":"W2100308419","doi":"10.1016/s0004-3702(00)00035-7","title":"Constraint-directed techniques for scheduling alternative activities","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"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":"Computer science; Scheduling (production processes); Mathematical optimization; Schedule; Constraint programming; Mathematics","score_opus":0.03535660262591858,"score_gpt":0.2865996582321427,"score_spread":0.25124305560622406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100308419","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.04319161,0.000103484635,0.95039505,0.00012692982,0.00035705836,0.0002856867,0.000025341746,0.0016326618,0.0038821565],"genre_scores_gemma":[0.6871153,0.00010945481,0.3121665,0.000095198695,0.0002670305,0.00008032668,0.000012879098,0.000032705102,0.00012057355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925363,0.000014013343,0.0002426195,0.0001699262,0.00009391298,0.00022587397],"domain_scores_gemma":[0.99959576,0.000143902,0.000021370191,0.00012225071,0.0000620103,0.00005469997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001256921,0.00013402804,0.00013254333,0.00007391552,0.00009780614,0.00007141638,0.00013081811,0.00007132056,0.00044695372],"category_scores_gemma":[0.000057642723,0.00014398665,0.000056695433,0.00017354966,0.000089802925,0.00014093689,0.0000059366935,0.000115541865,0.000056298923],"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.000019707511,0.000023270237,0.0000036958033,0.000013300598,0.000028553211,0.0000016404687,0.0005545035,0.2518945,0.0017703035,0.0033009835,0.000048899503,0.7423406],"study_design_scores_gemma":[0.0000103419,0.000022192475,8.2172676e-7,0.000022374237,0.0000056211265,0.0000023711136,0.00029746417,0.6385434,0.35582563,0.004577777,0.0005564491,0.0001355233],"about_ca_topic_score_codex":0.000014215517,"about_ca_topic_score_gemma":0.000009687492,"teacher_disagreement_score":0.7422051,"about_ca_system_score_codex":0.000033724846,"about_ca_system_score_gemma":0.000012186219,"threshold_uncertainty_score":0.5871605},"labels":[],"label_agreement":null},{"id":"W2101861158","doi":"10.1016/s0004-3702(01)00130-8","title":"The challenge of poker","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":271,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Construct (python library); Deception; Artificial intelligence; Probabilistic logic; Adversary; Class (philosophy); Perfect information; Machine learning; Task (project management); Computer security; Engineering; Psychology","score_opus":0.10045159529685105,"score_gpt":0.3046174899691713,"score_spread":0.20416589467232027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101861158","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.0050372956,0.002131496,0.95009595,0.013324685,0.0015030782,0.00032337787,0.0000020650843,0.00024147249,0.027340582],"genre_scores_gemma":[0.9946568,0.00058373326,0.003991951,0.00013328223,0.00012640604,0.000020732847,1.7584514e-7,0.0000122820065,0.00047465417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780357,0.00010166343,0.00073483674,0.00042322525,0.00046356904,0.00047312555],"domain_scores_gemma":[0.9976128,0.00068518653,0.00020798658,0.0011548281,0.00023802082,0.00010118676],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005815466,0.00017894163,0.00018966464,0.0000851409,0.00036423365,0.00017281176,0.0021304889,0.00008138403,0.0002667081],"category_scores_gemma":[0.0003224119,0.00013044398,0.00013466286,0.0006495375,0.00046175774,0.00040777322,0.000309619,0.00021446202,0.0014667007],"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.0000026334767,0.000067372406,0.000010091798,0.0000023480331,0.000007747047,0.0000040020323,0.0014486111,0.00017530224,0.00042236518,0.5897261,0.00023022402,0.40790325],"study_design_scores_gemma":[0.0000060014563,0.00016506412,0.000017738814,0.000019890904,0.0000051290435,0.0000056949275,0.0005142293,0.12005359,0.16513844,0.70448196,0.009353995,0.00023825765],"about_ca_topic_score_codex":0.00007655875,"about_ca_topic_score_gemma":0.00013149853,"teacher_disagreement_score":0.9896195,"about_ca_system_score_codex":0.00002866025,"about_ca_system_score_gemma":0.00002115032,"threshold_uncertainty_score":0.9993108},"labels":[],"label_agreement":null},{"id":"W2102323131","doi":"10.1016/j.artint.2011.02.001","title":"Inconsistent heuristics in theory and practice","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":59,"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 Alberta","funders":"","keywords":"Heuristics; Heuristic; Social heuristics; Consistency (knowledge bases); Computer science; Node (physics); Reduction (mathematics); Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.10229820460159553,"score_gpt":0.3197567451938249,"score_spread":0.21745854059222938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102323131","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.008558936,0.00037649166,0.9780405,0.0005013697,0.00026197912,0.00009567418,9.1296073e-7,0.00008330468,0.012080834],"genre_scores_gemma":[0.92337763,0.000031092597,0.07599267,0.0005173261,0.00002233638,0.000005430677,4.180462e-7,0.0000049529713,0.00004811116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988185,0.00029558493,0.00026894122,0.00028158,0.00011815424,0.00021723435],"domain_scores_gemma":[0.9981576,0.0013439351,0.000079049365,0.0002826879,0.00006631765,0.00007038482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017821451,0.00009610586,0.00009933258,0.00008866416,0.000089767826,0.00007832976,0.0003430027,0.000050209004,0.00002061056],"category_scores_gemma":[0.001252772,0.000092632465,0.000018325009,0.0002600936,0.00009160527,0.000346034,0.00015156715,0.00017042382,0.000090191475],"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.000052173717,0.00007186571,0.0005853942,0.000006521458,0.000005036862,0.0000772155,0.007275033,0.000069920185,0.00010485358,0.86729825,0.0000336916,0.12442002],"study_design_scores_gemma":[0.00003123328,0.000246994,0.001196028,0.00009347242,0.000013913272,0.0001186993,0.0020959103,0.038615834,0.012681789,0.94301254,0.0015040447,0.00038953955],"about_ca_topic_score_codex":0.00019642763,"about_ca_topic_score_gemma":0.00004671147,"teacher_disagreement_score":0.9148187,"about_ca_system_score_codex":0.000016219694,"about_ca_system_score_gemma":0.000047305788,"threshold_uncertainty_score":0.37774423},"labels":[],"label_agreement":null},{"id":"W2103049742","doi":"10.1016/j.artint.2013.01.001","title":"Predicting the size of IDA*ʼs search tree","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"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 Regina; University of Alberta","funders":"","keywords":"Preprocessor; Computation; Truncation (statistics); Computer science; Tree (set theory); Line (geometry); Algorithm; Chen; Mathematics; Artificial intelligence; Machine learning; Combinatorics","score_opus":0.05447862698732074,"score_gpt":0.2857127171165383,"score_spread":0.23123409012921753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103049742","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.1001547,0.00006788669,0.88365895,0.004689931,0.0006079128,0.0004763854,0.0000040886885,0.00014469388,0.010195466],"genre_scores_gemma":[0.9896098,0.0000158675,0.009611074,0.00018255063,0.000114021466,0.000018599401,0.0000010525121,0.0000054088773,0.00044167732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987516,0.00006351127,0.00031167388,0.00026461584,0.00033344317,0.00027514758],"domain_scores_gemma":[0.9987357,0.0003819808,0.00007100408,0.00064831786,0.00011231232,0.00005066859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052995345,0.00009209912,0.000100047575,0.00004512056,0.00014332701,0.00027045494,0.0016480627,0.00002578655,0.00016554799],"category_scores_gemma":[0.00017618701,0.00006395096,0.00005074226,0.0005150905,0.00013343358,0.00073410367,0.0005535326,0.00012409149,0.0006000915],"study_design_candidate":"design_other","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.0000017982526,0.000057337427,0.00051216333,0.000010009979,0.00001450594,0.0000024645706,0.0010158673,0.00017535921,0.0019464463,0.18452744,0.0006756963,0.8110609],"study_design_scores_gemma":[0.000023226454,0.00014733494,0.005149518,0.00003441429,0.000009845292,0.000003048064,0.0016155228,0.7817727,0.11529764,0.094488524,0.0012189226,0.00023931969],"about_ca_topic_score_codex":0.0005860164,"about_ca_topic_score_gemma":0.00004402034,"teacher_disagreement_score":0.889455,"about_ca_system_score_codex":0.00000978611,"about_ca_system_score_gemma":0.000023347096,"threshold_uncertainty_score":0.77131623},"labels":[],"label_agreement":null},{"id":"W2104290979","doi":"10.1016/s0004-3702(99)00099-5","title":"Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":48,"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":"Heuristics; Computer science; Heuristic; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Exploit; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Schedule","score_opus":0.019293890705295347,"score_gpt":0.28413377684716695,"score_spread":0.2648398861418716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104290979","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.024906587,0.000025436564,0.97264236,0.00074792013,0.0001620928,0.00033340487,0.00004018288,0.00034733184,0.00079465774],"genre_scores_gemma":[0.68760324,0.000021410682,0.31202632,0.00017163712,0.000020133068,0.000014048683,0.000021161584,0.000007457021,0.00011459013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984469,0.000054696913,0.00046651423,0.000504991,0.00021570372,0.00031123593],"domain_scores_gemma":[0.9989468,0.00022260584,0.00011193,0.00036983317,0.0002311292,0.00011769033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018123246,0.00017825165,0.00022732555,0.00024682228,0.0002606487,0.00027783032,0.00040158816,0.00010206615,0.0016760556],"category_scores_gemma":[0.00017989875,0.00018395335,0.00015869895,0.0015174911,0.00011979465,0.00027135474,0.000032096246,0.00013990399,0.000093734816],"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.000021837128,0.00003955368,0.0001516773,0.000009861627,0.00013957996,0.000004337381,0.0006048332,0.17982155,0.0007817317,0.071997896,0.000012591067,0.74641454],"study_design_scores_gemma":[0.000023565475,0.00004714685,0.00019069224,0.000012515175,0.000092762675,0.000010861493,0.000108519314,0.95655006,0.0041041495,0.03838088,0.00025543588,0.00022342245],"about_ca_topic_score_codex":0.00006233496,"about_ca_topic_score_gemma":0.0003906713,"teacher_disagreement_score":0.7767285,"about_ca_system_score_codex":0.000062428866,"about_ca_system_score_gemma":0.00012764332,"threshold_uncertainty_score":0.9992365},"labels":[],"label_agreement":null},{"id":"W2105786826","doi":"10.1016/j.artint.2009.06.005","title":"Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Satisfiability; Mathematics; Combinatorics; Discrete mathematics; Boolean satisfiability problem; Statistics","score_opus":0.07382149957098402,"score_gpt":0.3191596025939583,"score_spread":0.2453381030229743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105786826","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.071742125,0.000067401124,0.9219006,0.004927071,0.0004355488,0.00031789747,0.000019739742,0.00020198988,0.00038766308],"genre_scores_gemma":[0.9212042,0.00006361213,0.07836339,0.0002597341,0.00006303961,0.000005462574,0.00001919678,0.0000038123494,0.000017545963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982305,0.0001559461,0.00048156278,0.0006872198,0.00021681453,0.00022791736],"domain_scores_gemma":[0.998171,0.00036829372,0.00009953896,0.0011329664,0.00010650556,0.00012175069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650838,0.00014860957,0.00018948587,0.000090243026,0.00021983145,0.00027973767,0.0006066258,0.000078135534,0.00015611638],"category_scores_gemma":[0.0005412989,0.00014199762,0.000039478662,0.0004085093,0.00017285901,0.001082694,0.00015543039,0.00017466256,0.000043531356],"study_design_candidate":"design_other","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.000027300692,0.00012226663,0.0005822358,0.0000033618837,0.000007697235,0.0000019800389,0.0003007279,0.00014002125,0.0007904887,0.0361278,0.00013416234,0.96176195],"study_design_scores_gemma":[0.00012437598,0.00015173836,0.013415316,0.00001628736,0.000021666554,0.000047828304,0.00016465828,0.7225596,0.012297113,0.24956746,0.0012323086,0.00040169543],"about_ca_topic_score_codex":0.000048665526,"about_ca_topic_score_gemma":0.00009223941,"teacher_disagreement_score":0.9613603,"about_ca_system_score_codex":0.000030348596,"about_ca_system_score_gemma":0.000065219756,"threshold_uncertainty_score":0.57904947},"labels":[],"label_agreement":null},{"id":"W2107397894","doi":"10.1016/s0004-3702(01)00085-6","title":"Partial order bounding: A new approach to evaluation in game tree search","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"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 Alberta","funders":"","keywords":"Bounding overwatch; Order (exchange); Computer science; Tree (set theory); Artificial intelligence; Mathematics; Combinatorics; Economics","score_opus":0.24262151392340375,"score_gpt":0.3917934106083933,"score_spread":0.14917189668498954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107397894","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.07640362,0.00007343533,0.90482765,0.002663438,0.000722355,0.0009356015,7.1428815e-7,0.00018613931,0.014187047],"genre_scores_gemma":[0.9584218,0.000023974131,0.039812878,0.0005221638,0.00041776703,0.00011902647,0.000004351558,0.000027581551,0.0006504344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952352,0.0003450034,0.000955636,0.0012073811,0.0012431759,0.0010135727],"domain_scores_gemma":[0.9976534,0.00027236345,0.00010531575,0.001114461,0.00041575756,0.00043868963],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002484362,0.00032685738,0.00033925744,0.0005933204,0.00017579287,0.0006091675,0.0019279933,0.00016501069,0.00035172392],"category_scores_gemma":[0.0011338352,0.00033981452,0.00010197201,0.0038188505,0.0001461385,0.0009236894,0.0004234566,0.00039685477,0.0033765459],"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.000065602406,0.0003402676,0.0006673586,0.0000044062417,0.000009732432,0.000019621082,0.009137491,0.05758871,0.0016936448,0.19598454,0.0003392833,0.73414934],"study_design_scores_gemma":[0.00003817476,0.00013669448,0.00036444727,0.0000347285,0.000009533509,0.000025220248,0.0010603553,0.84595156,0.04950773,0.098052055,0.0043383273,0.0004811998],"about_ca_topic_score_codex":0.0014886383,"about_ca_topic_score_gemma":0.0014403787,"teacher_disagreement_score":0.8820182,"about_ca_system_score_codex":0.00032361588,"about_ca_system_score_gemma":0.0005882401,"threshold_uncertainty_score":0.9999054},"labels":[],"label_agreement":null},{"id":"W2109409153","doi":"10.1016/j.artint.2007.04.010","title":"The Carneades model of argument and burden of proof","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":395,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Argumentation theory; Burden of proof; Premise; Argument (complex analysis); Dialectic; Computer science; Persuasion; Proof of concept; Epistemology; Psychology; Social psychology; Law; Medicine; Philosophy; Political science","score_opus":0.06968742521884552,"score_gpt":0.3039494755120507,"score_spread":0.23426205029320518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109409153","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.17999607,0.00020093456,0.81906915,0.00018913181,0.00011500589,0.00015103882,8.104669e-7,0.000009659434,0.00026819872],"genre_scores_gemma":[0.9955726,0.000026852953,0.004287656,0.000008768744,0.000029329804,0.0000030350836,1.7321082e-7,0.000002530829,0.00006905197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999105,0.000024311208,0.00038634616,0.00014570254,0.00020256815,0.00013607243],"domain_scores_gemma":[0.99931353,0.00013969456,0.0001591517,0.0002515051,0.000101982594,0.000034108656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008135465,0.000059280403,0.000093430855,0.00003911876,0.000077764125,0.00002748123,0.00029884544,0.000029235336,0.0000013939392],"category_scores_gemma":[0.000050312716,0.000041652773,0.000028590206,0.00013611412,0.00008650367,0.00011134872,0.00007882169,0.000040737865,0.0000030205238],"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.000018906077,0.00005367508,0.00024493207,0.00003768459,0.00001530437,7.892511e-7,0.008994219,0.013797151,0.08677007,0.564131,0.000020988147,0.32591525],"study_design_scores_gemma":[0.000007090296,0.000032758846,0.00009463742,0.0000148373365,0.000002024855,6.169807e-7,0.0003040885,0.5126845,0.47344828,0.013330747,0.00004169803,0.00003870458],"about_ca_topic_score_codex":0.00022338523,"about_ca_topic_score_gemma":0.0001226251,"teacher_disagreement_score":0.8155765,"about_ca_system_score_codex":0.000010698075,"about_ca_system_score_gemma":0.000022947152,"threshold_uncertainty_score":0.16985507},"labels":[],"label_agreement":null},{"id":"W2114492537","doi":"10.1016/j.artint.2009.06.001","title":"Probabilistic models for melodic prediction","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Music and Audio Processing","field":"Computer Science","cited_by":17,"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é de Montréal","funders":"","keywords":"Chord (peer-to-peer); Melody; Probabilistic logic; Computer science; Polyphony; Statistical model; Hidden Markov model; Artificial intelligence; Metric (unit); Mathematics; Speech recognition; Machine learning","score_opus":0.08764861002211706,"score_gpt":0.29917862917698174,"score_spread":0.2115300191548647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114492537","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.0019512,0.000079245416,0.992952,0.0023219783,0.00032905952,0.00025699625,0.0000023948314,0.00021047542,0.0018966836],"genre_scores_gemma":[0.9568339,0.000006041854,0.04193864,0.00094396924,0.00016674661,0.00002471734,0.0000022152926,0.000004408728,0.00007937255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989137,0.000016535132,0.00028527976,0.0003567501,0.00016905613,0.00025867185],"domain_scores_gemma":[0.99938244,0.00006881943,0.000070308546,0.00028429466,0.00012642586,0.00006771805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002727596,0.00010315377,0.0001077066,0.00005799709,0.00020371014,0.00018457035,0.0004668174,0.000049167,0.000008281081],"category_scores_gemma":[0.000092885086,0.00009560627,0.00005384795,0.00028350102,0.00004152468,0.0006353601,0.000033558455,0.00007130333,0.000033635275],"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.0000056109443,0.00004250249,8.036835e-7,0.0000068861054,0.0000015434415,7.634454e-7,0.00042668162,0.009574861,0.0007373754,0.52256435,0.0002730931,0.46636555],"study_design_scores_gemma":[0.000006742137,0.00007282402,0.0000080471345,0.0000127721905,0.000002486291,0.0000020212226,0.000012629632,0.48606634,0.01123044,0.5022722,0.0002520858,0.00006139195],"about_ca_topic_score_codex":0.000004500206,"about_ca_topic_score_gemma":0.0000034551315,"teacher_disagreement_score":0.9548827,"about_ca_system_score_codex":0.000029679793,"about_ca_system_score_gemma":0.00006645711,"threshold_uncertainty_score":0.3898711},"labels":[],"label_agreement":null},{"id":"W2114629047","doi":"10.1016/j.artint.2006.09.002","title":"Maximizing over multiple pattern databases speeds up heuristic search","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; National Science Foundation","keywords":"Heuristic; Database; Computer science; Data mining; Table (database); Artificial intelligence","score_opus":0.09349248129293128,"score_gpt":0.3108650183312667,"score_spread":0.2173725370383354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114629047","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.06681743,0.0001775827,0.93084854,0.0003665076,0.00069077156,0.0001314962,0.000020900678,0.00025055255,0.00069620885],"genre_scores_gemma":[0.98307174,0.000007372309,0.016075142,0.00023677012,0.00027626596,0.0000074379846,0.00003375181,0.000017433746,0.00027410674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787503,0.00011036397,0.00044381397,0.0005764015,0.00041625477,0.00057812105],"domain_scores_gemma":[0.99841034,0.0006142697,0.00008986646,0.0006774967,0.0001001783,0.00010783459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054378837,0.00020834433,0.0001822502,0.0001521033,0.00033062734,0.0003225168,0.00085169135,0.00005459379,0.00012429935],"category_scores_gemma":[0.00012857128,0.0002077641,0.000073450836,0.0004991978,0.00009208771,0.0004784417,0.00031372267,0.0002811894,0.0006454432],"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.000055785018,0.00038432647,0.07416477,0.00009888349,0.000039108785,0.00039246952,0.002363565,0.054388955,0.010895144,0.1354475,0.0062289853,0.7155405],"study_design_scores_gemma":[0.000051969724,0.000077392295,0.0027725159,0.00012135147,0.000009819516,0.000024432538,0.00012741597,0.8823533,0.09834344,0.012298372,0.0032967944,0.00052321766],"about_ca_topic_score_codex":0.0044579683,"about_ca_topic_score_gemma":0.00042143173,"teacher_disagreement_score":0.9162543,"about_ca_system_score_codex":0.000043403183,"about_ca_system_score_gemma":0.00007345706,"threshold_uncertainty_score":0.8472374},"labels":[],"label_agreement":null},{"id":"W2127944251","doi":"10.1016/j.artint.2011.07.002","title":"Algorithms and mechanisms for procuring services with uncertain durations using redundancy","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":23,"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 Waterloo","funders":"Economic and Social Research Council; Engineering and Physical Sciences Research Council","keywords":"Computer science; Service provider; Payment; Redundancy (engineering); Incentive compatibility; Distributed computing; Incentive; Heuristic; Service (business); Artificial intelligence","score_opus":0.3575028466753127,"score_gpt":0.4208367829527739,"score_spread":0.0633339362774612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127944251","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.05680192,0.000019467769,0.94196504,0.00017163114,0.00009604098,0.00036156594,0.000012197089,0.000042249954,0.0005298951],"genre_scores_gemma":[0.9062411,0.0000020158336,0.09336501,0.00006757933,0.000057751422,0.00007665428,0.0000017366758,0.000009348237,0.00017879148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987483,0.000042251744,0.0003960749,0.0003895574,0.00024726076,0.00017652634],"domain_scores_gemma":[0.99893856,0.000246763,0.00017591278,0.00027886502,0.00028097155,0.000078901765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072916766,0.00010400007,0.00011944602,0.00010214925,0.0005676704,0.00015124079,0.00028595404,0.0000436795,0.00015492532],"category_scores_gemma":[0.000119136515,0.00007751494,0.000032723183,0.00045001067,0.00014432077,0.00038745845,0.000035783978,0.000059652044,0.000052662075],"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.000061020917,0.000059015467,0.00007010145,0.0000075179023,0.0000095108535,0.0000010251098,0.0035583647,0.00053022924,0.004796996,0.9269001,0.0000041401227,0.06400198],"study_design_scores_gemma":[0.00001383761,0.00007209399,0.000049370756,0.000016094533,0.000012670676,0.000013365156,0.008188298,0.049127188,0.11186914,0.8303517,0.00017596237,0.00011023958],"about_ca_topic_score_codex":0.00009569737,"about_ca_topic_score_gemma":0.00017772727,"teacher_disagreement_score":0.8494392,"about_ca_system_score_codex":0.0000124047065,"about_ca_system_score_gemma":0.000038959606,"threshold_uncertainty_score":0.4366119},"labels":[],"label_agreement":null},{"id":"W2134275439","doi":"10.1016/j.artint.2010.04.003","title":"Iterated belief change in the situation calculus","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Belief revision; Situation calculus; Introspection; Computer science; Iterated function; Formalism (music); Action (physics); Artificial intelligence; Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology","score_opus":0.07049695495656967,"score_gpt":0.31678408271310493,"score_spread":0.24628712775653527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134275439","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.44268516,0.00017107042,0.5381221,0.0047030207,0.0026880365,0.0006675034,0.0000019894546,0.0002274638,0.010733656],"genre_scores_gemma":[0.99767697,0.000009787212,0.0011854839,0.0007265732,0.00029864092,0.000049738825,0.000002783222,0.000004664841,0.00004536713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988641,0.00009248611,0.00024553252,0.00030436847,0.00020936172,0.0002841469],"domain_scores_gemma":[0.9991615,0.00015807393,0.00006136795,0.00046428962,0.00010455638,0.00005024394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069186947,0.0001146697,0.0000976463,0.00008918031,0.00015379561,0.00025071984,0.0009813224,0.00008206977,0.00006184946],"category_scores_gemma":[0.00020668715,0.00008036628,0.000042714742,0.0007529966,0.00007322735,0.00042216192,0.00010566778,0.00029919134,0.0006185859],"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.0000035184921,0.0001227938,0.0005311249,0.000002535634,0.0000018367408,0.000018385412,0.017077604,0.0000126434,0.003563885,0.6974657,0.00006758366,0.28113237],"study_design_scores_gemma":[0.00007535872,0.0002841499,0.021512302,0.000038290134,0.00001056482,0.000060671387,0.0007395741,0.6804764,0.08604488,0.20070465,0.009349379,0.00070375233],"about_ca_topic_score_codex":0.0004043483,"about_ca_topic_score_gemma":0.0036247068,"teacher_disagreement_score":0.6804638,"about_ca_system_score_codex":0.0000152567945,"about_ca_system_score_gemma":0.000036692443,"threshold_uncertainty_score":0.79508764},"labels":[],"label_agreement":null},{"id":"W2139771194","doi":"10.1016/s0004-3702(99)00087-9","title":"Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Circumscription; Axiom; Successor cardinal; State (computer science); Mathematics; Computer science; Frame problem; Class (philosophy); Set (abstract data type); Frame (networking); Theoretical computer science; Artificial intelligence; Algorithm; Programming language","score_opus":0.044013511608110345,"score_gpt":0.2909212580944951,"score_spread":0.24690774648638475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139771194","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.032583386,0.00008305204,0.95127255,0.003121957,0.00021440435,0.00046639977,0.000004057515,0.00017329067,0.012080936],"genre_scores_gemma":[0.9809843,0.00006845891,0.017908096,0.00027942317,0.0000856669,0.000056407956,0.0000025222434,0.0000070389324,0.00060813874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866164,0.000085762185,0.0003446454,0.00040553056,0.00017659835,0.0003258312],"domain_scores_gemma":[0.9991424,0.00015583834,0.00007906124,0.0003787277,0.00013120679,0.000112736874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060256897,0.00014423169,0.00011967769,0.00008240565,0.00051796756,0.00036415167,0.000519487,0.000048852144,0.0001358103],"category_scores_gemma":[0.00013190352,0.000104207356,0.000045727553,0.00063444907,0.00019204328,0.00043933265,0.000089691865,0.00018966466,0.00074023724],"study_design_candidate":"design_other","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.000006379736,0.00004010528,0.000020137817,0.0000030368426,0.000005934851,8.9986327e-7,0.0053598415,0.00021241956,0.0011747429,0.1706526,0.00014039458,0.8223835],"study_design_scores_gemma":[0.00008465033,0.0005461776,0.0014478897,0.0001416946,0.000030765757,0.00010105763,0.0022864528,0.5476993,0.06418791,0.3396098,0.042988826,0.00087547686],"about_ca_topic_score_codex":0.00015756734,"about_ca_topic_score_gemma":0.00046510567,"teacher_disagreement_score":0.94840086,"about_ca_system_score_codex":0.000057224253,"about_ca_system_score_gemma":0.00007654669,"threshold_uncertainty_score":0.9514499},"labels":[],"label_agreement":null},{"id":"W2141088850","doi":"10.1016/s0004-3702(99)00071-5","title":"Using temporal logics to express search control knowledge for planning","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":556,"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é de Sherbrooke; University of Toronto","funders":"","keywords":"Computer science; Forward chaining; Domain (mathematical analysis); Domain knowledge; Planner; Automated planning and scheduling; Plan (archaeology); Control (management); Artificial intelligence; Range (aeronautics); Modularity (biology); Theoretical computer science; Machine learning; Expert system; Mathematics; Engineering","score_opus":0.21885424557427835,"score_gpt":0.3932797970025497,"score_spread":0.17442555142827137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141088850","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.044086386,0.0001876956,0.95358497,0.00038097892,0.0002922266,0.00039635017,0.000011286643,0.0001726328,0.0008874675],"genre_scores_gemma":[0.8532366,0.0000012689711,0.14590427,0.00036549298,0.00020873954,0.000025982827,0.0000032801734,0.000014021862,0.00024030307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998219,0.0001034469,0.0003861293,0.00051242934,0.0001989091,0.0005800568],"domain_scores_gemma":[0.9987136,0.0004889029,0.000048414448,0.00040497127,0.00015042727,0.00019368505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800703,0.00018269512,0.00021204617,0.00012416391,0.00042690255,0.00028659264,0.0008665408,0.00009039648,0.00007563254],"category_scores_gemma":[0.00008396434,0.00018070059,0.000079991136,0.00045088408,0.000050682702,0.0002937247,0.000081634804,0.00018014936,0.00026767305],"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.00016289743,0.00012772881,0.0010375568,0.000036958416,0.000023046136,0.000028195258,0.008645399,0.56218076,0.0055048154,0.03033849,0.00071573857,0.3911984],"study_design_scores_gemma":[0.00004758646,0.00020841962,0.00002459216,0.00010549211,0.0000066648513,0.000008261299,0.00014975305,0.9616513,0.022479828,0.009198193,0.005814473,0.00030543213],"about_ca_topic_score_codex":0.000116953495,"about_ca_topic_score_gemma":0.0000102455615,"teacher_disagreement_score":0.8091503,"about_ca_system_score_codex":0.00004790725,"about_ca_system_score_gemma":0.00012076962,"threshold_uncertainty_score":0.73687565},"labels":[],"label_agreement":null},{"id":"W2142852830","doi":"10.1016/j.artint.2010.08.005","title":"Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":29,"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 British Columbia","funders":"","keywords":"Combinatorial auction; Common value auction; Mathematical economics; Vickrey–Clarke–Groves auction; Counterintuitive; Impossibility; Revenue; Monotonic function; Set (abstract data type); Submodular set function; Mechanism design; Computer science; Microeconomics; Economics; Mathematical optimization; Mathematics; Auction theory; Finance","score_opus":0.13125692860061683,"score_gpt":0.4222935611405288,"score_spread":0.29103663253991197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142852830","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.92224205,0.000008322636,0.0690769,0.00086847437,0.0032201782,0.0003433557,0.000043764543,0.00004083411,0.0041561],"genre_scores_gemma":[0.99856126,0.0000050126832,0.00040466868,0.000049079776,0.0003260054,0.00006426491,0.000001975502,0.000008291091,0.00057946326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791485,0.00014579453,0.00080118387,0.0004730115,0.00040199098,0.00026315707],"domain_scores_gemma":[0.99789065,0.0009403349,0.00019758583,0.000661722,0.00019282113,0.000116855685],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019318965,0.0001263836,0.00020196954,0.00018683074,0.00033329747,0.00018721212,0.0007041421,0.00013182886,0.0009427951],"category_scores_gemma":[0.0023978895,0.000113878414,0.00008603123,0.00091833255,0.00038417292,0.00025075278,0.000079967125,0.00045591066,0.002231362],"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.00004460392,0.00018769864,0.00044534297,8.05858e-7,0.000001946675,0.0000065985723,0.00032709583,0.0004599421,0.016297841,0.8572156,0.0002358648,0.124776684],"study_design_scores_gemma":[0.000026623373,0.000037449423,0.001194139,0.0000033382669,0.000004180167,0.000012857387,0.00053449586,0.0050731148,0.06760227,0.9159394,0.009435788,0.00013632803],"about_ca_topic_score_codex":0.0001770507,"about_ca_topic_score_gemma":0.0017993693,"teacher_disagreement_score":0.12464036,"about_ca_system_score_codex":0.000021572334,"about_ca_system_score_gemma":0.00010107398,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W2145996207","doi":"10.1016/j.artint.2006.02.003","title":"Constraint-based optimization and utility elicitation using the minimax decision criterion","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":151,"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 Alberta; University of Waterloo; University of Toronto","funders":"","keywords":"Regret; Minimax; Computer science; Mathematical optimization; Preference elicitation; Exploit; Set (abstract data type); Constraint (computer-aided design); Function (biology); Preference; Mathematics; Machine learning","score_opus":0.04697374374933979,"score_gpt":0.3001038880978434,"score_spread":0.2531301443485036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145996207","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.042110022,0.000037505015,0.95621413,0.0008598503,0.0002727958,0.00019594058,0.0000027125275,0.000088736175,0.00021831623],"genre_scores_gemma":[0.7805293,0.0000058651704,0.21923386,0.00017845347,0.000035223522,0.000004094633,0.0000053619215,0.0000043887476,0.0000034587463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988384,0.0000928186,0.00037392476,0.0003126227,0.00021723886,0.00016496574],"domain_scores_gemma":[0.99910474,0.0002943814,0.000117937474,0.0002618068,0.00017982296,0.000041329386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037997405,0.00011637843,0.000091854396,0.0001039604,0.00034948313,0.00030230984,0.00019439757,0.00006035927,0.00007635585],"category_scores_gemma":[0.00012723547,0.00009785039,0.00003791524,0.0004160394,0.00022580697,0.00042858033,0.000046762078,0.00008384424,0.000008499415],"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.00001635119,0.0000437549,0.0006868857,0.00000486298,0.000002534964,0.000002068257,0.00020644267,0.45605922,0.0021990726,0.058560852,0.0000254329,0.48219252],"study_design_scores_gemma":[0.000027636257,0.000021228207,0.00094868033,0.000016350426,0.000005651892,0.000009067332,0.00012735721,0.97421926,0.011221835,0.013236078,0.000057807374,0.0001090174],"about_ca_topic_score_codex":0.00015964109,"about_ca_topic_score_gemma":0.00010182146,"teacher_disagreement_score":0.7384193,"about_ca_system_score_codex":0.000034720822,"about_ca_system_score_gemma":0.00006944623,"threshold_uncertainty_score":0.3990223},"labels":[],"label_agreement":null},{"id":"W2155364832","doi":"10.1016/j.artint.2009.11.013","title":"Cortical hierarchies, sleep, and the extraction of knowledge from memory","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":48,"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 Lethbridge","funders":"","keywords":"Computer science; Sleep (system call); Artificial intelligence; Artificial neural network; Adaptive memory; Neuroscience; Psychology; Cognition","score_opus":0.13040113097937495,"score_gpt":0.3550060960699627,"score_spread":0.22460496509058775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155364832","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.98411673,0.00013990907,0.011019071,0.0009452972,0.0005133318,0.00023873479,0.00000645506,0.000044433982,0.0029760394],"genre_scores_gemma":[0.9989886,0.00008525273,0.00018053765,0.0005050717,0.00012328464,0.000005458961,5.922405e-7,0.0000053275517,0.000105862935],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987118,0.0002999225,0.00034234326,0.00030206263,0.00016646866,0.00017735969],"domain_scores_gemma":[0.9981471,0.0014234129,0.0000911794,0.00024272184,0.00002630883,0.00006932044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003016745,0.00010942282,0.00017108531,0.00004351132,0.00020578566,0.000033526125,0.00022359508,0.000051368792,0.0001718887],"category_scores_gemma":[0.00093158294,0.00007501807,0.000052574404,0.00020655997,0.00043464292,0.00014071817,0.00004116561,0.00024073545,0.00009690219],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0002612083,0.000073161675,0.0000016658503,0.0000020421537,0.0000012019653,0.000005727362,0.0007029834,0.000011058619,0.7182513,0.15071328,0.00001104887,0.12996535],"study_design_scores_gemma":[0.000039786246,0.00009880118,0.00011995836,0.000009456405,0.000010337527,0.000010100999,0.00013283463,0.008284802,0.8059191,0.18525663,0.00004937033,0.000068835325],"about_ca_topic_score_codex":0.000017641318,"about_ca_topic_score_gemma":0.000018083078,"teacher_disagreement_score":0.1298965,"about_ca_system_score_codex":0.0000073227357,"about_ca_system_score_gemma":0.000014876253,"threshold_uncertainty_score":0.30591482},"labels":[],"label_agreement":null},{"id":"W2156474728","doi":"10.1016/j.artint.2014.08.006","title":"Belief revision in Horn theories","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Belief revision; French horn; Horn clause; Iterated function; Mathematics; Representation (politics); Inference; Relevance (law); Logic programming; Algorithm; Computer science; Algebra over a field; Artificial intelligence; Pure mathematics","score_opus":0.028501850449163646,"score_gpt":0.2806735463121939,"score_spread":0.25217169586303023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156474728","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.018947784,0.00023422511,0.9564272,0.0006160294,0.00070931064,0.00011653647,3.0748086e-7,0.00014477395,0.022803813],"genre_scores_gemma":[0.99411297,0.000052000287,0.0052085975,0.00023719807,0.00017683205,0.000006096563,7.37753e-7,0.000006620972,0.0001989654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.00013574184,0.00032672417,0.0004107076,0.00018667971,0.00032545283],"domain_scores_gemma":[0.9989839,0.00026480464,0.00006908738,0.0005206353,0.000083103914,0.00007842118],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008671384,0.0001348304,0.00017103543,0.000104836465,0.0001269335,0.0001726552,0.0008524597,0.00007065123,0.00004934217],"category_scores_gemma":[0.0005275026,0.00011291155,0.000056961788,0.0005405787,0.00010129307,0.00032891036,0.00022929908,0.00015765302,0.0009806454],"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.0000032931428,0.0000369721,0.00021988327,0.0000036104793,9.668336e-7,0.0000026642326,0.0009722889,0.000053834152,0.00021033277,0.6649149,0.000056973215,0.3335243],"study_design_scores_gemma":[0.000019852572,0.00015915823,0.00059621764,0.000053479136,0.000002229203,0.0000056813165,0.00013325366,0.06947108,0.041763514,0.8769263,0.01060994,0.00025930224],"about_ca_topic_score_codex":0.00006840188,"about_ca_topic_score_gemma":0.00018241638,"teacher_disagreement_score":0.9751652,"about_ca_system_score_codex":0.000029014333,"about_ca_system_score_gemma":0.00003359112,"threshold_uncertainty_score":0.9997972},"labels":[],"label_agreement":null},{"id":"W2158118484","doi":"10.1016/j.artint.2011.08.001","title":"Learning heuristic functions for large state spaces","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":77,"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 Regina; University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Bootstrapping (finance); Computer science; Process (computing); Mathematical optimization; Sequence (biology); Hyper-heuristic; Null-move heuristic; Set (abstract data type); State (computer science); Consistent heuristic; Algorithm; Mathematics; Incremental heuristic search; Artificial intelligence; Machine learning; Search algorithm; Beam search","score_opus":0.08500217590443197,"score_gpt":0.2862445155951895,"score_spread":0.2012423396907575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158118484","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.00969482,0.000085451866,0.98748136,0.0001876958,0.00056011166,0.00014816051,0.000007509776,0.00027413105,0.0015607903],"genre_scores_gemma":[0.9624804,0.0000065479817,0.03621656,0.0001081201,0.00006791179,0.000030808667,0.000005762988,0.000011326688,0.0010725227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878675,0.000061015206,0.0002605595,0.00034998523,0.00012865533,0.00041304796],"domain_scores_gemma":[0.99912727,0.0002916688,0.0000999226,0.00026869596,0.00011927913,0.000093159535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558223,0.0001252299,0.00011847804,0.00009099769,0.00046506233,0.00015233514,0.00044420778,0.000043353335,0.00007660942],"category_scores_gemma":[0.00023236492,0.00012278165,0.000065014894,0.00029435725,0.000033379114,0.0002852925,0.00009302125,0.00018429621,0.00041776724],"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.00010492836,0.0003061695,0.0051410357,0.00006629466,0.0000613257,0.00003777775,0.028798481,0.0085067125,0.0010113012,0.57609993,0.0019869953,0.37787905],"study_design_scores_gemma":[0.000058706246,0.0009328905,0.00042311518,0.000083664214,0.000024448134,0.00001288659,0.0014609527,0.69603735,0.0345079,0.24151635,0.02428939,0.00065236783],"about_ca_topic_score_codex":0.000109471934,"about_ca_topic_score_gemma":0.00006243891,"teacher_disagreement_score":0.9527856,"about_ca_system_score_codex":0.000016194612,"about_ca_system_score_gemma":0.000054138854,"threshold_uncertainty_score":0.5369692},"labels":[],"label_agreement":null},{"id":"W2161241946","doi":"10.1016/j.artint.2010.06.002","title":"The computational complexity of avoiding spurious states in state space abstraction","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious relationship; Abstraction; State space; Property (philosophy); Computer science; Path (computing); Heuristic; State (computer science); Space (punctuation); Computational complexity theory; Theoretical computer science; Algorithm; Mathematics; Programming language; Artificial intelligence","score_opus":0.054278770289771516,"score_gpt":0.30044245351503396,"score_spread":0.24616368322526244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161241946","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.39548746,0.000032105105,0.6020415,0.0016202199,0.0004530069,0.00009353962,0.000004198391,0.000048661444,0.00021933399],"genre_scores_gemma":[0.9792128,0.000009612818,0.02067797,0.000038985927,0.000028201677,0.0000038698745,0.000004059436,0.000004843062,0.0000196076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988058,0.00008967411,0.00039597362,0.00022454285,0.00023496932,0.00024900725],"domain_scores_gemma":[0.9983435,0.0010647599,0.00017527037,0.00024782392,0.00011964788,0.00004895405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010979495,0.00009688202,0.00010764775,0.00007778637,0.00034814252,0.00015288964,0.000492522,0.00003786603,0.000011308587],"category_scores_gemma":[0.00016876613,0.000081018086,0.00003459114,0.00032897462,0.00023993691,0.0002482974,0.000079044454,0.0004454908,0.000049079255],"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.000036456364,0.00009380145,0.002174189,0.000016146507,0.000010219586,0.000012634385,0.0050995685,0.26066157,0.0074898084,0.5944145,0.00009806975,0.12989303],"study_design_scores_gemma":[0.000012940963,0.000032549797,0.0020968972,0.00001706712,9.4779347e-7,0.00000505317,0.00017394942,0.49980432,0.033197884,0.4643337,0.00023390414,0.0000907641],"about_ca_topic_score_codex":0.0008078025,"about_ca_topic_score_gemma":0.0018731402,"teacher_disagreement_score":0.5837254,"about_ca_system_score_codex":0.000019121046,"about_ca_system_score_gemma":0.00008453397,"threshold_uncertainty_score":0.33038217},"labels":[],"label_agreement":null},{"id":"W2170052858","doi":"10.1016/s0004-3702(00)00034-5","title":"Applying MDL to learn best model granularity","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; European Commission; University of Waterloo; York University; Office of Naval Research; Harvard University","keywords":"Minimum description length; Algorithm; Computer science; Granularity; Model selection; Artificial intelligence; Set (abstract data type); Mathematics; Pattern recognition (psychology)","score_opus":0.08122447488248963,"score_gpt":0.31134140498765334,"score_spread":0.2301169301051637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170052858","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.042038668,0.000050935112,0.95103216,0.0013022484,0.0003552495,0.0006442316,0.000004654496,0.00036046596,0.004211409],"genre_scores_gemma":[0.83633095,0.000015245022,0.16174592,0.0010030376,0.00017726682,0.00014068985,0.000002087207,0.000018663477,0.0005661395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722916,0.00009696973,0.00054874533,0.000958233,0.00051600445,0.00065090496],"domain_scores_gemma":[0.9982058,0.00015567994,0.000053590877,0.001125386,0.00015851458,0.00030102648],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006331649,0.00026568444,0.00027413177,0.00013349914,0.00034241928,0.00037944972,0.0018128833,0.0001059929,0.0002598397],"category_scores_gemma":[0.000117462856,0.00027589506,0.00013092684,0.0010130671,0.000115568124,0.00048643097,0.00043872406,0.0003181393,0.003788523],"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.000009800346,0.0001845135,0.000046560923,0.0000051698553,0.0000042210067,0.000011646859,0.0008210417,0.14134006,0.00053015683,0.0448814,0.000064974534,0.81210047],"study_design_scores_gemma":[0.000011953037,0.00009973093,0.000033417436,0.000011341008,0.0000041861176,0.0000095897085,0.00004350496,0.8015871,0.008968265,0.18615912,0.002769652,0.00030212154],"about_ca_topic_score_codex":0.00038418622,"about_ca_topic_score_gemma":0.00018621545,"teacher_disagreement_score":0.81179833,"about_ca_system_score_codex":0.000093080336,"about_ca_system_score_gemma":0.0000934182,"threshold_uncertainty_score":0.9999693},"labels":[],"label_agreement":null},{"id":"W2172181603","doi":"10.1016/j.artint.2007.02.002","title":"Inductive situation calculus","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Calculus (dental); Situation calculus; Rotation formalisms in three dimensions; Inductive logic programming; Many-valued logic; Monotone polygon; Inductive reasoning; Representation (politics); Algebra over a field; Computer science; Artificial intelligence; Pure mathematics; Description logic","score_opus":0.05741505432868664,"score_gpt":0.3118936394500684,"score_spread":0.2544785851213818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172181603","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.040344942,0.00007025765,0.93933564,0.00024731402,0.00088929146,0.00011936577,3.2905044e-7,0.00016664555,0.018826237],"genre_scores_gemma":[0.9895404,0.0000062730637,0.009778916,0.00017267239,0.00026525118,0.0000046442137,0.0000011584583,0.000006083215,0.00022462498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986737,0.000039432,0.00030366427,0.00037641972,0.00023730082,0.0003695316],"domain_scores_gemma":[0.99907416,0.00016444385,0.000087562876,0.00036510997,0.00018938261,0.000119354045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072383764,0.00012422877,0.000115425995,0.000111346606,0.00018150546,0.000121381534,0.0006086341,0.00008514807,0.0000446966],"category_scores_gemma":[0.00023364184,0.00011263339,0.000060910854,0.00061669137,0.00008989765,0.00043612218,0.00015110848,0.00015587412,0.0011312538],"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.0000054709153,0.000056098736,0.00010940945,0.0000014192908,0.000004381392,0.00001394755,0.0026564943,0.000029399962,0.0023618995,0.6263527,0.00006181124,0.36834696],"study_design_scores_gemma":[0.000031249117,0.00021001384,0.0027912657,0.000017876238,0.000009253298,0.000022584372,0.0009751295,0.053489916,0.5454494,0.39272526,0.003792689,0.0004853894],"about_ca_topic_score_codex":0.00013207136,"about_ca_topic_score_gemma":0.00036054078,"teacher_disagreement_score":0.94919544,"about_ca_system_score_codex":0.00007042546,"about_ca_system_score_gemma":0.00005949931,"threshold_uncertainty_score":0.9996465},"labels":[],"label_agreement":null},{"id":"W2185085875","doi":"10.1016/j.artint.2015.11.002","title":"SATenstein: Automatically building local search SAT solvers from components","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":71,"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 British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Solver; Parameterized complexity; Boolean satisfiability problem; Local search (optimization); Satisfiability; Task (project management); Theoretical computer science; State (computer science); Algorithm; Programming language","score_opus":0.11416094608679045,"score_gpt":0.3091856572084594,"score_spread":0.19502471112166897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185085875","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.07649842,0.00001856364,0.92045426,0.0011573237,0.00069752696,0.00012534756,0.0000033053623,0.00026344002,0.0007818172],"genre_scores_gemma":[0.8804225,0.000003928373,0.119196594,0.00027797304,0.00006131485,0.0000034487032,0.000008256258,0.000007663519,0.000018319834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983195,0.00010302956,0.00038297495,0.00039754255,0.00048550867,0.00031143162],"domain_scores_gemma":[0.9989125,0.00016532048,0.00006208868,0.00038117036,0.00020207171,0.00027683744],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036827906,0.00014112596,0.00015653351,0.00011082194,0.0001322193,0.00026116468,0.00055328367,0.00007746703,0.00011197828],"category_scores_gemma":[0.000107733176,0.00014222524,0.00005569291,0.00039275,0.00017896443,0.00048646543,0.00021504135,0.00016848114,0.0010179634],"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.000026939446,0.00009209018,0.0011466764,0.0000045694783,0.000026526975,0.000038277656,0.0024284006,0.07228913,0.004901001,0.19158825,0.00022356183,0.72723454],"study_design_scores_gemma":[0.000039871833,0.000045853663,0.0007377854,0.000021232845,0.0000045085753,0.000007304021,0.00046811195,0.94759303,0.023203913,0.027471568,0.00022462783,0.00018216285],"about_ca_topic_score_codex":0.00047785026,"about_ca_topic_score_gemma":0.00008531598,"teacher_disagreement_score":0.8753039,"about_ca_system_score_codex":0.00012333944,"about_ca_system_score_gemma":0.0001379134,"threshold_uncertainty_score":0.99975985},"labels":[],"label_agreement":null},{"id":"W2197146024","doi":"10.1016/j.artint.2015.09.012","title":"Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematical optimization; Heuristic; Computer science; Focus (optics); Path (computing); Limit (mathematics); State space; Sampling (signal processing); Search cost; State (computer science); Space (punctuation); Algorithm; Mathematics; Statistics; Computer vision","score_opus":0.12555650689661343,"score_gpt":0.3233545835191511,"score_spread":0.19779807662253765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197146024","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.34324786,0.00008571385,0.65529585,0.00051375665,0.00018703706,0.000110256326,0.0000014570621,0.00012265542,0.00043542066],"genre_scores_gemma":[0.9204433,0.0000027220447,0.07934503,0.000032733904,0.000108308086,0.0000110747,0.000005633032,0.00000830754,0.000042889205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983243,0.0001229985,0.00029717546,0.00042520685,0.00043956877,0.00039079544],"domain_scores_gemma":[0.9991259,0.00021951475,0.000076607466,0.00025739934,0.00018103528,0.00013955813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485362,0.00013601672,0.00013240307,0.00016878544,0.00019287446,0.00029570138,0.00039410716,0.0000734642,0.0000071683603],"category_scores_gemma":[0.00013583833,0.00012752824,0.000024002169,0.0006892614,0.00008016933,0.00053459854,0.000095837706,0.0002884786,0.00004512201],"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.00023574366,0.00017278484,0.03540925,0.000024198645,0.000027589353,0.000075492564,0.0091715325,0.7464662,0.0039329766,0.0736534,0.00011751398,0.13071333],"study_design_scores_gemma":[0.0000626753,0.00027894278,0.0005755474,0.00016049786,0.000003602336,0.000030697902,0.0013022188,0.9571101,0.03601355,0.0041283322,0.00009409395,0.00023972077],"about_ca_topic_score_codex":0.001151151,"about_ca_topic_score_gemma":0.00055536866,"teacher_disagreement_score":0.57719547,"about_ca_system_score_codex":0.00013725043,"about_ca_system_score_gemma":0.00028661633,"threshold_uncertainty_score":0.5200451},"labels":[],"label_agreement":null},{"id":"W2228999052","doi":"10.1016/j.artint.2016.04.006","title":"Bounded situation calculus action theories","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Provincia autonoma di Bolzano - Alto Adige; Sapienza Università di Roma","keywords":"Decidability; Bounded function; Situation calculus; Action (physics); Extension (predicate logic); Action theory (sociology); Mathematics; Object (grammar); Calculus (dental); Tuple; Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Artificial intelligence; Epistemology","score_opus":0.06660637544232685,"score_gpt":0.3137446923820261,"score_spread":0.2471383169396993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228999052","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.027996877,0.000044684923,0.9631725,0.0011727933,0.0011164953,0.00010279948,8.261579e-7,0.00023283392,0.0061601736],"genre_scores_gemma":[0.9965777,0.00003637452,0.0022501706,0.00010418467,0.00022572643,0.000014351876,7.236166e-7,0.0000062513336,0.0007845255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988251,0.00008039269,0.00024424886,0.00035788352,0.00021058075,0.0002818221],"domain_scores_gemma":[0.9990564,0.00021583335,0.00008844798,0.00040283496,0.00015593518,0.00008053939],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036055836,0.00012291949,0.000109253146,0.0000700695,0.0002300996,0.00018889607,0.00051947124,0.00007069055,0.000108203305],"category_scores_gemma":[0.00033376907,0.00008122114,0.00006345562,0.00031457958,0.00013442956,0.00072132924,0.0001185585,0.0000656439,0.0015929209],"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.0000058020178,0.000026497099,0.000037103477,0.0000014752245,0.0000035211397,0.0000020831023,0.00079980877,0.0000039305446,0.0071184537,0.63950366,0.000053514534,0.35244414],"study_design_scores_gemma":[0.000017669077,0.00007233631,0.00023682455,0.000015013613,0.0000037150176,0.0000065308814,0.00013171519,0.0067668357,0.314371,0.6764714,0.0017482002,0.00015875392],"about_ca_topic_score_codex":0.000052875675,"about_ca_topic_score_gemma":0.00023955171,"teacher_disagreement_score":0.96858084,"about_ca_system_score_codex":0.000076208824,"about_ca_system_score_gemma":0.000073023286,"threshold_uncertainty_score":0.9991844},"labels":[],"label_agreement":null},{"id":"W227147738","doi":"10.1016/s0004-3702(02)00227-8","title":"Abduction in logic programming: A new definition and an abductive procedure based on rewriting","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"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 Alberta","funders":"","keywords":"Rewriting; Answer set programming; Logic programming; Stable model semantics; Computer science; Programming language; Semantics (computer science); Non-monotonic logic; Set (abstract data type); Abductive reasoning; Circumscription; Logic program; Theoretical computer science; Artificial intelligence; Operational semantics","score_opus":0.12085611922082151,"score_gpt":0.30549535592446425,"score_spread":0.18463923670364274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227147738","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.07299673,0.00035833413,0.9153126,0.0021603156,0.00047748743,0.00069123745,9.4025535e-7,0.00042131956,0.007581057],"genre_scores_gemma":[0.96530426,0.00002034605,0.03416,0.00022755879,0.00020986056,0.00002792039,0.000002059642,0.000008669244,0.0000393187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985319,0.000087823944,0.00027956138,0.0005848038,0.00018817137,0.00032773192],"domain_scores_gemma":[0.9993228,0.00009629471,0.00009434529,0.0002730152,0.00008295723,0.00013063129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030934098,0.00016288106,0.00014157037,0.00017508611,0.0001658107,0.00023074976,0.000287588,0.000093319744,0.000032162425],"category_scores_gemma":[0.00031379395,0.00015368553,0.000034381308,0.0006341143,0.000081577346,0.0005444836,0.000046269015,0.00020888897,0.00010040254],"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.000020037995,0.0003691212,0.00045970306,0.000016222997,0.0000021137375,0.000019809493,0.0032817968,0.00049698283,0.00039331106,0.51385045,0.000045328787,0.48104516],"study_design_scores_gemma":[0.000083269406,0.0009469291,0.0005839407,0.0001221022,0.000006502911,0.000032390577,0.0008837831,0.6191715,0.009916172,0.36755425,0.00028461806,0.0004145247],"about_ca_topic_score_codex":0.000096010954,"about_ca_topic_score_gemma":0.00027261578,"teacher_disagreement_score":0.8923075,"about_ca_system_score_codex":0.000059217484,"about_ca_system_score_gemma":0.00004304994,"threshold_uncertainty_score":0.62671137},"labels":[],"label_agreement":null},{"id":"W2275001223","doi":"10.1016/j.artint.2019.07.002","title":"The logic of qualitative probability","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interpretation (philosophy); Axiom; Operator (biology); Set (abstract data type); Outcome (game theory); Possibility theory; Axiomatic system; Finite set; Set theory; Mathematics; Binary operation; Modal operator; Domain (mathematical analysis); Infinite set; Probability theory; Computer science; Discrete mathematics; Theoretical computer science; Mathematical economics; Fuzzy set; Artificial intelligence; Multimodal logic; Fuzzy logic; Description logic; Statistics","score_opus":0.19386836371796715,"score_gpt":0.3876034118537989,"score_spread":0.19373504813583173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275001223","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.058068216,0.0001185651,0.9373118,0.0014120842,0.00032692088,0.00017964531,0.000001035811,0.00005533228,0.0025263433],"genre_scores_gemma":[0.9854542,0.000017688835,0.014289197,0.00009420744,0.000015168513,0.000008831568,2.7095365e-7,0.0000029221355,0.00011749053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868727,0.00021016688,0.00037274227,0.00028316502,0.00022970597,0.00021692328],"domain_scores_gemma":[0.9983598,0.0006555309,0.00011674653,0.00061058137,0.00021451213,0.000042850217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012997728,0.00008915447,0.0001239548,0.000023894501,0.00010542114,0.00008261271,0.00095493894,0.00004174868,0.000022951783],"category_scores_gemma":[0.00022315071,0.000059145837,0.00006047042,0.00032955143,0.00018251812,0.00018296402,0.0001486266,0.00012811982,0.00038651327],"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.0000067829146,0.000031224186,0.000026515838,0.0000058614414,0.0000041443814,2.5049135e-7,0.0032855512,0.00044261088,0.0011513649,0.9158388,0.000014476716,0.07919245],"study_design_scores_gemma":[0.000005197142,0.00010453242,0.000032912114,0.000013992577,0.0000012423156,8.527236e-7,0.0007498093,0.074459925,0.03335118,0.8911176,0.00008105702,0.000081707665],"about_ca_topic_score_codex":0.00006396426,"about_ca_topic_score_gemma":0.00002784736,"teacher_disagreement_score":0.927386,"about_ca_system_score_codex":0.000017265207,"about_ca_system_score_gemma":0.000075123404,"threshold_uncertainty_score":0.4967975},"labels":[],"label_agreement":null},{"id":"W2295870642","doi":"10.1016/j.artint.2015.06.003","title":"Optimal social choice functions: A utilitarian view","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Social choice theory; Maximization; Social welfare function; Context (archaeology); Class (philosophy); Probabilistic logic; Social Welfare; Computer science; Mathematical economics; Mathematics; Mathematical optimization; Artificial intelligence; Welfare; Economics","score_opus":0.22067793669083208,"score_gpt":0.30804201530508346,"score_spread":0.08736407861425138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295870642","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.6147351,0.003530668,0.25587803,0.003189006,0.0057774,0.00068945816,0.00015303113,0.000416628,0.11563064],"genre_scores_gemma":[0.9970292,0.000005862305,0.00037139645,0.00017278056,0.00067092397,0.000027946087,0.000008466373,0.000019105502,0.0016943406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984944,0.000050909075,0.0006992652,0.0003799017,0.0000523079,0.00032323436],"domain_scores_gemma":[0.9992591,0.00009068112,0.00020288915,0.0002487309,0.00007101676,0.00012758786],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013567741,0.00014520105,0.00030064216,0.000116525945,0.00020571655,0.00010305643,0.00026961477,0.00010642913,0.00051449874],"category_scores_gemma":[0.00055310567,0.00017001071,0.000111953574,0.00035480486,0.00011988737,0.00023019308,0.000054278767,0.00017162842,0.009844102],"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.000034245957,0.000112699905,0.0018895156,0.000015409953,0.000028660905,0.0000029828157,0.0025233475,0.00038101754,0.000013977549,0.98262686,0.0012133125,0.011157992],"study_design_scores_gemma":[0.00013627743,0.00033101861,0.0015008844,0.00004551521,0.000020307445,0.000018822338,0.005783486,0.016096316,0.0007341877,0.60548574,0.36898363,0.0008637847],"about_ca_topic_score_codex":0.00057833886,"about_ca_topic_score_gemma":0.000083645056,"teacher_disagreement_score":0.38229406,"about_ca_system_score_codex":0.00008108933,"about_ca_system_score_gemma":0.00003160827,"threshold_uncertainty_score":0.99092686},"labels":[],"label_agreement":null},{"id":"W2398436144","doi":"10.1016/j.artint.2016.05.004","title":"Automatic construction of parallel portfolios via algorithm configuration","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Algorithm; Parallel computing","score_opus":0.023485811717941993,"score_gpt":0.26123016908454955,"score_spread":0.23774435736660754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398436144","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.0039428524,0.000009519394,0.9937965,0.0008781057,0.00048715764,0.00014962319,0.0000025276652,0.00014184462,0.00059181906],"genre_scores_gemma":[0.7879332,0.000024882791,0.21191318,0.000049302016,0.00003335359,0.000008621793,0.0000016018702,0.000004152127,0.000031729098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889696,0.000050166884,0.0004627858,0.00023371975,0.00020810128,0.00014824087],"domain_scores_gemma":[0.9991736,0.00010108851,0.00021074597,0.00027400482,0.00018162746,0.00005894968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017645964,0.000096945645,0.00012536476,0.00012656982,0.00007147615,0.000041865445,0.0002189339,0.00005740469,0.00053471065],"category_scores_gemma":[0.00007082419,0.00007607998,0.000051167888,0.0003071888,0.0001544046,0.00053804624,0.000033162232,0.000041853822,0.00017537952],"study_design_candidate":"design_other","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.0000017218348,0.000016888662,0.00009619377,0.0000024714898,0.0000056616723,0.0000011979947,0.00009896601,0.0000891229,0.0037968296,0.16316004,0.00001196369,0.83271897],"study_design_scores_gemma":[0.00005140491,0.00008111536,0.0009669988,0.000042989068,0.000007763975,0.000044924655,0.00009446415,0.71631956,0.18254235,0.09952412,0.0001290268,0.00019529043],"about_ca_topic_score_codex":0.000024989115,"about_ca_topic_score_gemma":0.000011016926,"teacher_disagreement_score":0.83252364,"about_ca_system_score_codex":0.000031689484,"about_ca_system_score_gemma":0.00006494566,"threshold_uncertainty_score":0.5854707},"labels":[],"label_agreement":null},{"id":"W2725233680","doi":"10.1016/j.artint.2018.10.007","title":"Gelfond–Zhang aggregates as propositional formulas","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre International de Mathématiques et Informatique de Toulouse; Ministerio de Economía y Competitividad; Xunta de Galicia; Simon Fraser University; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Answer set programming; Propositional calculus; Aggregate (composite); Syntax; Equivalence (formal languages); Semantics (computer science); Stable model semantics; Representation (politics); Propositional formula; Class (philosophy); Logical equivalence; Mathematics; Propositional variable; Computer science; Set (abstract data type); Discrete mathematics; Programming language; Artificial intelligence; Operational semantics; Intermediate logic; Description logic","score_opus":0.02289904309344189,"score_gpt":0.270212057011926,"score_spread":0.24731301391848412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725233680","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.27476546,0.00077387935,0.61088014,0.0017472809,0.0026542826,0.0007711118,0.000004087874,0.0005899871,0.107813776],"genre_scores_gemma":[0.99151057,0.000019915984,0.00601584,0.0003599251,0.00018853544,0.000018831455,0.0000046933355,0.000010958347,0.0018707127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984027,0.000045572873,0.0003028187,0.00050083816,0.00032421923,0.00042384877],"domain_scores_gemma":[0.99895483,0.00014459972,0.00010287091,0.0004957409,0.00017757642,0.00012436863],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026466948,0.00017713683,0.00017040706,0.00009993565,0.00018321016,0.0002628672,0.00092392927,0.00008758344,0.0005043238],"category_scores_gemma":[0.0001010394,0.00015257082,0.00010818295,0.00042004665,0.00008074506,0.0006337555,0.00026521544,0.00016225321,0.012746709],"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.000010459031,0.00009146686,0.0003674202,0.000010074939,0.000010637666,0.000014768589,0.00087607006,0.00010291735,0.0031795823,0.9117585,0.00015532417,0.083422795],"study_design_scores_gemma":[0.000041651096,0.00037183703,0.0003449084,0.00006161131,0.0000075541275,0.00006654445,0.00018204581,0.077667825,0.32786256,0.58641887,0.0065104477,0.0004641623],"about_ca_topic_score_codex":0.000087058535,"about_ca_topic_score_gemma":0.000036196492,"teacher_disagreement_score":0.71674514,"about_ca_system_score_codex":0.00005389372,"about_ca_system_score_gemma":0.00012890087,"threshold_uncertainty_score":0.98802197},"labels":[],"label_agreement":null},{"id":"W2746979461","doi":"10.1016/j.artint.2009.11.006","title":"Book review","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"","field":"","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":"University of Guelph","funders":"","keywords":"Computer science","score_opus":0.07495265727052909,"score_gpt":0.36079933455227586,"score_spread":0.2858466772817468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746979461","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056080765,0.9024135,0.018539073,0.02402176,0.0005490498,0.001236969,0.000020885964,0.001113649,0.051544327],"genre_scores_gemma":[0.43331894,0.07804596,0.0023951028,0.4755596,0.0010863374,0.000076799,0.00004670754,0.00016931367,0.009301246],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984061,0.000071555995,0.0004910053,0.00033831608,0.0003104033,0.0003826199],"domain_scores_gemma":[0.99908704,0.000054534612,0.000103098646,0.0005010401,0.00012374458,0.0001305328],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042931683,0.00016931462,0.00022750116,0.000068375455,0.000102762344,0.000041498974,0.0003640483,0.000045877092,0.0071627796],"category_scores_gemma":[0.00034208046,0.00016062899,0.000108384076,0.0005773564,0.00008854323,0.00027024632,0.000025294054,0.00016593472,0.06480122],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00002055417,0.00014053861,0.0000033403571,0.00003796143,0.000006071126,0.000023672204,0.00008177254,0.000030655076,0.0069253705,0.037693467,0.68165433,0.27338225],"study_design_scores_gemma":[0.000006412158,0.00013633141,0.00005773068,0.00059055205,0.000032152846,0.000017273514,0.00002032046,0.0005438923,0.10927639,0.029804768,0.8592036,0.00031060635],"about_ca_topic_score_codex":0.000011325529,"about_ca_topic_score_gemma":0.0000066018783,"teacher_disagreement_score":0.8243675,"about_ca_system_score_codex":0.000051604675,"about_ca_system_score_gemma":0.000038274487,"threshold_uncertainty_score":0.9937448},"labels":[],"label_agreement":null},{"id":"W2747118187","doi":"10.1016/j.artint.2017.05.004","title":"MM: A bidirectional search algorithm that is guaranteed to meet in the middle","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Incremental heuristic search; Bidirectional search; Beam search; Heuristic; Best-first search; Search algorithm; Algorithm; Computer science; Disjoint sets; Node (physics); Search problem; Depth-first search; Iterative deepening depth-first search; Null-move heuristic; Mathematics; Artificial intelligence","score_opus":0.2313199868634884,"score_gpt":0.3798248892331862,"score_spread":0.1485049023696978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747118187","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.0028793472,0.00004150385,0.9801928,0.011234068,0.0005919303,0.00047138354,0.0000123763,0.000054551234,0.004522062],"genre_scores_gemma":[0.7651695,0.000045742632,0.23052064,0.0027410265,0.00032525868,0.00013360787,0.000002260894,0.000024108402,0.0010378689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718755,0.00024808798,0.0003607073,0.0005975965,0.0010794101,0.00052667194],"domain_scores_gemma":[0.99769634,0.0003532955,0.000085734566,0.0014843517,0.00024073171,0.00013954566],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020835518,0.00016397657,0.0001837835,0.00028123605,0.00073575333,0.0013399255,0.0036729092,0.00006810561,0.00022285848],"category_scores_gemma":[0.0006161369,0.00012877851,0.000074634845,0.00070706115,0.0001931245,0.0004613886,0.00057727884,0.00023625926,0.00079993095],"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.000029208506,0.000363583,0.0005586339,0.000013627133,0.00003090124,0.0001337419,0.013545721,0.0024305822,0.00033280737,0.17858632,0.0029703367,0.8010045],"study_design_scores_gemma":[0.00004133646,0.000096055286,0.0009173176,0.000032314983,0.0000035595915,0.000027786622,0.0006478056,0.94020253,0.026848778,0.027980044,0.0029549813,0.0002474858],"about_ca_topic_score_codex":0.000801578,"about_ca_topic_score_gemma":0.00026891995,"teacher_disagreement_score":0.937772,"about_ca_system_score_codex":0.00005589284,"about_ca_system_score_gemma":0.00014639323,"threshold_uncertainty_score":0.99997807},"labels":[],"label_agreement":null},{"id":"W2747289554","doi":"10.1016/j.artint.2009.11.007","title":"Book review","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"","field":"","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":"Alberta Glycomics Centre; University of Alberta","funders":"","keywords":"Computer science","score_opus":0.07495265727052909,"score_gpt":0.36079933455227586,"score_spread":0.2858466772817468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747289554","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056080765,0.9024135,0.018539073,0.02402176,0.0005490498,0.001236969,0.000020885964,0.001113649,0.051544327],"genre_scores_gemma":[0.43331894,0.07804596,0.0023951028,0.4755596,0.0010863374,0.000076799,0.00004670754,0.00016931367,0.009301246],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984061,0.000071555995,0.0004910053,0.00033831608,0.0003104033,0.0003826199],"domain_scores_gemma":[0.99908704,0.000054534612,0.000103098646,0.0005010401,0.00012374458,0.0001305328],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042931683,0.00016931462,0.00022750116,0.000068375455,0.000102762344,0.000041498974,0.0003640483,0.000045877092,0.0071627796],"category_scores_gemma":[0.00034208046,0.00016062899,0.000108384076,0.0005773564,0.00008854323,0.00027024632,0.000025294054,0.00016593472,0.06480122],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00002055417,0.00014053861,0.0000033403571,0.00003796143,0.000006071126,0.000023672204,0.00008177254,0.000030655076,0.0069253705,0.037693467,0.68165433,0.27338225],"study_design_scores_gemma":[0.000006412158,0.00013633141,0.00005773068,0.00059055205,0.000032152846,0.000017273514,0.00002032046,0.0005438923,0.10927639,0.029804768,0.8592036,0.00031060635],"about_ca_topic_score_codex":0.000011325529,"about_ca_topic_score_gemma":0.0000066018783,"teacher_disagreement_score":0.8243675,"about_ca_system_score_codex":0.000051604675,"about_ca_system_score_gemma":0.000038274487,"threshold_uncertainty_score":0.9937448},"labels":[],"label_agreement":null},{"id":"W2750078980","doi":"10.1016/j.artint.2017.08.003","title":"Three-valued semantics for hybrid MKNF knowledge bases revisited","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semantics (computer science); Computer science; Programming language; Computational semantics; Artificial intelligence; Natural language processing; Cognitive science; Operational semantics; Psychology","score_opus":0.10308097849777433,"score_gpt":0.34667545679557993,"score_spread":0.24359447829780562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750078980","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.007338689,0.0005009253,0.9822528,0.0006498337,0.0015718915,0.00049214077,0.000011996066,0.0002419456,0.006939827],"genre_scores_gemma":[0.973234,0.000048490358,0.025295224,0.00015056258,0.00067299686,0.000048579488,0.000006648805,0.000023534387,0.00051996706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979299,0.00004947128,0.0004810403,0.00073099305,0.00021864721,0.00058999984],"domain_scores_gemma":[0.996992,0.00033067854,0.0002992768,0.0017284391,0.0004633153,0.00018632354],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007756589,0.0002755726,0.00034616533,0.00010618496,0.0012202128,0.0009454243,0.0025976917,0.0000868085,0.00004968686],"category_scores_gemma":[0.0015162531,0.0002471508,0.00021776637,0.0001762449,0.00025478346,0.0006620951,0.0005898449,0.00016772278,0.00083790836],"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.000020133317,0.00016638136,0.00036831948,0.000044838194,0.0000223569,0.000017124225,0.00039912827,0.0000133218455,0.0005493778,0.7814982,0.0025290556,0.21437176],"study_design_scores_gemma":[0.000084354935,0.00026459194,0.00063685153,0.00013528814,0.000038499024,0.000020971578,0.00004170653,0.503095,0.12694342,0.34436652,0.023742892,0.00062992476],"about_ca_topic_score_codex":0.000060893555,"about_ca_topic_score_gemma":0.00027406213,"teacher_disagreement_score":0.9658953,"about_ca_system_score_codex":0.00004636616,"about_ca_system_score_gemma":0.00013677332,"threshold_uncertainty_score":0.9999981},"labels":[],"label_agreement":null},{"id":"W2810243590","doi":"10.1016/j.artint.2018.06.003","title":"Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"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":"Formalism (music); Computer science; Dynamical systems theory; Artificial intelligence; Action (physics); Theoretical computer science; Mathematics; Algorithm; Physics","score_opus":0.016584897036570435,"score_gpt":0.27190308727807794,"score_spread":0.2553181902415075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810243590","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.833826,0.0006043672,0.16249047,0.00009616509,0.00070754596,0.00024748594,0.0000016041056,0.00011033619,0.0019160382],"genre_scores_gemma":[0.9979677,0.000048279548,0.0016039871,0.000031916963,0.00021407616,0.000012791302,8.5095223e-7,0.000010753804,0.000109614426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983354,0.00016091087,0.00034670517,0.0005704914,0.00016773443,0.00041873055],"domain_scores_gemma":[0.9990314,0.00031661894,0.00008996179,0.0003160185,0.000089507485,0.00015644106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801459,0.00019242428,0.00027979715,0.00011670555,0.00018131951,0.00035768075,0.00034171704,0.000107178785,0.000004642852],"category_scores_gemma":[0.00035891333,0.00016381087,0.00003250006,0.0003523293,0.00038657506,0.00028580174,0.00025275262,0.00017839938,0.000049491908],"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.00006253479,0.00009002926,0.029720878,0.000075330376,0.00002620621,0.00011554793,0.009771441,0.0001178018,0.0032418545,0.8127937,0.000074900345,0.14390983],"study_design_scores_gemma":[0.00009428745,0.0004886146,0.012541951,0.00030459365,0.000013208123,0.000104434934,0.0007408318,0.96455795,0.009301676,0.010777405,0.00049387047,0.0005811964],"about_ca_topic_score_codex":0.00053394417,"about_ca_topic_score_gemma":0.0004980672,"teacher_disagreement_score":0.9644401,"about_ca_system_score_codex":0.000037864007,"about_ca_system_score_gemma":0.000024027175,"threshold_uncertainty_score":0.66800135},"labels":[],"label_agreement":null},{"id":"W2898297778","doi":"10.1016/j.artint.2018.08.005","title":"Probably bounded suboptimal heuristic search","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Bounded function; Heuristic; Mathematical optimization; Computer science; Incremental heuristic search; Mathematics; Artificial intelligence; Search algorithm; Beam search","score_opus":0.05176550724848589,"score_gpt":0.323414968421788,"score_spread":0.27164946117330213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898297778","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.033637743,0.00003363946,0.9574596,0.0013960872,0.000760854,0.00013125005,0.000001009586,0.00031300445,0.0062667807],"genre_scores_gemma":[0.9265111,0.000003841395,0.07201348,0.00025170489,0.00055449054,0.000007813136,0.0000013962224,0.00001110766,0.00064506294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823755,0.000109561384,0.00029631532,0.00050804345,0.00036189862,0.00048661404],"domain_scores_gemma":[0.99890894,0.000112528774,0.00005401468,0.000564346,0.00021732187,0.00014287738],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005592701,0.00014997325,0.00013849029,0.00010601643,0.00038632296,0.00039970328,0.0010496968,0.00005697558,0.00018624595],"category_scores_gemma":[0.00017791707,0.00013824474,0.000057810706,0.00063741504,0.00027763873,0.00027385526,0.00027463998,0.00026115341,0.0031144745],"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.000016640539,0.000111319816,0.00020180122,0.000009389843,0.000010887025,0.000031543266,0.0015421547,0.00045215414,0.001124267,0.54904073,0.00032990036,0.44712922],"study_design_scores_gemma":[0.000020185293,0.00045782357,0.00027984162,0.000020687232,0.000003980829,0.000031773816,0.00007099343,0.84301466,0.050766524,0.101133585,0.0038975119,0.00030243993],"about_ca_topic_score_codex":0.00022208177,"about_ca_topic_score_gemma":0.000046635716,"teacher_disagreement_score":0.89287335,"about_ca_system_score_codex":0.000030867744,"about_ca_system_score_gemma":0.00010360318,"threshold_uncertainty_score":0.9976617},"labels":[],"label_agreement":null},{"id":"W2913764096","doi":"10.1016/s0004-3702(01)00121-7","title":"Computer Go","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":180,"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 Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Representation (politics); Artificial intelligence; Data science; Human–computer interaction; Management science; Mathematics; Engineering","score_opus":0.0945553412646733,"score_gpt":0.30020233166960725,"score_spread":0.20564699040493395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913764096","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.0043957755,0.00021630288,0.9793222,0.0030702981,0.001638596,0.00021033526,0.000001594869,0.0006073275,0.010537574],"genre_scores_gemma":[0.92268103,0.00006762069,0.07469707,0.001246871,0.00050413003,0.000024223102,8.96572e-7,0.000022433205,0.0007557137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972997,0.000100280944,0.0006889181,0.0007587783,0.00048246057,0.00066991855],"domain_scores_gemma":[0.99807847,0.00028859088,0.00013619025,0.001089001,0.0001871434,0.00022058203],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034542737,0.0002784473,0.00025118882,0.00019262826,0.0002840432,0.0004307094,0.0020115143,0.000121464334,0.0010937329],"category_scores_gemma":[0.00012264038,0.0002731487,0.00015282063,0.000929493,0.00028321007,0.0008968255,0.00042488214,0.0002845253,0.017801458],"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.0000017824424,0.00011546698,0.00005219465,0.0000029144717,0.000008481426,0.000030319747,0.0010459614,0.0008307474,0.00042095248,0.41147327,0.00243738,0.58358055],"study_design_scores_gemma":[0.0000074669824,0.00014413052,0.00003638755,0.000017976157,0.0000046079704,0.000031807685,0.00007459451,0.7747851,0.07367004,0.13831776,0.012498042,0.00041207654],"about_ca_topic_score_codex":0.000047963596,"about_ca_topic_score_gemma":0.00003879013,"teacher_disagreement_score":0.91828525,"about_ca_system_score_codex":0.00006135398,"about_ca_system_score_gemma":0.000019578174,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W2913781869","doi":"10.1016/j.artint.2019.103216","title":"The Hanabi challenge: A new frontier for AI research","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Computer science; Domain (mathematical analysis); Imperfect; Artificial intelligence; Frontier; Perfect information; State (computer science); Cognitive science; Data science; Human–computer interaction; Psychology","score_opus":0.16285222363553653,"score_gpt":0.41267342097697784,"score_spread":0.24982119734144131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913781869","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.0026341104,0.0009457857,0.95433867,0.032947615,0.0029697942,0.0013837579,0.0000024501824,0.00021024198,0.0045675957],"genre_scores_gemma":[0.96640515,0.00024119842,0.019384334,0.0007999935,0.000939672,0.0002081724,0.0000020584105,0.000051636107,0.011967804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960883,0.00022530921,0.0007192388,0.000915184,0.0008693484,0.0011825733],"domain_scores_gemma":[0.9951604,0.0019894966,0.00012762388,0.0016931546,0.0007774605,0.00025185058],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027657936,0.00025334297,0.000262685,0.00019669803,0.00089123234,0.00097404147,0.0034721661,0.00015919589,0.00012346702],"category_scores_gemma":[0.0009832397,0.00019469374,0.0001948225,0.0009770301,0.00038084653,0.0007468685,0.00058917835,0.0005724311,0.0045509115],"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.00003150698,0.00004253442,0.000025607893,0.0000054049606,0.00001288802,0.0000023061016,0.001264079,0.00024422188,0.00040889034,0.57263404,0.0072072414,0.4181213],"study_design_scores_gemma":[0.000015350253,0.0003210878,0.000012595204,0.000024864765,0.0000034414309,0.0000032661903,0.0010980722,0.11471922,0.05819198,0.67678356,0.14857647,0.00025007664],"about_ca_topic_score_codex":0.00039821846,"about_ca_topic_score_gemma":0.00071861054,"teacher_disagreement_score":0.96377105,"about_ca_system_score_codex":0.00012429692,"about_ca_system_score_gemma":0.00043910605,"threshold_uncertainty_score":0.99622416},"labels":[],"label_agreement":null},{"id":"W2954631080","doi":"10.1016/j.artint.2019.03.004","title":"Incentivizing evaluation with peer prediction and limited access to ground truth","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Truth telling; Ground truth; Computer science; Incentive; Grading (engineering); Aggregate (composite); Set (abstract data type); Common ground; Artificial intelligence; Psychology; Social psychology","score_opus":0.06897691049487736,"score_gpt":0.3100311487303518,"score_spread":0.24105423823547445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954631080","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.60466844,0.000018454504,0.39343646,0.00047830353,0.00039012887,0.00029128641,7.4372144e-7,0.00008409961,0.0006320834],"genre_scores_gemma":[0.9962996,0.0000028740526,0.0033330228,0.00019545184,0.000075829106,0.000018429435,0.000003236275,0.000009584679,0.0000619491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839604,0.000079548015,0.00022722359,0.00050120027,0.0005522775,0.00024373707],"domain_scores_gemma":[0.99893415,0.00013784599,0.00007315318,0.00040105634,0.00035629453,0.00009747967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008677314,0.00012528733,0.00012019626,0.00013859996,0.00015931367,0.00078830286,0.0003441398,0.000047067184,0.000022942546],"category_scores_gemma":[0.00015308885,0.000110996814,0.000020080794,0.0005916263,0.000038032445,0.00088864414,0.00017902719,0.00011421837,0.000105094194],"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.00007664955,0.00008706367,0.008345808,0.00002645626,0.00002629734,0.000006009511,0.0048456704,0.01756051,0.00979442,0.038455646,0.000110090914,0.9206654],"study_design_scores_gemma":[0.000073639996,0.00034250872,0.01747539,0.00016240156,0.00002452784,0.000025979998,0.0006886114,0.9127647,0.056518324,0.011030035,0.0005603354,0.00033350065],"about_ca_topic_score_codex":0.00008869094,"about_ca_topic_score_gemma":0.00005208848,"teacher_disagreement_score":0.9203319,"about_ca_system_score_codex":0.00005969135,"about_ca_system_score_gemma":0.000054893037,"threshold_uncertainty_score":0.76016223},"labels":[],"label_agreement":null},{"id":"W2964281761","doi":"10.1016/j.artint.2013.10.003","title":"Algorithm runtime prediction: Methods &amp; evaluation","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":384,"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 British Columbia","funders":"","keywords":"Computer science; Parameterized complexity; Generalization; Range (aeronautics); Algorithm; Variety (cybernetics); Machine learning; Artificial intelligence; Mathematics","score_opus":0.08348968459179722,"score_gpt":0.38890349694185905,"score_spread":0.3054138123500618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964281761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009763319,0.000112767135,0.99480695,0.000794411,0.001333629,0.00076899666,0.0000044850312,0.00037679385,0.0017043574],"genre_scores_gemma":[0.006005083,0.000022282815,0.99265516,0.00030967878,0.00020836909,0.00026279571,0.000014071668,0.000018551014,0.0005040326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974608,0.00036613818,0.00054432574,0.0006720205,0.0005770108,0.00037971753],"domain_scores_gemma":[0.9973858,0.00025823124,0.00017265267,0.00075934635,0.0012651859,0.00015877488],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011849045,0.00021277311,0.00018782553,0.0001866782,0.00027356236,0.0003213013,0.00073795655,0.00010039703,0.0010560116],"category_scores_gemma":[0.00063307525,0.00021253122,0.0000803121,0.0009723053,0.000119455355,0.0016632709,0.00022619627,0.00020175402,0.0028019785],"study_design_candidate":"design_other","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.0000010183608,0.00007014555,0.00000800626,0.0000015031678,0.000012484373,6.297952e-7,0.00048291136,0.019033125,0.0013205993,0.009583506,0.000145095,0.969341],"study_design_scores_gemma":[0.000027161821,0.0000367587,0.00017732756,0.0000069558455,0.000008521979,0.000010786099,0.00007823665,0.8379694,0.02046714,0.13945466,0.0015741856,0.00018885547],"about_ca_topic_score_codex":0.000084161875,"about_ca_topic_score_gemma":0.000009044423,"teacher_disagreement_score":0.9691521,"about_ca_system_score_codex":0.00017840255,"about_ca_system_score_gemma":0.000116424104,"threshold_uncertainty_score":0.9998572},"labels":[],"label_agreement":null},{"id":"W2987239078","doi":"10.1016/j.artint.2019.103199","title":"Probabilistic sentence satisfiability: An approach to PSAT","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Air Force Office of Scientific Research","keywords":"Probabilistic logic; Satisfiability; Sentence; Conditional probability; Computer science; Mathematics; Algorithm; Gaussian; Set (abstract data type); Artificial intelligence; Statistics","score_opus":0.05290585328553442,"score_gpt":0.2841674287547401,"score_spread":0.23126157546920567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987239078","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.23430158,0.000033783384,0.7406967,0.0002984068,0.00086045184,0.0007388886,0.0000018112058,0.00030393436,0.022764433],"genre_scores_gemma":[0.96424544,0.0000027453077,0.03478015,0.00037629437,0.00012752907,0.00004889063,0.0000028981249,0.000013613564,0.00040242277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743235,0.00015016829,0.00042812884,0.0010556899,0.00037973808,0.0005539406],"domain_scores_gemma":[0.99785954,0.00016983382,0.000082251136,0.0013471668,0.00022937452,0.00031182263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073551777,0.00023747067,0.00026678384,0.00010919781,0.00014902865,0.00032906423,0.0016163095,0.00009183155,0.00006960675],"category_scores_gemma":[0.00036381907,0.00020821848,0.00008477347,0.0008171548,0.00012924406,0.0006337401,0.00039330634,0.0001947942,0.0030851958],"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.000012927406,0.0003703331,0.0016040755,0.000031007145,0.000006348374,0.0000031805023,0.0033624459,0.0023127643,0.0015887576,0.8603149,0.00006747056,0.13032581],"study_design_scores_gemma":[0.000045059798,0.00060184643,0.0051782494,0.00004620907,0.000012531451,0.000037558566,0.00096350856,0.5741423,0.017469333,0.39867723,0.0018693971,0.000956838],"about_ca_topic_score_codex":0.00015010059,"about_ca_topic_score_gemma":0.000096763055,"teacher_disagreement_score":0.7299439,"about_ca_system_score_codex":0.000085221254,"about_ca_system_score_gemma":0.00011986029,"threshold_uncertainty_score":0.99769104},"labels":[],"label_agreement":null},{"id":"W3023698480","doi":"10.1016/j.artint.2010.12.004","title":"Book review","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"","field":"","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 Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.1835049871033256,"score_gpt":0.34703019296629667,"score_spread":0.16352520586297106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023698480","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008736773,0.75990415,0.026555791,0.0015292274,0.0011849374,0.0015763484,0.000035040535,0.0012859293,0.20705493],"genre_scores_gemma":[0.6066549,0.12729204,0.012205818,0.23063053,0.0013071507,0.00060876086,0.00005758645,0.00072346046,0.020519778],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984802,0.000082451144,0.0004889577,0.00033492208,0.00024684836,0.00036659112],"domain_scores_gemma":[0.99902856,0.000043755663,0.00011515749,0.0005440307,0.00013537511,0.00013313619],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046151463,0.00016456138,0.00020905124,0.000067398054,0.00008836847,0.000016949018,0.00041853776,0.00004635832,0.036463115],"category_scores_gemma":[0.00027885492,0.00015404854,0.00010382059,0.00046390516,0.00017976123,0.00027556342,0.000072963216,0.00015161787,0.12500188],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00006535533,0.000345417,0.00007210004,0.00021405565,0.000033498665,0.0000650043,0.0011171964,0.000002880981,0.003667884,0.08990139,0.77596754,0.12854767],"study_design_scores_gemma":[0.000006668421,0.000098380486,0.00008090864,0.00064269063,0.000057415065,0.000020522602,0.000080999285,0.00021756427,0.29273993,0.023921624,0.6817394,0.00039393012],"about_ca_topic_score_codex":0.00010288927,"about_ca_topic_score_gemma":0.000030427454,"teacher_disagreement_score":0.6326121,"about_ca_system_score_codex":0.000036353656,"about_ca_system_score_gemma":0.00003864532,"threshold_uncertainty_score":0.9644177},"labels":[],"label_agreement":null},{"id":"W3029510736","doi":"10.1016/j.artint.2020.103328","title":"On the equivalence of optimal recommendation sets and myopically optimal query sets","year":2020,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Computer science; Recommender system; Preference elicitation; Set (abstract data type); Preference; Equivalence (formal languages); Expected utility hypothesis; Information retrieval; Data mining; Machine learning; Mathematics","score_opus":0.33583112151467903,"score_gpt":0.46472001396090457,"score_spread":0.12888889244622553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029510736","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.40969995,0.0000427435,0.5689922,0.020198343,0.00018333807,0.00034501517,0.0000400425,0.00003422457,0.00046414172],"genre_scores_gemma":[0.993043,0.00004377467,0.006037041,0.0007329649,0.00007050762,0.000013563843,0.000003361547,0.000011477938,0.000044323482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692506,0.0003036309,0.00075714133,0.0005903122,0.0010954886,0.00032837855],"domain_scores_gemma":[0.9946714,0.004159301,0.00022324677,0.00039161573,0.00037344854,0.00018096482],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017121104,0.00015825605,0.00024835742,0.000105807805,0.00021483275,0.0001817271,0.0008423064,0.00007297275,0.0013841701],"category_scores_gemma":[0.009104935,0.000104066836,0.00007496884,0.00081276224,0.0004798582,0.00035042543,0.00035595926,0.00034165027,0.0004835723],"study_design_candidate":"design_other","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.00047484227,0.0001201062,0.00017463168,0.000011760657,0.000020604142,0.000016549497,0.0029504178,0.026071278,0.0045227315,0.029270599,0.001982198,0.9343843],"study_design_scores_gemma":[0.000067833855,0.001429523,0.0008564204,0.00004542069,0.000010283688,0.000009531405,0.00475558,0.7164165,0.13528636,0.13856582,0.002196934,0.00035982873],"about_ca_topic_score_codex":0.000017844784,"about_ca_topic_score_gemma":0.000009305266,"teacher_disagreement_score":0.93402445,"about_ca_system_score_codex":0.000024614283,"about_ca_system_score_gemma":0.00007566471,"threshold_uncertainty_score":0.9995287},"labels":[],"label_agreement":null},{"id":"W3042974867","doi":"10.1016/j.artint.2021.103503","title":"Toward personalized XAI: A case study in intelligent tutoring systems","year":2021,"lang":"en","type":"preprint","venue":"Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Personalization; Computer science; Context (archaeology); Constraint (computer-aided design); Perception; Intelligent tutoring system; Value (mathematics); Cognition; Human–computer interaction; World Wide Web; Psychology; Machine learning","score_opus":0.19535364336425445,"score_gpt":0.36216192382724816,"score_spread":0.1668082804629937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042974867","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.42960706,0.0022389435,0.55810726,0.00037356428,0.006158232,0.002550744,0.000009436049,0.0004914535,0.00046330367],"genre_scores_gemma":[0.9920617,0.0002528371,0.005732002,0.00013140136,0.000568956,0.000866484,0.000014754235,0.00010448253,0.00026740492],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9888144,0.0013281876,0.0031417836,0.0034205208,0.0015549883,0.0017401183],"domain_scores_gemma":[0.99344754,0.0008187037,0.00077600783,0.0034081442,0.0010087336,0.0005408448],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0032231489,0.0012417786,0.0016534234,0.0011215202,0.0004407057,0.0035812834,0.0041319295,0.0006912538,0.0001414938],"category_scores_gemma":[0.00090835115,0.0013753561,0.0005466761,0.0024897668,0.0003286798,0.001136629,0.0050131506,0.0024780836,0.0004394885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014757206,0.005953325,0.0032715988,0.0009929003,0.00053417264,0.17554851,0.25619686,0.2035496,0.0010126597,0.1947969,0.00009730096,0.1578986],"study_design_scores_gemma":[0.000111378475,0.00064260955,0.000054296277,0.0013308111,0.00012905318,0.0035849812,0.2576248,0.6766872,0.03476988,0.021364238,0.0005548911,0.0031458642],"about_ca_topic_score_codex":0.030589614,"about_ca_topic_score_gemma":0.0075322995,"teacher_disagreement_score":0.56245464,"about_ca_system_score_codex":0.0011668409,"about_ca_system_score_gemma":0.0011579603,"threshold_uncertainty_score":0.9998232},"labels":[],"label_agreement":null},{"id":"W3087059466","doi":"10.1016/j.artint.2021.103635","title":"CVPR 2020 continual learning in computer vision competition: Approaches, results, current challenges and future directions","year":2021,"lang":"en","type":"preprint","venue":"Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":10,"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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Benchmarking; Computer science; Forgetting; Artificial intelligence; Benchmark (surveying); Task (project management); Field (mathematics); Machine learning; Deep learning; Set (abstract data type); Competition (biology); Engineering","score_opus":0.09943231038043623,"score_gpt":0.3070483565818663,"score_spread":0.20761604620143007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087059466","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.0059309145,0.03406611,0.9405693,0.011329004,0.0050639147,0.00051701546,0.000008468602,0.0004286815,0.0020865977],"genre_scores_gemma":[0.902916,0.04061741,0.0536498,0.0001345757,0.0023007311,0.00007873022,0.00018207931,0.000038954433,0.00008172701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996663,0.00056679,0.00076933,0.001247108,0.0003928186,0.0003609607],"domain_scores_gemma":[0.9985531,0.00028565907,0.00031141,0.00052660896,0.00017329794,0.00014991521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009335476,0.00033841975,0.00044335364,0.00021769541,0.0002455518,0.0006877759,0.0005694231,0.00025123972,0.000022232674],"category_scores_gemma":[0.00010554275,0.00036660166,0.000115547686,0.0003899767,0.00012936331,0.00034417523,0.0011775097,0.0016512506,0.000038595037],"study_design_candidate":"design_other","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.000021708624,0.00014612332,0.000012241012,0.00006542189,0.000013272963,0.000035215584,0.010771811,0.010056731,0.000011078996,0.060350455,0.000024469655,0.9184915],"study_design_scores_gemma":[0.00012358665,0.00018601838,0.0032898476,0.00073265855,0.000015335923,0.00004431402,0.004780219,0.87923557,0.00020436438,0.007992599,0.10259256,0.00080295524],"about_ca_topic_score_codex":0.000037861708,"about_ca_topic_score_gemma":0.0003588687,"teacher_disagreement_score":0.9176885,"about_ca_system_score_codex":0.00007564684,"about_ca_system_score_gemma":0.00013303504,"threshold_uncertainty_score":0.9998786},"labels":[],"label_agreement":null},{"id":"W3186637254","doi":"10.1016/j.artint.2021.103557","title":"Strategic reasoning with a bounded number of resources: The quest for tractability","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; Université de Sherbrooke","keywords":"Bounded function; Model checking; Temporal logic; Turing machine; EXPTIME; Computer science; Theoretical computer science; Path (computing); Time complexity; Computational complexity theory; Boolean satisfiability problem; Computation tree logic; Mathematics; Discrete mathematics; Algorithm; PSPACE; Programming language","score_opus":0.0629153797926646,"score_gpt":0.31340299822789824,"score_spread":0.25048761843523365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186637254","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.43054652,0.00022702091,0.5480469,0.0006545143,0.0002814169,0.0003051201,0.000004709568,0.00009841746,0.019835375],"genre_scores_gemma":[0.98153204,0.000009929948,0.018042326,0.000080029175,0.00010153571,0.00003462489,0.0000020125865,0.00000897454,0.0001885022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984845,0.00013691525,0.00035984901,0.0004676489,0.00023338839,0.0003177064],"domain_scores_gemma":[0.99805456,0.00057086546,0.0001584639,0.00069770496,0.00044531847,0.000073069896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071064103,0.00014681494,0.00020877187,0.00001967139,0.00026238099,0.0002521809,0.0007101696,0.00006534479,0.000058523012],"category_scores_gemma":[0.00031975683,0.00009595983,0.000103831626,0.0005299093,0.0002548581,0.00021983116,0.000108796994,0.00015530852,0.000035353252],"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.00004091387,0.00017687697,0.0009217216,0.000027096534,0.000020793017,0.000009894709,0.0042319484,0.000082741404,0.00063474244,0.9788215,0.00001887431,0.015012903],"study_design_scores_gemma":[0.00009138335,0.00030773022,0.0012104787,0.0001413299,0.00004372843,0.00012578211,0.005156644,0.05483687,0.16655582,0.7673519,0.0037060152,0.00047229542],"about_ca_topic_score_codex":0.00013976615,"about_ca_topic_score_gemma":0.0009678811,"teacher_disagreement_score":0.5509855,"about_ca_system_score_codex":0.00003197601,"about_ca_system_score_gemma":0.00027247105,"threshold_uncertainty_score":0.39131287},"labels":[],"label_agreement":null},{"id":"W3187649900","doi":"10.1016/j.artint.2021.103574","title":"Pairwise symmetry reasoning for multi-agent path finding search","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pairwise comparison; Scalability; Bounded function; Computer science; Variety (cybernetics); Context (archaeology); Homogeneous space; Theoretical computer science; Node (physics); Path (computing); Symmetry (geometry); Combinatorial explosion; Combinatorial search; Algorithm; Mathematics; Search algorithm; Artificial intelligence; Combinatorics; Beam search; Physics","score_opus":0.1819009405321721,"score_gpt":0.3722673903453196,"score_spread":0.1903664498131475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187649900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008395867,0.00027674562,0.98901665,0.0005005398,0.001158528,0.00023485815,0.000008468245,0.00021733527,0.00019100201],"genre_scores_gemma":[0.29008245,0.000016273945,0.7091469,0.00020820745,0.00016021421,0.00003360232,0.0000091539705,0.000018094355,0.00032508196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763054,0.00013890277,0.00044360332,0.00074899395,0.00038739652,0.0006505778],"domain_scores_gemma":[0.99827135,0.0004505417,0.00009013442,0.0006938155,0.0003042376,0.00018990773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542813,0.00019561798,0.00022968245,0.00012036147,0.00036822332,0.00034019205,0.0008321822,0.00009926865,0.000020237312],"category_scores_gemma":[0.0009166424,0.00020645384,0.00013386118,0.0007902639,0.00006173679,0.0003181955,0.00035122133,0.00024761754,0.00025391515],"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.000017549404,0.00043447592,0.0016219288,0.00008214155,0.00006461637,0.00055251457,0.0053657736,0.02025989,0.008251363,0.3008036,0.0005013739,0.66204476],"study_design_scores_gemma":[0.000035977046,0.000064939384,0.0002947971,0.000096799915,0.0000073048645,0.0000339792,0.0005156669,0.8733076,0.12158246,0.0035318,0.00027614215,0.00025252494],"about_ca_topic_score_codex":0.000044652556,"about_ca_topic_score_gemma":0.000007047141,"teacher_disagreement_score":0.8530477,"about_ca_system_score_codex":0.00010026851,"about_ca_system_score_gemma":0.00022908201,"threshold_uncertainty_score":0.8418943},"labels":[],"label_agreement":null},{"id":"W346395726","doi":"10.1016/j.artint.2008.11.011","title":"A heuristic search approach to planning with temporally extended preferences","year":2008,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"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":"Heuristics; Computer science; Planner; Suite; Heuristic; Automated planning and scheduling; Variety (cybernetics); Metric (unit); Motion planning; Mathematical optimization; Key (lock); Artificial intelligence; Robot; Mathematics; Engineering","score_opus":0.1390512601965133,"score_gpt":0.30582560529783703,"score_spread":0.16677434510132375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W346395726","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.075986,0.00009829692,0.91579086,0.00033512214,0.000104752944,0.00024366417,0.0000021353633,0.00026161436,0.007177539],"genre_scores_gemma":[0.84533805,0.0000032528228,0.1540955,0.00026510315,0.000067344874,0.000029452138,0.0000043546565,0.000011831441,0.00018508684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978497,0.00011123578,0.0003398629,0.0006618635,0.0005076062,0.0005297469],"domain_scores_gemma":[0.99878883,0.00021737989,0.000072180264,0.00052723853,0.00015675022,0.00023763563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708209,0.00021272834,0.00021355008,0.00018360153,0.00047636885,0.00019531314,0.001089028,0.00006540529,0.000011795624],"category_scores_gemma":[0.000080897196,0.00017410923,0.0000388734,0.00087166723,0.00012337879,0.00033231327,0.00017827265,0.0002938277,0.00021996452],"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.0005278434,0.0011790154,0.019416828,0.0001662757,0.00014374741,0.00094301475,0.083951734,0.40676713,0.0021031285,0.25319517,0.0036836728,0.22792247],"study_design_scores_gemma":[0.00014359516,0.002833643,0.007347927,0.0005772906,0.000026997386,0.0007094659,0.0026484767,0.88736665,0.05020164,0.043968633,0.0019312446,0.0022444248],"about_ca_topic_score_codex":0.00019970338,"about_ca_topic_score_gemma":0.00000830485,"teacher_disagreement_score":0.7693521,"about_ca_system_score_codex":0.00002955706,"about_ca_system_score_gemma":0.00023224614,"threshold_uncertainty_score":0.7099968},"labels":[],"label_agreement":null},{"id":"W4211243918","doi":"10.1016/s0004-3702(03)00061-4","title":"Editorial","year":2003,"lang":"es","type":"editorial","venue":"Artificial Intelligence","topic":"","field":"","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":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.03914407820526416,"score_gpt":0.3292292508103948,"score_spread":0.2900851726051306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211243918","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054163727,0.00038252215,0.002551855,0.00009875057,0.9816588,0.001247623,0.001609236,0.000518227,0.01187883],"genre_scores_gemma":[0.0012492441,0.00059584493,0.000489627,0.00004607068,0.9936781,0.00016149986,0.0006372024,0.0008057674,0.0023366553],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.984335,0.0012394538,0.0032091888,0.0030872978,0.005516512,0.0026125282],"domain_scores_gemma":[0.9885641,0.0033252456,0.0015713355,0.0026119421,0.0030287297,0.0008986862],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0037120758,0.0020965321,0.001919371,0.0008119541,0.0009216068,0.0016481535,0.002743748,0.005014091,0.0045306473],"category_scores_gemma":[0.01717713,0.0023586822,0.0009882012,0.0022604046,0.0014811674,0.0006949805,0.00047201954,0.0050028195,0.23345628],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0007242742,0.0007413364,0.000004604547,0.00012889116,0.0002504687,0.000045856654,0.0004259897,0.0002464101,0.0023281078,0.024897488,0.96051186,0.009694721],"study_design_scores_gemma":[0.00006487522,0.00051392865,2.872649e-7,0.00035717804,0.0004084233,0.0000040971518,0.00033913966,0.00022712348,0.023469683,0.034077756,0.93833506,0.002202473],"about_ca_topic_score_codex":0.00092128996,"about_ca_topic_score_gemma":0.00031298512,"teacher_disagreement_score":0.22892563,"about_ca_system_score_codex":0.0012958626,"about_ca_system_score_gemma":0.0028632598,"threshold_uncertainty_score":0.9993882},"labels":[],"label_agreement":null},{"id":"W4226303121","doi":"10.1016/j.artint.2023.103898","title":"On approximating shortest paths in weighted triangular tessellations","year":2023,"lang":"en","type":"preprint","venue":"Artificial Intelligence","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Universidad de Alcalá; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; HORIZON EUROPE Framework Programme; Agencia Estatal de Investigación; Ministerio de Ciencia, Innovación y Universidades","keywords":"Combinatorics; Shortest path problem; Vertex (graph theory); Tessellation (computer graphics); Path (computing); Mathematics; Hexagonal tiling; Space (punctuation); Discrete mathematics; Computer science; Grid; Geometry","score_opus":0.2805005081998962,"score_gpt":0.4009864052137628,"score_spread":0.12048589701386658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226303121","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.35888827,0.0004130744,0.61974365,0.0018258465,0.0038001018,0.0026662378,0.00033001605,0.001254699,0.011078107],"genre_scores_gemma":[0.9874159,0.00008456938,0.010653288,0.000072622504,0.00038945506,0.00022517097,0.000092200986,0.00009059625,0.0009761704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966851,0.00013383622,0.0014783028,0.0006837876,0.00051221566,0.0005067827],"domain_scores_gemma":[0.99566513,0.0029045313,0.0004408519,0.0006955616,0.00021198532,0.00008193077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015907271,0.00038423843,0.00062492664,0.0008530894,0.00014048189,0.00018810951,0.00052032154,0.0003698845,0.00021593775],"category_scores_gemma":[0.0062362887,0.00037350957,0.00018082855,0.0013914156,0.00007665468,0.00008171125,0.0003755639,0.0008988788,0.00038613353],"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.000036079055,0.00039324703,0.000087648645,0.0006130687,0.000050887887,0.0000578017,0.0034826961,0.0034386253,0.0000394437,0.96698654,0.00052419596,0.024289792],"study_design_scores_gemma":[0.000021646138,0.00005214899,0.000018600138,0.00059140363,0.000028010512,0.0000012612333,0.0014036263,0.059659377,0.003672742,0.9341057,0.00006553404,0.0003799416],"about_ca_topic_score_codex":0.000302221,"about_ca_topic_score_gemma":0.000384678,"teacher_disagreement_score":0.62852764,"about_ca_system_score_codex":0.00012553435,"about_ca_system_score_gemma":0.00015804199,"threshold_uncertainty_score":0.9998717},"labels":[],"label_agreement":null},{"id":"W4323266611","doi":"10.1016/j.artint.2023.103897","title":"Temporal logic explanations for dynamic decision systems using anchors and Monte Carlo Tree Search","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Black box; Monte Carlo tree search; Artificial intelligence; Decision tree; Machine learning; Monte Carlo method; State (computer science); Artificial neural network; Tree (set theory); Perception; Control (management); Complex system; Theoretical computer science; Algorithm; Mathematics","score_opus":0.1235831946043025,"score_gpt":0.38312002421067154,"score_spread":0.25953682960636903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323266611","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.15780799,0.00010621372,0.8403348,0.00031959824,0.0008288312,0.00035343255,0.0000062942663,0.00021322852,0.00002965845],"genre_scores_gemma":[0.93579024,0.000022433,0.063950755,0.000021541946,0.000093278984,0.000028240642,0.0000047277886,0.000016607812,0.000072160015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998249,0.000103096885,0.0003921762,0.0005219593,0.00033056745,0.000403235],"domain_scores_gemma":[0.9985428,0.00072711415,0.00009378903,0.00037812573,0.00015659445,0.00010161757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089504366,0.00015694488,0.00019620589,0.0003178343,0.00047125772,0.00031078514,0.0006021157,0.00008674119,0.0000030493334],"category_scores_gemma":[0.0004257413,0.00015237293,0.000057687444,0.000972202,0.000088411674,0.00047106034,0.0003081766,0.00018262609,0.000041940133],"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.0000201813,0.000018128196,0.00046013974,0.000024039999,0.00001138128,0.000020811236,0.0010716507,0.7909108,0.00072442216,0.06254537,0.000043087857,0.14415003],"study_design_scores_gemma":[0.000029699962,0.0000604639,0.00026797492,0.00004573102,0.00000623737,0.000009772506,0.0008555433,0.9840059,0.00021715843,0.0142131755,0.00012024774,0.00016804031],"about_ca_topic_score_codex":0.00043707315,"about_ca_topic_score_gemma":0.00021561685,"teacher_disagreement_score":0.77798223,"about_ca_system_score_codex":0.0000877166,"about_ca_system_score_gemma":0.00006977822,"threshold_uncertainty_score":0.62135875},"labels":[],"label_agreement":null},{"id":"W4377030819","doi":"10.1016/j.artint.2023.103945","title":"Human performance consequences of normative and contrastive explanations: An experiment in machine learning for reliability maintenance","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Mitacs","keywords":"Normative; Computer science; Artificial intelligence; Workload; Task (project management); Reliability (semiconductor); Machine learning; Automation; Advice (programming); Contrast (vision); Baseline (sea); Human–computer interaction; Psychology; Engineering","score_opus":0.07485535456500177,"score_gpt":0.3397358529433857,"score_spread":0.26488049837838396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377030819","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.7481307,0.00008633875,0.24987611,0.0006043201,0.0001686117,0.0007141696,0.000011714609,0.00016396427,0.0002440721],"genre_scores_gemma":[0.99398685,0.00009665569,0.005532967,0.000057557638,0.00002121837,0.00022418145,0.000012189609,0.000012113145,0.000056276327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757916,0.00019368286,0.0008374507,0.00060779543,0.00027980935,0.000502128],"domain_scores_gemma":[0.9983057,0.0005820574,0.0002573781,0.00038283714,0.00036351336,0.00010850979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016033412,0.00021231703,0.00032464837,0.0003276139,0.0003506011,0.00010565157,0.00065092125,0.00007938953,0.00001572653],"category_scores_gemma":[0.00070088153,0.00020816531,0.000052145715,0.0010113016,0.00054577034,0.0011881534,0.00017018407,0.00021635953,0.000029670924],"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.00016274407,0.00040924308,0.006768768,0.0001559073,0.00002656067,0.000022510589,0.035150923,0.07155619,0.07721231,0.72409594,0.000037617563,0.08440127],"study_design_scores_gemma":[0.000042292,0.00051074644,0.0010990277,0.00007331778,0.0000030249182,0.0000031797856,0.005259036,0.5349899,0.3945294,0.06321469,0.00006155797,0.00021383227],"about_ca_topic_score_codex":0.0006662033,"about_ca_topic_score_gemma":0.0005219117,"teacher_disagreement_score":0.6608813,"about_ca_system_score_codex":0.00009048202,"about_ca_system_score_gemma":0.000084533756,"threshold_uncertainty_score":0.8488735},"labels":[],"label_agreement":null},{"id":"W4378469689","doi":"10.1016/j.artint.2023.103950","title":"Conflict-tolerant and conflict-free multi-agent meeting","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"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 Alberta","funders":"Israel Science Foundation; National Sleep Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Heuristics; Task (project management); Mathematical optimization; Computer science; Heuristic; Function (biology); Path (computing); Point (geometry); Operations research; Artificial intelligence; Mathematics; Engineering","score_opus":0.15850144781698802,"score_gpt":0.3451729614154096,"score_spread":0.18667151359842157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378469689","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.010938832,0.00018234874,0.9818825,0.0036885417,0.00049624173,0.00035507767,0.000005570766,0.000614437,0.0018364104],"genre_scores_gemma":[0.9245375,0.0008302621,0.070997134,0.001459956,0.00013992701,0.000071282906,0.000010758178,0.000034300017,0.001918906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832696,0.0000902423,0.0003833225,0.0004602446,0.00031193954,0.0004272785],"domain_scores_gemma":[0.9988161,0.00020183128,0.00007297037,0.00057575834,0.0001480273,0.00018533652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072858634,0.00014449892,0.00015693808,0.00016985653,0.00028094288,0.00034476316,0.0008618166,0.00006358954,0.00004520842],"category_scores_gemma":[0.0003139081,0.00013869963,0.000044614782,0.00075415446,0.00013428215,0.00029931308,0.0006201318,0.0001540932,0.0007339838],"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.000020840542,0.00019500295,0.0005863479,0.00006219914,0.00004825623,0.00011734807,0.021547383,0.03901427,0.011385589,0.63807476,0.0031941761,0.28575385],"study_design_scores_gemma":[0.000052815787,0.000051275318,0.00018546026,0.000027229096,0.000002462448,0.0000057431507,0.00035286503,0.9687486,0.015267343,0.0048288195,0.010278663,0.0001986903],"about_ca_topic_score_codex":0.00011559761,"about_ca_topic_score_gemma":0.000058991645,"teacher_disagreement_score":0.92973435,"about_ca_system_score_codex":0.00001783281,"about_ca_system_score_gemma":0.000044379354,"threshold_uncertainty_score":0.94341224},"labels":[],"label_agreement":null},{"id":"W4385462630","doi":"10.1016/j.artint.2023.103989","title":"Learning reward machines: A study in partially observable reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vector Institute; University of Toronto","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Agencia Nacional de Investigación y Desarrollo; Government of Ontario; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Reinforcement learning; Observable; Computer science; Set (abstract data type); Artificial intelligence; Task (project management); Function (biology); Optimization problem; Representation (politics); Decomposition; Learning automata; Mathematical optimization; Automaton; Machine learning; Mathematics; Algorithm","score_opus":0.08641297792112246,"score_gpt":0.3260962182458153,"score_spread":0.23968324032469285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385462630","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.16838296,0.000014518183,0.82701784,0.00041295937,0.0006477088,0.00062924804,8.705469e-8,0.0009692112,0.001925457],"genre_scores_gemma":[0.9948818,0.0000402415,0.0017606,0.00009517563,0.00008656549,0.0000838156,0.000008110535,0.000030514284,0.0030131675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962094,0.0003721899,0.0009968728,0.0007415404,0.00078878907,0.0008912185],"domain_scores_gemma":[0.99842334,0.00040133696,0.00024484063,0.000660705,0.0001281915,0.00014161652],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002094184,0.0002994337,0.0003382525,0.00046845237,0.0004220884,0.0004494473,0.0013269538,0.00009308235,0.000091166985],"category_scores_gemma":[0.0010601531,0.00031035696,0.00009511101,0.0027417077,0.000063539854,0.0006937476,0.00080298504,0.00083091826,0.0022258621],"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.000018299952,0.00006121002,0.033358257,0.000012811449,0.000016841568,0.00010644226,0.007663286,0.9251564,0.0002581961,0.007792035,0.00003468876,0.02552153],"study_design_scores_gemma":[0.00007223813,0.0008037677,0.0037602312,0.000048376143,0.000006812252,0.0000026363475,0.0028678318,0.98841316,0.0009733525,0.0016674137,0.0010358011,0.00034837992],"about_ca_topic_score_codex":0.00044180793,"about_ca_topic_score_gemma":0.00030596714,"teacher_disagreement_score":0.82649887,"about_ca_system_score_codex":0.00013651018,"about_ca_system_score_gemma":0.00011429001,"threshold_uncertainty_score":0.99993485},"labels":[],"label_agreement":null},{"id":"W4387096360","doi":"10.1016/j.artint.2023.104023","title":"A general framework for preferences in answer set programming","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Generality; Answer set programming; Constraint satisfaction; Theoretical computer science; Constraint programming; Implementation; Set (abstract data type); Preference; Flexibility (engineering); Constraint satisfaction problem; Satisfiability; Programming language; Logic programming; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.11974218036133154,"score_gpt":0.3563576723342461,"score_spread":0.23661549197291454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387096360","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.09041753,0.000094153,0.9065384,0.0005196243,0.0010378694,0.00042921974,0.0000031929742,0.00035899525,0.0006010203],"genre_scores_gemma":[0.9095901,0.000027839764,0.089554094,0.00010952594,0.00028228693,0.00019469969,0.0000067072824,0.000010932812,0.00022381656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834293,0.00005612061,0.0003403525,0.0005115112,0.000188481,0.00056057394],"domain_scores_gemma":[0.9989953,0.00038838031,0.00007207616,0.00036166035,0.00009417102,0.00008841437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058070186,0.00015327761,0.00017893103,0.0001741348,0.00014831594,0.00025943413,0.00086826476,0.000117474694,0.000020426913],"category_scores_gemma":[0.00046291883,0.00013551679,0.00008219485,0.0012871759,0.00007531119,0.00028471157,0.00019025398,0.00017102041,0.00036298065],"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.000008197643,0.000045226898,0.0009198028,0.00001280876,0.0000048876027,0.000008837077,0.0035313328,0.00027138824,0.00009827082,0.6410975,0.00017732687,0.35382444],"study_design_scores_gemma":[0.000020522202,0.00015681869,0.0007466112,0.0000512963,0.000003192219,0.0000023146606,0.00045875483,0.1538136,0.010537852,0.82905525,0.004888696,0.00026510918],"about_ca_topic_score_codex":0.00008290018,"about_ca_topic_score_gemma":0.00036808412,"teacher_disagreement_score":0.81917256,"about_ca_system_score_codex":0.000030410516,"about_ca_system_score_gemma":0.00008091527,"threshold_uncertainty_score":0.5526214},"labels":[],"label_agreement":null},{"id":"W4390815987","doi":"10.1016/j.artint.2024.104075","title":"Corrigendum to “Learning constraints through partial queries” [Artificial Intelligence 319 (2023) 103896]","year":2024,"lang":"en","type":"erratum","venue":"Artificial Intelligence","topic":"Machine Learning and 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":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.06598476562047607,"score_gpt":0.3288429589463709,"score_spread":0.26285819332589483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390815987","genre_codex":"methods","genre_gemma":"other","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.000032004595,0.0010942098,0.837494,0.004501009,0.1257217,0.00076546083,0.000081435996,0.0013702366,0.028939921],"genre_scores_gemma":[0.13058242,0.001829257,0.12855786,0.0065966076,0.046813805,0.001043341,0.0011304652,0.0011468602,0.6822994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9900168,0.00061298464,0.0022933797,0.003232034,0.0017316444,0.002113142],"domain_scores_gemma":[0.9958366,0.00036512926,0.00062736653,0.0019068335,0.0005546154,0.0007094185],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.001582429,0.0014209507,0.0013320481,0.0006626984,0.0010004023,0.0024340923,0.004170644,0.0010960053,0.0020207807],"category_scores_gemma":[0.0016698607,0.0014423411,0.00064103416,0.0029970666,0.000835084,0.0007558973,0.0019358256,0.005678528,0.020277776],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003545799,0.00015603266,0.0000036008244,0.00014540806,0.0001155183,0.0004632011,0.004645778,0.0026458432,0.00011778127,0.29420328,0.2039273,0.4935408],"study_design_scores_gemma":[0.000011266233,0.00063789217,0.0000026233547,0.0007068855,0.000085165026,0.000094581024,0.0011867069,0.21406987,0.0068363803,0.10151115,0.67301244,0.0018450428],"about_ca_topic_score_codex":0.0012801518,"about_ca_topic_score_gemma":0.00045307714,"teacher_disagreement_score":0.70893615,"about_ca_system_score_codex":0.00031855216,"about_ca_system_score_gemma":0.0013024325,"threshold_uncertainty_score":0.999854},"labels":[],"label_agreement":null},{"id":"W4391617321","doi":"10.1016/j.artint.2024.104095","title":"Primarily about primaries","year":2024,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Voting; Condorcet method; Bullet voting; Approval voting; Converse; Cardinal voting systems; Computer science; Anti-plurality voting; Ranked voting system; Quality (philosophy); Distortion (music); Political science; Politics; Mathematics; Law","score_opus":0.07772587154186397,"score_gpt":0.27459328879420036,"score_spread":0.1968674172523364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391617321","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.18857712,0.021827195,0.4610217,0.0027393447,0.010055439,0.00062727847,0.00015136298,0.0010827545,0.31391782],"genre_scores_gemma":[0.99642056,0.000048107566,0.00039628916,0.0001581061,0.000359731,0.000017454437,0.0000054552643,0.000023852206,0.0025704575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864787,0.000019255449,0.0006232473,0.00040911025,0.0000362452,0.00026426022],"domain_scores_gemma":[0.999417,0.00014587227,0.000084163024,0.0002712814,0.000021328377,0.00006035864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009134585,0.00013100103,0.00022966297,0.00015497225,0.00011324575,0.0003455426,0.00023854159,0.00008111792,0.0007409913],"category_scores_gemma":[0.00018889838,0.00014154249,0.00010819729,0.00033103407,0.00012534595,0.00023754123,0.000049550283,0.00017136648,0.012200469],"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.000007757347,0.00002342414,0.00043353444,0.0000520314,0.00002212999,0.000009056954,0.00080571795,0.000054319662,0.00012389036,0.97572863,0.0002818824,0.022457646],"study_design_scores_gemma":[0.0000067195006,0.000044763132,0.00034863222,0.000063646345,0.000004174967,0.000008293002,0.000153594,0.0068310713,0.004802881,0.9007219,0.086779594,0.0002347468],"about_ca_topic_score_codex":0.00015042938,"about_ca_topic_score_gemma":0.000020479796,"teacher_disagreement_score":0.80784345,"about_ca_system_score_codex":0.000056627876,"about_ca_system_score_gemma":0.000025038411,"threshold_uncertainty_score":0.98856866},"labels":[],"label_agreement":null},{"id":"W4400451734","doi":"10.1016/j.artint.2024.104177","title":"Class fairness in online matching","year":2024,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Precursory Research for Embryonic Science and Technology; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matching (statistics); Class (philosophy); Computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.2307543031709243,"score_gpt":0.4646650782267826,"score_spread":0.2339107750558583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400451734","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.32949677,0.00014417824,0.6613617,0.004344168,0.00079321285,0.00012297946,0.000017636818,0.00012274127,0.0035966274],"genre_scores_gemma":[0.9977655,0.000010331996,0.0005270999,0.00017487744,0.000181644,0.000015454732,0.0000033552487,0.00000796903,0.0013137956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983128,0.00009997914,0.0005977074,0.00041874347,0.00039449648,0.00017629852],"domain_scores_gemma":[0.99846655,0.0010247229,0.00004582676,0.00033556484,0.000070968395,0.00005637028],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015053981,0.00008700194,0.000121696416,0.00025611543,0.00010492046,0.0003188967,0.00048238243,0.0000534517,0.0010480857],"category_scores_gemma":[0.00045300202,0.000068938636,0.00006628803,0.0015539911,0.0001157191,0.00030955643,0.000074779455,0.00021261,0.0045872154],"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.0000055138403,0.000042224237,0.000038555223,0.0000016193192,0.000001504458,0.000007907481,0.0007621334,0.0025925555,0.0010710917,0.6495033,0.00016892639,0.3458047],"study_design_scores_gemma":[0.0000030258773,0.000009097828,0.0001542806,0.000020564548,0.0000018057378,0.0000057701905,0.0044207177,0.032026228,0.0075953435,0.94047177,0.0152058005,0.00008560676],"about_ca_topic_score_codex":0.00007201797,"about_ca_topic_score_gemma":0.00051152136,"teacher_disagreement_score":0.66826874,"about_ca_system_score_codex":0.00003085966,"about_ca_system_score_gemma":0.000046626883,"threshold_uncertainty_score":0.9998651},"labels":[],"label_agreement":null},{"id":"W4400767383","doi":"10.1016/j.artint.2024.104181","title":"Planning with mental models – Balancing explanations and explicability","year":2024,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Office of Naval Research; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; National Sleep Foundation; National Aeronautics and Space Administration; Natural Sciences and Engineering Research Council of Canada; International Business Machines Corporation; National Science Foundation","keywords":"Mental model; Computer science; Psychology; Cognitive science; Artificial intelligence","score_opus":0.06438478467350495,"score_gpt":0.29834073968319663,"score_spread":0.23395595500969169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400767383","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.048960768,0.000690083,0.947384,0.0011229845,0.00020846327,0.00011270167,0.0000050267427,0.0003254347,0.0011905117],"genre_scores_gemma":[0.97412384,0.000009457092,0.025649099,0.000101258964,0.000048238628,0.000018643883,0.0000045224583,0.000008207552,0.000036755573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988871,0.000037006437,0.00020481805,0.00044365553,0.00018870564,0.00023869703],"domain_scores_gemma":[0.99933755,0.00026691344,0.00002728427,0.0002458366,0.000034865545,0.000087575354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003652059,0.00012378072,0.00010129512,0.00009440503,0.00024368898,0.00041801232,0.00026392512,0.000039539533,0.000011386297],"category_scores_gemma":[0.000019362786,0.00010429471,0.00002302257,0.00034550112,0.000061688064,0.00075068313,0.000093166505,0.00017166747,0.000030266192],"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.000020733272,0.000045916444,0.0010395827,0.00007209628,0.00003672951,0.00010199731,0.024391333,0.049073294,0.0014490815,0.7039213,0.0004275615,0.21942036],"study_design_scores_gemma":[0.000007781899,0.00006690688,0.000046119138,0.00015679967,0.0000046881196,0.000034948804,0.00045627993,0.91575587,0.0054599657,0.077473015,0.00037730095,0.00016032807],"about_ca_topic_score_codex":0.00007339355,"about_ca_topic_score_gemma":0.000018820932,"teacher_disagreement_score":0.92516303,"about_ca_system_score_codex":0.00003311976,"about_ca_system_score_gemma":0.00006286878,"threshold_uncertainty_score":0.4253015},"labels":[],"label_agreement":null},{"id":"W4405942492","doi":"10.1016/j.artint.2024.104273","title":"A semantic framework for neurosymbolic computation","year":2024,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Neural Networks and Applications","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","funders":"","keywords":"Computer science; Artificial intelligence; Computation; Natural language processing; Programming language","score_opus":0.07593160393922248,"score_gpt":0.35936569587295397,"score_spread":0.2834340919337315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405942492","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.0028796056,0.00018439816,0.9898989,0.0053830408,0.0008903662,0.00027512925,0.0000026119658,0.0003624241,0.00012352107],"genre_scores_gemma":[0.92690104,0.000019490777,0.07224936,0.000421197,0.000279541,0.00007377247,0.0000025187223,0.000010444574,0.000042621105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906945,0.000017108187,0.00022115232,0.00037020218,0.000109876135,0.00021219789],"domain_scores_gemma":[0.99915403,0.00048290277,0.000027050504,0.0002310919,0.000048509984,0.000056396875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012147343,0.00009259692,0.000083797604,0.00006223039,0.00014708153,0.0004477756,0.0003869169,0.000042863434,0.0000074324953],"category_scores_gemma":[0.0000411067,0.00008607234,0.00007284895,0.0006194909,0.00003564663,0.00022065669,0.000065591754,0.000120726225,0.0002653386],"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":[9.0986384e-7,0.000013859977,0.0000010872369,0.000010165867,0.0000025638535,0.000002245793,0.00012587477,0.0019235316,0.00049250846,0.7137041,0.00030020744,0.28342292],"study_design_scores_gemma":[0.0000015049322,0.00002289781,0.000008123531,0.00002126124,0.0000026276477,0.000003632632,0.0000076406595,0.49954274,0.004474409,0.49380893,0.0020473206,0.000058920043],"about_ca_topic_score_codex":0.00000780971,"about_ca_topic_score_gemma":0.0000059469653,"teacher_disagreement_score":0.9240214,"about_ca_system_score_codex":0.000011488223,"about_ca_system_score_gemma":0.000027688597,"threshold_uncertainty_score":0.43179104},"labels":[],"label_agreement":null},{"id":"W4412702220","doi":"10.1016/j.artint.2025.104395","title":"Interpreting capsule networks for image classification by routing path visualization","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Guelph","funders":"Institut national des sciences de l'Univers; Canadian Electricity Association; National Research Council; National Research Council Canada; Compute Canada; University of Hawai'i","keywords":"Computer science; Visualization; Path (computing); Artificial intelligence; Routing (electronic design automation); Pattern recognition (psychology); Computer network","score_opus":0.055344944166872245,"score_gpt":0.347001983606144,"score_spread":0.29165703943927174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412702220","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.01503797,0.00002361465,0.97926766,0.0010519933,0.0007917855,0.0004961929,0.000010806837,0.00022793369,0.0030920673],"genre_scores_gemma":[0.9976467,0.00002405512,0.00045086333,0.0011154214,0.00008365851,0.00014164005,0.000022589133,0.000019663485,0.00049539586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983332,0.00014929134,0.0005304552,0.0005461678,0.00014626919,0.00029457588],"domain_scores_gemma":[0.99895567,0.00039019118,0.00021398377,0.0002582707,0.0001303562,0.000051515126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047643145,0.00014806497,0.00012961678,0.00010710138,0.00045775028,0.00022682421,0.00026062748,0.00009909102,0.000045662633],"category_scores_gemma":[0.0021095392,0.00015928007,0.0000741509,0.0006996389,0.00013243886,0.0002524123,0.00004154971,0.00014988171,0.000050887196],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000029726862,0.00006422581,0.0000154475,0.000011144398,0.0000021155654,2.9852643e-7,0.00018264253,0.00017323584,0.7109028,0.20613463,0.001171821,0.08131191],"study_design_scores_gemma":[0.000017447028,0.000023341774,0.00002459023,0.00002827337,0.000005860485,9.2443435e-7,0.0004319101,0.48596787,0.5066111,0.0056852223,0.0011097497,0.000093715134],"about_ca_topic_score_codex":0.000017398206,"about_ca_topic_score_gemma":0.000009015909,"teacher_disagreement_score":0.98260874,"about_ca_system_score_codex":0.000106914726,"about_ca_system_score_gemma":0.000039488998,"threshold_uncertainty_score":0.6495253},"labels":[],"label_agreement":null},{"id":"W4413883207","doi":"10.1016/j.artint.2025.104407","title":"Abstracting situation calculus action theories","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University; UK Research and Innovation","keywords":"Situation calculus; Action (physics); Calculus (dental); Computer science; Cognitive science; Mathematics; Artificial intelligence; Psychology; Medicine","score_opus":0.05888960173923377,"score_gpt":0.3409720854442167,"score_spread":0.2820824837049829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413883207","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.01759631,0.000082415805,0.9732741,0.0016672721,0.00089683186,0.00008241987,6.172414e-7,0.00022752336,0.0061724843],"genre_scores_gemma":[0.9898904,0.000007025509,0.009435349,0.00025721904,0.00007103924,0.000008463342,0.0000026048867,0.0000034668096,0.00032445203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990287,0.000060579627,0.00026856764,0.0002813602,0.00014629329,0.0002145134],"domain_scores_gemma":[0.99912536,0.0003720405,0.00008630777,0.00028384026,0.00009706816,0.00003537942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052212935,0.000098519755,0.000089232235,0.00011133357,0.00034189882,0.00024885288,0.00037889846,0.00006430368,0.0000238032],"category_scores_gemma":[0.00025385237,0.00009753888,0.000041085823,0.00049618457,0.00004120176,0.00046972974,0.000078865305,0.00017736181,0.00017300683],"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.000006516392,0.000017682241,0.00012483909,0.00000852182,0.000006166903,0.0000030017782,0.0008188078,0.003859821,0.0024748184,0.5718586,0.0000935323,0.42072773],"study_design_scores_gemma":[0.000012503045,0.00003659232,0.00036507877,0.00007831251,0.000007998549,0.0000035469923,0.000627225,0.29282477,0.2756923,0.42895952,0.0012097622,0.00018235158],"about_ca_topic_score_codex":0.00018245218,"about_ca_topic_score_gemma":0.00007349178,"teacher_disagreement_score":0.9722941,"about_ca_system_score_codex":0.00004337826,"about_ca_system_score_gemma":0.00008506732,"threshold_uncertainty_score":0.39775202},"labels":[],"label_agreement":null},{"id":"W4413923498","doi":"10.1016/j.artint.2025.104408","title":"Incentives for responsiveness, instrumental control and impact","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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":"Open Philanthropy Project","keywords":"Incentive; Instrumental variable; Control (management); Computer science; Business; Econometrics; Economics; Artificial intelligence; Microeconomics; Machine learning","score_opus":0.03386361560293745,"score_gpt":0.33617515161292216,"score_spread":0.3023115360099847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413923498","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.0801932,0.0001928933,0.91761523,0.001192581,0.00026641678,0.00022666548,0.000008724769,0.000069430636,0.00023486344],"genre_scores_gemma":[0.99053556,0.000026180742,0.008910925,0.0004057047,0.000025997833,0.000032356817,0.0000012732518,0.0000037901789,0.000058199406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.000056853343,0.00024103772,0.00034417395,0.000089784364,0.00024592225],"domain_scores_gemma":[0.99923635,0.0002896791,0.00004881508,0.00024335869,0.00011779955,0.00006402486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032039025,0.00012249118,0.0001496821,0.000109172935,0.00019008436,0.00022065177,0.0003949002,0.000055223398,0.0000046795763],"category_scores_gemma":[0.00014751176,0.000109579996,0.00006220847,0.00028168308,0.00011732066,0.00030826032,0.00010633405,0.000084098014,0.000012204452],"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.000112975526,0.00004091195,0.00047898307,0.0000095977375,0.000021613092,0.0000014679815,0.00020005631,0.00016123419,0.004614263,0.63527,0.000068101996,0.3590208],"study_design_scores_gemma":[0.00009599147,0.0002047044,0.0017379052,0.00006474466,0.00001259119,0.000004040893,0.00015162177,0.43310556,0.04794339,0.5161138,0.0003582518,0.00020738457],"about_ca_topic_score_codex":0.00007045293,"about_ca_topic_score_gemma":0.000020050771,"teacher_disagreement_score":0.9103424,"about_ca_system_score_codex":0.000036749767,"about_ca_system_score_gemma":0.00013698002,"threshold_uncertainty_score":0.44685426},"labels":[],"label_agreement":null},{"id":"W4417137941","doi":"10.1016/j.artint.2025.104468","title":"Is DIBBS a DXBB algorithm?","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science, Technology and Space; Israel Science Foundation; Israel National Road Safety Authority; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"","score_opus":0.034249568538827324,"score_gpt":0.3096793767285582,"score_spread":0.2754298081897309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417137941","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.00019943429,0.000046197398,0.97985995,0.0043401853,0.00076519436,0.00010401423,0.0000019022287,0.00017388738,0.014509239],"genre_scores_gemma":[0.78268105,0.000075521195,0.21051875,0.004594244,0.0000780187,0.000023305316,0.0000025968125,0.000007020466,0.0020195202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909824,0.000029207256,0.00025113754,0.00030351334,0.00013952519,0.00017840482],"domain_scores_gemma":[0.9993877,0.00007194935,0.000042980493,0.0003452467,0.000103273975,0.0000488953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013908504,0.00009230969,0.00008925116,0.00014242117,0.00014817332,0.00018366816,0.0004097584,0.000050435003,0.0003395635],"category_scores_gemma":[0.000052990617,0.00009436836,0.0000550049,0.00073344074,0.00005048436,0.00028655643,0.00012032312,0.000095773736,0.00038387973],"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":[9.731366e-7,0.000016928909,0.00009588599,0.0000017766894,0.0000050194003,0.0000017340068,0.00021593705,0.00018028743,0.00007374627,0.27668914,0.0005223876,0.7221962],"study_design_scores_gemma":[0.000016942075,0.000022834769,0.0005304174,0.000017948869,0.0000050546587,0.0000036999977,0.00012064955,0.75998104,0.047394536,0.18439832,0.007345835,0.00016275437],"about_ca_topic_score_codex":0.00004834362,"about_ca_topic_score_gemma":0.000028044666,"teacher_disagreement_score":0.7824816,"about_ca_system_score_codex":0.00003371318,"about_ca_system_score_gemma":0.000082980354,"threshold_uncertainty_score":0.49341252},"labels":[],"label_agreement":null}]}