{"meta":{"query_hash":"43498212310d","filters":{"venue":"Proceedings of the International Conference on Automated Planning and Scheduling"},"cohort_total":93,"direct_labels_cover":0,"predictions_cover":93,"exported":93,"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/43498212310d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+International+Conference+on+Automated+Planning+and+Scheduling"},"results":[{"id":"W112889630","doi":"10.1609/icaps.v21i1.13450","title":"Scheduling an Aircraft Repair Shop","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Schedule; Scheduling (production processes); Constraint programming; Computer science; Benders' decomposition; Job shop scheduling; Mathematical optimization; Heuristic; Operations research; Context (archaeology); Engineering; Stochastic programming; Mathematics; Algorithm","score_opus":0.04964498439739254,"score_gpt":0.2694260334571725,"score_spread":0.21978104905977994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112889630","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.97639436,0.00009048735,0.0010596683,0.000105974694,0.00061838346,0.00010514477,0.000007621754,0.0019411518,0.019677218],"genre_scores_gemma":[0.8924217,0.000024611942,0.107314005,0.000065988934,0.00007105775,0.0000096378935,0.0000052362766,0.000029561896,0.00005816178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988489,0.000006827923,0.0003467258,0.0002654215,0.0003183357,0.00021378318],"domain_scores_gemma":[0.9993261,0.000027347472,0.00012434156,0.00010724644,0.00031542635,0.000099545534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032008358,0.00020758176,0.00018984282,0.00017719346,0.00012973805,0.00010657967,0.0004626233,0.00012563614,0.000059672842],"category_scores_gemma":[0.00013779709,0.00017330755,0.000070406044,0.00017980993,0.00007065884,0.0003185974,0.00007069742,0.00031832157,0.0000064346805],"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.0004979896,0.0004977089,0.119161196,0.0005973656,0.0012152107,0.000021403865,0.023951026,0.6334053,0.083887175,0.13113551,0.0005375395,0.0050925105],"study_design_scores_gemma":[0.0002497997,0.000049269926,0.0022532789,0.00043013223,0.000020476633,0.000019676292,0.0017302816,0.97969854,0.014778332,0.00055311964,0.000012086479,0.0002049843],"about_ca_topic_score_codex":0.000009439912,"about_ca_topic_score_gemma":4.6066577e-7,"teacher_disagreement_score":0.3462932,"about_ca_system_score_codex":0.00003249082,"about_ca_system_score_gemma":0.000026224085,"threshold_uncertainty_score":0.7067277},"labels":[],"label_agreement":null},{"id":"W1487826456","doi":"10.1609/icaps.v23i1.13563","title":"Using Alternative Suboptimality Bounds in Heuristic Search","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Bounded function; Mathematical optimization; Heuristic; Upper and lower bounds; Computer science; Mathematics; Construct (python library); Constant (computer programming); Algorithm; Artificial intelligence","score_opus":0.0787746973012493,"score_gpt":0.32667422913694777,"score_spread":0.24789953183569846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487826456","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.98323274,0.000010610249,0.010591615,0.0014074907,0.00020638443,0.00013319122,0.000002018326,0.00012053191,0.0042954106],"genre_scores_gemma":[0.9782059,0.0000060448333,0.021637024,0.00008654541,0.000016116484,0.000005567767,9.2159627e-7,0.0000043796604,0.000037456823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.000013075137,0.0002451078,0.00023462156,0.0003138908,0.00014497754],"domain_scores_gemma":[0.99932086,0.000054073447,0.00015180132,0.000063226595,0.0003674468,0.00004256878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028744122,0.000103426406,0.000116924064,0.00017845385,0.000093714676,0.00035669951,0.00049048604,0.000047329973,0.000027417605],"category_scores_gemma":[0.00013379821,0.0000841885,0.000026520967,0.00020998777,0.00006691858,0.0004935691,0.00016788095,0.00020514145,0.000003273328],"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.00006409311,0.00015462935,0.34595567,0.0001062773,0.000119797165,0.000005604652,0.006096867,0.14976339,0.07484358,0.4158812,0.00012283471,0.0068860864],"study_design_scores_gemma":[0.0001966779,0.000016409567,0.037986673,0.00025781314,0.0000019949798,0.000014639185,0.00030900055,0.9554708,0.003096289,0.002562196,0.0000019397798,0.00008556988],"about_ca_topic_score_codex":0.0001736518,"about_ca_topic_score_gemma":0.0000012038596,"teacher_disagreement_score":0.8057074,"about_ca_system_score_codex":0.00006140693,"about_ca_system_score_gemma":0.00005773113,"threshold_uncertainty_score":0.34396616},"labels":[],"label_agreement":null},{"id":"W1537738406","doi":"10.1609/icaps.v20i1.13426","title":"Computer-Aided Algorithm Design: Automated Tuning, Configuration, Selection, and Beyond","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Structuring; Intuition; Integer programming; Scheduling (production processes); Selection (genetic algorithm); Mathematical optimization; Algorithm; Machine learning; Mathematics","score_opus":0.029888213250378406,"score_gpt":0.2744444472290716,"score_spread":0.24455623397869317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537738406","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.18886605,0.000094448216,0.79849976,0.0067429026,0.00086298614,0.00025697466,0.000009481358,0.0019099117,0.0027574725],"genre_scores_gemma":[0.75285375,0.00002550052,0.24669884,0.0002910717,0.000034423214,0.00000573084,0.0000058240194,0.0000070728984,0.00007777902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886423,0.000025262556,0.0003054737,0.00034908,0.000312884,0.00014309288],"domain_scores_gemma":[0.9986392,0.00009107521,0.00025930605,0.0000676336,0.0008769302,0.00006585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029177734,0.00015145956,0.00016218908,0.00014340677,0.00025219997,0.0005390206,0.0002941995,0.00008275688,0.000017543514],"category_scores_gemma":[0.00014905469,0.00013308173,0.000030315892,0.00030242716,0.00005967258,0.00045897544,0.0001621509,0.00018301926,0.0000015776651],"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.0001210327,0.00032573976,0.03668813,0.00020905292,0.00079617376,0.000030243447,0.009453237,0.09787554,0.23139556,0.53054327,0.0062359297,0.08632609],"study_design_scores_gemma":[0.00035094767,0.0000448825,0.0052830763,0.0002079856,0.000009875622,0.00016143633,0.00022123163,0.97986805,0.012578785,0.0010959443,0.000038106304,0.00013967254],"about_ca_topic_score_codex":0.0000058555142,"about_ca_topic_score_gemma":6.712022e-7,"teacher_disagreement_score":0.8819925,"about_ca_system_score_codex":0.000033839675,"about_ca_system_score_gemma":0.00012851713,"threshold_uncertainty_score":0.5426915},"labels":[],"label_agreement":null},{"id":"W155860189","doi":"10.1609/icaps.v22i1.13537","title":"Optimally Relaxing Partial-Order Plans with MaxSAT","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Order (exchange); Minification; Operations research; Artificial intelligence; Mathematics","score_opus":0.03352342834652276,"score_gpt":0.2690857539899184,"score_spread":0.23556232564339563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155860189","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.96754396,0.0001312508,0.011661201,0.0026093689,0.00042634213,0.00013553258,0.000007226659,0.0005888224,0.016896322],"genre_scores_gemma":[0.94032454,0.000006290812,0.059280515,0.00018616293,0.000064563705,0.0000087546905,0.00000299608,0.000011766813,0.00011442269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867934,0.000012031239,0.00025949988,0.00027613068,0.00044607086,0.00032689815],"domain_scores_gemma":[0.9991172,0.000104513514,0.00028716898,0.00010691315,0.00028255364,0.00010163185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005740006,0.00018840532,0.00017263298,0.00012500604,0.00023228447,0.00029586945,0.0008087458,0.000083751744,0.000009593882],"category_scores_gemma":[0.00013627298,0.00013083273,0.000033747572,0.00022404648,0.000060535385,0.0006227318,0.00020139058,0.00032559197,0.0000057010348],"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.00031832844,0.0001951788,0.41951674,0.00019151047,0.00037451446,0.000010294419,0.0127385175,0.028010882,0.03566195,0.4993568,0.001025953,0.00259934],"study_design_scores_gemma":[0.00043909845,0.00012548149,0.009351161,0.0015094194,0.000021022537,0.00011103106,0.000580235,0.97486496,0.011841902,0.0005710142,0.00027123417,0.0003134683],"about_ca_topic_score_codex":0.000014641221,"about_ca_topic_score_gemma":2.9802231e-7,"teacher_disagreement_score":0.94685405,"about_ca_system_score_codex":0.00002773129,"about_ca_system_score_gemma":0.00006645659,"threshold_uncertainty_score":0.5335204},"labels":[],"label_agreement":null},{"id":"W1585557683","doi":"10.1609/icaps.v22i1.13505","title":"Planning Modulo Theories: Extending the Planning Paradigm","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Planner; Computer science; Modular design; Heuristic; Scope (computer science); Syntax; Answer set programming; Automated planning and scheduling; Programming language; Theoretical computer science; Artificial intelligence; Set (abstract data type); Mathematics; Discrete mathematics","score_opus":0.04438401684249059,"score_gpt":0.3012732997910121,"score_spread":0.2568892829485215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585557683","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.9594037,0.0015794351,0.015908884,0.0041653765,0.0015364733,0.00026786551,0.000010795701,0.0009174102,0.016210046],"genre_scores_gemma":[0.9911872,0.000012917843,0.008051583,0.00037670985,0.00020769222,0.000020859658,0.0000041636413,0.000020845264,0.00011803687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978535,0.00003917639,0.00046730542,0.0004099391,0.0006721712,0.0005578747],"domain_scores_gemma":[0.9984699,0.0004514495,0.0005326263,0.00021406866,0.00019761658,0.0001343748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015564145,0.0003160551,0.00027548874,0.00020362958,0.00072897744,0.00063476147,0.0017988635,0.00013330577,0.000010282099],"category_scores_gemma":[0.0003824864,0.00020571303,0.000093150906,0.0003452545,0.00013542775,0.0008988867,0.00045765855,0.000648117,0.0000065703025],"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.0001015674,0.00007173033,0.1509589,0.00009404849,0.00021800626,0.0000062256963,0.021331068,0.022988483,0.00945764,0.79206055,0.0009114282,0.001800332],"study_design_scores_gemma":[0.00039332765,0.00008021648,0.01431891,0.0025086368,0.0000317426,0.00013587365,0.0028749255,0.95803946,0.006884391,0.013778621,0.0005132091,0.00044066977],"about_ca_topic_score_codex":0.000016116433,"about_ca_topic_score_gemma":6.48956e-8,"teacher_disagreement_score":0.93505096,"about_ca_system_score_codex":0.00005560907,"about_ca_system_score_gemma":0.000066730376,"threshold_uncertainty_score":0.83887345},"labels":[],"label_agreement":null},{"id":"W1797158199","doi":"10.1609/icaps.v19i1.13364","title":"Improving Planning Performance Using Low-Conflict Relaxed Plans","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Government","keywords":"Satisficing; Computer science; Heuristic; Plan (archaeology); Executable; Exploit; Mathematical optimization; Heuristics; Domain (mathematical analysis); State (computer science); Relaxation (psychology); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.042858574521779845,"score_gpt":0.2841194638274261,"score_spread":0.24126088930564624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797158199","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.98853534,0.00011347328,0.005087791,0.00085241435,0.00037566276,0.00013103157,0.0000059376803,0.0005687815,0.004329566],"genre_scores_gemma":[0.97507995,0.000008066179,0.024418635,0.00032722246,0.000073740346,0.0000033414758,0.0000035406022,0.000012452431,0.000073033756],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981476,0.000014354157,0.00045582405,0.00047576663,0.0005340535,0.0003723754],"domain_scores_gemma":[0.99883085,0.00009949333,0.0005162562,0.00015485386,0.00030053753,0.00009800033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006407453,0.00027228132,0.00026326315,0.0002536894,0.00042001266,0.00048235807,0.0012767202,0.00014004785,0.000004140451],"category_scores_gemma":[0.00019353356,0.00022165618,0.00006870811,0.00028878442,0.00005800109,0.0006948034,0.00020276602,0.00051693566,0.0000026688688],"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.00047616684,0.00022275394,0.15204704,0.0004460452,0.00026798874,0.000037841397,0.015129634,0.17349029,0.54473394,0.094397,0.00055510725,0.01819618],"study_design_scores_gemma":[0.00035946682,0.00010975462,0.0074705873,0.0021794445,0.000012921919,0.00006909668,0.00025918742,0.9694668,0.019352324,0.00043133658,0.000023813544,0.0002652568],"about_ca_topic_score_codex":0.000018989138,"about_ca_topic_score_gemma":9.0092534e-8,"teacher_disagreement_score":0.7959765,"about_ca_system_score_codex":0.00006113448,"about_ca_system_score_gemma":0.00010454334,"threshold_uncertainty_score":0.9038877},"labels":[],"label_agreement":null},{"id":"W1872977731","doi":"10.1609/icaps.v23i1.13579","title":"Linear Fitted-Q Iteration with Multiple Reward Functions","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Triangulation; Computer science; Mathematical optimization; Function (biology); Markov decision process; Construct (python library); Field (mathematics); Bellman equation; Reduction (mathematics); Algorithm; Mathematics; Artificial intelligence; Statistics; Markov process; Geometry","score_opus":0.21884345960269017,"score_gpt":0.37506491524088736,"score_spread":0.1562214556381972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872977731","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.9725165,0.00006518036,0.0005407047,0.01864858,0.00026800993,0.00029730762,0.00004834433,0.00014683923,0.0074685654],"genre_scores_gemma":[0.99277866,0.00000646939,0.005211,0.0012671845,0.00010196178,0.000055421107,0.000015651796,0.000013810231,0.0005498266],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840677,0.0000135854725,0.0010031948,0.00028957543,0.00012858293,0.00015829326],"domain_scores_gemma":[0.99833304,0.00019007376,0.001006307,0.00008867698,0.0003171947,0.00006473391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013924732,0.00012849142,0.00028307654,0.00018494834,0.00018512298,0.00019452516,0.00024752237,0.00007956833,0.00013016009],"category_scores_gemma":[0.0012420297,0.000111301146,0.0000391628,0.000112472044,0.000054439126,0.0004848775,0.00004634193,0.00018324227,0.00013940863],"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.00011122093,0.0001421833,0.83637184,0.0003109379,0.00030078585,4.323265e-7,0.004708079,0.008003264,0.0027131147,0.13197446,0.01517575,0.00018790009],"study_design_scores_gemma":[0.0005766453,0.00008979504,0.059943613,0.00066496234,0.0000067812402,0.0000108285285,0.0021166399,0.9321973,0.00032620935,0.0031401056,0.0007213695,0.00020575571],"about_ca_topic_score_codex":0.00019322537,"about_ca_topic_score_gemma":0.0000034510351,"teacher_disagreement_score":0.92419404,"about_ca_system_score_codex":0.000080412654,"about_ca_system_score_gemma":0.000040955834,"threshold_uncertainty_score":0.45387292},"labels":[],"label_agreement":null},{"id":"W1886156573","doi":"10.1609/icaps.v23i1.13552","title":"Hybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Scheduling (production processes); Mathematical optimization; Dynamic priority scheduling; Sequence (biology); Distributed computing; Mathematics; Quality of service; Computer network","score_opus":0.019560836295905833,"score_gpt":0.24645218792809634,"score_spread":0.2268913516321905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886156573","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.97186404,0.00017003824,0.025398692,0.00030520163,0.0001633696,0.00032091024,0.000023845216,0.00037541005,0.0013784624],"genre_scores_gemma":[0.946299,0.00006313032,0.053289674,0.000061396,0.000024246556,0.00005337051,0.000011710237,0.00003471879,0.00016274242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895215,0.0000080511645,0.00026954673,0.00027334527,0.0002814275,0.00021550732],"domain_scores_gemma":[0.99946994,0.00010606995,0.00013992918,0.00006867524,0.00014128987,0.00007412046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032035218,0.00021901373,0.00019535628,0.00012808567,0.0001525022,0.00024598325,0.00026722104,0.00007419303,0.000017913166],"category_scores_gemma":[0.0000785693,0.00016784667,0.000032771375,0.00005693016,0.000085068306,0.0003957645,0.00006379912,0.00022011672,0.000002450673],"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.00009770898,0.000026678728,0.0010534185,0.0001380804,0.00024389752,0.0000011345842,0.0010596099,0.94452345,0.03158395,0.019338746,0.000021846354,0.0019114832],"study_design_scores_gemma":[0.00044435883,0.000042519776,0.00017689179,0.00063927757,0.000026963342,0.000028355544,0.0010620689,0.98161685,0.009387057,0.006367811,0.0000032645555,0.000204606],"about_ca_topic_score_codex":0.000007760609,"about_ca_topic_score_gemma":1.8637164e-7,"teacher_disagreement_score":0.03709338,"about_ca_system_score_codex":0.000054476608,"about_ca_system_score_gemma":0.000020824082,"threshold_uncertainty_score":0.68445885},"labels":[],"label_agreement":null},{"id":"W189498254","doi":"10.1609/icaps.v19i1.13365","title":"Minimal Sufficient Explanations for Factored Markov Decision Processes","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Task (project management); Markov decision process; Computer science; Set (abstract data type); Template; Domain (mathematical analysis); Probabilistic logic; Selection (genetic algorithm); Markov chain; Markov process; Markov model; Machine learning; Artificial intelligence; Programming language; Mathematics; Engineering","score_opus":0.04320861166281764,"score_gpt":0.3100428253267046,"score_spread":0.26683421366388693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189498254","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.7493236,0.000041986874,0.24178335,0.0032483053,0.00043424827,0.00031998742,0.0000087637945,0.00043319617,0.004406555],"genre_scores_gemma":[0.93278325,0.000008455696,0.06692025,0.00015118656,0.000026570313,0.000008744174,0.0000042238917,0.0000048789057,0.00009244245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988248,0.0000035266596,0.00029318524,0.00026442655,0.00044254906,0.00017156152],"domain_scores_gemma":[0.9987393,0.00018285237,0.0002859181,0.000082641986,0.00066288665,0.000046404028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027014484,0.00013263848,0.00013237099,0.00016337946,0.00018591323,0.0003646491,0.00091202295,0.00005949617,0.0000036588513],"category_scores_gemma":[0.00085834524,0.00010035459,0.000041211453,0.00020678603,0.0000314317,0.00032409202,0.00010561718,0.00013283847,0.0000011824488],"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.0004954312,0.0003118708,0.015566513,0.00027585437,0.00019120585,0.0000030055614,0.0087752845,0.40425557,0.051232502,0.5023435,0.0029345024,0.013614763],"study_design_scores_gemma":[0.00031665733,0.0001661594,0.0049752574,0.00052871235,0.0000070689994,0.000007949621,0.00031733446,0.98549926,0.0067497054,0.0011846181,0.00012270539,0.00012459034],"about_ca_topic_score_codex":0.0000013466326,"about_ca_topic_score_gemma":1.0495749e-7,"teacher_disagreement_score":0.58124363,"about_ca_system_score_codex":0.000033243294,"about_ca_system_score_gemma":0.00007849734,"threshold_uncertainty_score":0.40923414},"labels":[],"label_agreement":null},{"id":"W2097114036","doi":"10.1609/icaps.v24i1.13681","title":"A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Planner; Randomness; Heuristic; Satisficing; Benchmark (surveying); Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.06480995116400483,"score_gpt":0.33580014182964607,"score_spread":0.27099019066564123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097114036","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.94614714,0.00027836606,0.04015308,0.0013503459,0.00039996696,0.00016884963,0.00000574095,0.00028677154,0.011209726],"genre_scores_gemma":[0.98125,0.0000043362256,0.018589964,0.000041969164,0.000030603296,0.000010156898,0.0000034085353,0.0000074025106,0.00006215616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988725,0.000025857107,0.00037228662,0.0002931296,0.00028180028,0.00015438355],"domain_scores_gemma":[0.9987528,0.00020553592,0.00041129126,0.00012639527,0.00044798458,0.00005601558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064477365,0.0001574152,0.00023809551,0.00018287892,0.00016035126,0.00016527854,0.00083064515,0.00007765606,0.0000030764875],"category_scores_gemma":[0.0003693932,0.00012750435,0.000035228873,0.00018690681,0.000077865014,0.0003166503,0.00026573523,0.00019643157,0.0000018696124],"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.0003596841,0.0007936904,0.23499693,0.001254022,0.0003036262,9.401742e-7,0.03434873,0.017001806,0.2238046,0.4498713,0.002545362,0.034719326],"study_design_scores_gemma":[0.00046324177,0.0001455136,0.0019607488,0.001354431,0.000010715781,0.0000018197101,0.0002693145,0.93478066,0.05806549,0.0027407175,0.000078604215,0.00012872246],"about_ca_topic_score_codex":0.000010488589,"about_ca_topic_score_gemma":9.766615e-7,"teacher_disagreement_score":0.91777885,"about_ca_system_score_codex":0.000020396148,"about_ca_system_score_gemma":0.00007699154,"threshold_uncertainty_score":0.51994765},"labels":[],"label_agreement":null},{"id":"W2098960454","doi":"10.1609/icaps.v20i1.13402","title":"Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Satisficing; Plan (archaeology); Computer science; Graph; Metric (unit); Competition (biology); Action plan; Mathematical optimization; Operations research; Operations management; Artificial intelligence; Mathematics; Theoretical computer science; Engineering; Economics","score_opus":0.09831838808852035,"score_gpt":0.3290259229691195,"score_spread":0.23070753488059914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098960454","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.94620043,0.00015432188,0.04511184,0.005353093,0.0006087107,0.0002779962,0.000038904356,0.00037131278,0.0018834007],"genre_scores_gemma":[0.97720796,0.000023372057,0.022418857,0.00017214676,0.000059267943,0.00001764211,0.000021091959,0.000008864596,0.00007082091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987981,0.000011787352,0.0002554682,0.00037628502,0.00035497287,0.0002034103],"domain_scores_gemma":[0.99901444,0.00015071707,0.00021138662,0.000078927376,0.000477683,0.00006687701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049040373,0.00015321902,0.00015355146,0.000146458,0.0002643996,0.00041934772,0.0004043079,0.00007084158,0.000003187243],"category_scores_gemma":[0.00014776314,0.00012850111,0.000043051856,0.00016000237,0.00003816365,0.00033949994,0.00017767758,0.00021979857,5.389452e-7],"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.0003076084,0.00022000277,0.026206883,0.0005651886,0.00045259006,0.000012254792,0.008854631,0.009981791,0.38834766,0.4859399,0.0006021031,0.07850939],"study_design_scores_gemma":[0.0005904081,0.0001374559,0.0021865247,0.0005694808,0.000014536341,0.000036894686,0.0009185241,0.9242072,0.06565484,0.005501812,0.00002844715,0.00015384395],"about_ca_topic_score_codex":0.000016751244,"about_ca_topic_score_gemma":9.544169e-7,"teacher_disagreement_score":0.91422546,"about_ca_system_score_codex":0.000031060303,"about_ca_system_score_gemma":0.00008246187,"threshold_uncertainty_score":0.5240123},"labels":[],"label_agreement":null},{"id":"W2113267394","doi":"10.1609/icaps.v20i1.13400","title":"Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian Networks","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; Bayesian network; Probabilistic logic; Duration (music); Chaining; Action (physics); Dynamic Bayesian network; State (computer science); Artificial intelligence; Distributed computing; Algorithm","score_opus":0.07556528448785273,"score_gpt":0.3406418268058319,"score_spread":0.26507654231797917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113267394","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.5770373,0.000024823676,0.4201653,0.00080113014,0.0013222614,0.00018301806,0.0000070050937,0.00029328512,0.00016587654],"genre_scores_gemma":[0.96750677,0.000006042095,0.032127976,0.000112757385,0.00014766406,0.000020791036,0.00002950713,0.000013693266,0.000034808083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986009,0.000017123892,0.00040635545,0.00039678498,0.0003178362,0.0002610099],"domain_scores_gemma":[0.9985807,0.00016633334,0.000501049,0.00009959594,0.00057131134,0.00008099839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047665506,0.00021002459,0.00018210187,0.00018308143,0.00053283677,0.00047929934,0.00055339356,0.00018523875,0.0000045861875],"category_scores_gemma":[0.00017182309,0.00017788688,0.00006905832,0.00023071213,0.000064800275,0.0005000495,0.000105447856,0.00052629947,4.3190119e-7],"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.00008656145,0.0000568872,0.0035658404,0.00007475096,0.000108371445,9.274159e-7,0.00075181725,0.5196881,0.3711275,0.101811536,0.00016355484,0.0025641283],"study_design_scores_gemma":[0.00036656327,0.000057925747,0.0010340208,0.00057656097,0.00002390377,0.000029747223,0.000314608,0.98711234,0.008883289,0.0013478996,0.000054109238,0.00019901937],"about_ca_topic_score_codex":0.000033613112,"about_ca_topic_score_gemma":0.000004292712,"teacher_disagreement_score":0.4674242,"about_ca_system_score_codex":0.000078302146,"about_ca_system_score_gemma":0.00011825452,"threshold_uncertainty_score":0.72540164},"labels":[],"label_agreement":null},{"id":"W2171440583","doi":"10.1609/icaps.v20i1.13423","title":"Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallelizable manifold; Algorithm; Domain (mathematical analysis); Mathematical optimization; Mathematics","score_opus":0.06394127200578725,"score_gpt":0.3128285928497654,"score_spread":0.24888732084397813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171440583","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.8485329,0.000037180624,0.14754997,0.002527383,0.00020131946,0.00027718337,0.000028110311,0.00032177323,0.00052416185],"genre_scores_gemma":[0.73493606,0.000001460808,0.26458523,0.0003077522,0.000053775475,0.000018158882,0.000011795318,0.000017154078,0.00006863241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.000034055025,0.0003237627,0.00064027327,0.0006283385,0.0003992538],"domain_scores_gemma":[0.997732,0.0006487264,0.00021930876,0.00015038304,0.0010808244,0.00016875546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742227,0.00023927528,0.00024656515,0.00019082706,0.00036985686,0.0008112063,0.00097190693,0.00007689359,0.0000037620764],"category_scores_gemma":[0.00075345516,0.00018785438,0.000057723802,0.00028408863,0.00005687099,0.0004574982,0.00033572112,0.00037798382,0.0000015655717],"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.0007644668,0.00036791502,0.02364289,0.0003198061,0.0004905564,0.00009112022,0.031360418,0.6167457,0.28341624,0.024076963,0.00017716103,0.01854673],"study_design_scores_gemma":[0.0004635466,0.00038901018,0.00028057117,0.0012910377,0.000011523563,0.00008035067,0.0015176941,0.9331617,0.062136266,0.0003841318,0.000046126173,0.00023805602],"about_ca_topic_score_codex":0.000036320365,"about_ca_topic_score_gemma":0.0000021184153,"teacher_disagreement_score":0.31641594,"about_ca_system_score_codex":0.00006997765,"about_ca_system_score_gemma":0.00013914634,"threshold_uncertainty_score":0.7822481},"labels":[],"label_agreement":null},{"id":"W2177060007","doi":"10.1609/icaps.v21i1.13467","title":"Closing the Gap: Improved Bounds on Optimal POMDP Solutions","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology; University of Waterloo","funders":"","keywords":"Upper and lower bounds; Sawtooth wave; Benchmark (surveying); Partially observable Markov decision process; Mathematical optimization; Bellman equation; Function (biology); Interpolation (computer graphics); Computer science; Grid; Linear programming; Mathematics; Markov decision process; Markov process; Artificial intelligence","score_opus":0.11260743891545368,"score_gpt":0.30147540917280535,"score_spread":0.1888679702573517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177060007","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.8598687,0.00008353071,0.023065211,0.0109382365,0.0011090444,0.0005159429,0.000012947897,0.0009956917,0.10341069],"genre_scores_gemma":[0.97831064,0.000013270377,0.021097474,0.0003544672,0.000025907471,0.000012320784,0.0000013778593,0.000007765836,0.0001767685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888146,0.000014983254,0.0002460893,0.0002675651,0.0003596199,0.00023026133],"domain_scores_gemma":[0.99915874,0.00006344059,0.00021648445,0.00012446582,0.00037933863,0.0000575308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053640344,0.00013594571,0.00011233352,0.0001253541,0.00042152515,0.00040370572,0.0011372479,0.000061847844,0.000016157497],"category_scores_gemma":[0.00018339758,0.000086157146,0.00005162337,0.00019968985,0.00011261952,0.0003298883,0.00030297687,0.00030575428,0.000004783108],"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.00008717289,0.00012219335,0.0018137656,0.000022843864,0.00009960067,0.0000015907015,0.0063575343,0.0045111035,0.01823592,0.9666668,0.00039323955,0.0016882333],"study_design_scores_gemma":[0.00022540313,0.000100671,0.0014229657,0.00027129348,0.000005753807,0.000016374852,0.00047093123,0.9887826,0.0054954775,0.0030393465,0.000058087953,0.0001111159],"about_ca_topic_score_codex":0.00002599469,"about_ca_topic_score_gemma":5.2033715e-7,"teacher_disagreement_score":0.98427147,"about_ca_system_score_codex":0.000030976822,"about_ca_system_score_gemma":0.00006888214,"threshold_uncertainty_score":0.38929436},"labels":[],"label_agreement":null},{"id":"W2211274022","doi":"10.1609/icaps.v24i1.13640","title":"The Complexity of Partial-Order Plan Viability Problems","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Heuristics; Plan (archaeology); Order (exchange); Computer science; Task (project management); Management science; Mathematical optimization; Mathematics; Engineering; Economics; Systems engineering","score_opus":0.06234092099937335,"score_gpt":0.28064504394064843,"score_spread":0.21830412294127507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211274022","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.9675087,0.00007965317,0.012372853,0.007751788,0.0005325883,0.0002536686,0.000010940894,0.00039578765,0.011094065],"genre_scores_gemma":[0.9891952,0.000005140647,0.010615701,0.00009058836,0.00003141589,0.00000870824,0.0000023321834,0.000006177977,0.000044689717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.000033078704,0.0003968949,0.00028701784,0.0004412933,0.00021108509],"domain_scores_gemma":[0.9985509,0.00029438705,0.00045436365,0.00015949727,0.00048743843,0.000053404965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013164738,0.00014989622,0.00019238699,0.000064233696,0.00033290265,0.00024608185,0.0012420445,0.000068936926,0.000003956322],"category_scores_gemma":[0.00055700925,0.00009418943,0.00005003866,0.00019082843,0.0002860516,0.00019247067,0.00026657345,0.00027186982,0.000001637127],"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.00008598603,0.00007723246,0.05406874,0.00016440122,0.00010933004,3.362547e-7,0.0029099237,0.009654334,0.017108789,0.91267645,0.00030828346,0.00283619],"study_design_scores_gemma":[0.00021094925,0.00008224065,0.005172887,0.0005353081,0.000007065161,0.000007322374,0.00015576917,0.96207994,0.010098327,0.02129941,0.00023248832,0.00011830779],"about_ca_topic_score_codex":0.000041418116,"about_ca_topic_score_gemma":0.0000012033537,"teacher_disagreement_score":0.9524256,"about_ca_system_score_codex":0.000018015007,"about_ca_system_score_gemma":0.00005753437,"threshold_uncertainty_score":0.38409334},"labels":[],"label_agreement":null},{"id":"W2219185070","doi":"10.1609/icaps.v23i1.13575","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Job shop scheduling; Benchmark (surveying); Concurrent constraint logic programming; Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Stochastic programming; Schedule","score_opus":0.03285429607784356,"score_gpt":0.27679911591896517,"score_spread":0.2439448198411216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219185070","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.93523073,0.000063195315,0.009826641,0.0020316066,0.000424155,0.0012061615,0.000014001181,0.0010592154,0.050144307],"genre_scores_gemma":[0.79200625,0.0000041769354,0.20766157,0.00011748134,0.000050801926,0.000083685954,0.0000072812686,0.000019594278,0.00004917534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.000008349831,0.00029479107,0.0002538437,0.0002985008,0.00022186841],"domain_scores_gemma":[0.9992897,0.000031261745,0.00010509925,0.00010286817,0.00036713504,0.00010395561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824008,0.00018298227,0.00016490198,0.00009887214,0.0001713692,0.00093460514,0.0010604304,0.00007771041,0.000026795173],"category_scores_gemma":[0.000077009245,0.000120121884,0.000032463406,0.00020491668,0.00006614216,0.0003416557,0.00015105018,0.0002835308,0.000008715601],"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.000039663664,0.00011590356,0.0015681819,0.00008102178,0.00015540207,4.1849435e-7,0.0043384843,0.9496284,0.0087771015,0.02436524,0.0006278545,0.010302316],"study_design_scores_gemma":[0.0002136134,0.000045113,0.0004075221,0.00027308558,0.000010056716,0.0000194387,0.0039965454,0.99184364,0.002801093,0.00012855444,0.00009693967,0.00016437907],"about_ca_topic_score_codex":0.000018765264,"about_ca_topic_score_gemma":2.423923e-7,"teacher_disagreement_score":0.19783492,"about_ca_system_score_codex":0.000030540174,"about_ca_system_score_gemma":0.000029585455,"threshold_uncertainty_score":0.9012419},"labels":[],"label_agreement":null},{"id":"W2220822187","doi":"10.1609/icaps.v22i1.13524","title":"Long-Run Stability in Dynamic Scheduling","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Polling; Computer science; Queueing theory; Dynamic priority scheduling; Scheduling (production processes); Mathematical optimization; Stability (learning theory); Flow shop scheduling; Schedule; Distributed computing; Mathematics; Computer network","score_opus":0.029926027054536772,"score_gpt":0.27560620595054924,"score_spread":0.24568017889601246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220822187","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.99358815,0.00028083887,0.0006924785,0.00024013309,0.0006008779,0.00011028652,0.000006761265,0.0004481261,0.0040323627],"genre_scores_gemma":[0.9822624,0.000037217626,0.017554404,0.00003955927,0.000048283757,0.0000109262455,0.0000056855542,0.000021768703,0.000019773208],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988829,0.000007799836,0.00035232047,0.00018100104,0.0002994076,0.00027656084],"domain_scores_gemma":[0.9995072,0.00006094103,0.00010988929,0.00007497566,0.00016693567,0.00008004082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051051774,0.00018043662,0.00019167365,0.00018314556,0.00007198295,0.00009939195,0.0003224214,0.0001122811,0.00003308757],"category_scores_gemma":[0.00022124847,0.00015326086,0.000044446777,0.00023067796,0.00005617119,0.00030158745,0.00007119798,0.00036324692,0.000004905911],"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.00010974027,0.00019285317,0.53346676,0.0003293317,0.00017175601,0.0000019274064,0.00518079,0.41131482,0.037682246,0.009371631,0.000030160978,0.002147993],"study_design_scores_gemma":[0.00029091418,0.000011566275,0.025981434,0.0005039957,0.000008914675,0.000010278497,0.0010691877,0.9628811,0.008920834,0.00015272382,0.000003845443,0.00016521558],"about_ca_topic_score_codex":0.0000064076835,"about_ca_topic_score_gemma":0.0000010942106,"teacher_disagreement_score":0.55156624,"about_ca_system_score_codex":0.000087062384,"about_ca_system_score_gemma":0.000021121841,"threshold_uncertainty_score":0.6249797},"labels":[],"label_agreement":null},{"id":"W2274199420","doi":"10.1609/icaps.v22i1.13515","title":"Resource-Constrained Planning: A Monte Carlo Random Walk Approach","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Planner; Suite; Computer science; Resource (disambiguation); Monte Carlo method; Feature (linguistics); Random walk; Operations research; Function (biology); Mathematical optimization; Artificial intelligence; Engineering; Mathematics","score_opus":0.04241536260847029,"score_gpt":0.2743744785948414,"score_spread":0.2319591159863711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274199420","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.9442941,0.0005237681,0.0064017004,0.0018576462,0.0005027756,0.00026374258,0.000012415322,0.0008547973,0.045289043],"genre_scores_gemma":[0.9742941,0.0000037814737,0.025128176,0.00022431553,0.00011217685,0.000017386874,0.0000043523187,0.000015123915,0.00020055663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981924,0.00002846033,0.0004073429,0.00037932227,0.0005651216,0.00042732613],"domain_scores_gemma":[0.99886614,0.00019567566,0.00040187556,0.00014687856,0.00023797416,0.00015147535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010975375,0.00026164766,0.0002918963,0.0002175834,0.00029929384,0.00036626452,0.0011944071,0.0001386543,0.0000059506206],"category_scores_gemma":[0.0003121681,0.00019822412,0.00009123974,0.0002526742,0.00009849834,0.0005365153,0.0002964469,0.00046647913,0.000003195063],"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.0013315688,0.0007137256,0.34937516,0.00067001075,0.0011744285,0.000020924228,0.07246166,0.0943426,0.05645728,0.4063071,0.009137493,0.008008076],"study_design_scores_gemma":[0.0008767197,0.000057098645,0.002760997,0.00093680783,0.000021604867,0.0000949174,0.0013455595,0.9893411,0.0034688322,0.0004576184,0.0003527643,0.00028601018],"about_ca_topic_score_codex":0.000018767274,"about_ca_topic_score_gemma":4.8557144e-8,"teacher_disagreement_score":0.8949985,"about_ca_system_score_codex":0.000039921684,"about_ca_system_score_gemma":0.00006455607,"threshold_uncertainty_score":0.8083345},"labels":[],"label_agreement":null},{"id":"W2294988606","doi":"10.1609/icaps.v25i1.13709","title":"Moving Target Search with Subgoal Graphs","year":2015,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); Abstraction; Robotics; Spacetime; Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Robot","score_opus":0.057875168532856985,"score_gpt":0.2929854708873217,"score_spread":0.2351103023544647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294988606","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.97301435,0.000079016216,0.013830091,0.0021745274,0.00041439832,0.00014027118,0.0000046888076,0.0005783904,0.009764289],"genre_scores_gemma":[0.8362729,0.0000017456593,0.16351259,0.00007595158,0.000026812331,0.000004985699,0.0000016471002,0.000008500493,0.00009489476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984374,0.000012742305,0.00022515772,0.0003382319,0.000746244,0.00024019726],"domain_scores_gemma":[0.9989035,0.000060604947,0.00018895481,0.0001155679,0.0006086823,0.00012270686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352242,0.00016333103,0.00017339767,0.00018902648,0.00012590009,0.00034801534,0.0011579079,0.00006484289,0.0000020540697],"category_scores_gemma":[0.00018725156,0.000113103866,0.000030618165,0.00028845487,0.00008770403,0.00041642055,0.00028492618,0.00030328013,0.0000038118344],"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.00032379554,0.00020699558,0.2844292,0.00013062642,0.00037467614,0.000055769193,0.015581105,0.13795665,0.023513103,0.5341228,0.0012011632,0.0021041043],"study_design_scores_gemma":[0.00039774633,0.00012237689,0.0048270174,0.0005471423,0.0000055124583,0.00008438993,0.000785837,0.984618,0.0057690805,0.0026726588,0.000014013611,0.0001561961],"about_ca_topic_score_codex":0.000027017264,"about_ca_topic_score_gemma":9.4244015e-8,"teacher_disagreement_score":0.8466614,"about_ca_system_score_codex":0.000040567324,"about_ca_system_score_gemma":0.00014083125,"threshold_uncertainty_score":0.46122417},"labels":[],"label_agreement":null},{"id":"W233883780","doi":"10.1609/icaps.v21i1.13468","title":"Distributed Control of Situated Assistance in Large Domains with Many Tasks","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Situated; Partially observable Markov decision process; Computer science; Task (project management); Scalability; Affordance; Domain (mathematical analysis); Set (abstract data type); Process (computing); Population; Markov decision process; Artificial intelligence; Human–computer interaction; Controller (irrigation); Control (management); Machine learning; Distributed computing; Markov process; Markov chain; Markov model; Engineering; Mathematics","score_opus":0.029838982046658497,"score_gpt":0.25990372975629306,"score_spread":0.23006474770963456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W233883780","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.83405495,0.000017258164,0.16114819,0.0002748168,0.00009493108,0.00013603417,0.00001267018,0.0001476917,0.004113434],"genre_scores_gemma":[0.9895632,0.0000038754656,0.0103332875,0.000052108146,0.0000057019215,0.0000058237556,0.0000032253959,0.0000061054434,0.00002667178],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988818,0.000010321873,0.0003241741,0.00022065474,0.00037798155,0.00018505914],"domain_scores_gemma":[0.9990369,0.00005212491,0.0004300161,0.000100025536,0.00034441444,0.000036520145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036514326,0.00012999581,0.00019459294,0.00011389227,0.00006089384,0.00008872887,0.0008031152,0.000059488917,0.000006796332],"category_scores_gemma":[0.00014600519,0.0000939373,0.000028128863,0.0002472273,0.00006868883,0.0002544033,0.00012560615,0.0002207078,8.366731e-7],"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.0003884929,0.00014630645,0.47712302,0.00009474195,0.00018132462,0.0000104392,0.0035394097,0.053931758,0.018631691,0.44581178,0.000033692988,0.000107328626],"study_design_scores_gemma":[0.00086317165,0.00010124546,0.06763539,0.00072483433,0.000008366619,0.0000077136365,0.00031517528,0.9241989,0.0056076404,0.00042485044,0.0000064320834,0.00010623773],"about_ca_topic_score_codex":0.00001630684,"about_ca_topic_score_gemma":0.0000010344784,"teacher_disagreement_score":0.8702672,"about_ca_system_score_codex":0.000032040116,"about_ca_system_score_gemma":0.000044939057,"threshold_uncertainty_score":0.3830652},"labels":[],"label_agreement":null},{"id":"W2394636111","doi":"10.1609/icaps.v22i1.13502","title":"Planning Via Random Walk-Driven Local Search","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random walk; Satisficing; Local search (optimization); Computer science; Node (physics); Plan (archaeology); Mathematical optimization; Random search; Search algorithm; Quality (philosophy); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Engineering; Statistics; Geography","score_opus":0.04381493788673569,"score_gpt":0.29650923569130333,"score_spread":0.25269429780456765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394636111","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.9090116,0.00031380483,0.079330444,0.0017907282,0.0007156556,0.00017838646,0.0000058283995,0.0006185453,0.008034989],"genre_scores_gemma":[0.9827798,0.000005761039,0.01679641,0.0001993287,0.00010543942,0.000008970034,0.000004241547,0.000013664705,0.000086355976],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826866,0.000026000547,0.00035043582,0.00032400232,0.00060597487,0.00042489838],"domain_scores_gemma":[0.99897456,0.00020635586,0.0002517116,0.00012145957,0.0003008097,0.00014512379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091780233,0.00021872859,0.00024127276,0.00019646417,0.00030130002,0.00029214687,0.001137024,0.00012098632,0.000012249371],"category_scores_gemma":[0.00013662991,0.0001677519,0.000071592134,0.00023705763,0.00009884798,0.0006244498,0.00036717448,0.0004805618,0.000010807313],"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.0007502342,0.00036682337,0.4587279,0.0004211039,0.00065327337,0.000021139276,0.036619842,0.14859334,0.12971401,0.20064709,0.0023230375,0.021162197],"study_design_scores_gemma":[0.00057532906,0.000057735902,0.005201031,0.0009789307,0.00001215527,0.000062314255,0.0005686302,0.9779062,0.013699692,0.0006433421,0.000078995574,0.0002155998],"about_ca_topic_score_codex":0.000026716627,"about_ca_topic_score_gemma":1.10703446e-7,"teacher_disagreement_score":0.8293129,"about_ca_system_score_codex":0.000050812712,"about_ca_system_score_gemma":0.00006258833,"threshold_uncertainty_score":0.68407243},"labels":[],"label_agreement":null},{"id":"W2401205034","doi":"10.1609/icaps.v25i1.13685","title":"Improving the Design and Discovery of Dynamic Treatment Strategies Using Recent Results in Sequential Decision-Making","year":2015,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Neurostimulation; Machine learning; Artificial intelligence; Data science; Management science; Psychology; Engineering","score_opus":0.3698951900488029,"score_gpt":0.44219970744945514,"score_spread":0.07230451740065225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401205034","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.992927,0.0003906124,0.003237776,0.0022923965,0.00024407968,0.00026299153,0.00004080472,0.000024404486,0.00057993206],"genre_scores_gemma":[0.98717463,0.00006564196,0.012601406,0.00010096179,0.000026227188,0.000008872231,0.0000022792226,0.0000086553455,0.000011338345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998138,0.000037961625,0.0012907129,0.000266636,0.00012732054,0.00013934152],"domain_scores_gemma":[0.9978179,0.00051649666,0.0013988694,0.00008200017,0.00015132217,0.000033461703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004645735,0.00012150848,0.00032786414,0.00019211967,0.00008835028,0.00022035102,0.0002334354,0.00006498497,0.0000022949032],"category_scores_gemma":[0.0022385765,0.000094043906,0.000029753148,0.000104762454,0.00007663525,0.00044754168,0.000079044745,0.00011381536,0.000001008341],"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.0033054682,0.00049216335,0.087149344,0.00077134656,0.0007289079,0.0000063215884,0.06470835,0.36464125,0.01566853,0.4528291,0.00030170288,0.009397517],"study_design_scores_gemma":[0.00063849596,0.00007962112,0.0034617297,0.00092294975,0.000006677541,0.000008703598,0.007935528,0.97421813,0.00022310702,0.012392712,0.000012519753,0.00009982825],"about_ca_topic_score_codex":0.0003007295,"about_ca_topic_score_gemma":0.000008964305,"teacher_disagreement_score":0.6095769,"about_ca_system_score_codex":0.0002759294,"about_ca_system_score_gemma":0.00019141284,"threshold_uncertainty_score":0.38349992},"labels":[],"label_agreement":null},{"id":"W2401554262","doi":"10.1609/icaps.v25i1.13704","title":"Understanding and Improving Local Exploration for GBFS","year":2015,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Maxima and minima; Satisficing; Local search (optimization); Heuristic; Mathematics; Mathematical optimization; Algorithm; Computer science; Artificial intelligence","score_opus":0.20482249081506348,"score_gpt":0.30985478916159825,"score_spread":0.10503229834653477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401554262","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.27348438,0.0001303636,0.7168383,0.004893316,0.00054540165,0.00025221775,0.0000078805315,0.0004759887,0.0033721498],"genre_scores_gemma":[0.9692748,0.0000037555449,0.030510185,0.00011215289,0.00003783035,0.000011319376,0.000002965443,0.00000769186,0.000039259503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.000007852219,0.00021951288,0.00027314608,0.00028588396,0.00016337646],"domain_scores_gemma":[0.9992269,0.00011552675,0.00022807346,0.000057705663,0.00029219477,0.00007958412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006713479,0.00012767038,0.00013245024,0.00012252024,0.0001901142,0.00037547539,0.0004176769,0.000070888666,5.6958044e-7],"category_scores_gemma":[0.00026881034,0.00010168221,0.00002627822,0.000112299276,0.000060767827,0.0005898974,0.00016205879,0.00015576338,5.0410404e-7],"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.00021150916,0.000043382202,0.009828092,0.00019790561,0.00009951981,0.0000022373679,0.009673525,0.016586471,0.018970054,0.9376082,0.0010860265,0.0056931092],"study_design_scores_gemma":[0.0004145987,0.000106100015,0.00011175324,0.00045643,0.00000803242,0.0000150084215,0.002302793,0.96985364,0.0044130506,0.022162654,0.000031843734,0.00012409282],"about_ca_topic_score_codex":0.0000142419585,"about_ca_topic_score_gemma":5.031135e-7,"teacher_disagreement_score":0.95326716,"about_ca_system_score_codex":0.00006585181,"about_ca_system_score_gemma":0.00007743962,"threshold_uncertainty_score":0.41464803},"labels":[],"label_agreement":null},{"id":"W2408280519","doi":"10.1609/icaps.v22i1.13512","title":"Predicting Optimal Solution Cost with Bidirectional Stratified Sampling","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Regina","keywords":"Mathematical optimization; Path (computing); Focus (optics); Heuristic; Sampling (signal processing); State space; Limit (mathematics); Space (punctuation); Computer science; Total cost; State (computer science); Infinity; Mathematics; Algorithm; Statistics; Economics","score_opus":0.05816263018726656,"score_gpt":0.2944029400724816,"score_spread":0.23624030988521502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408280519","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.97067213,0.000083785926,0.022550836,0.000979088,0.0004361413,0.00014130618,0.000007532306,0.00048985344,0.004639351],"genre_scores_gemma":[0.9483418,0.0000034549835,0.051394485,0.00007208665,0.00010441347,0.000013268201,0.000005197986,0.000009367716,0.000055950677],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871093,0.000012029916,0.00025999086,0.00026360547,0.00046124536,0.00029220502],"domain_scores_gemma":[0.99909705,0.00012545133,0.0003126167,0.00007544458,0.00029975554,0.000089696936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062790565,0.00016801263,0.00014607288,0.00013677173,0.0003400873,0.00029945927,0.00053823617,0.00008015207,0.000006675626],"category_scores_gemma":[0.00013806776,0.00012410725,0.00003543644,0.00020344001,0.000057681555,0.00067758677,0.00014396533,0.00032439965,0.000002166744],"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.00034063318,0.00020650358,0.6698173,0.00015784083,0.00034415835,0.0000024381338,0.008053921,0.054992467,0.08512664,0.17598873,0.0003939586,0.0045753717],"study_design_scores_gemma":[0.0003528006,0.0000746789,0.0147857275,0.0009561003,0.000014345119,0.00007435754,0.0004634496,0.97036767,0.012452094,0.00021763988,0.000053872387,0.00018726192],"about_ca_topic_score_codex":0.000024315776,"about_ca_topic_score_gemma":4.793974e-7,"teacher_disagreement_score":0.91537523,"about_ca_system_score_codex":0.000045600962,"about_ca_system_score_gemma":0.00007303571,"threshold_uncertainty_score":0.5060947},"labels":[],"label_agreement":null},{"id":"W256918177","doi":"10.1609/icaps.v24i1.13682","title":"Non-Deterministic Planning With Conditional Effects","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planner; Soundness; Determinism; Computer science; Variety (cybernetics); Completeness (order theory); Key (lock); Extension (predicate logic); Core (optical fiber); Artificial intelligence; Programming language; Mathematics; Computer security","score_opus":0.018108935209690247,"score_gpt":0.2621770235230653,"score_spread":0.24406808831337506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256918177","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.9432272,0.000033685952,0.04112561,0.00140257,0.0003587972,0.00016664766,0.0000056190615,0.00048222064,0.0131977],"genre_scores_gemma":[0.9813914,9.883356e-7,0.018131226,0.00030684817,0.000061552484,0.000014150208,0.000006319907,0.000011730746,0.000075832504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986599,0.000012782376,0.00025078742,0.00036574565,0.00047647144,0.00023431997],"domain_scores_gemma":[0.9989428,0.00028026683,0.00031934283,0.00010691606,0.00026925362,0.00008145762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004282925,0.000203939,0.00021228699,0.00015725671,0.00026544067,0.00034440326,0.000871462,0.000080221216,0.000003087376],"category_scores_gemma":[0.00019948298,0.00014560501,0.000040081963,0.00016465785,0.00008643565,0.00029656957,0.00016651167,0.00030964523,0.0000044831872],"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.00037628913,0.00018138735,0.17063639,0.0007155162,0.00043326922,0.000039422768,0.0069359527,0.05713987,0.06584394,0.69228166,0.0014316036,0.003984716],"study_design_scores_gemma":[0.0005020753,0.00023083652,0.013062244,0.0021550015,0.000015122597,0.000067565765,0.00010522817,0.9692958,0.008410775,0.0058833756,0.00005617485,0.00021580755],"about_ca_topic_score_codex":0.000006387419,"about_ca_topic_score_gemma":9.9426984e-8,"teacher_disagreement_score":0.9121559,"about_ca_system_score_codex":0.000023356142,"about_ca_system_score_gemma":0.00006318043,"threshold_uncertainty_score":0.59376},"labels":[],"label_agreement":null},{"id":"W2574020264","doi":"10.1609/icaps.v26i1.13773","title":"From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Leverage (statistics); Exploit; Planner; Computer science; Class (philosophy); Mathematical optimization; Artificial intelligence; Mathematics; Computer security","score_opus":0.06966296944873947,"score_gpt":0.29929599307677135,"score_spread":0.2296330236280319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574020264","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.9631098,0.000072560426,0.02280678,0.008585292,0.00048788477,0.00020318618,0.000034303444,0.0006445836,0.004055617],"genre_scores_gemma":[0.9798717,0.0000020123246,0.01948644,0.0003272793,0.00011337816,0.000005877075,0.0000041375292,0.000017528873,0.00017164148],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980055,0.000025819221,0.00040120268,0.00055150304,0.0006050371,0.00041095237],"domain_scores_gemma":[0.99838835,0.00051976414,0.00041064873,0.00017557702,0.0003452069,0.00016046468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820956,0.00028759622,0.00031235797,0.00025039035,0.0003360081,0.00058842887,0.0015498924,0.00011570301,0.000012675164],"category_scores_gemma":[0.0004674568,0.00018991498,0.00006860689,0.00027071364,0.0000850943,0.0004345234,0.00040057235,0.0002873723,0.000010208875],"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.00046900232,0.00025929915,0.37399623,0.00025973268,0.00067447266,0.000028895387,0.027421353,0.17224321,0.19924839,0.20831908,0.010415276,0.00666507],"study_design_scores_gemma":[0.00066485,0.00015634802,0.02121367,0.005553722,0.000023229022,0.000033902907,0.0010087059,0.9397348,0.024280308,0.006665633,0.00018785223,0.00047695058],"about_ca_topic_score_codex":0.00013999331,"about_ca_topic_score_gemma":8.8841256e-7,"teacher_disagreement_score":0.76749164,"about_ca_system_score_codex":0.00009120654,"about_ca_system_score_gemma":0.00008486884,"threshold_uncertainty_score":0.7744508},"labels":[],"label_agreement":null},{"id":"W2577088067","doi":"10.1609/icaps.v26i1.13780","title":"Scheduling Ocean Color Observations for a GEO-Stationary Satellite","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Goddard Space Flight Center; Ministry of Education, India; Langley Research Center; Ames Research Center; National Aeronautics and Space Administration","keywords":"Remote sensing; Computer science; Radiometer; Satellite; Environmental science; Meteorology; Cloud cover; Scheduling (production processes); Real-time computing; Ocean color; Cloud computing; Geology; Geography; Aerospace engineering; Engineering; Mathematical optimization; Mathematics","score_opus":0.057705320826238644,"score_gpt":0.29025124259599255,"score_spread":0.23254592176975392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577088067","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.8288397,0.00004995416,0.14161484,0.025534108,0.0006506587,0.00040951773,0.000041104817,0.0006228695,0.0022372382],"genre_scores_gemma":[0.91451395,0.000030332498,0.084890015,0.00025256572,0.00003456222,0.000014745412,0.000005126268,0.000007892233,0.00025083227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989913,0.000007074672,0.00030189045,0.0002838003,0.00026200718,0.0001538968],"domain_scores_gemma":[0.9987198,0.00020892142,0.00028543212,0.00007921993,0.0006544477,0.000052148447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030070622,0.00012761338,0.00012443813,0.00014664143,0.00020570123,0.00019798867,0.00050096883,0.00006594593,0.0000073708693],"category_scores_gemma":[0.00042965592,0.00008682997,0.00005388384,0.0001675087,0.00006469554,0.0005408392,0.000107618594,0.00008710472,0.0000017924741],"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.00009391738,0.00005192143,0.04025753,0.000053092444,0.00010191938,6.419475e-7,0.00096862705,0.005045245,0.08338914,0.8588503,0.0003145772,0.010873093],"study_design_scores_gemma":[0.00056646514,0.000053924323,0.019278893,0.000605114,0.000010159917,0.000013603873,0.0002684793,0.9652285,0.0064656404,0.0070735374,0.00027653095,0.0001591388],"about_ca_topic_score_codex":0.00000265976,"about_ca_topic_score_gemma":4.7381272e-7,"teacher_disagreement_score":0.96018326,"about_ca_system_score_codex":0.000044181616,"about_ca_system_score_gemma":0.00008394776,"threshold_uncertainty_score":0.35408232},"labels":[],"label_agreement":null},{"id":"W2578999369","doi":"10.1609/icaps.v26i1.13752","title":"Efficient Representation of Pattern Databases Using Acyclic Random Hypergraphs","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Heuristic; Computer science; Representation (politics); Abstraction; Benchmark (surveying); Database; Domain (mathematical analysis); Theoretical computer science; Table (database); Algorithm; Data mining; Mathematics; Artificial intelligence","score_opus":0.06536379554403488,"score_gpt":0.3140520566603513,"score_spread":0.24868826111631642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578999369","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.96295327,0.00005545451,0.034918133,0.0008775318,0.00024578246,0.00009660408,0.000016822045,0.00015522803,0.0006811705],"genre_scores_gemma":[0.9884077,0.000009048002,0.01147409,0.000050320577,0.000024579878,0.0000038068501,0.0000020201144,0.0000072114904,0.00002122515],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987362,0.000019438343,0.00035430962,0.0003056737,0.00042165344,0.00016269478],"domain_scores_gemma":[0.99880475,0.0002548937,0.0004520065,0.000126742,0.00031636312,0.00004523677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041562496,0.00013693498,0.00019817939,0.00018980686,0.00012215205,0.00008868357,0.0006701426,0.000044334804,0.0000066851812],"category_scores_gemma":[0.00033357425,0.00008599684,0.000060924172,0.00021861217,0.00007675692,0.00020311332,0.00022367526,0.00011067228,0.0000011256667],"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.00019212028,0.00010495355,0.1694002,0.00011778728,0.00017161552,0.0000037663515,0.0019973682,0.02188736,0.76465404,0.031421915,0.00013003325,0.009918833],"study_design_scores_gemma":[0.00067394663,0.00003388351,0.003392031,0.001984715,0.000013646898,0.000019365241,0.0001675659,0.909173,0.08389173,0.0005223148,0.00000636682,0.00012143846],"about_ca_topic_score_codex":0.000054770786,"about_ca_topic_score_gemma":2.7194693e-7,"teacher_disagreement_score":0.88728565,"about_ca_system_score_codex":0.00002161423,"about_ca_system_score_gemma":0.000046653226,"threshold_uncertainty_score":0.35068494},"labels":[],"label_agreement":null},{"id":"W269605412","doi":"10.1609/icaps.v22i1.13520","title":"Improved Non-Deterministic Planning by Exploiting State Relevance","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relevance (law); Planner; Probabilistic logic; State (computer science); Computer science; Observable; Work (physics); Theoretical computer science; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Engineering; Political science; Law","score_opus":0.03166301535650045,"score_gpt":0.28407529041399643,"score_spread":0.25241227505749597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W269605412","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.9790848,0.00029393373,0.013727559,0.00088472967,0.0006850679,0.00015967866,0.000016506197,0.0005333481,0.0046144053],"genre_scores_gemma":[0.9817498,0.000010617755,0.017676564,0.0002620879,0.000073132476,0.000016140808,0.000005301787,0.000018304192,0.00018807822],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983092,0.0000149325015,0.0004253042,0.00037155446,0.00042315098,0.00045586514],"domain_scores_gemma":[0.99872494,0.00024575592,0.00051539927,0.00012940473,0.00024899066,0.00013548485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478953,0.00025080738,0.00023961147,0.00013756704,0.0003096579,0.00038007146,0.0010549127,0.00009021149,0.0000042482375],"category_scores_gemma":[0.00039419145,0.00020481055,0.000056021167,0.00019860128,0.000065910324,0.00076819235,0.00030840674,0.00042716265,0.000004183517],"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.00028411066,0.00026897577,0.1322929,0.0004969759,0.00036630133,0.000011956129,0.025117451,0.0077587827,0.7862602,0.030179488,0.0050635776,0.011899307],"study_design_scores_gemma":[0.0003344654,0.00008236597,0.0017485793,0.0015398471,0.0000113531805,0.00003601685,0.0005362814,0.95891166,0.0356483,0.000704371,0.00015033282,0.00029642825],"about_ca_topic_score_codex":0.000014147822,"about_ca_topic_score_gemma":5.7859378e-8,"teacher_disagreement_score":0.95115286,"about_ca_system_score_codex":0.000045403947,"about_ca_system_score_gemma":0.000055348428,"threshold_uncertainty_score":0.8351932},"labels":[],"label_agreement":null},{"id":"W2756655043","doi":"10.1609/icaps.v27i1.13807","title":"Boosting Search Guidance in Problems with Semantic Attachments","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Planner; Exploit; Computer science; Heuristic; Estimator; Boosting (machine learning); Leverage (statistics); Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.05653941684740136,"score_gpt":0.3161860120499285,"score_spread":0.25964659520252714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756655043","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.98566186,0.00006602506,0.0014866265,0.0026414227,0.00015320758,0.00015032919,0.0000025962167,0.00018482967,0.009653125],"genre_scores_gemma":[0.9855476,0.000004911574,0.014206206,0.000071499286,0.000022383716,0.000009482545,0.0000010900396,0.000008720436,0.00012808922],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986332,0.0000110956025,0.00027028404,0.00036275067,0.00046466402,0.00025801235],"domain_scores_gemma":[0.99904895,0.0000720962,0.0003835524,0.00017674254,0.00026643727,0.00005224036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075757515,0.0001594286,0.0001764603,0.00014062322,0.0004269501,0.0007636572,0.001607985,0.000062434665,0.0000023158584],"category_scores_gemma":[0.00021528426,0.000115654955,0.000025318324,0.00009555176,0.0000877271,0.00055622443,0.00037918685,0.00034123685,0.00000219808],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007088168,0.000056558794,0.9231908,0.00018295423,0.00006605669,0.000013680248,0.0032665564,0.016057987,0.016158432,0.039117068,0.00006881031,0.0017502287],"study_design_scores_gemma":[0.00044310436,0.00007434533,0.06947757,0.004327176,0.000004357067,0.000026234635,0.00016366229,0.918682,0.00566406,0.0009643402,0.000010818056,0.00016236026],"about_ca_topic_score_codex":0.000105080915,"about_ca_topic_score_gemma":0.0000025831628,"teacher_disagreement_score":0.902624,"about_ca_system_score_codex":0.00003522714,"about_ca_system_score_gemma":0.00007279466,"threshold_uncertainty_score":0.73639643},"labels":[],"label_agreement":null},{"id":"W2756715505","doi":"10.1609/icaps.v27i1.13829","title":"An Investigation of Phase Transitions in Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Advanced Exploration Systems; Ames Research Center; National Aeronautics and Space Administration","keywords":"Parameterized complexity; Scheduling (production processes); Computer science; Phase transition; Distributed computing; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Physics","score_opus":0.04681897896836605,"score_gpt":0.29776735699557605,"score_spread":0.25094837802721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756715505","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.99646384,0.00005969938,0.0010385897,0.00050586386,0.00022369862,0.00012200966,0.00002184497,0.00022652553,0.0013379194],"genre_scores_gemma":[0.97628945,0.000015123767,0.023594277,0.00002011524,0.000031787975,0.000009544018,0.000015112778,0.000018057153,0.000006554149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903876,0.00000713886,0.00038131422,0.00018531525,0.00024972638,0.00013774187],"domain_scores_gemma":[0.9992936,0.000022550179,0.00025675466,0.0001177564,0.00024954163,0.000059756272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003298339,0.0001491126,0.0001942321,0.00020512498,0.00015598918,0.00019044473,0.000469403,0.000094089664,0.000008772058],"category_scores_gemma":[0.00013534723,0.00013175035,0.000036912803,0.0001038773,0.000112618356,0.00042428373,0.000031550917,0.00024438096,5.48467e-7],"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.000060880804,0.00013110726,0.025382776,0.0001758517,0.00007236273,0.0000010969064,0.0041849087,0.54679376,0.41636202,0.005556345,0.0000044401345,0.0012744473],"study_design_scores_gemma":[0.0007934499,0.00006803156,0.0031357901,0.0011184328,0.000013100619,0.0000055390296,0.00065572356,0.94977343,0.043731418,0.0005760629,8.342383e-7,0.0001281616],"about_ca_topic_score_codex":0.000019809635,"about_ca_topic_score_gemma":0.000003431817,"teacher_disagreement_score":0.40297967,"about_ca_system_score_codex":0.000029874029,"about_ca_system_score_gemma":0.000024870502,"threshold_uncertainty_score":0.5372624},"labels":[],"label_agreement":null},{"id":"W2758646404","doi":"10.1609/icaps.v27i1.13824","title":"Online Repositioning in Bike Sharing Systems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Bike sharing; Computer science; Benchmark (surveying); Heuristic; Routing (electronic design automation); Greedy algorithm; Set (abstract data type); Matching (statistics); Operations research; Mathematical optimization; Transport engineering; Computer network; Engineering; Artificial intelligence","score_opus":0.06569628425107436,"score_gpt":0.3493977974602436,"score_spread":0.2837015132091692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758646404","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.9726871,0.000031387375,0.00003428518,0.0015829714,0.0003798915,0.000092322,0.000008191781,0.00012891355,0.025054907],"genre_scores_gemma":[0.998517,0.00002804921,0.001001087,0.00003134447,0.00006204623,0.0000052561704,0.00000782957,0.000006085951,0.00034132806],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991122,0.000007126154,0.0002484302,0.00018734753,0.00031486168,0.0001300537],"domain_scores_gemma":[0.99922144,0.0000340043,0.00038595853,0.000066192144,0.0002549171,0.000037461738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051861495,0.00007852031,0.00011357203,0.00011644799,0.00064213056,0.0005429026,0.00049937645,0.00007399082,0.0000061376863],"category_scores_gemma":[0.00043467255,0.000068362366,0.00002368346,0.000067177,0.00010209678,0.0003393795,0.00004164374,0.00017063753,6.6563257e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060552607,0.000063538355,0.7518892,0.00004812018,0.000036212678,0.000004272599,0.009618909,0.03245571,0.0028130184,0.20271203,0.000048916634,0.00024949125],"study_design_scores_gemma":[0.00039890336,0.000019334142,0.22980112,0.002723902,0.00001208451,0.0000043337654,0.00896515,0.75656253,0.0003923786,0.0008774158,0.000088002846,0.00015484862],"about_ca_topic_score_codex":0.0007697236,"about_ca_topic_score_gemma":0.00003757307,"teacher_disagreement_score":0.72410685,"about_ca_system_score_codex":0.000039028713,"about_ca_system_score_gemma":0.000047008198,"threshold_uncertainty_score":0.52352226},"labels":[],"label_agreement":null},{"id":"W2759637265","doi":"10.1609/icaps.v27i1.13804","title":"The Two-Edged Nature of Diverse Action Costs","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Action (physics); Diversity (politics); Unit (ring theory); Computer science; Risk analysis (engineering); Feature (linguistics); Cost–benefit analysis; Distribution (mathematics); Search cost; Domain (mathematical analysis); Operations research; Total cost; Microeconomics; Economics; Business; Mathematics; Political science; Law","score_opus":0.04822625836150071,"score_gpt":0.3319589236488111,"score_spread":0.28373266528731034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759637265","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.98439246,0.00010079507,0.00051243993,0.0034317959,0.00087942893,0.00010096881,0.000006597976,0.00015861067,0.0104169],"genre_scores_gemma":[0.996363,0.000020356352,0.0033691586,0.00006371073,0.00004562152,0.000003727992,0.0000012374977,0.0000051948864,0.00012799274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.000011467742,0.00022201253,0.00022200258,0.00038865602,0.0001533787],"domain_scores_gemma":[0.9985477,0.00015535725,0.00063792994,0.00018440656,0.00043462007,0.00004004194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062061555,0.00012220645,0.00013117708,0.00006838478,0.0008347446,0.00056987844,0.0017500427,0.00009301704,0.0000021546584],"category_scores_gemma":[0.0005609336,0.00007837518,0.000049888607,0.00006477831,0.00012657978,0.0004024681,0.00036579184,0.0004213334,0.0000014921312],"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.00034806228,0.000087203895,0.13673942,0.00013924848,0.0003394268,0.0000061302185,0.0034189522,0.0028579168,0.13706656,0.68828833,0.0017944876,0.02891428],"study_design_scores_gemma":[0.0004924322,0.000063088424,0.023178987,0.0012894704,0.00001472284,0.000018258168,0.00066105905,0.92733675,0.04306336,0.0035728328,0.0001501993,0.0001588237],"about_ca_topic_score_codex":0.000047890597,"about_ca_topic_score_gemma":0.000002064529,"teacher_disagreement_score":0.9244788,"about_ca_system_score_codex":0.000029549408,"about_ca_system_score_gemma":0.000055497105,"threshold_uncertainty_score":0.6420265},"labels":[],"label_agreement":null},{"id":"W2759836588","doi":"10.1609/icaps.v27i1.13825","title":"Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Node (physics); Heuristics; Mathematical optimization; Class (philosophy); Bidirectional search; Heuristic; Incremental heuristic search; Search algorithm; Beam search; Computer science; Front (military); Focus (optics); Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.08026908485261397,"score_gpt":0.3518153585259207,"score_spread":0.27154627367330675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759836588","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.98145247,0.000017784845,0.012655288,0.0028736223,0.00037788547,0.00012475453,0.000014610837,0.00012608139,0.0023575295],"genre_scores_gemma":[0.99156165,0.0000080263235,0.008223398,0.00007746697,0.000029811235,0.00001976367,0.000002854121,0.000005271111,0.00007174898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990393,0.0000061935143,0.00021884979,0.00027961188,0.00029242525,0.00016364982],"domain_scores_gemma":[0.99917835,0.000082294566,0.00018580622,0.00012419639,0.0003854309,0.000043923905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042484477,0.00010397643,0.00012405762,0.0001358406,0.0003945531,0.00045251468,0.0009654836,0.00005936589,0.0000032281346],"category_scores_gemma":[0.00033670798,0.000084110245,0.000038921153,0.00006652839,0.00008268975,0.00027477354,0.00020493481,0.00018754712,0.0000016558363],"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.00012489443,0.0002293534,0.04462207,0.00012044366,0.00006259129,0.0000034746117,0.0023943821,0.021567222,0.10925369,0.8189411,0.00037896118,0.0023018003],"study_design_scores_gemma":[0.00028138625,0.000038661456,0.023124235,0.0006087492,0.0000032442626,0.000009397041,0.00015985213,0.96215826,0.007668556,0.0058434,0.000007857084,0.00009637242],"about_ca_topic_score_codex":0.000038063943,"about_ca_topic_score_gemma":0.0000012204978,"teacher_disagreement_score":0.9405911,"about_ca_system_score_codex":0.000032885266,"about_ca_system_score_gemma":0.0000815609,"threshold_uncertainty_score":0.43636093},"labels":[],"label_agreement":null},{"id":"W2760276144","doi":"10.1609/icaps.v27i1.13803","title":"Analytic Decision Analysis via Symbolic Dynamic Programming for Parameterized Hybrid MDPs","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parameterized complexity; Mathematical optimization; Computer science; Leverage (statistics); Discretization; Nonlinear programming; Convex optimization; Dynamic programming; Scalability; Piecewise; Optimization problem; Nonlinear system; Mathematics; Regular polygon; Algorithm; Artificial intelligence","score_opus":0.03706048564634457,"score_gpt":0.3302437727257557,"score_spread":0.29318328707941116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760276144","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.58571804,0.000012641448,0.41257322,0.0005825278,0.0002556452,0.0001931016,0.0000030076385,0.0001885879,0.00047322427],"genre_scores_gemma":[0.9038379,0.000007230429,0.09597579,0.00004386581,0.000016884635,0.000018316683,0.0000049696755,0.000009034948,0.00008599583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984875,0.0000065619397,0.00038861006,0.00039821948,0.00047772427,0.00024142789],"domain_scores_gemma":[0.998258,0.00015595107,0.00077454804,0.00028386043,0.0004627568,0.00006487887],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005826006,0.00018148539,0.00029919096,0.00030701162,0.00050658087,0.0012875793,0.0019785804,0.00006101223,0.00000327082],"category_scores_gemma":[0.00084466586,0.00014139498,0.00015574075,0.00017871108,0.000090161775,0.0004635203,0.00041131896,0.00019116458,0.0000017121544],"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.0005149153,0.00017813343,0.12100202,0.000303105,0.0037018342,0.000010569457,0.0024797274,0.69142044,0.043570213,0.078183465,0.00010960701,0.058525972],"study_design_scores_gemma":[0.0003804905,0.00007175876,0.01134292,0.0003548182,0.000107466236,0.000008801695,0.000058445607,0.98397154,0.0019267453,0.001598872,0.000022985352,0.00015516575],"about_ca_topic_score_codex":0.000013663217,"about_ca_topic_score_gemma":5.8010363e-7,"teacher_disagreement_score":0.31811988,"about_ca_system_score_codex":0.000047325844,"about_ca_system_score_gemma":0.000038824364,"threshold_uncertainty_score":0.9997492},"labels":[],"label_agreement":null},{"id":"W2789610989","doi":"10.1609/icaps.v28i1.13920","title":"Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Exploration Systems; National Aeronautics and Space Administration","keywords":"Computer science; Satisficing; Task (project management); Time horizon; Constraint (computer-aided design); Class (philosophy); Constraint programming; Quantum; Baseline (sea); Mathematical optimization; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Routing (electronic design automation)","score_opus":0.08699356612568282,"score_gpt":0.3177409570303168,"score_spread":0.23074739090463398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789610989","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.8692251,0.0001243405,0.12624083,0.0012428663,0.0006891085,0.0006050503,0.000025807294,0.0004713812,0.0013755359],"genre_scores_gemma":[0.9394303,0.000012045232,0.060351413,0.00005947768,0.00006723905,0.000029788871,0.000025481782,0.0000134316815,0.000010800216],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998388,0.000015822416,0.0005053725,0.0005660334,0.00031496322,0.00020980208],"domain_scores_gemma":[0.9983487,0.00014998681,0.00073474046,0.00009812651,0.00058807613,0.00008037312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064884505,0.00028095933,0.00034322034,0.00024654716,0.00032597542,0.0010167536,0.00047102175,0.00018535502,0.0000021570797],"category_scores_gemma":[0.0002792666,0.00024314164,0.000054169825,0.000098533135,0.00022097022,0.00030624037,0.00058998726,0.0004609528,1.9528501e-7],"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.00015320253,0.00007327478,0.48659754,0.0010596864,0.0003851902,0.0000027618762,0.013008321,0.0071209087,0.0067033996,0.4663975,0.00015916357,0.018339083],"study_design_scores_gemma":[0.00038774943,0.000066775094,0.0123001,0.0029619099,0.000023923787,0.00004227124,0.0012653392,0.97532237,0.00053070096,0.0068287826,0.000022751477,0.0002473598],"about_ca_topic_score_codex":0.000020791984,"about_ca_topic_score_gemma":0.0000015094577,"teacher_disagreement_score":0.9682014,"about_ca_system_score_codex":0.00005007519,"about_ca_system_score_gemma":0.00010159038,"threshold_uncertainty_score":0.9915028},"labels":[],"label_agreement":null},{"id":"W2809867153","doi":"10.1609/icaps.v28i1.13885","title":"MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Merge (version control); Heuristics; Computer science; Algorithm; Parallel computing","score_opus":0.04241745071625335,"score_gpt":0.3183386825914925,"score_spread":0.27592123187523915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809867153","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.91078156,0.00028734293,0.037061896,0.013958494,0.0010763332,0.0002964496,0.000027440054,0.0010168878,0.035493568],"genre_scores_gemma":[0.8813511,0.000010855499,0.11795688,0.0004240772,0.00009187644,0.0000064289684,0.0000037954662,0.0000090097865,0.00014596933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859816,0.000021525413,0.00033055615,0.000410797,0.00039863394,0.00024033761],"domain_scores_gemma":[0.9989961,0.00014606521,0.0002872783,0.000111252426,0.00037371856,0.00008563179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343771,0.00019133749,0.0002036611,0.00017187043,0.00033011872,0.00032854202,0.0009280772,0.00007453168,0.000032659544],"category_scores_gemma":[0.00012017088,0.00014461463,0.00004401266,0.0002061484,0.00009895994,0.00033564545,0.00042516066,0.00026280843,0.000005108263],"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.00021969837,0.00011746522,0.058746107,0.00020115692,0.00045503813,0.000009349323,0.012519539,0.0005128642,0.09354323,0.8131754,0.006622348,0.013877807],"study_design_scores_gemma":[0.0003440235,0.00012784488,0.002951896,0.0008351203,0.00001635643,0.000050861345,0.0002651428,0.96629983,0.021529347,0.0064432276,0.000928278,0.00020806755],"about_ca_topic_score_codex":0.00005815813,"about_ca_topic_score_gemma":0.0000011375326,"teacher_disagreement_score":0.965787,"about_ca_system_score_codex":0.0000239167,"about_ca_system_score_gemma":0.00004828859,"threshold_uncertainty_score":0.5897214},"labels":[],"label_agreement":null},{"id":"W2810026609","doi":"10.1609/icaps.v28i1.13919","title":"Compiling Optimal Numeric Planning to Mixed Integer Linear Programming","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Mathematical optimization; Linear programming; Computer science; Encoding (memory); Heuristic; Integer (computer science); Dependency (UML); Simple (philosophy); State (computer science); Class (philosophy); Branch and price; Action (physics); Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.06534018288188553,"score_gpt":0.34910988811430615,"score_spread":0.2837697052324206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810026609","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.8236452,0.000020645175,0.17142029,0.000764758,0.0008147702,0.00018561655,0.000002130985,0.0004946309,0.0026519904],"genre_scores_gemma":[0.60675544,8.3741367e-7,0.3929944,0.00012202651,0.00007923332,0.00001059758,0.0000010189049,0.0000081009675,0.000028351074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984666,0.000017173055,0.00037887835,0.00040861158,0.00046220855,0.00026650593],"domain_scores_gemma":[0.9987142,0.00006671661,0.0003148544,0.00014493396,0.0006665848,0.000092704235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815604,0.00018627656,0.00019331764,0.00023366736,0.00025385,0.00034694647,0.0013225834,0.00008098199,0.0000054086845],"category_scores_gemma":[0.00057786825,0.0001499904,0.000046969893,0.00041433892,0.00010826415,0.00043970734,0.00044292683,0.0002856196,0.000011832354],"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.00064872706,0.00029817893,0.040758204,0.00025637142,0.00038652585,0.000009373552,0.03168927,0.04263869,0.24804334,0.5894772,0.00077096367,0.045023147],"study_design_scores_gemma":[0.00016211202,0.00015996637,0.0024278734,0.00083103526,0.0000064021133,0.000025675941,0.00077749917,0.9482169,0.04662629,0.00033993553,0.0002521163,0.0001741645],"about_ca_topic_score_codex":0.000008767527,"about_ca_topic_score_gemma":1.1528551e-7,"teacher_disagreement_score":0.90557826,"about_ca_system_score_codex":0.000048016896,"about_ca_system_score_gemma":0.000049628812,"threshold_uncertainty_score":0.61164314},"labels":[],"label_agreement":null},{"id":"W2810178509","doi":"10.1609/icaps.v28i1.13908","title":"Finite LTL Synthesis as Planning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear temporal logic; Leverage (statistics); Automaton; Program synthesis; Finite-state machine; Theoretical computer science; Bottleneck; Transformation (genetics); Exploit; Algorithm; Artificial intelligence","score_opus":0.06458275588763768,"score_gpt":0.33623961333948554,"score_spread":0.27165685745184787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810178509","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.93707895,0.000034277455,0.014083892,0.0013405511,0.0007558843,0.00011355396,0.0000036728695,0.0005380907,0.046051104],"genre_scores_gemma":[0.8807368,0.000005330282,0.118892595,0.00018924905,0.00007260361,0.000010584252,5.2541833e-7,0.0000073968986,0.00008488901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882126,0.000014673816,0.00027318657,0.00030457613,0.000408737,0.00017757676],"domain_scores_gemma":[0.99884415,0.00019769673,0.00032025806,0.0001319037,0.00045313223,0.000052838506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062576984,0.00013956167,0.00014133276,0.00016722357,0.00021455938,0.00030630865,0.0012164399,0.00007939341,0.000015991905],"category_scores_gemma":[0.0016805881,0.000109004955,0.00003892874,0.00022222767,0.00012167532,0.0004468579,0.0002770967,0.00019203615,0.000017542261],"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.00014851254,0.000068513975,0.015284948,0.000084509724,0.00013430713,0.0000032182859,0.0058341185,0.0016929148,0.09485862,0.874532,0.00040342726,0.0069549577],"study_design_scores_gemma":[0.000102963444,0.00007381557,0.003831462,0.000854181,0.0000070883957,0.00002254021,0.00033605398,0.8563024,0.13355324,0.004687189,0.000097802484,0.00013127018],"about_ca_topic_score_codex":0.000009582071,"about_ca_topic_score_gemma":9.070921e-8,"teacher_disagreement_score":0.8698448,"about_ca_system_score_codex":0.000030034047,"about_ca_system_score_gemma":0.000058136095,"threshold_uncertainty_score":0.4445093},"labels":[],"label_agreement":null},{"id":"W2910547178","doi":"10.1609/icaps.v29i1.3505","title":"Robust and Adaptive Planning under Model Uncertainty","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Robustness (evolution); Computation; Mathematical optimization; Computer science; Adversary; Monte Carlo method; Tree (set theory); Decision tree; Monte Carlo tree search; Bayesian probability; Artificial intelligence; Algorithm; Mathematics","score_opus":0.2897143656682048,"score_gpt":0.4215858200438864,"score_spread":0.1318714543756816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910547178","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.96611905,0.00038166923,0.020769222,0.002182487,0.00075240724,0.0005156384,0.00014152713,0.0002425404,0.008895442],"genre_scores_gemma":[0.98843515,0.00004102605,0.010501551,0.00012217279,0.000077393524,0.000020086274,0.000009729501,0.000026569927,0.0007663322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585146,0.000031814692,0.00072166696,0.000977456,0.0020760605,0.00034152335],"domain_scores_gemma":[0.99643344,0.0006517818,0.00091791275,0.00024202892,0.0016312688,0.00012354844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017710121,0.0003756681,0.0005558572,0.00051562017,0.0002332016,0.00087467686,0.001702132,0.0003259618,0.000030244624],"category_scores_gemma":[0.0017224835,0.0002601492,0.00010951313,0.0002317903,0.00027398125,0.0003208224,0.0020007421,0.0013148221,0.0000069513035],"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.00017901699,0.000020315507,0.002640448,0.00003996111,0.00009441901,0.0000015580486,0.0009844503,0.9884625,0.00072239316,0.0059421165,0.00027481565,0.00063798774],"study_design_scores_gemma":[0.00033342745,0.000050926432,0.0022178881,0.0014224502,0.00001768622,0.000013425895,0.0033899997,0.9371794,0.0005065016,0.054597568,0.0000106824045,0.0002600867],"about_ca_topic_score_codex":0.000028416425,"about_ca_topic_score_gemma":8.4732227e-7,"teacher_disagreement_score":0.051283162,"about_ca_system_score_codex":0.00011912704,"about_ca_system_score_gemma":0.0002808471,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2964574649","doi":"10.1609/icaps.v29i1.3460","title":"Towards a Unified View of AI Planning and Reactive Synthesis","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Plan (archaeology); Linear temporal logic; Computer science; Temporal logic; Automated planning and scheduling; Artificial intelligence; Theoretical computer science; Geography","score_opus":0.04851122598432915,"score_gpt":0.32375637927044454,"score_spread":0.2752451532861154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964574649","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.98497653,0.00008124208,0.0036554064,0.00076501793,0.00022669685,0.00013629897,0.0000042415286,0.00013379888,0.010020768],"genre_scores_gemma":[0.93325,0.000010936561,0.06660997,0.00007849689,0.000010898689,0.000007256181,5.5841673e-7,0.0000057924085,0.000026093685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899626,0.000016775924,0.00027536452,0.00025966333,0.00033234587,0.00011956511],"domain_scores_gemma":[0.9990356,0.00011803049,0.0003519511,0.00010441512,0.00035436815,0.00003565465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062069885,0.00012209038,0.00020348087,0.00014646794,0.00006068984,0.00012940486,0.00065556075,0.000071194,0.0000049530563],"category_scores_gemma":[0.00043679736,0.00009438441,0.000031419382,0.00016773863,0.00006340826,0.0004278766,0.00022323316,0.00021342022,0.00000135237],"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.00014933536,0.000052169904,0.031128997,0.0002875279,0.00013949418,9.813223e-7,0.0046198117,0.00084891886,0.17104207,0.78174055,0.000030467096,0.009959681],"study_design_scores_gemma":[0.00017919336,0.00007237246,0.019338673,0.0017648329,0.000011656336,0.000020774061,0.0006445673,0.8309528,0.14290215,0.0039512687,0.00003147505,0.00013019377],"about_ca_topic_score_codex":0.000016360062,"about_ca_topic_score_gemma":4.3543235e-8,"teacher_disagreement_score":0.83010393,"about_ca_system_score_codex":0.000024012674,"about_ca_system_score_gemma":0.00005438537,"threshold_uncertainty_score":0.38488844},"labels":[],"label_agreement":null},{"id":"W2964981248","doi":"10.1609/icaps.v29i1.3462","title":"Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Heuristic; Computer science; Task (project management); Relaxation (psychology); Algorithm; State (computer science); Computation; Theoretical computer science; Binary number; Mathematical optimization; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.04687297143215736,"score_gpt":0.3066115264322689,"score_spread":0.25973855500011156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964981248","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.8712243,0.00019771022,0.10933499,0.008096627,0.0008914775,0.00041815636,0.00006113527,0.0011003338,0.008675292],"genre_scores_gemma":[0.9220948,0.0000029644061,0.077213794,0.00040994494,0.000059911985,0.00002721804,0.000033542714,0.000018586099,0.00013924463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820703,0.000029904691,0.0003965013,0.0005561497,0.00052562146,0.00028476227],"domain_scores_gemma":[0.99820447,0.00038475945,0.00043979724,0.0002486298,0.0006021468,0.00012021059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006850284,0.00023247323,0.00023602822,0.00019144762,0.0003778386,0.00052194606,0.0011061503,0.00013089774,0.0000077045515],"category_scores_gemma":[0.0015540202,0.00019376773,0.000080971804,0.00026415806,0.00004330413,0.00042214838,0.00018227978,0.00035463463,0.0000015448884],"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.0015444326,0.0005183867,0.054380335,0.0008867947,0.00040021632,0.00006777111,0.0101589095,0.37520382,0.09429538,0.45060235,0.0046086726,0.007332922],"study_design_scores_gemma":[0.0007365694,0.00025263394,0.0018423204,0.002202069,0.00001870599,0.000019849213,0.00032361486,0.97448945,0.01359444,0.006187723,0.0000984279,0.00023418273],"about_ca_topic_score_codex":0.000010635646,"about_ca_topic_score_gemma":4.883232e-7,"teacher_disagreement_score":0.59928566,"about_ca_system_score_codex":0.00005355068,"about_ca_system_score_gemma":0.00021334772,"threshold_uncertainty_score":0.79016185},"labels":[],"label_agreement":null},{"id":"W2965569070","doi":"10.1609/icaps.v29i1.3529","title":"Learning Interpretable Models Expressed in Linear Temporal Logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Artificial intelligence; Computer science; Linear temporal logic; Oracle; Classifier (UML); Machine learning; Relevance (law); Set (abstract data type); Feature learning; Temporal logic; Theoretical computer science","score_opus":0.034693092630761306,"score_gpt":0.2746181787677578,"score_spread":0.23992508613699648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965569070","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.98099864,0.000070805116,0.0040118922,0.0010645646,0.0003581318,0.00014229567,0.0000029160453,0.00035399865,0.012996769],"genre_scores_gemma":[0.98255146,0.000009315697,0.0169172,0.00013964003,0.000018647579,0.0000071873424,0.0000034679585,0.000009773821,0.0003432868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868107,0.000019625293,0.0003283138,0.0003779216,0.00035724134,0.0002358501],"domain_scores_gemma":[0.99925286,0.000115869756,0.00028077056,0.00009901668,0.00020402698,0.00004746944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094693,0.00017105769,0.0002185737,0.00020936906,0.00009388377,0.00023464626,0.000980353,0.00009863582,0.000011960562],"category_scores_gemma":[0.00011613791,0.00013487671,0.0000467667,0.00022165768,0.000031407024,0.0005794755,0.00030687204,0.0004998436,0.000007781716],"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.00020377748,0.000110900466,0.21220276,0.00020762088,0.00009449525,0.000008791258,0.009092001,0.5188761,0.073684774,0.1837224,0.00019763938,0.0015987513],"study_design_scores_gemma":[0.00032668418,0.000089985755,0.00082461326,0.0013947684,0.0000028134707,0.000008960975,0.0004902803,0.98590094,0.0041952212,0.0065762913,0.000032599477,0.00015682803],"about_ca_topic_score_codex":0.00004468288,"about_ca_topic_score_gemma":3.5102073e-7,"teacher_disagreement_score":0.46702486,"about_ca_system_score_codex":0.000035239987,"about_ca_system_score_gemma":0.000061643645,"threshold_uncertainty_score":0.5500113},"labels":[],"label_agreement":null},{"id":"W2965668794","doi":"10.1609/icaps.v29i1.3548","title":"A Logical Semantics for PDDL+","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Computer science; Semantics (computer science); Rotation formalisms in three dimensions; Situation calculus; Operational semantics; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.05743131545813914,"score_gpt":0.3053202317283896,"score_spread":0.24788891627025048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965668794","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.94154346,0.0002152727,0.020407235,0.0060614296,0.00089676067,0.00017820623,0.000009169589,0.0004897835,0.030198688],"genre_scores_gemma":[0.9728603,0.000014028982,0.026522055,0.00020756056,0.0000584653,0.000008666727,0.0000024585531,0.0000051048974,0.00032137224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910897,0.000006043439,0.00019754354,0.00028287547,0.00024362096,0.00016092231],"domain_scores_gemma":[0.9989704,0.00010614626,0.00016094792,0.00007730024,0.00063729513,0.000047940044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026059104,0.0001134903,0.00015102346,0.000056147775,0.0001406281,0.0003037082,0.00066415087,0.000072838986,0.000006962081],"category_scores_gemma":[0.00052454416,0.000081184815,0.00006533925,0.00013458349,0.000043719418,0.00016516002,0.00026156075,0.00014529125,0.0000024542808],"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.00002505907,0.00006577167,0.005922456,0.000057914178,0.000059329675,0.0000037626596,0.0010085492,0.00020162137,0.027911542,0.9632674,0.0005076636,0.0009689214],"study_design_scores_gemma":[0.0003603811,0.000061044855,0.0023220107,0.0004133051,0.0000107777905,0.000056621844,0.0003443549,0.9454399,0.031767584,0.018716175,0.00036695585,0.00014089145],"about_ca_topic_score_codex":0.0000015544099,"about_ca_topic_score_gemma":2.8538634e-7,"teacher_disagreement_score":0.9452383,"about_ca_system_score_codex":0.000018606599,"about_ca_system_score_gemma":0.000074672316,"threshold_uncertainty_score":0.33106208},"labels":[],"label_agreement":null},{"id":"W2966291835","doi":"10.1609/icaps.v29i1.3474","title":"A Multi-Label A* Algorithm for Multi-Agent Pathfinding","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Pathfinding; Computer science; Computation; Pickup; Set (abstract data type); Heuristic; Sequence (biology); Mathematical optimization; Path (computing); Job shop scheduling; Algorithm; Theoretical computer science; Artificial intelligence; Shortest path problem; Mathematics; Schedule; Graph","score_opus":0.08975077837246882,"score_gpt":0.3315500664996794,"score_spread":0.24179928812721058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966291835","genre_codex":"empirical","genre_gemma":"methods","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.51446766,0.00010633404,0.47996277,0.0010141128,0.0020241074,0.0007325503,0.00003797234,0.00080179196,0.00085270725],"genre_scores_gemma":[0.3532882,0.0000040882187,0.6462588,0.000112900256,0.000029635863,0.000021285789,0.0000033314952,0.000011854704,0.00026993785],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984575,0.00000909221,0.00034816164,0.00047478368,0.00042084616,0.0002896246],"domain_scores_gemma":[0.9988872,0.000104441526,0.0003694637,0.0001358514,0.0004276138,0.00007545287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456024,0.0002114858,0.00024213642,0.0001752242,0.000161829,0.0003152151,0.0012256928,0.0001040571,0.0000038715134],"category_scores_gemma":[0.0002073517,0.00016699199,0.00006796462,0.00016209258,0.00004092362,0.00034404255,0.000306988,0.0002494476,0.000012298493],"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.00022939064,0.0016209322,0.11213258,0.0008227231,0.0013309959,0.000029660227,0.020979505,0.02349365,0.5235699,0.14779861,0.0011036936,0.16688836],"study_design_scores_gemma":[0.0011479525,0.00008843892,0.0027815062,0.00076750305,0.000009450765,0.000024527248,0.00034004572,0.9891583,0.005277244,0.00018652495,0.00001985158,0.00019867416],"about_ca_topic_score_codex":0.000008790404,"about_ca_topic_score_gemma":5.5049853e-8,"teacher_disagreement_score":0.9656646,"about_ca_system_score_codex":0.000056134773,"about_ca_system_score_gemma":0.00006496481,"threshold_uncertainty_score":0.6809736},"labels":[],"label_agreement":null},{"id":"W2966466466","doi":"10.1609/icaps.v29i1.3504","title":"Learning Scheduling Models from Event Data","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Solver; Petri net; Job shop scheduling; Constraint programming; Schedule; Artificial intelligence; Distributed computing; Programming language; Mathematical optimization; Engineering; Operations management","score_opus":0.06287514748996063,"score_gpt":0.2836487717362305,"score_spread":0.22077362424626984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966466466","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.9878938,0.00010803343,0.00055443554,0.0014567071,0.00033577855,0.00009424269,0.000008562419,0.00032835317,0.009220046],"genre_scores_gemma":[0.9974879,0.000020748017,0.0016499365,0.00033222084,0.0002625803,0.000004255949,0.00007064589,0.000024023755,0.00014769805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838287,0.0000032461949,0.00037367875,0.000504048,0.0005311985,0.0002049479],"domain_scores_gemma":[0.9986799,0.000046397814,0.0005193235,0.00017494409,0.0005633747,0.000016108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954357,0.00020990756,0.00026789316,0.00022713229,0.00019531269,0.00059006567,0.0011249701,0.00009420691,0.00006465883],"category_scores_gemma":[0.00025951094,0.00016344452,0.00006131342,0.00027846772,0.000041211264,0.0013811653,0.00068201794,0.00037531153,0.00003076223],"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.00023451376,0.00012648178,0.1439308,0.0003828615,0.00043231118,0.0000021045444,0.00055386784,0.74684286,0.030295702,0.07377074,0.0002014111,0.0032263421],"study_design_scores_gemma":[0.0003262719,0.000006315748,0.0009964638,0.0011768254,0.00006378444,0.000001337848,0.0012902414,0.9871498,0.00028765062,0.008407409,0.000096631135,0.0001973203],"about_ca_topic_score_codex":0.00028323548,"about_ca_topic_score_gemma":0.0000014969739,"teacher_disagreement_score":0.24030687,"about_ca_system_score_codex":0.000018524332,"about_ca_system_score_gemma":0.000033243192,"threshold_uncertainty_score":0.6665074},"labels":[],"label_agreement":null},{"id":"W2966682271","doi":"10.1609/icaps.v29i1.3490","title":"Error-Tolerant Anytime Approach to Plan Recognition Using a Particle Filter","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"AGE-WELL","keywords":"Computer science; Plan (archaeology); Extension (predicate logic); Particle filter; Filter (signal processing); Artificial intelligence; Tree (set theory); Machine learning; Kalman filter; Programming language; Computer vision; Mathematics","score_opus":0.10255879337915103,"score_gpt":0.2977517847957307,"score_spread":0.1951929914165797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966682271","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.962821,0.000012272293,0.028951421,0.0016730968,0.00022663,0.00009962389,0.000009189226,0.00020595679,0.0060008327],"genre_scores_gemma":[0.9280688,0.0000018659515,0.07152045,0.0003223391,0.000022306993,0.0000050530516,0.0000058632268,0.000004999521,0.000048321413],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991222,0.000011379288,0.00020971941,0.00026420728,0.00026412794,0.00012837931],"domain_scores_gemma":[0.9993613,0.00002846384,0.00012874744,0.00006869408,0.00035155515,0.00006128405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018866586,0.00009885305,0.00010977761,0.00007782997,0.00012366723,0.00028594246,0.0002771916,0.000050722494,0.000018830688],"category_scores_gemma":[0.00012666157,0.000083721636,0.000030235622,0.00021806858,0.000024117095,0.00028374075,0.00013498175,0.00013389911,0.0000041534286],"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.00026909067,0.0005489492,0.041832533,0.0002137567,0.00038283507,0.0000179651,0.017271971,0.21804692,0.5393788,0.15767977,0.0008978257,0.023459578],"study_design_scores_gemma":[0.00019847798,0.00001646606,0.0026479731,0.00026929166,0.0000067678857,0.00006679277,0.00055600726,0.9760384,0.019628674,0.00044743903,0.000017393666,0.000106340194],"about_ca_topic_score_codex":0.0000074196337,"about_ca_topic_score_gemma":3.285092e-7,"teacher_disagreement_score":0.75799143,"about_ca_system_score_codex":0.000028593337,"about_ca_system_score_gemma":0.000059772065,"threshold_uncertainty_score":0.3414069},"labels":[],"label_agreement":null},{"id":"W2966782683","doi":"10.1609/icaps.v29i1.3496","title":"Lagrangian Decomposition for Optimal Cost Partitioning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"European Commission","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristics; Solver; Computation; Computer science; Context (archaeology); Heuristic; Lagrange multiplier; Decomposition; Mathematics; Algorithm","score_opus":0.046115230530977894,"score_gpt":0.323265699325086,"score_spread":0.2771504687941081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966782683","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.7654353,0.00010357557,0.21796378,0.007923576,0.001178162,0.00034564428,0.000030807765,0.00070959196,0.0063095745],"genre_scores_gemma":[0.78059715,0.000004029566,0.2190872,0.00016344381,0.000044617853,0.00002017227,0.00001047397,0.0000062772287,0.00006666305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900204,0.000008368741,0.00023492517,0.00029420687,0.00028227316,0.00017816192],"domain_scores_gemma":[0.9990083,0.00009759625,0.00020209057,0.000081648635,0.00055719644,0.000053185548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029789915,0.000117607764,0.0001404788,0.00008241752,0.00020801183,0.00036276443,0.0005230018,0.00006256599,0.000003925227],"category_scores_gemma":[0.00023798463,0.000101335245,0.000055600663,0.00015726227,0.000036127723,0.00029564035,0.00014949068,0.0001478014,0.0000019662327],"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.00014843741,0.00024504177,0.020099191,0.00021866361,0.00035782112,0.000024923926,0.004606542,0.118666,0.2423797,0.6040395,0.0016336145,0.0075805755],"study_design_scores_gemma":[0.00033098864,0.000037381167,0.0028562632,0.00064114,0.000010218968,0.00006412796,0.00023910154,0.9524232,0.04187812,0.0013421115,0.000060404127,0.000116933894],"about_ca_topic_score_codex":0.000003269836,"about_ca_topic_score_gemma":9.703305e-8,"teacher_disagreement_score":0.8337572,"about_ca_system_score_codex":0.0000321605,"about_ca_system_score_gemma":0.00006911793,"threshold_uncertainty_score":0.41323313},"labels":[],"label_agreement":null},{"id":"W3022772269","doi":"10.1609/icaps.v23i1.13578","title":"Temporal-Difference Search in Computer Go","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Search algorithm; Reinforcement learning; Beam search; Tree (set theory); Binary search algorithm; Artificial intelligence; Temporal difference learning; Search tree; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.06008416597085555,"score_gpt":0.31047455053372397,"score_spread":0.25039038456286844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022772269","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.9883174,0.000019569818,0.005447683,0.0029292013,0.0002706409,0.00016485626,0.0000012083473,0.00021505289,0.002634412],"genre_scores_gemma":[0.9763987,0.000006684259,0.023237703,0.00018960454,0.00003457626,0.000013778323,7.44665e-7,0.0000063581215,0.000111834495],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869174,0.000012644256,0.00033473922,0.00032668715,0.00041602325,0.00021816656],"domain_scores_gemma":[0.9991837,0.00009791753,0.00015666273,0.00011017343,0.00039511253,0.00005642033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170609,0.00014121002,0.00016054268,0.00018983406,0.00008245157,0.00043489825,0.001339599,0.00007214637,0.000020713627],"category_scores_gemma":[0.000107641456,0.00010520813,0.000029853529,0.00024160849,0.0000942503,0.00041725198,0.0004165713,0.00029378445,0.00002664325],"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.000054149496,0.0002608417,0.43390876,0.00011376071,0.00009059003,0.000008016477,0.010278942,0.013221631,0.14044045,0.35258883,0.0008171656,0.048216857],"study_design_scores_gemma":[0.000077893375,0.0000506214,0.031817574,0.00047202676,0.0000011399616,0.000008968484,0.00026172498,0.9434426,0.017031182,0.0067135175,0.000006633835,0.000116163756],"about_ca_topic_score_codex":0.00015390161,"about_ca_topic_score_gemma":0.0000018852396,"teacher_disagreement_score":0.9302209,"about_ca_system_score_codex":0.00003684623,"about_ca_system_score_gemma":0.00004704082,"threshold_uncertainty_score":0.4290263},"labels":[],"label_agreement":null},{"id":"W3037289440","doi":"10.1609/icaps.v30i1.6672","title":"Predicting the Effectiveness of Bidirectional Heuristic Search","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Incremental heuristic search; Beam search; Heuristic; Bidirectional search; Computer science; Best-first search; Set (abstract data type); Search algorithm; Iterative deepening depth-first search; Artificial intelligence; Consistent heuristic; Space (punctuation); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.04473747509593059,"score_gpt":0.28533179241940027,"score_spread":0.24059431732346967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037289440","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.98947877,0.00008384689,0.0037730422,0.0024966714,0.00022991549,0.00013324236,0.00000898363,0.00023743557,0.003558102],"genre_scores_gemma":[0.99675053,0.000004787408,0.0030627125,0.00010869963,0.00004677306,0.000006133468,0.0000018120714,0.000006545753,0.000011988158],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998839,0.000049519444,0.00024896255,0.0002559436,0.00046232884,0.0001442353],"domain_scores_gemma":[0.9986878,0.0006086751,0.00021316203,0.000067747664,0.00037048646,0.000052138435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010826695,0.0001194141,0.00015805702,0.000067009045,0.00019576012,0.00015173166,0.0009239339,0.000052343414,0.000003917172],"category_scores_gemma":[0.00063642,0.00007811969,0.000049816626,0.00026827303,0.000081861646,0.00017411743,0.00025726255,0.00032178458,0.0000014469682],"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.00065955566,0.00009877422,0.4199786,0.000953169,0.00039203596,0.0000054648617,0.009796338,0.069508456,0.23222692,0.2641068,0.00029358076,0.0019803043],"study_design_scores_gemma":[0.00020613744,0.00009092836,0.018211074,0.0010629776,0.000009331448,0.000014371321,0.00029137105,0.94421595,0.0347881,0.0010134387,0.000010677207,0.000085615255],"about_ca_topic_score_codex":0.000027946951,"about_ca_topic_score_gemma":7.832699e-8,"teacher_disagreement_score":0.8747075,"about_ca_system_score_codex":0.000017340677,"about_ca_system_score_gemma":0.000081431186,"threshold_uncertainty_score":0.31856284},"labels":[],"label_agreement":null},{"id":"W3037357983","doi":"10.1609/icaps.v30i1.6642","title":"Probabilistic Robust Multi-Agent Path Finding","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Probabilistic logic; Path (computing); Set (abstract data type); Computer science; Task (project management); Mathematical optimization; Algorithm; Robustness (evolution); Mathematics; Artificial intelligence; Engineering","score_opus":0.11003610080036016,"score_gpt":0.2997737098215403,"score_spread":0.18973760902118011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037357983","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.8955045,0.0001115355,0.08442745,0.012128721,0.0010659358,0.0004597089,0.000019164583,0.001537177,0.0047458513],"genre_scores_gemma":[0.85604054,0.0000042258507,0.14350456,0.00034035882,0.000048576887,0.000008431319,0.0000019069138,0.0000094853285,0.000041896677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985362,0.0000117496265,0.00032642655,0.00042821933,0.0004747273,0.00022264956],"domain_scores_gemma":[0.9991184,0.00007641086,0.00030931694,0.0000958517,0.00028367597,0.000116362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031320727,0.00018501254,0.00020089402,0.00008694497,0.00016215604,0.00032707487,0.00126333,0.000073660616,0.0000048569145],"category_scores_gemma":[0.0006678925,0.00014300246,0.00005268632,0.00024129546,0.00005854556,0.00028399972,0.00038391264,0.00031193692,0.000008175066],"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.00018562676,0.00040898318,0.06775259,0.00068709254,0.00050128356,0.0000702962,0.030432252,0.5243023,0.1053153,0.26229528,0.0023604203,0.0056885807],"study_design_scores_gemma":[0.00031395673,0.000067254194,0.0036926232,0.0006063921,0.000008805446,0.0000210786,0.0003318003,0.99226516,0.0022002952,0.00031395373,0.000018869723,0.00015981407],"about_ca_topic_score_codex":0.0000061340925,"about_ca_topic_score_gemma":3.8408906e-8,"teacher_disagreement_score":0.46796286,"about_ca_system_score_codex":0.000039506824,"about_ca_system_score_gemma":0.000064748936,"threshold_uncertainty_score":0.58314705},"labels":[],"label_agreement":null},{"id":"W3037476194","doi":"10.1609/icaps.v30i1.6750","title":"Symbolic Plans as High-Level Instructions for Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo","keywords":"Reinforcement learning; Computer science; Maximization; Task (project management); State (computer science); Action (physics); Artificial intelligence; Machine learning; Mathematical optimization; Programming language; Mathematics","score_opus":0.06793028415246624,"score_gpt":0.2946574244530109,"score_spread":0.22672714030054467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037476194","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.631974,0.000017726205,0.34088063,0.012548323,0.0009165037,0.00049085054,0.000009777928,0.0010173516,0.012144868],"genre_scores_gemma":[0.97727597,0.000009280958,0.021878233,0.00045593496,0.00006897823,0.00001698385,0.000007237454,0.000010793738,0.00027659026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987517,0.0000063784855,0.00032850323,0.00029223488,0.00042616457,0.00019502173],"domain_scores_gemma":[0.99907196,0.00008251376,0.00034326722,0.00007169991,0.0003472561,0.00008329513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020610711,0.0001560623,0.00016993974,0.0001040279,0.00025954598,0.0003147045,0.0009181796,0.00007120496,0.000009760322],"category_scores_gemma":[0.00057549065,0.00012935261,0.000055504366,0.00017914422,0.000047824444,0.00031554722,0.00027641022,0.00031048807,0.000006213363],"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.00004665603,0.0000074188,0.0025123565,0.000053907454,0.00007931708,4.933848e-7,0.0019802367,0.6440079,0.010483215,0.34025434,0.00016203463,0.0004121316],"study_design_scores_gemma":[0.0004229061,0.00018981256,0.0008624433,0.00029015454,0.000011807507,0.000011329817,0.0005378793,0.98829466,0.008106588,0.00087050715,0.000259129,0.00014280819],"about_ca_topic_score_codex":0.000012234156,"about_ca_topic_score_gemma":9.037417e-8,"teacher_disagreement_score":0.34530202,"about_ca_system_score_codex":0.000032683947,"about_ca_system_score_gemma":0.000067588786,"threshold_uncertainty_score":0.52748466},"labels":[],"label_agreement":null},{"id":"W3038024331","doi":"10.1609/icaps.v30i1.6661","title":"New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":45,"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":"University of Southern California; National Science Foundation","keywords":"Pairwise comparison; Homogeneous space; Path (computing); Symmetry (geometry); Context (archaeology); Rotational symmetry; Computer science; Symmetry breaking; Class (philosophy); Local symmetry; Theoretical computer science; Algorithm; Theoretical physics; Mathematics; Artificial intelligence; Physics; Geometry; Quantum mechanics","score_opus":0.09075200892442147,"score_gpt":0.32523314933394004,"score_spread":0.23448114040951856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038024331","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.38899943,0.0001678697,0.5929308,0.012135633,0.0007876237,0.00083564036,0.000021664518,0.0017207933,0.0024005445],"genre_scores_gemma":[0.6392721,0.0000037581028,0.36041272,0.00022286078,0.000047415775,0.000010855572,0.0000015154645,0.0000082631295,0.000020511212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870497,0.00000883238,0.00034608276,0.0003914073,0.000325242,0.00022348815],"domain_scores_gemma":[0.99924767,0.00011048544,0.00029340995,0.000074884345,0.00017836815,0.00009515846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040694175,0.00017181208,0.00021299471,0.00016581679,0.00009767483,0.00025043843,0.0010184664,0.00008786319,0.00000170067],"category_scores_gemma":[0.00052322994,0.00014242179,0.000055518496,0.0002674311,0.000023644949,0.0002995337,0.00026809896,0.00026044316,0.0000012456211],"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.0005176116,0.0004158381,0.22049841,0.0010981392,0.00048869284,0.000067654946,0.03906827,0.028301412,0.2692081,0.30284005,0.0041703586,0.13332543],"study_design_scores_gemma":[0.00041083246,0.00009469302,0.0029369376,0.0011851343,0.0000058842934,0.000012192601,0.00031280413,0.97949815,0.014707784,0.00063367514,0.000041309428,0.00016062942],"about_ca_topic_score_codex":0.000022991338,"about_ca_topic_score_gemma":1.3949818e-7,"teacher_disagreement_score":0.95119673,"about_ca_system_score_codex":0.00005000848,"about_ca_system_score_gemma":0.00008302837,"threshold_uncertainty_score":0.5807792},"labels":[],"label_agreement":null},{"id":"W3131156720","doi":"10.1609/icaps.v31i1.15972","title":"Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fairness measure; Distributed computing; Scheduling (production processes); Information exchange; Queueing theory; Maximum throughput scheduling; Computer network; Throughput; Dynamic priority scheduling; Round-robin scheduling; Mathematical optimization; Wireless; Quality of service","score_opus":0.06390188017009031,"score_gpt":0.31187907324612674,"score_spread":0.24797719307603644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131156720","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.69221497,0.00035517628,0.29697207,0.003663863,0.0014843997,0.0029080678,0.00009465497,0.00060162233,0.0017051611],"genre_scores_gemma":[0.9793661,0.000013707981,0.020130105,0.00009760613,0.00003382899,0.00030792673,0.000020590265,0.0000051431684,0.000024944982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989464,0.000011180716,0.00036731546,0.0002139683,0.00027554348,0.00018559142],"domain_scores_gemma":[0.99893475,0.000077036246,0.00028757492,0.00008240572,0.0005740431,0.00004417901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045353512,0.00012751519,0.0001736943,0.000116722134,0.00011106335,0.0005253443,0.0005503106,0.00008604555,0.0000017233485],"category_scores_gemma":[0.00023799388,0.0001043097,0.00004439329,0.0002423238,0.000021449163,0.0005988957,0.00020900439,0.00017454608,0.0000012066009],"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.0002553284,0.00030311904,0.04130425,0.0015028347,0.0002330999,0.000010506429,0.0070583676,0.2800748,0.022123914,0.63705873,0.00073173054,0.009343277],"study_design_scores_gemma":[0.0006137627,0.000028062785,0.0027117475,0.0013125506,0.0000034801399,0.000011863191,0.00056048884,0.9905327,0.0034027493,0.00035624576,0.00034656184,0.00011980334],"about_ca_topic_score_codex":0.000014393029,"about_ca_topic_score_gemma":9.987124e-7,"teacher_disagreement_score":0.71045786,"about_ca_system_score_codex":0.000051348245,"about_ca_system_score_gemma":0.00007330594,"threshold_uncertainty_score":0.5065907},"labels":[],"label_agreement":null},{"id":"W31312056","doi":"10.1609/icaps.v19i1.13387","title":"Computing Robust Plans in Continuous Domains","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Computer science; Random variable; Gaussian; State variable; Mathematical optimization; Mathematics; Statistics","score_opus":0.031302243109750494,"score_gpt":0.2745356781969923,"score_spread":0.24323343508724182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31312056","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.9783658,0.00006256727,0.005117356,0.003543457,0.00026080085,0.00011665511,0.00000487336,0.00041014515,0.012118351],"genre_scores_gemma":[0.97620744,0.0000050685862,0.023331247,0.0003625153,0.000036979192,0.0000016062747,0.0000025280972,0.0000056919985,0.000046937992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868023,0.000013535464,0.0003577091,0.0003360972,0.00035508905,0.0002573583],"domain_scores_gemma":[0.9992726,0.00011676441,0.00028285736,0.00009071923,0.00018071929,0.000056341974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964279,0.00017048698,0.0002148248,0.00021168395,0.00015685469,0.0003105331,0.0009963159,0.00008934992,0.0000027952376],"category_scores_gemma":[0.00016950723,0.00013733318,0.00004309351,0.00025528076,0.000039215665,0.00027881423,0.00014107111,0.00036969673,0.000002014321],"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.00019959247,0.00026460274,0.21920188,0.000108926295,0.00011664017,0.000046103167,0.012408153,0.11661895,0.05212204,0.5847551,0.0010661202,0.013091847],"study_design_scores_gemma":[0.00041892502,0.00009149627,0.021965213,0.0013367967,0.0000041932626,0.00003861603,0.0003864327,0.9693604,0.0029277175,0.0032701904,0.000024235533,0.00017578375],"about_ca_topic_score_codex":0.000020988891,"about_ca_topic_score_gemma":8.8599603e-7,"teacher_disagreement_score":0.8527414,"about_ca_system_score_codex":0.000037458416,"about_ca_system_score_gemma":0.000051457806,"threshold_uncertainty_score":0.56002843},"labels":[],"label_agreement":null},{"id":"W3173855118","doi":"10.1609/icaps.v31i1.15978","title":"Iterative-deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Heuristics; Iterative deepening depth-first search; Heuristic; Incremental heuristic search; Beam search; Bidirectional search; Search algorithm; Node (physics); Exploit; Algorithm; Artificial intelligence","score_opus":0.04752449624311907,"score_gpt":0.308609240293454,"score_spread":0.26108474405033494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173855118","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.902222,0.00015239771,0.05990585,0.005387003,0.00055710203,0.00026561547,0.000015890735,0.0006525544,0.030841613],"genre_scores_gemma":[0.9029922,0.000016810447,0.09611549,0.00008939992,0.000040042094,0.000009576762,0.0000055476876,0.00001009113,0.0007208776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982295,0.00003539764,0.00026492865,0.0003978302,0.00087210623,0.00020023294],"domain_scores_gemma":[0.99787647,0.00018853368,0.00016391664,0.00012016574,0.00156783,0.00008309166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036051287,0.00014175274,0.00017039465,0.00021397539,0.00023198774,0.0005637203,0.00070207426,0.000055868564,0.000044866683],"category_scores_gemma":[0.0006505038,0.00010496222,0.00003249364,0.00059813936,0.000085354404,0.00031509393,0.00032380896,0.00035311893,0.0000044850226],"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.00060133403,0.0006367383,0.044541564,0.0004301369,0.001076704,0.00023983003,0.008514477,0.14654447,0.20403768,0.57993644,0.0016298346,0.011810801],"study_design_scores_gemma":[0.00036493354,0.000054180804,0.004084228,0.00044339133,0.0000066244957,0.00012136247,0.00033810487,0.9675822,0.026387207,0.00047055152,0.000022825167,0.00012433714],"about_ca_topic_score_codex":0.000009678407,"about_ca_topic_score_gemma":3.2603742e-7,"teacher_disagreement_score":0.82103777,"about_ca_system_score_codex":0.000043474356,"about_ca_system_score_gemma":0.00025414155,"threshold_uncertainty_score":0.54359674},"labels":[],"label_agreement":null},{"id":"W3175465930","doi":"10.1609/icaps.v31i1.15961","title":"Jump Point Search with Temporal Obstacles","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Australian Research Council; Monash University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Jump; Point (geometry); Computer science; Variety (cybernetics); Grid; Path (computing); Motion planning; Space (punctuation); Order (exchange); Artificial intelligence; Robotics; Mathematical optimization; Algorithm; Robot; Mathematics; Geometry","score_opus":0.04692968483102595,"score_gpt":0.2901247606502225,"score_spread":0.24319507581919658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175465930","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.97814995,0.00009131972,0.008560953,0.004609439,0.0003183683,0.00009582506,0.000006184656,0.00043677096,0.0077312016],"genre_scores_gemma":[0.8767742,0.000005415712,0.122859664,0.00014129432,0.000029292802,0.000004061581,0.0000031351997,0.0000080538,0.00017486323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860674,0.0000132067025,0.00022952167,0.00036444,0.0005774848,0.00020857765],"domain_scores_gemma":[0.998917,0.00007778093,0.00016831052,0.00012830152,0.0006381267,0.00007047168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003425989,0.00014905732,0.00017206211,0.00011117898,0.00014848528,0.00039183008,0.0008255208,0.000059903214,0.0000067256833],"category_scores_gemma":[0.00015978575,0.00010577647,0.000036442496,0.0002704898,0.00007287228,0.00032743503,0.00030832653,0.000285088,0.0000037645316],"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.00024465346,0.00040733087,0.37640148,0.00032758224,0.0006785148,0.00025776273,0.013585633,0.04635247,0.1204827,0.4335615,0.0012568258,0.006443529],"study_design_scores_gemma":[0.00033043022,0.000069026995,0.010043264,0.0009745182,0.0000073594097,0.00017801604,0.00092777703,0.95200884,0.03426506,0.0010111477,0.00002379401,0.000160761],"about_ca_topic_score_codex":0.000016893837,"about_ca_topic_score_gemma":2.7643551e-7,"teacher_disagreement_score":0.9056564,"about_ca_system_score_codex":0.000032825028,"about_ca_system_score_gemma":0.00015511895,"threshold_uncertainty_score":0.4313439},"labels":[],"label_agreement":null},{"id":"W3175635045","doi":"10.1609/icaps.v31i1.15967","title":"A Competitive Analysis of Online Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Computer science; Controllability; Path (computing); Set (abstract data type); Bounded function; Plan (archaeology); Asymptotically optimal algorithm; Mathematical optimization; Bounded rationality; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Applied mathematics","score_opus":0.07027185868418233,"score_gpt":0.33327608150466753,"score_spread":0.2630042228204852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175635045","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.9726479,0.00008221694,0.018259864,0.002282536,0.00022982951,0.00011511213,0.000051723677,0.0001964468,0.006134363],"genre_scores_gemma":[0.93678975,0.000030547162,0.06293061,0.00011483778,0.000007353411,0.0000024379867,0.000014149095,0.000003643161,0.00010667774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.000014227337,0.0002824555,0.0002415167,0.00036672308,0.00011716159],"domain_scores_gemma":[0.9987339,0.00007160089,0.00026546422,0.00008092608,0.00080338964,0.00004471336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025663115,0.000094962874,0.00020143027,0.0002444385,0.000081059756,0.00014408556,0.0005305733,0.000043222295,0.000019613326],"category_scores_gemma":[0.0002554053,0.00007550433,0.00007759492,0.00062547193,0.000045521112,0.00016893189,0.00026930193,0.00015056653,6.131691e-7],"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.00002716409,0.0003193065,0.035405308,0.00007452363,0.0010196214,0.000006452829,0.0045492915,0.055185955,0.06804567,0.83436,0.00004375473,0.00096293224],"study_design_scores_gemma":[0.00023471045,0.000023358878,0.015102953,0.0003776548,0.000037418078,0.0000041713793,0.0009349838,0.97433156,0.008678954,0.00017226647,0.000025254134,0.000076716824],"about_ca_topic_score_codex":0.0000091055135,"about_ca_topic_score_gemma":0.000002219604,"teacher_disagreement_score":0.9191456,"about_ca_system_score_codex":0.0000228389,"about_ca_system_score_gemma":0.00008027847,"threshold_uncertainty_score":0.30789772},"labels":[],"label_agreement":null},{"id":"W3176143362","doi":"10.1609/icaps.v31i1.15984","title":"Conflict-Based Increasing Cost Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Denver; Lockheed Martin; University of Alberta; National Science Foundation","keywords":"Symmetry breaking; Symmetry (geometry); Computer science; ICTS; Tree (set theory); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Combinatorics; Physics; Geometry; Information and Communications Technology; World Wide Web","score_opus":0.18426027921152138,"score_gpt":0.4146299869876681,"score_spread":0.23036970777614674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176143362","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.97397125,0.000032383934,0.0007354454,0.004519347,0.00017468476,0.00009174079,0.00001885722,0.00011691664,0.020339347],"genre_scores_gemma":[0.99669254,0.0000043398754,0.0023722958,0.00036434826,0.000042646418,0.000009346676,0.000004825279,0.0000066966873,0.0005029672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983069,0.00003870541,0.00037862262,0.0003238874,0.0008155741,0.00013631118],"domain_scores_gemma":[0.9976973,0.00056402746,0.00025929091,0.00012242327,0.0012878897,0.00006904696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016463604,0.00010589777,0.00016033884,0.0001411306,0.00027850314,0.0004336473,0.00061770494,0.00006619039,0.0001740882],"category_scores_gemma":[0.0022230828,0.00007615417,0.00006130671,0.00039424287,0.00013791212,0.00016388441,0.0001490814,0.00023420175,0.00002125429],"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.0003375132,0.00017253935,0.07555837,0.000030271955,0.000101360216,0.000005106889,0.001748958,0.013773605,0.3345176,0.5656536,0.0011408294,0.0069602034],"study_design_scores_gemma":[0.00045941275,0.000025431476,0.014974656,0.00043411934,0.000013749214,0.000057461813,0.0050665527,0.7886242,0.17790447,0.010728966,0.0015403312,0.00017060021],"about_ca_topic_score_codex":0.000008815376,"about_ca_topic_score_gemma":3.691241e-7,"teacher_disagreement_score":0.77485067,"about_ca_system_score_codex":0.000024753073,"about_ca_system_score_gemma":0.00012706037,"threshold_uncertainty_score":0.4181671},"labels":[],"label_agreement":null},{"id":"W3177062893","doi":"10.1609/icaps.v31i1.15964","title":"LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Operator (biology); Simple (philosophy); State (computer science); Mathematical optimization; Computer science; Consistent heuristic; Algorithm; Mathematics; Null-move heuristic; Constant (computer programming); Incremental heuristic search; Search algorithm; Beam search","score_opus":0.0314566558341207,"score_gpt":0.29300295957440925,"score_spread":0.26154630374028853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177062893","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.9699812,0.0001626929,0.02632555,0.001501469,0.0001783091,0.00014396798,0.000043810047,0.00027451344,0.0013885114],"genre_scores_gemma":[0.93890125,0.0000065103523,0.06068641,0.00023772282,0.000045305547,0.000017102933,0.00002086539,0.00001285662,0.000071992516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988149,0.000010220326,0.00026773795,0.00037862055,0.0002956005,0.00023295275],"domain_scores_gemma":[0.9986924,0.00024533903,0.00025790502,0.000083926425,0.00064738165,0.000073026706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324181,0.00017882382,0.00020666023,0.0000959177,0.00043095465,0.0005981335,0.0004310255,0.00007114715,0.0000049037267],"category_scores_gemma":[0.00030579756,0.0001423214,0.00003286158,0.00018877933,0.000071938084,0.00032743273,0.00017901375,0.00023783858,6.0038974e-7],"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.0004471777,0.00025293432,0.23125625,0.00095161045,0.0008951007,0.00008321641,0.01432514,0.14417179,0.1282424,0.4733644,0.003796403,0.002213578],"study_design_scores_gemma":[0.00048357164,0.00010820928,0.0019880126,0.001154345,0.000024249597,0.00012007132,0.0011229708,0.9814958,0.012041325,0.0010597367,0.00018649969,0.00021522942],"about_ca_topic_score_codex":0.00000750013,"about_ca_topic_score_gemma":3.528751e-7,"teacher_disagreement_score":0.837324,"about_ca_system_score_codex":0.000022195516,"about_ca_system_score_gemma":0.00014308817,"threshold_uncertainty_score":0.5803698},"labels":[],"label_agreement":null},{"id":"W3198376353","doi":"10.1609/icaps.v31i1.15994","title":"Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Monash University; National Science Foundation; Deutsche Bahn; University of Southern California; Simon Fraser University","keywords":"Scalability; Computer science; Train; Distributed computing; Deadlock; Simulated annealing; Software; Motion planning; Plan (archaeology); Graph; Mathematical optimization; Operations research; Engineering; Robot; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics","score_opus":0.02591758923968751,"score_gpt":0.2511828116355023,"score_spread":0.2252652223958148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198376353","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.9704375,0.0016054923,0.00006273169,0.0015420927,0.00045625525,0.000071330534,0.000005078355,0.00032041722,0.025499105],"genre_scores_gemma":[0.9988547,0.00008731157,0.00055134733,0.0000650068,0.00012406005,0.000009637234,0.00000417816,0.000022444832,0.00028131128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881977,0.000009684366,0.00032318334,0.0002801394,0.00033243926,0.00023481053],"domain_scores_gemma":[0.99940157,0.00009401662,0.00013462052,0.00009773963,0.00020836903,0.00006369296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382186,0.00019862707,0.0002220986,0.00007061094,0.00025485415,0.00028599805,0.00031329514,0.00010244321,0.000013082052],"category_scores_gemma":[0.00017409396,0.00013685544,0.00004376313,0.00017218251,0.00007455957,0.00016591484,0.00012917261,0.00034387223,0.0000013986667],"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.0002056142,0.000119859265,0.18765229,0.0010451466,0.0009812032,0.0001028664,0.023600398,0.45797002,0.24568403,0.07246553,0.0069669485,0.0032060992],"study_design_scores_gemma":[0.00035295862,0.00003551831,0.00878494,0.0016248387,0.000022401118,0.00015249653,0.0033865855,0.977812,0.006346699,0.00035332845,0.0008995116,0.00022873403],"about_ca_topic_score_codex":0.000011170425,"about_ca_topic_score_gemma":5.8379595e-7,"teacher_disagreement_score":0.51984197,"about_ca_system_score_codex":0.000024802628,"about_ca_system_score_gemma":0.000030131005,"threshold_uncertainty_score":0.55808026},"labels":[],"label_agreement":null},{"id":"W4312250476","doi":"10.1609/icaps.v32i1.19798","title":"Multi-Agent Path Finding with Temporal Jump Point Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Monash University; National Science Foundation; Northeast Normal University; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Pathfinding; Jump; Path (computing); Computer science; Point (geometry); Grid; Planner; Mathematical optimization; Work (physics); Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Shortest path problem; Physics","score_opus":0.06576627797060018,"score_gpt":0.3031903675507545,"score_spread":0.23742408958015432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312250476","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.98171604,0.000042589312,0.013610191,0.0021459686,0.0004589681,0.00020487096,0.000015344198,0.00046070307,0.0013453361],"genre_scores_gemma":[0.8702564,0.0000018850377,0.1294037,0.00013343389,0.000021698042,0.00002053715,0.0000043286764,0.000010985678,0.00014700307],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819124,0.00002395653,0.00027330918,0.00041303548,0.00083732634,0.00026115662],"domain_scores_gemma":[0.99921155,0.00006612952,0.0002684668,0.00012798439,0.00025100526,0.000074875694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076098565,0.00017430562,0.00018165907,0.0002079592,0.00044278035,0.00027821198,0.0013457369,0.000037965343,0.000012727613],"category_scores_gemma":[0.0000863782,0.00013105519,0.000043037013,0.0003095941,0.000060173366,0.00027158554,0.0007187189,0.00048555844,0.0000025717707],"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.00043052292,0.00071619026,0.42509848,0.00024033873,0.0006101788,0.00016945243,0.030815806,0.38403136,0.07320419,0.079526186,0.0012859288,0.003871351],"study_design_scores_gemma":[0.00046483308,0.00016445224,0.008121721,0.0003510525,0.0000065852523,0.00012515836,0.0015701995,0.98644525,0.002397815,0.00015663973,0.000026043204,0.00017026052],"about_ca_topic_score_codex":0.00003504631,"about_ca_topic_score_gemma":1.2191191e-7,"teacher_disagreement_score":0.6024139,"about_ca_system_score_codex":0.00009652558,"about_ca_system_score_gemma":0.000115682655,"threshold_uncertainty_score":0.5344275},"labels":[],"label_agreement":null},{"id":"W4312258528","doi":"10.1609/icaps.v23i1.13543","title":"Better Time Constrained Search via Randomization and Postprocessing","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Computer science; Bounding overwatch; Set (abstract data type); Mathematical optimization; Beam search; Metric (unit); Heuristic; Quality (philosophy); Iterative deepening depth-first search; Ranking (information retrieval); Hypersphere; Incremental heuristic search; Search algorithm; Algorithm; Machine learning; Artificial intelligence; Mathematics","score_opus":0.018479973602937416,"score_gpt":0.2526648700279775,"score_spread":0.2341848964250401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312258528","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.9832001,0.000065919114,0.0071452754,0.0048293956,0.00011902489,0.00017842127,0.0000023254524,0.0003026369,0.004156919],"genre_scores_gemma":[0.97611785,0.000004249097,0.023430316,0.0003069028,0.000029230157,0.000008122445,0.0000036821443,0.000007906197,0.00009176795],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893206,0.000011555966,0.00025964077,0.00028714977,0.00032118615,0.00018843048],"domain_scores_gemma":[0.99915767,0.000111618065,0.0001928674,0.0000627775,0.0004084181,0.000066647335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044357852,0.00014712838,0.00017208818,0.00014452987,0.00021993164,0.00059643877,0.00049863535,0.00007717706,0.00002152343],"category_scores_gemma":[0.000103827246,0.000110641835,0.000028446846,0.00014999643,0.000089818495,0.0005390051,0.00018223118,0.00022851117,0.00000849741],"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.00038468436,0.00014190715,0.09752543,0.00047922705,0.00041575136,0.000008333709,0.012703061,0.007722658,0.7641514,0.06735955,0.0014393949,0.04766858],"study_design_scores_gemma":[0.00064055127,0.000041372918,0.0025901694,0.0006574258,0.0000069644766,0.00003800583,0.00012351555,0.98321325,0.010210619,0.002337094,0.000006567252,0.00013446143],"about_ca_topic_score_codex":0.00002375169,"about_ca_topic_score_gemma":5.28072e-8,"teacher_disagreement_score":0.97549057,"about_ca_system_score_codex":0.000016056201,"about_ca_system_score_gemma":0.000044657434,"threshold_uncertainty_score":0.5751473},"labels":[],"label_agreement":null},{"id":"W4312463518","doi":"10.1609/icaps.v21i1.13440","title":"Organizing Committee","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Flexible and Reconfigurable Manufacturing Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Library science; Political science; Operations research; Computer science; Engineering management; Engineering","score_opus":0.0491570292906451,"score_gpt":0.23961464653735925,"score_spread":0.19045761724671414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312463518","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.87786245,0.00006139681,0.000023736693,0.00007781271,0.0004997486,0.000058940794,0.000002993712,0.0005099913,0.12090294],"genre_scores_gemma":[0.9989103,0.00001537583,0.0008110561,0.000033005104,0.00004011425,0.000004043979,0.0000010162015,0.000016457474,0.0001686145],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937457,0.0000025675977,0.00020590788,0.000120514705,0.00016573213,0.00013070127],"domain_scores_gemma":[0.9997073,0.000018563947,0.00008163237,0.000050794864,0.00010654005,0.000035187266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014387713,0.000121396166,0.00013119211,0.00009749479,0.000073748684,0.000069807946,0.00033236618,0.00006650587,0.000044381064],"category_scores_gemma":[0.00003229293,0.00008974219,0.000030535244,0.00007386261,0.000036023623,0.00010978853,0.000042717627,0.00019223978,0.00000775116],"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.00023689585,0.00018013302,0.11657066,0.0015999589,0.0013793305,0.000016053811,0.02655616,0.019667678,0.657961,0.1628989,0.0077893385,0.005143883],"study_design_scores_gemma":[0.00035792618,0.000048121376,0.012668589,0.0016587141,0.0000228332,0.000052894768,0.002224979,0.5602857,0.42033228,0.0017654554,0.0002745482,0.00030796052],"about_ca_topic_score_codex":0.000017310202,"about_ca_topic_score_gemma":3.167402e-7,"teacher_disagreement_score":0.540618,"about_ca_system_score_codex":0.000020035737,"about_ca_system_score_gemma":0.000009015393,"threshold_uncertainty_score":0.36595803},"labels":[],"label_agreement":null},{"id":"W4312465291","doi":"10.1609/icaps.v32i1.19862","title":"Resolving Misconceptions about the Plans of Agents via Theory of Mind","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Plan (archaeology); Set (abstract data type); Appeal; Computer science; Epistemology; Psychology; Management science; Political science; Engineering","score_opus":0.05234666380518317,"score_gpt":0.29057457838984685,"score_spread":0.2382279145846637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312465291","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.98815095,0.00023969833,0.004320481,0.0013557402,0.00037016906,0.00015516489,0.000057803605,0.00009182652,0.005258163],"genre_scores_gemma":[0.9944149,0.0000060148,0.0052794972,0.000097247816,0.000019045461,0.000011595503,0.0000043348314,0.0000069952102,0.00016031464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862313,0.00004579795,0.00039880796,0.00023789307,0.0005347083,0.00015968551],"domain_scores_gemma":[0.9987029,0.00028354194,0.00059980876,0.0001349718,0.000245995,0.000032770255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105964,0.00012725196,0.00017856313,0.0001464448,0.00035975737,0.00007797205,0.0014348878,0.00004174826,0.000047951868],"category_scores_gemma":[0.00018509748,0.0000904869,0.00007065966,0.00024480632,0.00012512929,0.00015307362,0.0004528819,0.00034034325,6.5778704e-7],"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.00044052448,0.00030404268,0.0769818,0.00031144283,0.00072937587,0.0000061503683,0.057971075,0.12580134,0.19156896,0.5345268,0.0016217221,0.009736767],"study_design_scores_gemma":[0.00029869255,0.00012432582,0.005760026,0.00072631775,0.000028684331,0.00003340194,0.0030778875,0.96965164,0.014641936,0.0053516286,0.00016379957,0.00014164596],"about_ca_topic_score_codex":0.000023330545,"about_ca_topic_score_gemma":2.951201e-7,"teacher_disagreement_score":0.8438503,"about_ca_system_score_codex":0.000021322698,"about_ca_system_score_gemma":0.0000789681,"threshold_uncertainty_score":0.36899486},"labels":[],"label_agreement":null},{"id":"W4312511734","doi":"10.1609/icaps.v24i1.13613","title":"Program Committee","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität des Saarlandes; University of Toronto; King's College London; Universität Basel; Arizona State University; Carnegie Mellon University; University of Denver","keywords":"Political science; Computer science; Library science; Operations research; Engineering management; Engineering","score_opus":0.023630246233099225,"score_gpt":0.26931329406788673,"score_spread":0.2456830478347875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312511734","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.91406786,0.000037361722,0.006325566,0.00046028744,0.00053522445,0.00016397634,0.0000056772915,0.0017986099,0.076605424],"genre_scores_gemma":[0.9829391,0.000011947387,0.016898802,0.000033602875,0.00003760539,0.000008815097,0.0000035035744,0.000011101486,0.000055493423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951375,0.0000021782391,0.0001389971,0.000101393656,0.00014445845,0.00009921895],"domain_scores_gemma":[0.99972993,0.000032236836,0.00006460699,0.000040526724,0.000105640254,0.00002705651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011221599,0.000094022456,0.000092189606,0.000056750287,0.00006272567,0.00007605255,0.00020403606,0.00004701201,0.000005033638],"category_scores_gemma":[0.000112235735,0.000073259005,0.000019897661,0.000049464154,0.00003809663,0.00007322926,0.000036217945,0.00015036571,0.0000015696002],"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.000028317807,0.000037269976,0.0036462322,0.00012479463,0.00006906682,2.952018e-7,0.00043307652,0.90002614,0.0073758066,0.079472445,0.0006147067,0.008171872],"study_design_scores_gemma":[0.00013537025,0.000028866327,0.0014174134,0.00021795048,0.0000061897426,0.0000034675013,0.000093839866,0.9859604,0.009187019,0.002523165,0.00033964482,0.000086625325],"about_ca_topic_score_codex":0.0000016059194,"about_ca_topic_score_gemma":1.1168891e-7,"teacher_disagreement_score":0.08593433,"about_ca_system_score_codex":0.000014615419,"about_ca_system_score_gemma":0.000003873593,"threshold_uncertainty_score":0.29874155},"labels":[],"label_agreement":null},{"id":"W4312577582","doi":"10.1609/icaps.v32i1.19826","title":"Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Fujitsu","keywords":"Computer science; Quadratic unconstrained binary optimization; Scheduling (production processes); Constraint programming; Integer programming; Job shop scheduling; Mathematical optimization; Theoretical computer science; Algorithm; Quantum; Quantum computer; Mathematics; Operating system; Schedule","score_opus":0.033205397598888214,"score_gpt":0.2629384316561554,"score_spread":0.22973303405726717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312577582","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.92109925,0.000083804196,0.05200675,0.009292482,0.000906473,0.0005027723,0.000020987336,0.0011349021,0.014952558],"genre_scores_gemma":[0.9623804,0.0000045266443,0.03717582,0.0002453243,0.000031590815,0.000031065196,0.000005518325,0.000011912522,0.00011382886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984658,0.00001907037,0.000297406,0.0003656221,0.00065939775,0.00019272085],"domain_scores_gemma":[0.99904007,0.00006403613,0.00036601146,0.000099842124,0.0003715072,0.000058542388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042134497,0.00016928527,0.00017476518,0.0001931231,0.00050556945,0.00039615895,0.00079296925,0.000041728337,0.00007526744],"category_scores_gemma":[0.000115538765,0.0001366209,0.000050850562,0.00034692776,0.0000633426,0.00033734457,0.00027656156,0.00035393727,0.000001340097],"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.0002595041,0.00012644207,0.059873544,0.00012399914,0.00017557804,0.000008493125,0.003237605,0.71258897,0.029230824,0.19037108,0.0002619213,0.003742016],"study_design_scores_gemma":[0.0006476158,0.000084208004,0.0020391552,0.00039612153,0.000010240008,0.00003674341,0.0007742454,0.9927581,0.0025040559,0.00043946644,0.00013001003,0.00018002829],"about_ca_topic_score_codex":0.000014182647,"about_ca_topic_score_gemma":0.0000015946998,"teacher_disagreement_score":0.28016913,"about_ca_system_score_codex":0.00008473775,"about_ca_system_score_gemma":0.00016514868,"threshold_uncertainty_score":0.55712384},"labels":[],"label_agreement":null},{"id":"W4312605127","doi":"10.1609/icaps.v32i1.19803","title":"LM-Cut Heuristics for Optimal Linear Numeric Planning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Simple (philosophy); Computer science; Mathematics","score_opus":0.04559055700428573,"score_gpt":0.2994431930214112,"score_spread":0.2538526360171255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312605127","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.94204724,0.0002314395,0.047289763,0.003769221,0.0012587849,0.0003626966,0.00007390797,0.00084520876,0.004121751],"genre_scores_gemma":[0.9379106,0.0000029134692,0.061449386,0.00027953973,0.00007169768,0.000043351167,0.0000131600855,0.00001561252,0.00021374323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844515,0.000016651622,0.00034863263,0.0003965326,0.0005138251,0.0002792246],"domain_scores_gemma":[0.9988988,0.00022552778,0.000400175,0.00010839434,0.00029914075,0.000067952555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006942575,0.0001913296,0.00021087872,0.00018409692,0.00065698416,0.00024422252,0.0013151506,0.00005689248,0.0000121377225],"category_scores_gemma":[0.00026862917,0.00016774201,0.00007540537,0.00024597772,0.000046999798,0.00022162843,0.0005070019,0.00043002603,0.0000013359339],"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.00054581946,0.000219643,0.035749707,0.00028577048,0.00036169754,0.000020167225,0.011816255,0.6825941,0.02350934,0.23556031,0.006485975,0.0028511744],"study_design_scores_gemma":[0.00036725038,0.00018734086,0.00036806954,0.00032246573,0.000013364227,0.000049828053,0.000791256,0.9923373,0.0032143411,0.001384776,0.00076124375,0.00020275218],"about_ca_topic_score_codex":0.0000097841,"about_ca_topic_score_gemma":4.3711637e-8,"teacher_disagreement_score":0.30974317,"about_ca_system_score_codex":0.000054081684,"about_ca_system_score_gemma":0.00010538893,"threshold_uncertainty_score":0.684032},"labels":[],"label_agreement":null},{"id":"W4312621041","doi":"10.1609/icaps.v32i1.19805","title":"Beam Search: Faster and Monotonic","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Beam search; Satisficing; Beam (structure); Computation; Monotonic function; Heuristic; Mathematical optimization; Beam diameter; Computer science; Search algorithm; Mathematics; Algorithm; Physics; Optics; Artificial intelligence; Mathematical analysis","score_opus":0.060167967661227346,"score_gpt":0.3081002708569113,"score_spread":0.24793230319568393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312621041","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.9806648,0.00009076447,0.0054849423,0.0047228485,0.0003046357,0.00020681976,0.000011900442,0.00024708622,0.008266208],"genre_scores_gemma":[0.9814885,0.000014715926,0.017976904,0.00015199903,0.0000143580855,0.000016522454,0.000001369617,0.0000063383045,0.00032927556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871665,0.000017610468,0.00019281595,0.0002744462,0.00064365554,0.00015483292],"domain_scores_gemma":[0.99940693,0.00007575258,0.00011995794,0.00008412517,0.00025480194,0.00005840729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006121223,0.00009346368,0.00011225376,0.00018633687,0.0002777945,0.00030505587,0.0008973821,0.000024609852,0.000039161227],"category_scores_gemma":[0.00015338795,0.00007610048,0.000022715456,0.00021883857,0.00006108979,0.00020152968,0.0009796747,0.00030910675,0.0000015330078],"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.0002628519,0.0003414452,0.03353148,0.00022258003,0.00040503562,0.000021378944,0.013475703,0.11519952,0.073838525,0.7427279,0.0016976753,0.018275937],"study_design_scores_gemma":[0.00021706143,0.00005988667,0.0016625064,0.000060154147,0.0000028412414,0.000036891488,0.00052694464,0.9932662,0.0031379785,0.0008635749,0.000084801824,0.00008116001],"about_ca_topic_score_codex":0.000008782685,"about_ca_topic_score_gemma":4.602064e-8,"teacher_disagreement_score":0.87806666,"about_ca_system_score_codex":0.000033188233,"about_ca_system_score_gemma":0.00006269188,"threshold_uncertainty_score":0.31032875},"labels":[],"label_agreement":null},{"id":"W4312891993","doi":"10.1609/icaps.v32i1.19804","title":"Biased Exploration for Satisficing Heuristic Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Incremental heuristic search; Heuristic; Mathematical optimization; Beam search; Best-first search; Node (physics); Computer science; Consistent heuristic; Null-move heuristic; Greedy algorithm; Mathematics; Search algorithm; Algorithm; Artificial intelligence; Engineering","score_opus":0.08200595162074595,"score_gpt":0.30909067228654175,"score_spread":0.2270847206657958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312891993","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.9438564,0.000087472705,0.046325803,0.0059296703,0.00067888526,0.00035113876,0.000035480254,0.0005460683,0.0021890826],"genre_scores_gemma":[0.97949743,0.0000028985867,0.020110274,0.000189342,0.000035357578,0.000048010475,0.000010619025,0.0000094480165,0.00009663215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876654,0.00002014996,0.0002601103,0.00029936378,0.00046685615,0.00018699114],"domain_scores_gemma":[0.99911535,0.0002632289,0.00022375875,0.00008109557,0.00027419877,0.00004234457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085488247,0.00012093326,0.00013475942,0.00017091256,0.00056990696,0.0002637566,0.00082509854,0.000033963144,0.000009251613],"category_scores_gemma":[0.00027272562,0.00010494499,0.00004574477,0.00021723998,0.000029231936,0.00029185924,0.0002952327,0.00027220053,8.964162e-7],"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.00038765796,0.0001595017,0.019422239,0.0002885256,0.00019738705,0.000006516889,0.016115302,0.3052772,0.11671863,0.52777916,0.0026622375,0.010985662],"study_design_scores_gemma":[0.00030740947,0.00013238224,0.00047095714,0.00025909953,0.0000067284886,0.00001472928,0.0010404101,0.98673856,0.006991224,0.0038168717,0.000097114775,0.00012451956],"about_ca_topic_score_codex":0.000020315694,"about_ca_topic_score_gemma":1.9559516e-7,"teacher_disagreement_score":0.68146133,"about_ca_system_score_codex":0.00005161922,"about_ca_system_score_gemma":0.000085379084,"threshold_uncertainty_score":0.4383321},"labels":[],"label_agreement":null},{"id":"W4312950274","doi":"10.1609/icaps.v21i1.13439","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Library science; Computer science; Operations research; Presentation (obstetrics); Engineering; Medicine","score_opus":0.061109028357754336,"score_gpt":0.2727059875151443,"score_spread":0.21159695915738996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312950274","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.8667898,0.000025285051,0.015931325,0.002200627,0.0006412949,0.00014638854,0.0000032165797,0.00068584166,0.113576226],"genre_scores_gemma":[0.9733481,0.0000069534776,0.0263892,0.000110827,0.000010371238,0.0000031375234,4.3092868e-7,0.000003239441,0.00012777539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.0000038415587,0.00015422053,0.00016933923,0.0002000392,0.00008658625],"domain_scores_gemma":[0.9995301,0.00001722687,0.0001533209,0.000057803805,0.0002086524,0.00003291605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015028157,0.000078194185,0.00007324387,0.00008484145,0.00008191103,0.000108232205,0.0004972718,0.0000396823,0.000028714887],"category_scores_gemma":[0.00007900767,0.000059164846,0.000025143438,0.000109214474,0.00004008963,0.0002833393,0.00012521884,0.000112184425,0.0000033506176],"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.00004341528,0.000055742697,0.05816582,0.000027319931,0.00006932646,0.0000013150009,0.0048231273,0.00085365283,0.018484827,0.91175354,0.0003070699,0.005414821],"study_design_scores_gemma":[0.00018683811,0.000033960554,0.033651687,0.00023159005,0.0000046233063,0.000021618536,0.00032848094,0.94288635,0.018892722,0.0036168823,0.000040501407,0.00010474597],"about_ca_topic_score_codex":0.0000088601555,"about_ca_topic_score_gemma":2.781783e-7,"teacher_disagreement_score":0.9420327,"about_ca_system_score_codex":0.000013143572,"about_ca_system_score_gemma":0.000027336277,"threshold_uncertainty_score":0.24126723},"labels":[],"label_agreement":null},{"id":"W4313015941","doi":"10.1609/icaps.v21i1.13441","title":"Program Committee","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Flexible and Reconfigurable Manufacturing Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Library science; Political science; Operations research; Engineering; Management; Engineering management; Computer science; Economics","score_opus":0.05219478832545849,"score_gpt":0.2621214965318074,"score_spread":0.2099267082063489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313015941","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.8436254,0.00005392737,0.000010217593,0.000070036906,0.00044070568,0.00011028056,0.0000031133986,0.0007883865,0.15489787],"genre_scores_gemma":[0.998255,0.000013893414,0.0014639824,0.000022775439,0.000035586047,0.00001596352,0.0000013416326,0.000013840401,0.00017758211],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937683,0.000002469356,0.00019989263,0.000119212265,0.0001676606,0.00013393948],"domain_scores_gemma":[0.99972177,0.000014582731,0.00007812008,0.000050051833,0.000099224344,0.000036229892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013140941,0.000120017474,0.00012705872,0.000089529,0.000061633844,0.00007514736,0.00032342182,0.00006716131,0.000029697883],"category_scores_gemma":[0.000022202788,0.00008635939,0.00003610985,0.00006417372,0.000043435877,0.00009777261,0.000035945584,0.00018551105,0.000005772374],"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.0006869661,0.0009092111,0.1947991,0.0040863696,0.0032218038,0.000032221407,0.037264504,0.03935306,0.33338958,0.30166072,0.019095853,0.06550062],"study_design_scores_gemma":[0.00033883654,0.00009164918,0.0134035,0.0014162393,0.000020103664,0.00003792784,0.0011870458,0.82353127,0.15759842,0.0015040761,0.0006020102,0.00026894486],"about_ca_topic_score_codex":0.000015461708,"about_ca_topic_score_gemma":3.1227472e-7,"teacher_disagreement_score":0.7841782,"about_ca_system_score_codex":0.000016042179,"about_ca_system_score_gemma":0.000008175178,"threshold_uncertainty_score":0.35216337},"labels":[],"label_agreement":null},{"id":"W4313193649","doi":"10.1609/icaps.v20i1.13398","title":"Preface","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Operations research; Computer science; Scheduling (production processes); Automated planning and scheduling; Engineering; Artificial intelligence; Operations management","score_opus":0.033752758441679936,"score_gpt":0.28103862567382976,"score_spread":0.24728586723214982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313193649","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.91175073,0.000078654244,0.01745245,0.013786043,0.0008330183,0.00010612111,0.000005253253,0.0006114197,0.05537628],"genre_scores_gemma":[0.9795981,0.000014435651,0.019861104,0.00020638212,0.000015405567,0.000002301381,0.0000012843542,0.0000030762885,0.00029792966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933565,0.000005240864,0.00015089012,0.00019017636,0.00023496215,0.000083067505],"domain_scores_gemma":[0.999381,0.000030831732,0.00012584124,0.00006195056,0.00036897796,0.00003136332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012686485,0.00007295616,0.00007835607,0.000057151567,0.00009060617,0.00022961614,0.00034780038,0.00003920422,0.000023286324],"category_scores_gemma":[0.00016249054,0.000058598824,0.00002816632,0.00014807908,0.000028964396,0.00023651424,0.00015333481,0.00012009106,0.0000025207019],"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.000021259995,0.000056119436,0.03491781,0.000042353407,0.00008670832,0.000004541094,0.0015734297,0.007199224,0.09311926,0.85544056,0.00064725237,0.0068915095],"study_design_scores_gemma":[0.00017982296,0.000012675285,0.011334352,0.00025966758,0.0000039351644,0.000044795714,0.00029674612,0.95006716,0.03558847,0.0019949162,0.00013209588,0.000085333966],"about_ca_topic_score_codex":0.0000024182505,"about_ca_topic_score_gemma":3.3916155e-7,"teacher_disagreement_score":0.942868,"about_ca_system_score_codex":0.000016389127,"about_ca_system_score_gemma":0.00006213276,"threshold_uncertainty_score":0.23895907},"labels":[],"label_agreement":null},{"id":"W4382866729","doi":"10.1609/icaps.v33i1.27221","title":"Generalizing Action Justification and Causal Links to Policies","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Air Force Office of Scientific Research; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Generalization; Action (physics); Context (archaeology); Computer science; Observable; State (computer science); Causal theory of reference; Management science; Epistemology; Mathematical economics; Theoretical computer science; Artificial intelligence; Mathematics; Economics; Algorithm","score_opus":0.09405748696312577,"score_gpt":0.3372824619862425,"score_spread":0.24322497502311674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866729","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.98727536,0.000032340315,0.0027223646,0.0073701227,0.00033408118,0.00009249524,0.0000048384563,0.00059502013,0.0015733702],"genre_scores_gemma":[0.9923189,0.000019486528,0.007104553,0.00028461454,0.00005856439,0.000009789221,0.0000051201914,0.0000074218588,0.00019152842],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990514,0.000009117729,0.00020544691,0.00027777778,0.00028199152,0.00017425901],"domain_scores_gemma":[0.99940854,0.00008066667,0.00016016269,0.00007163947,0.00021330714,0.00006570507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044819113,0.000118866796,0.00011313083,0.0002579313,0.00024216292,0.0003604609,0.00045204998,0.00009328557,0.0000017022741],"category_scores_gemma":[0.00019997328,0.00009756716,0.000021655054,0.00037233302,0.00003097436,0.00025701884,0.00021895516,0.00024145909,0.000005857049],"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.00009971031,0.000041776024,0.04986083,0.00024636465,0.00014345166,0.0000039543893,0.01536586,0.029394224,0.5243282,0.35611212,0.005602226,0.018801324],"study_design_scores_gemma":[0.00013658841,0.00005079217,0.01455065,0.00062386395,0.000007833841,0.000018105144,0.0006590997,0.9594859,0.022044726,0.002055835,0.0002152865,0.00015132445],"about_ca_topic_score_codex":0.00005542993,"about_ca_topic_score_gemma":0.0000010143551,"teacher_disagreement_score":0.9300917,"about_ca_system_score_codex":0.000031508564,"about_ca_system_score_gemma":0.000033499644,"threshold_uncertainty_score":0.39786732},"labels":[],"label_agreement":null},{"id":"W4382866757","doi":"10.1609/icaps.v33i1.27218","title":"Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Academy of Sciences and Humanities","keywords":"Satisficing; Pruning; Symmetry (geometry); Symmetry breaking; Heuristic; Homogeneous space; Mathematics; Symmetry group; Rotational symmetry; Mathematical optimization; Computer science; Algorithm; Artificial intelligence; Physics; Geometry","score_opus":0.03892980605732845,"score_gpt":0.29940599164730153,"score_spread":0.2604761855899731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866757","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.9934923,0.00008083081,0.0032426554,0.00082237995,0.00036991865,0.00012503022,0.000003574347,0.00055001583,0.0013132623],"genre_scores_gemma":[0.99282694,0.000013653576,0.006949222,0.00009283964,0.00003984739,0.000013160012,0.000002912444,0.0000113775395,0.00005002654],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987063,0.000015624142,0.00030470476,0.00037077285,0.000338171,0.00026442876],"domain_scores_gemma":[0.99929184,0.00018242277,0.00024437023,0.00007420747,0.00014790548,0.000059249225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007050325,0.0001704701,0.00018668547,0.0004221788,0.00020642401,0.00026696158,0.000535801,0.000100984194,0.000001843576],"category_scores_gemma":[0.00025695257,0.00014554127,0.00003230213,0.00058340596,0.000048608963,0.00037572664,0.0002786878,0.00038887485,0.0000035589342],"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.00042764694,0.00013078238,0.48824325,0.0005661306,0.00028708923,0.000086463835,0.022780037,0.19563863,0.18884578,0.0552331,0.0004348748,0.047326222],"study_design_scores_gemma":[0.00029344507,0.000052083284,0.019942991,0.0012249039,0.0000052475807,0.00004311686,0.0007000796,0.9713467,0.0055394573,0.0006555308,0.000036706453,0.00015977117],"about_ca_topic_score_codex":0.000038671416,"about_ca_topic_score_gemma":5.487205e-7,"teacher_disagreement_score":0.775708,"about_ca_system_score_codex":0.00003630363,"about_ca_system_score_gemma":0.000039046772,"threshold_uncertainty_score":0.5935001},"labels":[],"label_agreement":null},{"id":"W4382866769","doi":"10.1609/icaps.v33i1.27238","title":"Exploration Policies for On-the-Fly Controller Synthesis: A Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; International Development Research Centre; Agencia Nacional de Investigación e Innovación","keywords":"Reinforcement learning; Heuristics; Computer science; Heuristic; Task (project management); Set (abstract data type); Controller (irrigation); Supervisory control; Domain (mathematical analysis); Artificial intelligence; Space (punctuation); Control (management); Machine learning; Mathematical optimization; Mathematics; Engineering","score_opus":0.1186295975928637,"score_gpt":0.33159983778870095,"score_spread":0.21297024019583724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866769","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.7207681,0.000029972483,0.23448895,0.015865125,0.0007796248,0.001263251,0.000008025842,0.0018001462,0.024996802],"genre_scores_gemma":[0.9736695,0.000011459996,0.02568907,0.00016727461,0.00004203713,0.00019236324,0.000002629972,0.000008253243,0.00021737716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989296,0.000020070845,0.00026665418,0.00023154294,0.00038349157,0.00016861525],"domain_scores_gemma":[0.9989704,0.00029109165,0.00030983958,0.0000850547,0.00031612688,0.000027500113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011859939,0.0001223167,0.00013350155,0.00017279947,0.00030505317,0.0003131578,0.0007733498,0.000054072105,0.000001440601],"category_scores_gemma":[0.0014785425,0.00007995291,0.00005088946,0.0002534189,0.000049813203,0.00033897156,0.00013604893,0.000177734,0.000004620727],"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.00008462011,0.000017407374,0.00020180707,0.000040445262,0.0000588929,8.268614e-8,0.0027302827,0.08320982,0.01263649,0.8994174,0.00033474067,0.001267993],"study_design_scores_gemma":[0.00017277036,0.00006608696,0.0003374745,0.00030380118,0.0000066362445,0.00000229607,0.0013486078,0.9750097,0.019124841,0.0034387298,0.000100299934,0.000088796354],"about_ca_topic_score_codex":0.000004725758,"about_ca_topic_score_gemma":3.166053e-8,"teacher_disagreement_score":0.8959787,"about_ca_system_score_codex":0.00003266862,"about_ca_system_score_gemma":0.000027968706,"threshold_uncertainty_score":0.32603848},"labels":[],"label_agreement":null},{"id":"W4382866772","doi":"10.1609/icaps.v33i1.27251","title":"Frontmatter","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Moonshot Research and Development Program; Office of Naval Research; Office National d'études et de Recherches Aérospatiales; Institute of Software, Chinese Academy of Sciences; U.S. Naval Research Laboratory; Russian Academy of Sciences; Technische Universität Dortmund; Singapore Management University; Universität Konstanz; Libera Università di Bolzano; Università degli Studi di Brescia; Universidade do Porto; Universidad de Granada; Masarykova Univerzita; Universität des Saarlandes; RWTH Aachen University; Danmarks Tekniske Universitet; Universitat Politècnica de València; Ben-Gurion University of the Negev; Universidade Federal do Rio Grande do Sul; Technische Universität Wien; Sapienza Università di Roma; Oregon State University; Queen's University; Linköpings Universitet; University of Alberta; Imperial College London; University of Toronto; University of Southern California; Institució Catalana de Recerca i Estudis Avançats; Arizona State University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; Chinese Academy of Sciences; Sun Yat-sen University; Bar-Ilan University; Universiteit van Amsterdam; Jet Propulsion Laboratory; Monash University; Royal Holloway, University of London; National Aeronautics and Space Administration; Nanyang Technological University; Universität Ulm; National University of Singapore; University of Aberdeen; University of Oxford; Albert-Ludwigs-Universität Freiburg; Centre National de la Recherche Scientifique; King's College London; Invitae; Carnegie Mellon University; Amazon Robotics; Purdue University; Polytechnique Montréal; Institut national de recherche en informatique et en automatique (INRIA); Universite Angers; Colorado State University; KU Leuven; Heriot-Watt University; Simon Fraser University; Università degli Studi di Padova; European Space Agency; Aalborg Universitet; Universidad Carlos III de Madrid; International Science and Technology Center; Università degli Studi di Napoli Federico II; Örebro Universitet; California Institute of Technology; Fondazione Bruno Kessler; Georgia Institute of Technology; Universidad de Oviedo; Universität Basel; Università degli Studi di Trento; University of Science and Technology of China; Microsoft Research; Technische Universiteit Delft; RAND Corporation; České Vysoké Učení Technické v Praze","keywords":"Czech; Computer science; Library science; Scheduling (production processes); Operations research; Political science; Engineering; Operations management","score_opus":0.03892079911777357,"score_gpt":0.2871891253091323,"score_spread":0.24826832619135875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866772","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.9267484,0.000010992632,0.0061735027,0.016463656,0.000824475,0.00012209054,0.000005038092,0.0013266209,0.04832522],"genre_scores_gemma":[0.9936063,0.0000041713356,0.0052394317,0.0002379505,0.000019507155,0.000004310125,0.0000017729338,0.0000038827015,0.0008826688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933875,0.0000036887493,0.00014932743,0.00016839555,0.00023993237,0.00009991954],"domain_scores_gemma":[0.99960196,0.000033468692,0.0001176767,0.000054025266,0.0001641834,0.000028697481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018762269,0.000073868236,0.000074856674,0.0001427008,0.0000959202,0.00019014128,0.00043472607,0.00003750295,0.000039343504],"category_scores_gemma":[0.00008816106,0.00005631809,0.00002678707,0.0002111197,0.00003117178,0.00023531297,0.00014802549,0.00010624911,0.000034740417],"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.000059519472,0.000058132267,0.1141233,0.00009301419,0.00017945237,0.0000063020366,0.0049126362,0.020573013,0.08124087,0.7281887,0.03386089,0.016704196],"study_design_scores_gemma":[0.00013887038,0.000012417891,0.021414623,0.00017040981,0.0000023249277,0.0000094257075,0.00021822122,0.97303796,0.0031550343,0.0016190382,0.00015106592,0.000070607515],"about_ca_topic_score_codex":0.0000034332015,"about_ca_topic_score_gemma":1.7352707e-7,"teacher_disagreement_score":0.95246494,"about_ca_system_score_codex":0.0000134972515,"about_ca_system_score_gemma":0.000022489961,"threshold_uncertainty_score":0.22965851},"labels":[],"label_agreement":null},{"id":"W4382866786","doi":"10.1609/icaps.v33i1.27179","title":"Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Planner; Linear temporal logic; Temporal logic; Computer science; Linear logic; Spurious relationship; Overhead (engineering); Compiler; Theoretical computer science; Artificial intelligence; Programming language; Machine learning","score_opus":0.06726799504584709,"score_gpt":0.33030112970346653,"score_spread":0.26303313465761946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866786","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.9847578,0.000101938414,0.0028802739,0.0025744056,0.0006012968,0.00033570727,0.000010471283,0.00083730766,0.007900796],"genre_scores_gemma":[0.9869102,0.000007067542,0.012517181,0.00013201886,0.00009456112,0.0000359023,0.0000106482885,0.00001252984,0.00027988775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984954,0.000012152565,0.00039510094,0.00042907186,0.00035624375,0.00031201376],"domain_scores_gemma":[0.9990024,0.00015128817,0.00031981527,0.000103422004,0.00035693895,0.00006614791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083064404,0.00019906057,0.00025642556,0.00032914078,0.00016505003,0.00026675707,0.0011234005,0.00011707979,0.0000034502575],"category_scores_gemma":[0.0004450117,0.00015002121,0.00007452283,0.0004309304,0.00005907176,0.0003345393,0.00029986392,0.0002528259,0.0000072207527],"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.00031739983,0.0002233918,0.25148016,0.00031813412,0.0001755192,0.000035341378,0.009053939,0.010149341,0.03728925,0.6855271,0.0031682674,0.002262184],"study_design_scores_gemma":[0.00061318895,0.00011965323,0.017834233,0.00084404333,0.000005655933,0.000016314983,0.00071632955,0.95864075,0.0031089645,0.017764451,0.00012461831,0.00021181355],"about_ca_topic_score_codex":0.00000982372,"about_ca_topic_score_gemma":9.2554956e-7,"teacher_disagreement_score":0.9484914,"about_ca_system_score_codex":0.000039243783,"about_ca_system_score_gemma":0.000080941354,"threshold_uncertainty_score":0.6117687},"labels":[],"label_agreement":null},{"id":"W4382866836","doi":"10.1609/icaps.v33i1.27175","title":"W-restrained Bidirectional Bounded-Suboptimal Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Heuristic; Property (philosophy); Search algorithm; Mathematical optimization; Computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Philosophy","score_opus":0.0726040891907504,"score_gpt":0.3367700420719623,"score_spread":0.2641659528812119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866836","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.9575037,0.000033190037,0.013522121,0.007943454,0.00096119154,0.00028617564,0.000023162434,0.0015741825,0.018152857],"genre_scores_gemma":[0.96592605,0.000022975346,0.033070497,0.00007174347,0.000060192597,0.0000133865815,0.000006860485,0.000011394772,0.0008169224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981355,0.000019688854,0.00029256177,0.00036428883,0.0009220506,0.0002659024],"domain_scores_gemma":[0.9988183,0.00017864529,0.00014157938,0.00011344762,0.00065594335,0.00009209955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319244,0.00014028458,0.00015493286,0.0003736123,0.0002467165,0.00050163426,0.0011162356,0.00006734204,0.000033444077],"category_scores_gemma":[0.00070896285,0.0001118506,0.00004878519,0.0007194297,0.0001105543,0.00026663337,0.0004261502,0.000302328,0.000029605148],"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.00017885679,0.00019690838,0.01743549,0.0002190603,0.00035743567,0.00003463581,0.002823078,0.075709075,0.046526678,0.8450784,0.004250721,0.007189674],"study_design_scores_gemma":[0.00024395772,0.00004288448,0.0073824655,0.0001816641,0.0000037950178,0.00002712137,0.00016625934,0.9862662,0.003004163,0.002508057,0.0000609062,0.00011250362],"about_ca_topic_score_codex":0.00001258605,"about_ca_topic_score_gemma":1.3131883e-7,"teacher_disagreement_score":0.91055715,"about_ca_system_score_codex":0.000041087027,"about_ca_system_score_gemma":0.00014357112,"threshold_uncertainty_score":0.48372707},"labels":[],"label_agreement":null},{"id":"W4382866847","doi":"10.1609/icaps.v33i1.27201","title":"Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Travelling salesman problem; Mathematical optimization; Heuristic; Domain (mathematical analysis); Computer science; Constraint programming; Dynamic programming; Constraint satisfaction problem; Mathematics; Stochastic programming; Artificial intelligence","score_opus":0.029136682222907113,"score_gpt":0.28917392073227355,"score_spread":0.26003723850936644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866847","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.9916792,0.000032148477,0.0035764906,0.0003504037,0.00017045115,0.00022293442,0.0000060585658,0.001505991,0.0024563458],"genre_scores_gemma":[0.9597281,0.000014498381,0.04006394,0.000012721333,0.000022299597,0.000020602183,0.000007951144,0.000036608588,0.00009325466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986985,0.000010819125,0.00027599154,0.00024402855,0.00048806315,0.00028263376],"domain_scores_gemma":[0.99940604,0.00008009521,0.00010966321,0.00007112973,0.0002708674,0.00006221359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664034,0.0001778542,0.0001761263,0.00023094547,0.0001581351,0.00023616108,0.000368849,0.00007883961,0.000008613083],"category_scores_gemma":[0.00011043735,0.00013850706,0.000032491767,0.00040235906,0.000062500854,0.000148462,0.00010831054,0.00033850464,0.00000577233],"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.000045687113,0.000023777302,0.022075828,0.00033021977,0.00017348048,0.0000063475118,0.002896147,0.9209042,0.047721665,0.0031351272,0.000042215757,0.0026452746],"study_design_scores_gemma":[0.00029093502,0.000041546373,0.005430016,0.0011549172,0.000012080196,0.000028325743,0.0011531124,0.9888298,0.0026250307,0.00025260233,0.000017314253,0.00016432624],"about_ca_topic_score_codex":0.0000053984186,"about_ca_topic_score_gemma":5.9213596e-7,"teacher_disagreement_score":0.067925565,"about_ca_system_score_codex":0.00006676124,"about_ca_system_score_gemma":0.00003394063,"threshold_uncertainty_score":0.56481546},"labels":[],"label_agreement":null},{"id":"W4382866853","doi":"10.1609/icaps.v33i1.27200","title":"Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Computer science; Solver; Integer programming; State space; Formalism (music); Mathematical optimization; Domain (mathematical analysis); Dynamic programming; Combinatorial optimization; Theoretical computer science; Mathematics; Algorithm; Stochastic programming; Programming language","score_opus":0.03391730746902807,"score_gpt":0.29794611231564133,"score_spread":0.2640288048466133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866853","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.67370194,0.00001711546,0.3158363,0.0061798804,0.0014429807,0.00060629373,0.000016047863,0.0010761964,0.0011232615],"genre_scores_gemma":[0.9226722,0.000022197519,0.0770739,0.0000404524,0.000023900171,0.000028485594,0.000014116187,0.000010543738,0.00011421172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988535,0.000009886359,0.00023600369,0.00029183595,0.00041362835,0.0001951555],"domain_scores_gemma":[0.9991467,0.00006531327,0.00019395753,0.00007283365,0.00046757975,0.00005358889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045746044,0.00012385673,0.0001238889,0.00019101848,0.00020379624,0.00037600653,0.00048969686,0.000060665872,0.000004322041],"category_scores_gemma":[0.000070182505,0.000104972016,0.000046271813,0.00037207996,0.000046879282,0.00026646932,0.00016686866,0.00013903937,0.0000021418589],"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.00013939325,0.000070702416,0.0070877634,0.000110720466,0.00012638875,0.0000024200037,0.0027935451,0.66033757,0.015753308,0.30535936,0.00024552076,0.0079733115],"study_design_scores_gemma":[0.0005115103,0.000058184036,0.0015539705,0.00014505722,0.000004718725,0.000008426479,0.0004052555,0.99247575,0.00262905,0.0020153886,0.00007739749,0.000115270166],"about_ca_topic_score_codex":0.0000044967437,"about_ca_topic_score_gemma":3.308521e-7,"teacher_disagreement_score":0.3321382,"about_ca_system_score_codex":0.00005553717,"about_ca_system_score_gemma":0.00007994932,"threshold_uncertainty_score":0.42806345},"labels":[],"label_agreement":null},{"id":"W4382866902","doi":"10.1609/icaps.v33i1.27241","title":"Safe MDP Planning by Learning Temporal Patterns of Undesirable Trajectories and Averting Negative Side Effects","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Scalability; Lagrange multiplier; Reinforcement learning; Computation; Categorical variable; Fidelity; Markov process; Function (biology); Mathematical optimization; Action (physics); Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.07393665330678277,"score_gpt":0.35434579308602976,"score_spread":0.280409139779247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866902","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.99578017,0.000079734295,0.00024014607,0.0007985521,0.00013652713,0.00008722059,0.00001516008,0.00013326346,0.0027292445],"genre_scores_gemma":[0.9987041,0.00004819572,0.0006867548,0.000036697063,0.00002521477,0.00000487964,0.0000068033355,0.000010921011,0.000476442],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785644,0.00004641474,0.00058615004,0.00037373207,0.0009249802,0.00021227554],"domain_scores_gemma":[0.9974301,0.0012881197,0.00068823365,0.000072462884,0.00045512104,0.00006599648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015719862,0.00017616579,0.00036830932,0.00033782684,0.00030201007,0.00027502986,0.0004998741,0.00008937627,0.000012472455],"category_scores_gemma":[0.003304902,0.00012460384,0.00007848736,0.00046706363,0.00010809917,0.00031709677,0.00020075632,0.00031199705,0.0000038157],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021560933,0.00003067379,0.87885994,0.00011189113,0.00024027884,0.000005273623,0.009232528,0.017238671,0.08463778,0.004462735,0.00032475882,0.004639876],"study_design_scores_gemma":[0.00054401613,0.00014111382,0.104331836,0.0015118611,0.00004325585,0.0000084354215,0.018321106,0.82096285,0.04375404,0.010093442,0.00005257651,0.00023547173],"about_ca_topic_score_codex":0.0001217755,"about_ca_topic_score_gemma":0.0000018994534,"teacher_disagreement_score":0.80372417,"about_ca_system_score_codex":0.000021209938,"about_ca_system_score_gemma":0.000037657188,"threshold_uncertainty_score":0.50811976},"labels":[],"label_agreement":null},{"id":"W4382866947","doi":"10.1609/icaps.v33i1.27203","title":"On Using Action Inheritance and Modularity in PDDL Domain Modelling","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; UK Research and Innovation","keywords":"Computer science; Modularity (biology); Inheritance (genetic algorithm); Programming language; Software engineering; Code reuse; Domain (mathematical analysis); Artificial intelligence; Software","score_opus":0.08997274870527693,"score_gpt":0.316578830694882,"score_spread":0.22660608198960508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866947","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.6482864,0.000010281287,0.35076046,0.00025531542,0.00009104995,0.000060920993,0.0000014052682,0.00042179285,0.000112393864],"genre_scores_gemma":[0.8604363,0.000016951264,0.13948214,0.000029789262,0.000011687794,0.0000066570597,7.532101e-7,0.0000075185712,0.000008177292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.0000076324,0.00019848175,0.0002830826,0.00028214094,0.00014918587],"domain_scores_gemma":[0.99960846,0.000045039335,0.00012235683,0.000078394514,0.00011379457,0.000031944735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040517445,0.00012270901,0.00013191617,0.00025313775,0.000081930324,0.0001511039,0.0004155774,0.000075423646,5.2842194e-7],"category_scores_gemma":[0.00003207239,0.000108365384,0.000020863255,0.00027848917,0.000030565938,0.0003009555,0.00018145407,0.00024984294,5.4876574e-7],"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.00003594973,0.000026747033,0.0058426284,0.00007041825,0.000022278542,0.000004343417,0.0014718518,0.42849383,0.038222816,0.5240714,0.000019870255,0.0017178901],"study_design_scores_gemma":[0.00013327818,0.000023617325,0.0016033339,0.00084135745,0.0000015392537,0.00000908877,0.000049851573,0.9736048,0.004167376,0.019451072,0.000009861623,0.00010485227],"about_ca_topic_score_codex":0.000023268576,"about_ca_topic_score_gemma":4.0653458e-7,"teacher_disagreement_score":0.54511094,"about_ca_system_score_codex":0.00005363423,"about_ca_system_score_gemma":0.000020578234,"threshold_uncertainty_score":0.4419012},"labels":[],"label_agreement":null},{"id":"W4382890541","doi":"10.1609/icaps.v33i1.27227","title":"Priority-Based Search for the Virtual Network Embedding Problem","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; University of Southern California; Simon Fraser University; National Science Foundation","keywords":"Embedding; Computer science; Benchmark (surveying); Heuristic; Solver; Context (archaeology); Network virtualization; Path (computing); Theoretical computer science; Mathematical optimization; Mathematics; Virtualization; Artificial intelligence; Computer network; Cloud computing","score_opus":0.051670014530140924,"score_gpt":0.31757142461650856,"score_spread":0.26590141008636764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382890541","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.90218276,0.00017441937,0.07348021,0.016801821,0.0017709265,0.00092881604,0.000020036125,0.0023240002,0.0023169925],"genre_scores_gemma":[0.98257244,0.00001598432,0.016826555,0.00027696707,0.00015151271,0.00004159635,0.000004078702,0.000011946253,0.00009889794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987152,0.000010070933,0.00024388253,0.00029959792,0.00043356125,0.000297649],"domain_scores_gemma":[0.99871016,0.0006058445,0.00016933237,0.000108842134,0.00035991834,0.000045925135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333058,0.00013984772,0.00014401643,0.000102275284,0.00042524232,0.00044028094,0.0011775653,0.000071161565,0.0000026533862],"category_scores_gemma":[0.00016063622,0.000089541645,0.0000686614,0.00044726997,0.00006224455,0.0001762731,0.0002929402,0.00025405173,0.0000034028244],"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.00013270933,0.000035706544,0.017671535,0.000088458626,0.00014834397,0.0000018745297,0.001652076,0.53004664,0.00340588,0.4336796,0.0034639637,0.0096732],"study_design_scores_gemma":[0.00028993477,0.000071088674,0.0022366447,0.0005314895,0.000008446186,0.000004085769,0.00023733005,0.991382,0.0014508022,0.0034943065,0.00018370422,0.000110153735],"about_ca_topic_score_codex":0.00000817558,"about_ca_topic_score_gemma":3.2428508e-7,"teacher_disagreement_score":0.46133536,"about_ca_system_score_codex":0.000023921959,"about_ca_system_score_gemma":0.00008738495,"threshold_uncertainty_score":0.42456394},"labels":[],"label_agreement":null},{"id":"W4391833299","doi":"10.1609/icaps.v34i1.31489","title":"Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings","year":2024,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"Office of Naval Research","keywords":"Psychology; Epistemology; Computer science; Artificial intelligence; Philosophy","score_opus":0.09167038274346535,"score_gpt":0.39999145334192976,"score_spread":0.3083210705984644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391833299","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.9847118,0.0004937553,0.0019802845,0.0031280983,0.0011235377,0.00039690698,0.000025241405,0.00033304695,0.007807289],"genre_scores_gemma":[0.9800393,0.000011919832,0.018110197,0.00014866405,0.0001630271,0.00014155435,0.000070784445,0.000045945246,0.001268625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998175,0.00009106625,0.0005698905,0.0006268607,0.00028032128,0.00025685586],"domain_scores_gemma":[0.998553,0.00034872527,0.0006121481,0.00007947523,0.00036823718,0.000038450504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026065744,0.0003030525,0.0003685885,0.00049843057,0.00022611923,0.000295852,0.0003425841,0.00030680388,0.000011507914],"category_scores_gemma":[0.0006993371,0.0002646058,0.00006634263,0.00017357722,0.00008544825,0.00011300936,0.00038451425,0.00192686,0.000002261728],"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.0017372624,0.00025251418,0.13922022,0.0052812053,0.001424767,0.000032592765,0.2106375,0.28151974,0.089730814,0.25045747,0.0051502013,0.014555703],"study_design_scores_gemma":[0.0005906071,0.00011956684,0.010418645,0.0082824165,0.00005125675,0.000026343792,0.009624201,0.946307,0.00082027254,0.023185166,0.00019907646,0.00037541633],"about_ca_topic_score_codex":0.00007453477,"about_ca_topic_score_gemma":3.7365723e-7,"teacher_disagreement_score":0.6647873,"about_ca_system_score_codex":0.000080282676,"about_ca_system_score_gemma":0.000078320336,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W4399157307","doi":"10.1609/icaps.v34i1.31480","title":"JaxPlan and GurobiPlan: Optimization Baselines for Replanning in Discrete and Mixed Discrete-Continuous Probabilistic Domains","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Solver; Computer science; Discrete optimization; Computation; Mathematical optimization; Discrete time and continuous time; Graph; Theoretical computer science; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.025062564619118047,"score_gpt":0.28507919947442417,"score_spread":0.26001663485530613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399157307","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.9736202,0.00047631995,0.021419019,0.0014842182,0.00045485553,0.0003507533,0.00002245679,0.0003638838,0.0018082967],"genre_scores_gemma":[0.97724515,0.00003806791,0.02248765,0.00003873245,0.00004978375,0.000026800664,0.000010348835,0.00001046571,0.00009299243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989096,0.000012333534,0.0002878042,0.00043102534,0.0001786155,0.00018060507],"domain_scores_gemma":[0.9993506,0.00023148554,0.00013643311,0.000066620094,0.00016124919,0.000053612854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054012594,0.00016798372,0.00019732636,0.00018099425,0.00012920878,0.0006075675,0.00033900284,0.00007634523,0.0000012790391],"category_scores_gemma":[0.0004803342,0.00012065462,0.000030593874,0.00015458057,0.00007493885,0.00035821603,0.00018525394,0.00016732686,1.9407338e-7],"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.00037113286,0.00009271527,0.046898127,0.0013946837,0.00023455414,0.000025851774,0.013243963,0.03164776,0.01679466,0.88279474,0.00056698045,0.0059348377],"study_design_scores_gemma":[0.00032792398,0.00008148467,0.0022292023,0.0015338468,0.000014584611,0.000054106902,0.00038344247,0.99111027,0.0008362883,0.0032321129,0.000042249452,0.00015446817],"about_ca_topic_score_codex":0.000013151166,"about_ca_topic_score_gemma":0.0000021157352,"teacher_disagreement_score":0.9594625,"about_ca_system_score_codex":0.000023707633,"about_ca_system_score_gemma":0.00003630958,"threshold_uncertainty_score":0.58587873},"labels":[],"label_agreement":null},{"id":"W4399175867","doi":"10.1609/icaps.v34i1.31520","title":"Multi-Robot Connected Fermat Spiral Coverage","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workspace; Computer science; Robot; Path (computing); Motion planning; Scalability; Distributed computing; Artificial intelligence; Mathematical optimization; Computer network; Mathematics","score_opus":0.054018082742686706,"score_gpt":0.30943663855518305,"score_spread":0.25541855581249634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399175867","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.9255389,0.0003941591,0.057954308,0.004261743,0.0025871093,0.0002725292,0.000023401913,0.0024985608,0.0064692656],"genre_scores_gemma":[0.9291569,0.00001116992,0.070375636,0.00017680207,0.000053792006,0.0000078609955,0.000003510706,0.000012376537,0.00020193718],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985742,0.000011173278,0.00031482326,0.00041694907,0.00045340185,0.00022943199],"domain_scores_gemma":[0.99929535,0.00011451451,0.00015310959,0.00011188075,0.00025502397,0.00007009073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003611477,0.00019623441,0.00018998711,0.0002083272,0.00013806761,0.00074328325,0.0010717128,0.000092838935,0.000007622826],"category_scores_gemma":[0.0002343634,0.00014756541,0.000063493506,0.00028518954,0.00006390744,0.00047170452,0.0003001226,0.0003610509,0.000015599991],"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.00012812979,0.00030259503,0.026936369,0.00072126254,0.0008355714,0.00018277104,0.012686552,0.059869207,0.47632706,0.40617958,0.0026097936,0.013221101],"study_design_scores_gemma":[0.00025247998,0.00004423568,0.0057923817,0.0014497336,0.000010021209,0.00009302853,0.000117070136,0.9836401,0.007496135,0.00088040484,0.000052525498,0.0001718922],"about_ca_topic_score_codex":0.000012224021,"about_ca_topic_score_gemma":8.769149e-8,"teacher_disagreement_score":0.9237709,"about_ca_system_score_codex":0.000048032918,"about_ca_system_score_gemma":0.00008025249,"threshold_uncertainty_score":0.7167497},"labels":[],"label_agreement":null},{"id":"W4399177038","doi":"10.1609/icaps.v34i1.31455","title":"Exact Multi-objective Path Finding with Negative Weights","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"State Government of Victoria; Australian Government","keywords":"Mathematical optimization; Shortest path problem; Computer science; Path (computing); Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Task (project management); Pareto optimal; Algorithm; Multi-objective optimization; Mathematics; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.03990089687618361,"score_gpt":0.29810617310350235,"score_spread":0.25820527622731876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399177038","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.92798495,0.00021107715,0.056624927,0.0020970064,0.0011379204,0.00032306963,0.00001893289,0.0015648485,0.010037247],"genre_scores_gemma":[0.8678323,0.000006770881,0.13188383,0.000053914802,0.000042567986,0.000011386503,0.0000014671366,0.000012002323,0.0001557386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859476,0.000012210449,0.00023364119,0.00045911636,0.0004812269,0.00021904986],"domain_scores_gemma":[0.9991723,0.00019008461,0.0001805005,0.00009393857,0.00029940758,0.0000637799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003396671,0.00020527994,0.00018480862,0.00023350611,0.00017563032,0.0006000745,0.0008083051,0.00007366974,0.000003876078],"category_scores_gemma":[0.0001730188,0.0001333236,0.000045729947,0.0003385922,0.00008161081,0.00054671575,0.00019716547,0.00038292698,0.000006267143],"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.00035699146,0.00038597686,0.05100264,0.0007253035,0.0018782973,0.00027938743,0.06893633,0.03725786,0.06138104,0.76372266,0.0009955465,0.0130779445],"study_design_scores_gemma":[0.0002516813,0.00009747575,0.0054380484,0.002926149,0.000013227418,0.000083585146,0.0006118459,0.97975945,0.009021834,0.0016072871,0.000011640429,0.00017776014],"about_ca_topic_score_codex":0.00001937311,"about_ca_topic_score_gemma":1.7530891e-7,"teacher_disagreement_score":0.9425016,"about_ca_system_score_codex":0.00006602656,"about_ca_system_score_gemma":0.000109391556,"threshold_uncertainty_score":0.5786532},"labels":[],"label_agreement":null},{"id":"W4414222950","doi":"10.1609/icaps.v35i1.36109","title":"Parallelizing Multi-objective A* Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Curse of dimensionality; Graph; Enhanced Data Rates for GSM Evolution; Shortest path problem; Optimization problem; Path (computing); Search algorithm; Key (lock)","score_opus":0.04308071131536093,"score_gpt":0.3321844671879373,"score_spread":0.28910375587257636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414222950","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.34680542,0.00019038156,0.6147876,0.004890281,0.0011722855,0.00053730427,0.000010123059,0.0011840432,0.030422553],"genre_scores_gemma":[0.8218466,0.00001623093,0.17755869,0.00019126442,0.000013558111,0.000011454564,9.87993e-7,0.000005917533,0.0003552645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998879,0.000012472294,0.00024773847,0.00036580054,0.00031373,0.00018123798],"domain_scores_gemma":[0.9988897,0.00009213632,0.00016613495,0.000101523714,0.0007098526,0.000040675055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029019325,0.00014812211,0.00015823578,0.00023943729,0.00020849642,0.00024491418,0.00092289736,0.000067888854,0.0000036054807],"category_scores_gemma":[0.00032369854,0.000118783966,0.000044722347,0.0003760096,0.00007969882,0.0003915665,0.00040863993,0.00027638522,0.000002382584],"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.0001400258,0.0002554672,0.02775611,0.00012059436,0.00036104576,0.0000059645236,0.0059039975,0.13547349,0.061850313,0.7562153,0.00019431807,0.011723423],"study_design_scores_gemma":[0.000455592,0.000021645039,0.0062409905,0.0005069552,0.0000048786733,0.000007111131,0.000687081,0.9712075,0.01923667,0.0014989665,0.000019864035,0.000112774535],"about_ca_topic_score_codex":0.000012536496,"about_ca_topic_score_gemma":3.549164e-7,"teacher_disagreement_score":0.83573395,"about_ca_system_score_codex":0.000070387425,"about_ca_system_score_gemma":0.00008790151,"threshold_uncertainty_score":0.48438695},"labels":[],"label_agreement":null},{"id":"W4414223321","doi":"10.1609/icaps.v35i1.36134","title":"New Exact Methods for Solving Quadratic Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Travelling salesman problem; Integer programming; Generalization; Quadratic programming; Quadratic equation; Branch and bound; Scalability; Integer (computer science); Linear programming","score_opus":0.05569454548912666,"score_gpt":0.38933066774580644,"score_spread":0.33363612225667977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414223321","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.008737129,0.00008704761,0.97848964,0.0036102694,0.00038271162,0.0003286728,0.0000021969354,0.0002723115,0.008090023],"genre_scores_gemma":[0.276573,0.000010873882,0.7225749,0.00010767893,0.000026250407,0.000018938907,0.0000015930957,0.0000071093687,0.0006797026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.000018207316,0.0003929481,0.0003603699,0.00031160977,0.0002133182],"domain_scores_gemma":[0.9985814,0.00037564864,0.00024556665,0.00011355736,0.00061522203,0.00006856695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444264,0.00014990674,0.00021033108,0.00023649212,0.00021004977,0.00054370594,0.0011793501,0.00007372729,0.0000092463515],"category_scores_gemma":[0.001048027,0.0001183544,0.00005997344,0.00034447148,0.000038189908,0.0002749279,0.000266284,0.00022338849,9.676484e-7],"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.00006952796,0.000054301356,0.0013064628,0.00027708698,0.00022112107,6.4523545e-7,0.0017557724,0.010272434,0.055113822,0.87096524,0.0009258459,0.059037734],"study_design_scores_gemma":[0.0003500557,0.00003435806,0.00033272366,0.0007524361,0.000012308176,0.0000049240257,0.00016971977,0.9623834,0.01752592,0.01822778,0.00009895015,0.00010743331],"about_ca_topic_score_codex":0.000012560519,"about_ca_topic_score_gemma":2.2344516e-7,"teacher_disagreement_score":0.95211095,"about_ca_system_score_codex":0.00004312636,"about_ca_system_score_gemma":0.00023458003,"threshold_uncertainty_score":0.5242969},"labels":[],"label_agreement":null},{"id":"W49698117","doi":"10.1609/icaps.v24i1.13680","title":"Improved Features for Runtime Prediction of Domain-Independent Planners","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Planner; Computer science; Set (abstract data type); Domain (mathematical analysis); Variation (astronomy); Range (aeronautics); Machine learning; Artificial intelligence; Point (geometry); Mathematics; Engineering; Programming language","score_opus":0.0215283963574559,"score_gpt":0.25794355658467766,"score_spread":0.23641516022722175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49698117","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.95030034,0.000068772875,0.040397737,0.0020851712,0.000745869,0.00031295998,0.00004838685,0.00042541363,0.005615376],"genre_scores_gemma":[0.9640785,0.0000026635146,0.035659447,0.00008716229,0.00005344693,0.000013525164,0.000008163969,0.0000082155075,0.000088906556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988884,0.000010815155,0.00030810147,0.00029049814,0.0003257472,0.00017648534],"domain_scores_gemma":[0.9989239,0.0001590983,0.00040515556,0.000093971445,0.00036888904,0.0000490062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069893803,0.00014654784,0.00018964068,0.0001457052,0.00015442554,0.00015599592,0.00077048526,0.00009935224,0.000002072061],"category_scores_gemma":[0.00023197896,0.00011209001,0.0000648552,0.00011020472,0.00004905281,0.00021648458,0.00013428633,0.00019392972,3.9957754e-7],"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.0004699982,0.00013321934,0.027455809,0.00044009968,0.00035339562,8.0157827e-7,0.006360917,0.0103855245,0.4669665,0.48111004,0.002049211,0.004274461],"study_design_scores_gemma":[0.00056661014,0.00020034498,0.004041516,0.00076942315,0.000013369788,0.000014131443,0.00029417258,0.9533028,0.035105858,0.005472682,0.00009680945,0.00012229325],"about_ca_topic_score_codex":0.000015364385,"about_ca_topic_score_gemma":2.9729964e-7,"teacher_disagreement_score":0.9429173,"about_ca_system_score_codex":0.000022039749,"about_ca_system_score_gemma":0.00004597827,"threshold_uncertainty_score":0.4570898},"labels":[],"label_agreement":null},{"id":"W85676387","doi":"10.1609/icaps.v19i1.13392","title":"Exploiting N-Gram Analysis to Predict Operator Sequences","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"n-gram; Gram; Computer science; Operator (biology); Planner; Set (abstract data type); Sequence (biology); Core (optical fiber); Artificial intelligence; Word (group theory); Data mining; Mathematics; Language model; Programming language","score_opus":0.03421742483727147,"score_gpt":0.2935455780116302,"score_spread":0.25932815317435876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85676387","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.979518,0.00006627733,0.008600261,0.0054133795,0.00019505448,0.00012525143,0.000007648252,0.0005587175,0.005515435],"genre_scores_gemma":[0.9651989,0.0000056697027,0.034026515,0.0006432915,0.00004475923,0.000007050591,0.0000027013004,0.000004983198,0.00006617058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985056,0.000013112282,0.00033685256,0.00040699675,0.00049420487,0.00024321215],"domain_scores_gemma":[0.9990863,0.00008193374,0.00023725367,0.000114061266,0.000369975,0.00011043939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583644,0.00017857166,0.00023141144,0.00034891668,0.00024680383,0.00056747417,0.0012036213,0.00007159189,0.0000067863593],"category_scores_gemma":[0.00027907616,0.00013614268,0.00007923365,0.0007249009,0.000030673473,0.00039951457,0.00015891949,0.00024183837,0.0000034665786],"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.00022452418,0.00023844893,0.20397143,0.00010519893,0.001562007,0.000026170379,0.01868263,0.19255823,0.21915236,0.33844844,0.0015504328,0.023480127],"study_design_scores_gemma":[0.0001490597,0.00014311785,0.009315525,0.0007000761,0.00004306228,0.00001185314,0.00045848306,0.97396874,0.0133559145,0.0016257972,0.000031097585,0.00019728475],"about_ca_topic_score_codex":0.00002091109,"about_ca_topic_score_gemma":4.2961787e-7,"teacher_disagreement_score":0.7814105,"about_ca_system_score_codex":0.000033502645,"about_ca_system_score_gemma":0.00006204472,"threshold_uncertainty_score":0.55517375},"labels":[],"label_agreement":null},{"id":"W85998123","doi":"10.1609/icaps.v19i1.13355","title":"Incremental Policy Generation for Finite-Horizon DEC-POMDPs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Dynamic programming; Computer science; Scalability; Reachability; Mathematical optimization; State (computer science); State space; Reduction (mathematics); Backup; Horizon; Algorithm; Mathematics","score_opus":0.05613533112334739,"score_gpt":0.31798258634313714,"score_spread":0.26184725521978974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85998123","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.8231798,0.000031377196,0.15691182,0.007752398,0.00059184164,0.00039525726,0.0000054859925,0.0007152855,0.010416759],"genre_scores_gemma":[0.9512043,0.000008926823,0.048234075,0.00033007417,0.00012932987,0.0000070846463,0.00000504657,0.000005372223,0.000075775446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989807,0.0000054413485,0.00026230398,0.00023771862,0.00034734086,0.00016649182],"domain_scores_gemma":[0.99924546,0.000060393635,0.0002614639,0.00008025338,0.0003101354,0.00004227408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030832167,0.00012684957,0.00011723971,0.0001721926,0.00017789174,0.00034842748,0.00072171475,0.00006238276,0.0000021578724],"category_scores_gemma":[0.0003896973,0.00010301291,0.000044228243,0.00015665404,0.0000217889,0.00033751375,0.00011052835,0.00012249046,0.0000013592839],"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.000049027694,0.00005552316,0.0020782035,0.000031640335,0.00007153163,5.842673e-7,0.0012936533,0.13279042,0.18110326,0.67777187,0.0005655419,0.0041887416],"study_design_scores_gemma":[0.0003021205,0.00023475828,0.0006775631,0.00017250737,0.000006044,0.000005400974,0.00008238517,0.9712363,0.025428485,0.0016680942,0.00007779745,0.000108543405],"about_ca_topic_score_codex":0.000004935337,"about_ca_topic_score_gemma":1.0594683e-7,"teacher_disagreement_score":0.8384459,"about_ca_system_score_codex":0.00006150985,"about_ca_system_score_gemma":0.00007066078,"threshold_uncertainty_score":0.42007446},"labels":[],"label_agreement":null}]}