{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":93,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":93,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"43498212310d","filters":{"venue":"Proceedings of the International Conference on Automated Planning and Scheduling"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Christian Muise","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03166301535650045,"gpt":0.2840752904139964,"spread":0.252412275057496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478953,0.0002508074,0.0002396115,0.000137567,0.0003096579,0.0003800715,0.001054913,0.00009021149,0.000004248237],"category_scores_gemma":[0.0003941914,0.0002048106,0.00005602117,0.0001986013,0.00006591032,0.0007681923,0.0003084067,0.0004271627,0.000004183517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004540395,"about_ca_system_score_gemma":0.00005534843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001414782,"about_ca_topic_score_gemma":5.785938e-8,"domain_scores_codex":[0.9983092,0.0000149325,0.0004253042,0.0003715545,0.000423151,0.0004558651],"domain_scores_gemma":[0.9987249,0.0002457559,0.0005153993,0.0001294047,0.0002489907,0.0001354849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002841107,0.0002689758,0.1322929,0.0004969759,0.0003663013,0.00001195613,0.02511745,0.007758783,0.7862602,0.03017949,0.005063578,0.01189931],"study_design_scores_gemma":[0.0003344654,0.00008236597,0.001748579,0.001539847,0.00001135318,0.00003601685,0.0005362814,0.9589117,0.0356483,0.000704371,0.0001503328,0.0002964282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9790848,0.0002939337,0.01372756,0.0008847297,0.0006850679,0.0001596787,0.0000165062,0.0005333481,0.004614405],"genre_scores_gemma":[0.9817498,0.00001061775,0.01767656,0.0002620879,0.00007313248,0.00001614081,0.000005301787,0.00001830419,0.0001880782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9511529,"threshold_uncertainty_score":0.8351932,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alberto Rivas","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03469309263076131,"gpt":0.2746181787677578,"spread":0.2399250861369965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094693,0.0001710577,0.0002185737,0.0002093691,0.00009388377,0.0002346463,0.000980353,0.00009863582,0.00001196056],"category_scores_gemma":[0.0001161379,0.0001348767,0.0000467667,0.0002216577,0.00003140702,0.0005794755,0.000306872,0.0004998436,0.000007781716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003523999,"about_ca_system_score_gemma":0.00006164364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004468288,"about_ca_topic_score_gemma":3.510207e-7,"domain_scores_codex":[0.9986811,0.00001962529,0.0003283138,0.0003779216,0.0003572413,0.0002358501],"domain_scores_gemma":[0.9992529,0.0001158698,0.0002807706,0.00009901668,0.000204027,0.00004746944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002037775,0.0001109005,0.2122028,0.0002076209,0.00009449525,0.000008791258,0.009092001,0.5188761,0.07368477,0.1837224,0.0001976394,0.001598751],"study_design_scores_gemma":[0.0003266842,0.00008998576,0.0008246133,0.001394768,0.000002813471,0.000008960975,0.0004902803,0.9859009,0.004195221,0.006576291,0.00003259948,0.000156828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9809986,0.00007080512,0.004011892,0.001064565,0.0003581318,0.0001422957,0.000002916045,0.0003539987,0.01299677],"genre_scores_gemma":[0.9825515,0.000009315697,0.0169172,0.00013964,0.00001864758,0.000007187342,0.000003467959,0.000009773821,0.0003432868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4670249,"threshold_uncertainty_score":0.5500113,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Omar Khan","is_ca":true},{"name":"Pascal Poupart","is_ca":true},{"name":"James P. Black","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04320861166281764,"gpt":0.3100428253267046,"spread":0.2668342136638869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002701448,0.0001326385,0.000132371,0.0001633795,0.0001859132,0.0003646491,0.000912023,0.00005949617,0.000003658851],"category_scores_gemma":[0.0008583452,0.0001003546,0.00004121145,0.000206786,0.0000314317,0.000324092,0.0001056172,0.0001328385,0.000001182449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003324329,"about_ca_system_score_gemma":0.00007849734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001346633,"about_ca_topic_score_gemma":1.049575e-7,"domain_scores_codex":[0.9988248,0.00000352666,0.0002931852,0.0002644265,0.0004425491,0.0001715615],"domain_scores_gemma":[0.9987393,0.0001828524,0.0002859181,0.00008264199,0.0006628867,0.00004640403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004954312,0.0003118708,0.01556651,0.0002758544,0.0001912059,0.000003005561,0.008775285,0.4042556,0.0512325,0.5023435,0.002934502,0.01361476],"study_design_scores_gemma":[0.0003166573,0.0001661594,0.004975257,0.0005287123,0.000007068999,0.000007949621,0.0003173345,0.9854993,0.006749705,0.001184618,0.0001227054,0.0001245903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7493236,0.00004198687,0.2417834,0.003248305,0.0004342483,0.0003199874,0.000008763795,0.0004331962,0.004406555],"genre_scores_gemma":[0.9327832,0.000008455696,0.06692025,0.0001511866,0.00002657031,0.000008744174,0.000004223892,0.000004878906,0.00009244245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5812436,"threshold_uncertainty_score":0.4092341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Florian Grenouilleau","is_ca":true},{"name":"Willem‐Jan van Hoeve","is_ca":false},{"name":"John Hooker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08975077837246882,"gpt":0.3315500664996794,"spread":0.2417992881272106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456024,0.0002114858,0.0002421364,0.0001752242,0.000161829,0.0003152151,0.001225693,0.0001040571,0.000003871513],"category_scores_gemma":[0.0002073517,0.000166992,0.00006796462,0.0001620926,0.00004092362,0.0003440425,0.000306988,0.0002494476,0.00001229849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005613477,"about_ca_system_score_gemma":0.00006496481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008790404,"about_ca_topic_score_gemma":5.504985e-8,"domain_scores_codex":[0.9984575,0.00000909221,0.0003481616,0.0004747837,0.0004208462,0.0002896246],"domain_scores_gemma":[0.9988872,0.0001044415,0.0003694637,0.0001358514,0.0004276138,0.00007545287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002293906,0.001620932,0.1121326,0.0008227231,0.001330996,0.00002966023,0.02097951,0.02349365,0.5235699,0.1477986,0.001103694,0.1668884],"study_design_scores_gemma":[0.001147953,0.00008843892,0.002781506,0.0007675031,0.000009450765,0.00002452725,0.0003400457,0.9891583,0.005277244,0.000186525,0.00001985158,0.0001986742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5144677,0.000106334,0.4799628,0.001014113,0.002024107,0.0007325503,0.00003797234,0.000801792,0.0008527072],"genre_scores_gemma":[0.3532882,0.000004088219,0.6462588,0.0001129003,0.00002963586,0.00002128579,0.000003331495,0.0000118547,0.0002699379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9656646,"threshold_uncertainty_score":0.6809736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christopher Amato","is_ca":false},{"name":"Jilles Dibangoye","is_ca":true},{"name":"Shlomo Zilberstein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05613533112334739,"gpt":0.3179825863431371,"spread":0.2618472552197897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003083217,0.0001268496,0.0001172397,0.0001721926,0.0001778917,0.0003484275,0.0007217148,0.00006238276,0.000002157872],"category_scores_gemma":[0.0003896973,0.0001030129,0.00004422824,0.000156654,0.0000217889,0.0003375137,0.0001105284,0.0001224905,0.000001359284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006150985,"about_ca_system_score_gemma":0.00007066078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004935337,"about_ca_topic_score_gemma":1.059468e-7,"domain_scores_codex":[0.9989807,0.000005441349,0.000262304,0.0002377186,0.0003473409,0.0001664918],"domain_scores_gemma":[0.9992455,0.00006039364,0.0002614639,0.00008025338,0.0003101354,0.00004227408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004902769,0.00005552316,0.002078203,0.00003164033,0.00007153163,5.842673e-7,0.001293653,0.1327904,0.1811033,0.6777719,0.0005655419,0.004188742],"study_design_scores_gemma":[0.0003021205,0.0002347583,0.0006775631,0.0001725074,0.000006044,0.000005400974,0.00008238517,0.9712363,0.02542849,0.001668094,0.00007779745,0.0001085434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8231798,0.0000313772,0.1569118,0.007752398,0.0005918416,0.0003952573,0.000005485992,0.0007152855,0.01041676],"genre_scores_gemma":[0.9512043,0.000008926823,0.04823408,0.0003300742,0.0001293299,0.000007084646,0.00000504657,0.000005372223,0.00007577545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8384459,"threshold_uncertainty_score":0.4200745,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"León Illanes","is_ca":true},{"name":"Xi Yan","is_ca":true},{"name":"Rodrigo Toro Icarte","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06793028415246624,"gpt":0.2946574244530109,"spread":0.2267271403005447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002061071,0.0001560623,0.0001699397,0.0001040279,0.000259546,0.0003147045,0.0009181796,0.00007120496,0.000009760322],"category_scores_gemma":[0.0005754906,0.0001293526,0.00005550437,0.0001791442,0.00004782444,0.0003155472,0.0002764102,0.0003104881,0.000006213363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003268395,"about_ca_system_score_gemma":0.00006758879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001223416,"about_ca_topic_score_gemma":9.037417e-8,"domain_scores_codex":[0.9987517,0.000006378486,0.0003285032,0.0002922349,0.0004261646,0.0001950217],"domain_scores_gemma":[0.999072,0.00008251376,0.0003432672,0.00007169991,0.0003472561,0.00008329513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004665603,0.0000074188,0.002512356,0.00005390745,0.00007931708,4.933848e-7,0.001980237,0.6440079,0.01048321,0.3402543,0.0001620346,0.0004121316],"study_design_scores_gemma":[0.0004229061,0.0001898126,0.0008624433,0.0002901545,0.00001180751,0.00001132982,0.0005378793,0.9882947,0.008106588,0.0008705072,0.000259129,0.0001428082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.631974,0.0000177262,0.3408806,0.01254832,0.0009165037,0.0004908505,0.000009777928,0.001017352,0.01214487],"genre_scores_gemma":[0.977276,0.000009280958,0.02187823,0.000455935,0.00006897823,0.00001698385,0.000007237454,0.00001079374,0.0002765903],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.345302,"threshold_uncertainty_score":0.5274847,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alberto Rivas","is_ca":true},{"name":"Jorge A. Baier","is_ca":false},{"name":"Christian Muise","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06458275588763768,"gpt":0.3362396133394855,"spread":0.2716568574518479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257698,0.0001395617,0.0001413328,0.0001672236,0.0002145594,0.0003063086,0.00121644,0.00007939341,0.00001599191],"category_scores_gemma":[0.001680588,0.000109005,0.00003892874,0.0002222277,0.0001216753,0.0004468579,0.0002770967,0.0001920362,0.00001754226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003003405,"about_ca_system_score_gemma":0.00005813609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009582071,"about_ca_topic_score_gemma":9.070921e-8,"domain_scores_codex":[0.9988213,0.00001467382,0.0002731866,0.0003045761,0.000408737,0.0001775768],"domain_scores_gemma":[0.9988441,0.0001976967,0.0003202581,0.0001319037,0.0004531322,0.00005283851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001485125,0.00006851397,0.01528495,0.00008450972,0.0001343071,0.000003218286,0.005834118,0.001692915,0.09485862,0.874532,0.0004034273,0.006954958],"study_design_scores_gemma":[0.0001029634,0.00007381557,0.003831462,0.000854181,0.000007088396,0.00002254021,0.000336054,0.8563024,0.1335532,0.004687189,0.00009780248,0.0001312702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.937079,0.00003427745,0.01408389,0.001340551,0.0007558843,0.000113554,0.00000367287,0.0005380907,0.0460511],"genre_scores_gemma":[0.8807368,0.000005330282,0.1188926,0.0001892491,0.00007260361,0.00001058425,5.254183e-7,0.000007396899,0.00008488901],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8698448,"threshold_uncertainty_score":0.4445093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Gregory","is_ca":false},{"name":"Derek Long","is_ca":false},{"name":"Maria Fox","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04438401684249059,"gpt":0.3012732997910121,"spread":0.2568892829485215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556415,0.0003160551,0.0002754887,0.0002036296,0.0007289774,0.0006347615,0.001798864,0.0001333058,0.0000102821],"category_scores_gemma":[0.0003824864,0.000205713,0.00009315091,0.0003452545,0.0001354277,0.0008988867,0.0004576585,0.000648117,0.000006570303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005560907,"about_ca_system_score_gemma":0.00006673038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611643,"about_ca_topic_score_gemma":6.48956e-8,"domain_scores_codex":[0.9978535,0.00003917639,0.0004673054,0.0004099391,0.0006721712,0.0005578747],"domain_scores_gemma":[0.9984699,0.0004514495,0.0005326263,0.0002140687,0.0001976166,0.0001343748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001015674,0.00007173033,0.1509589,0.00009404849,0.0002180063,0.000006225696,0.02133107,0.02298848,0.00945764,0.7920606,0.0009114282,0.001800332],"study_design_scores_gemma":[0.0003933276,0.00008021648,0.01431891,0.002508637,0.0000317426,0.0001358736,0.002874925,0.9580395,0.006884391,0.01377862,0.0005132091,0.0004406698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9594037,0.001579435,0.01590888,0.004165377,0.001536473,0.0002678655,0.0000107957,0.0009174102,0.01621005],"genre_scores_gemma":[0.9911872,0.00001291784,0.008051583,0.0003767099,0.0002076922,0.00002085966,0.000004163641,0.00002084526,0.0001180369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.935051,"threshold_uncertainty_score":0.8388734,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hootan Nakhost","is_ca":true},{"name":"Jöerg Hoffmann","is_ca":false},{"name":"Martin Mueller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04241536260847029,"gpt":0.2743744785948414,"spread":0.2319591159863711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097537,0.0002616477,0.0002918963,0.0002175834,0.0002992938,0.0003662645,0.001194407,0.0001386543,0.000005950621],"category_scores_gemma":[0.0003121681,0.0001982241,0.00009123974,0.0002526742,0.00009849834,0.0005365153,0.0002964469,0.0004664791,0.000003195063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003992168,"about_ca_system_score_gemma":0.00006455607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001876727,"about_ca_topic_score_gemma":4.855714e-8,"domain_scores_codex":[0.9981924,0.00002846033,0.0004073429,0.0003793223,0.0005651216,0.0004273261],"domain_scores_gemma":[0.9988661,0.0001956757,0.0004018756,0.0001468786,0.0002379742,0.0001514754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001331569,0.0007137256,0.3493752,0.0006700107,0.001174429,0.00002092423,0.07246166,0.0943426,0.05645728,0.4063071,0.009137493,0.008008076],"study_design_scores_gemma":[0.0008767197,0.00005709864,0.002760997,0.0009368078,0.00002160487,0.0000949174,0.001345559,0.9893411,0.003468832,0.0004576184,0.0003527643,0.0002860102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9442941,0.0005237681,0.0064017,0.001857646,0.0005027756,0.0002637426,0.00001241532,0.0008547973,0.04528904],"genre_scores_gemma":[0.9742941,0.000003781474,0.02512818,0.0002243155,0.0001121769,0.00001738687,0.000004352319,0.00001512391,0.0002005566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8949985,"threshold_uncertainty_score":0.8083345,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pascal Poupart","is_ca":true},{"name":"Kee-Eung Kim","is_ca":true},{"name":"Dongho Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1126074389154537,"gpt":0.3014754091728054,"spread":0.1888679702573517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005364034,0.0001359457,0.0001123335,0.0001253541,0.0004215252,0.0004037057,0.001137248,0.00006184784,0.0000161575],"category_scores_gemma":[0.0001833976,0.00008615715,0.00005162337,0.0001996898,0.0001126195,0.0003298883,0.0003029769,0.0003057543,0.000004783108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003097682,"about_ca_system_score_gemma":0.00006888214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002599469,"about_ca_topic_score_gemma":5.203372e-7,"domain_scores_codex":[0.9988815,0.00001498325,0.0002460893,0.0002675651,0.0003596199,0.0002302613],"domain_scores_gemma":[0.9991587,0.00006344059,0.0002164844,0.0001244658,0.0003793386,0.0000575308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008717289,0.0001221933,0.001813766,0.00002284386,0.00009960067,0.000001590701,0.006357534,0.004511103,0.01823592,0.9666668,0.0003932395,0.001688233],"study_design_scores_gemma":[0.0002254031,0.000100671,0.001422966,0.0002712935,0.000005753807,0.00001637485,0.0004709312,0.9887826,0.005495477,0.003039347,0.00005808795,0.0001111159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8598687,0.00008353071,0.02306521,0.01093824,0.001109044,0.0005159429,0.0000129479,0.0009956917,0.1034107],"genre_scores_gemma":[0.9783106,0.00001327038,0.02109747,0.0003544672,0.00002590747,0.00001232078,0.000001377859,0.000007765836,0.0001767685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9842715,"threshold_uncertainty_score":0.3892944,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chris Fawcett","is_ca":true},{"name":"Mauro Vallati","is_ca":false},{"name":"Frank Hutter","is_ca":false},{"name":"Jörg Hoffmann","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0215283963574559,"gpt":0.2579435565846777,"spread":0.2364151602272218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698938,0.0001465478,0.0001896407,0.0001457052,0.0001544255,0.0001559959,0.0007704853,0.00009935224,0.000002072061],"category_scores_gemma":[0.000231979,0.00011209,0.0000648552,0.0001102047,0.00004905281,0.0002164846,0.0001342863,0.0001939297,3.995775e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002203975,"about_ca_system_score_gemma":0.00004597827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001536439,"about_ca_topic_score_gemma":2.972996e-7,"domain_scores_codex":[0.9988884,0.00001081516,0.0003081015,0.0002904981,0.0003257472,0.0001764853],"domain_scores_gemma":[0.9989239,0.0001590983,0.0004051556,0.00009397144,0.000368889,0.0000490062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004699982,0.0001332193,0.02745581,0.0004400997,0.0003533956,8.015783e-7,0.006360917,0.01038552,0.4669665,0.48111,0.002049211,0.004274461],"study_design_scores_gemma":[0.0005666101,0.000200345,0.004041516,0.0007694231,0.00001336979,0.00001413144,0.0002941726,0.9533028,0.03510586,0.005472682,0.00009680945,0.0001222932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9503003,0.00006877288,0.04039774,0.002085171,0.000745869,0.00031296,0.00004838685,0.0004254136,0.005615376],"genre_scores_gemma":[0.9640785,0.000002663515,0.03565945,0.00008716229,0.00005344693,0.00001352516,0.000008163969,0.000008215507,0.00008890656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9429173,"threshold_uncertainty_score":0.4570898,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Richard Valenzano","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true},{"name":"Karen Buro","is_ca":true},{"name":"Akihiro Kishimoto","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06394127200578725,"gpt":0.3128285928497654,"spread":0.2488873208439781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742227,0.0002392753,0.0002465651,0.0001908271,0.0003698569,0.0008112063,0.0009719069,0.00007689359,0.000003762076],"category_scores_gemma":[0.0007534552,0.0001878544,0.0000577238,0.0002840886,0.00005687099,0.0004574982,0.0003357211,0.0003779838,0.000001565572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006997765,"about_ca_system_score_gemma":0.0001391463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003632037,"about_ca_topic_score_gemma":0.000002118415,"domain_scores_codex":[0.9979743,0.00003405503,0.0003237627,0.0006402733,0.0006283385,0.0003992538],"domain_scores_gemma":[0.997732,0.0006487264,0.0002193088,0.000150383,0.001080824,0.0001687555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007644668,0.000367915,0.02364289,0.0003198061,0.0004905564,0.00009112022,0.03136042,0.6167457,0.2834162,0.02407696,0.000177161,0.01854673],"study_design_scores_gemma":[0.0004635466,0.0003890102,0.0002805712,0.001291038,0.00001152356,0.00008035067,0.001517694,0.9331617,0.06213627,0.0003841318,0.00004612617,0.000238056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8485329,0.00003718062,0.14755,0.002527383,0.0002013195,0.0002771834,0.00002811031,0.0003217732,0.0005241618],"genre_scores_gemma":[0.7349361,0.000001460808,0.2645852,0.0003077522,0.00005377547,0.00001815888,0.00001179532,0.00001715408,0.00006863241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3164159,"threshold_uncertainty_score":0.7822481,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jiaoyang Li","is_ca":false},{"name":"Graeme Gange","is_ca":false},{"name":"Daniel Harabor","is_ca":false},{"name":"Peter J. Stuckey","is_ca":false},{"name":"Hang Ma","is_ca":true},{"name":"Sven Koenig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09075200892442147,"gpt":0.32523314933394,"spread":0.2344811404095186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004069417,0.0001718121,0.0002129947,0.0001658168,0.00009767483,0.0002504384,0.001018466,0.00008786319,0.00000170067],"category_scores_gemma":[0.0005232299,0.0001424218,0.0000555185,0.0002674311,0.00002364495,0.0002995337,0.000268099,0.0002604432,0.000001245621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005000848,"about_ca_system_score_gemma":0.00008302837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002299134,"about_ca_topic_score_gemma":1.394982e-7,"domain_scores_codex":[0.998705,0.00000883238,0.0003460828,0.0003914073,0.000325242,0.0002234882],"domain_scores_gemma":[0.9992477,0.0001104854,0.0002934099,0.00007488434,0.0001783682,0.00009515846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005176116,0.0004158381,0.2204984,0.001098139,0.0004886928,0.00006765495,0.03906827,0.02830141,0.2692081,0.3028401,0.004170359,0.1333254],"study_design_scores_gemma":[0.0004108325,0.00009469302,0.002936938,0.001185134,0.000005884293,0.0000121926,0.0003128041,0.9794981,0.01470778,0.0006336751,0.00004130943,0.0001606294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3889994,0.0001678697,0.5929308,0.01213563,0.0007876237,0.0008356404,0.00002166452,0.001720793,0.002400544],"genre_scores_gemma":[0.6392721,0.000003758103,0.3604127,0.0002228608,0.00004741578,0.00001085557,0.000001515465,0.00000826313,0.00002051121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9511967,"threshold_uncertainty_score":0.5807792,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel J. Lizotte","is_ca":true},{"name":"Michael Bowling","is_ca":true},{"name":"Susan A. Murphy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2188434596026902,"gpt":0.3750649152408874,"spread":0.1562214556381972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392473,0.0001284914,0.0002830765,0.0001849483,0.000185123,0.0001945252,0.0002475224,0.00007956833,0.0001301601],"category_scores_gemma":[0.00124203,0.0001113011,0.0000391628,0.000112472,0.00005443913,0.0004848775,0.00004634193,0.0001832423,0.0001394086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008041265,"about_ca_system_score_gemma":0.00004095583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001932254,"about_ca_topic_score_gemma":0.000003451035,"domain_scores_codex":[0.9984068,0.00001358547,0.001003195,0.0002895754,0.0001285829,0.0001582933],"domain_scores_gemma":[0.998333,0.0001900738,0.001006307,0.00008867698,0.0003171947,0.00006473391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001112209,0.0001421833,0.8363718,0.0003109379,0.0003007858,4.323265e-7,0.004708079,0.008003264,0.002713115,0.1319745,0.01517575,0.0001879001],"study_design_scores_gemma":[0.0005766453,0.00008979504,0.05994361,0.0006649623,0.00000678124,0.00001082853,0.00211664,0.9321973,0.0003262094,0.003140106,0.0007213695,0.0002057557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9725165,0.00006518036,0.0005407047,0.01864858,0.0002680099,0.0002973076,0.00004834433,0.0001468392,0.007468565],"genre_scores_gemma":[0.9927787,0.00000646939,0.005211,0.001267185,0.0001019618,0.00005542111,0.0000156518,0.00001381023,0.0005498266],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.924194,"threshold_uncertainty_score":0.4538729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dor Atzmon","is_ca":false},{"name":"Roni Stern","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Sven Koenig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1100361008003602,"gpt":0.2997737098215403,"spread":0.1897376090211801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132073,0.0001850125,0.000200894,0.00008694497,0.000162156,0.0003270749,0.00126333,0.00007366062,0.000004856915],"category_scores_gemma":[0.0006678925,0.0001430025,0.00005268632,0.0002412955,0.00005854556,0.0002839997,0.0003839126,0.0003119369,0.000008175066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003950682,"about_ca_system_score_gemma":0.00006474894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006134092,"about_ca_topic_score_gemma":3.840891e-8,"domain_scores_codex":[0.9985362,0.00001174963,0.0003264266,0.0004282193,0.0004747273,0.0002226496],"domain_scores_gemma":[0.9991184,0.00007641086,0.0003093169,0.0000958517,0.000283676,0.000116362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001856268,0.0004089832,0.06775259,0.0006870925,0.0005012836,0.0000702962,0.03043225,0.5243023,0.1053153,0.2622953,0.00236042,0.005688581],"study_design_scores_gemma":[0.0003139567,0.00006725419,0.003692623,0.0006063921,0.000008805446,0.0000210786,0.0003318003,0.9922652,0.002200295,0.0003139537,0.00001886972,0.0001598141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8955045,0.0001115355,0.08442745,0.01212872,0.001065936,0.0004597089,0.00001916458,0.001537177,0.004745851],"genre_scores_gemma":[0.8560405,0.000004225851,0.1435046,0.0003403588,0.00004857689,0.000008431319,0.000001906914,0.000009485329,0.00004189668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4679629,"threshold_uncertainty_score":0.583147,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hootan Nakhost","is_ca":true},{"name":"Martin Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09831838808852035,"gpt":0.3290259229691195,"spread":0.2307075348805991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904037,0.000153219,0.0001535515,0.000146458,0.0002643996,0.0004193477,0.0004043079,0.00007084158,0.000003187243],"category_scores_gemma":[0.0001477631,0.0001285011,0.00004305186,0.0001600024,0.00003816365,0.0003394999,0.0001776776,0.0002197986,5.389452e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000310603,"about_ca_system_score_gemma":0.00008246187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001675124,"about_ca_topic_score_gemma":9.544169e-7,"domain_scores_codex":[0.9987981,0.00001178735,0.0002554682,0.000376285,0.0003549729,0.0002034103],"domain_scores_gemma":[0.9990144,0.0001507171,0.0002113866,0.00007892738,0.000477683,0.00006687701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003076084,0.0002200028,0.02620688,0.0005651886,0.0004525901,0.00001225479,0.008854631,0.009981791,0.3883477,0.4859399,0.0006021031,0.07850939],"study_design_scores_gemma":[0.0005904081,0.0001374559,0.002186525,0.0005694808,0.00001453634,0.00003689469,0.0009185241,0.9242072,0.06565484,0.005501812,0.00002844715,0.000153844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9462004,0.0001543219,0.04511184,0.005353093,0.0006087107,0.0002779962,0.00003890436,0.0003713128,0.001883401],"genre_scores_gemma":[0.977208,0.00002337206,0.02241886,0.0001721468,0.00005926794,0.00001764211,0.00002109196,0.000008864596,0.00007082091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9142255,"threshold_uncertainty_score":0.5240123,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Richard Valenzano","is_ca":true},{"name":"Nathan Sturtevant","is_ca":false},{"name":"Jonathan Schaeffer","is_ca":true},{"name":"Fan Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06480995116400483,"gpt":0.3358001418296461,"spread":0.2709901906656412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447737,0.0001574152,0.0002380955,0.0001828789,0.0001603513,0.0001652785,0.0008306451,0.00007765606,0.000003076487],"category_scores_gemma":[0.0003693932,0.0001275043,0.00003522887,0.0001869068,0.00007786501,0.0003166503,0.0002657352,0.0001964316,0.000001869612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002039615,"about_ca_system_score_gemma":0.00007699154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001048859,"about_ca_topic_score_gemma":9.766615e-7,"domain_scores_codex":[0.9988725,0.00002585711,0.0003722866,0.0002931296,0.0002818003,0.0001543836],"domain_scores_gemma":[0.9987528,0.0002055359,0.0004112913,0.0001263953,0.0004479846,0.00005601558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003596841,0.0007936904,0.2349969,0.001254022,0.0003036262,9.401742e-7,0.03434873,0.01700181,0.2238046,0.4498713,0.002545362,0.03471933],"study_design_scores_gemma":[0.0004632418,0.0001455136,0.001960749,0.001354431,0.00001071578,0.00000181971,0.0002693145,0.9347807,0.05806549,0.002740717,0.00007860421,0.0001287225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9461471,0.0002783661,0.04015308,0.001350346,0.000399967,0.0001688496,0.00000574095,0.0002867715,0.01120973],"genre_scores_gemma":[0.98125,0.000004336226,0.01858996,0.00004196916,0.0000306033,0.0000101569,0.000003408535,0.000007402511,0.00006215616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9177788,"threshold_uncertainty_score":0.5199476,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Meghna Lowalekar","is_ca":false},{"name":"Pradeep Varakantham","is_ca":false},{"name":"S. K. Ghosh","is_ca":false},{"name":"Sanjay Dominik Jena","is_ca":true},{"name":"Patrick Jaillet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06569628425107436,"gpt":0.3493977974602436,"spread":0.2837015132091692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000518615,0.00007852031,0.000113572,0.000116448,0.0006421306,0.0005429026,0.0004993764,0.00007399082,0.000006137686],"category_scores_gemma":[0.0004346725,0.00006836237,0.00002368346,0.000067177,0.0001020968,0.0003393795,0.00004164374,0.0001706375,6.656326e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003902871,"about_ca_system_score_gemma":0.0000470082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007697236,"about_ca_topic_score_gemma":0.00003757307,"domain_scores_codex":[0.9991122,0.000007126154,0.0002484302,0.0001873475,0.0003148617,0.0001300537],"domain_scores_gemma":[0.9992214,0.0000340043,0.0003859585,0.00006619214,0.0002549171,0.00003746174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006055261,0.00006353835,0.7518892,0.00004812018,0.00003621268,0.000004272599,0.009618909,0.03245571,0.002813018,0.202712,0.00004891663,0.0002494912],"study_design_scores_gemma":[0.0003989034,0.00001933414,0.2298011,0.002723902,0.00001208451,0.000004333765,0.00896515,0.7565625,0.0003923786,0.0008774158,0.00008800285,0.0001548486],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726871,0.00003138738,0.00003428518,0.001582971,0.0003798915,0.000092322,0.000008191781,0.0001289136,0.02505491],"genre_scores_gemma":[0.998517,0.00002804921,0.001001087,0.00003134447,0.00006204623,0.00000525617,0.00000782957,0.000006085951,0.0003413281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7241068,"threshold_uncertainty_score":0.5235223,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alberto Rivas","is_ca":true},{"name":"Meghyn Bienvenu","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04851122598432915,"gpt":0.3237563792704445,"spread":0.2752451532861154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206988,0.0001220904,0.0002034809,0.0001464679,0.00006068984,0.0001294049,0.0006555608,0.000071194,0.000004953056],"category_scores_gemma":[0.0004367974,0.00009438441,0.00003141938,0.0001677386,0.00006340826,0.0004278766,0.0002232332,0.0002134202,0.00000135237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002401267,"about_ca_system_score_gemma":0.00005438537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001636006,"about_ca_topic_score_gemma":4.354323e-8,"domain_scores_codex":[0.9989963,0.00001677592,0.0002753645,0.0002596633,0.0003323459,0.0001195651],"domain_scores_gemma":[0.9990356,0.0001180305,0.0003519511,0.0001044151,0.0003543682,0.00003565465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001493354,0.0000521699,0.031129,0.0002875279,0.0001394942,9.813223e-7,0.004619812,0.0008489189,0.1710421,0.7817405,0.0000304671,0.009959681],"study_design_scores_gemma":[0.0001791934,0.00007237246,0.01933867,0.001764833,0.00001165634,0.00002077406,0.0006445673,0.8309528,0.1429022,0.003951269,0.00003147505,0.0001301938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9849765,0.00008124208,0.003655406,0.0007650179,0.0002266969,0.000136299,0.000004241529,0.0001337989,0.01002077],"genre_scores_gemma":[0.93325,0.00001093656,0.06660997,0.00007849689,0.00001089869,0.000007256181,5.584167e-7,0.000005792409,0.00002609368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8301039,"threshold_uncertainty_score":0.3848884,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Juergen Eckerle","is_ca":false},{"name":"Jingwei Chen","is_ca":false},{"name":"Nathan Sturtevant","is_ca":false},{"name":"Sandra Zilles","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08026908485261397,"gpt":0.3518153585259207,"spread":0.2715462736733067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004248448,0.0001039764,0.0001240576,0.0001358406,0.0003945531,0.0004525147,0.0009654836,0.00005936589,0.000003228135],"category_scores_gemma":[0.000336708,0.00008411024,0.00003892115,0.00006652839,0.00008268975,0.0002747735,0.0002049348,0.0001875471,0.000001655836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003288527,"about_ca_system_score_gemma":0.0000815609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003806394,"about_ca_topic_score_gemma":0.000001220498,"domain_scores_codex":[0.9990393,0.000006193514,0.0002188498,0.0002796119,0.0002924252,0.0001636498],"domain_scores_gemma":[0.9991783,0.00008229457,0.0001858062,0.0001241964,0.0003854309,0.0000439239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001248944,0.0002293534,0.04462207,0.0001204437,0.00006259129,0.000003474612,0.002394382,0.02156722,0.1092537,0.8189411,0.0003789612,0.0023018],"study_design_scores_gemma":[0.0002813863,0.00003866146,0.02312423,0.0006087492,0.000003244263,0.000009397041,0.0001598521,0.9621583,0.007668556,0.0058434,0.000007857084,0.00009637242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9814525,0.00001778485,0.01265529,0.002873622,0.0003778855,0.0001247545,0.00001461084,0.0001260814,0.002357529],"genre_scores_gemma":[0.9915617,0.000008026323,0.008223398,0.00007746697,0.00002981124,0.00001976367,0.000002854121,0.000005271111,0.00007174898],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9405911,"threshold_uncertainty_score":0.4363609,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jiaoyang Li","is_ca":false},{"name":"Zhe Chen","is_ca":false},{"name":"Yi Zheng","is_ca":false},{"name":"Shao-Hung Chan","is_ca":false},{"name":"Daniel Harabor","is_ca":false},{"name":"Peter J. Stuckey","is_ca":false},{"name":"Hang Ma","is_ca":true},{"name":"Sven Koenig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02591758923968751,"gpt":0.2511828116355023,"spread":0.2252652223958148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382186,0.0001986271,0.0002220986,0.00007061094,0.0002548542,0.000285998,0.0003132951,0.0001024432,0.00001308205],"category_scores_gemma":[0.000174094,0.0001368554,0.00004376313,0.0001721825,0.00007455957,0.0001659148,0.0001291726,0.0003438722,0.000001398667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002480263,"about_ca_system_score_gemma":0.000030131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001117042,"about_ca_topic_score_gemma":5.83796e-7,"domain_scores_codex":[0.9988198,0.000009684366,0.0003231833,0.0002801394,0.0003324393,0.0002348105],"domain_scores_gemma":[0.9994016,0.00009401662,0.0001346205,0.00009773963,0.000208369,0.00006369296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002056142,0.0001198593,0.1876523,0.001045147,0.0009812032,0.0001028664,0.0236004,0.45797,0.245684,0.07246553,0.006966949,0.003206099],"study_design_scores_gemma":[0.0003529586,0.00003551831,0.00878494,0.001624839,0.00002240112,0.0001524965,0.003386586,0.977812,0.006346699,0.0003533284,0.0008995116,0.000228734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9704375,0.001605492,0.00006273169,0.001542093,0.0004562552,0.00007133053,0.000005078355,0.0003204172,0.02549911],"genre_scores_gemma":[0.9988547,0.00008731157,0.0005513473,0.0000650068,0.0001240601,0.000009637234,0.00000417816,0.00002244483,0.0002813113],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.519842,"threshold_uncertainty_score":0.5580803,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alberto Rivas","is_ca":true},{"name":"Christian Muise","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06966296944873947,"gpt":0.2992959930767713,"spread":0.2296330236280319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820956,0.0002875962,0.000312358,0.0002503904,0.0003360081,0.0005884289,0.001549892,0.000115703,0.00001267516],"category_scores_gemma":[0.0004674568,0.000189915,0.00006860689,0.0002707136,0.0000850943,0.0004345234,0.0004005723,0.0002873723,0.00001020888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009120654,"about_ca_system_score_gemma":0.00008486884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001399933,"about_ca_topic_score_gemma":8.884126e-7,"domain_scores_codex":[0.9980055,0.00002581922,0.0004012027,0.000551503,0.0006050371,0.0004109524],"domain_scores_gemma":[0.9983884,0.0005197641,0.0004106487,0.000175577,0.0003452069,0.0001604647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004690023,0.0002592992,0.3739962,0.0002597327,0.0006744727,0.00002889539,0.02742135,0.1722432,0.1992484,0.2083191,0.01041528,0.00666507],"study_design_scores_gemma":[0.00066485,0.000156348,0.02121367,0.005553722,0.00002322902,0.00003390291,0.001008706,0.9397348,0.02428031,0.006665633,0.0001878522,0.0004769506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9631098,0.00007256043,0.02280678,0.008585292,0.0004878848,0.0002031862,0.00003430344,0.0006445836,0.004055617],"genre_scores_gemma":[0.9798717,0.000002012325,0.01948644,0.0003272793,0.0001133782,0.000005877075,0.000004137529,0.00001752887,0.0001716415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7674916,"threshold_uncertainty_score":0.7744508,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Kyle E. C. Booth","is_ca":true},{"name":"N. Minh","is_ca":false},{"name":"J. Christopher Beck","is_ca":true},{"name":"Eleanor Rieffel","is_ca":false},{"name":"Davide Venturelli","is_ca":false},{"name":"Jeremy Frank","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08699356612568282,"gpt":0.3177409570303168,"spread":0.230747390904634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000648845,0.0002809593,0.0003432203,0.0002465472,0.0003259754,0.001016754,0.0004710217,0.000185355,0.00000215708],"category_scores_gemma":[0.0002792666,0.0002431416,0.00005416982,0.00009853314,0.0002209702,0.0003062404,0.0005899873,0.0004609528,1.95285e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005007519,"about_ca_system_score_gemma":0.0001015904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002079198,"about_ca_topic_score_gemma":0.000001509458,"domain_scores_codex":[0.998388,0.00001582242,0.0005053725,0.0005660334,0.0003149632,0.0002098021],"domain_scores_gemma":[0.9983487,0.0001499868,0.0007347405,0.00009812651,0.0005880761,0.00008037312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001532025,0.00007327478,0.4865975,0.001059686,0.0003851902,0.000002761876,0.01300832,0.007120909,0.0067034,0.4663975,0.0001591636,0.01833908],"study_design_scores_gemma":[0.0003877494,0.00006677509,0.0123001,0.00296191,0.00002392379,0.00004227124,0.001265339,0.9753224,0.000530701,0.006828783,0.00002275148,0.0002473598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8692251,0.0001243405,0.1262408,0.001242866,0.0006891085,0.0006050503,0.00002580729,0.0004713812,0.001375536],"genre_scores_gemma":[0.9394303,0.00001204523,0.06035141,0.00005947768,0.00006723905,0.00002978887,0.00002548178,0.00001343168,0.00001080022],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9682014,"threshold_uncertainty_score":0.9915028,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Christian Muise","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true},{"name":"Vaishak Belle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01810893520969025,"gpt":0.2621770235230653,"spread":0.2440680883133751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004282925,0.000203939,0.000212287,0.0001572567,0.0002654407,0.0003444033,0.000871462,0.00008022122,0.000003087376],"category_scores_gemma":[0.000199483,0.000145605,0.00004008196,0.0001646578,0.00008643565,0.0002965696,0.0001665117,0.0003096452,0.000004483187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002335614,"about_ca_system_score_gemma":0.00006318043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006387419,"about_ca_topic_score_gemma":9.942698e-8,"domain_scores_codex":[0.9986599,0.00001278238,0.0002507874,0.0003657457,0.0004764714,0.00023432],"domain_scores_gemma":[0.9989428,0.0002802668,0.0003193428,0.0001069161,0.0002692536,0.00008145762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003762891,0.0001813874,0.1706364,0.0007155162,0.0004332692,0.00003942277,0.006935953,0.05713987,0.06584394,0.6922817,0.001431604,0.003984716],"study_design_scores_gemma":[0.0005020753,0.0002308365,0.01306224,0.002155002,0.0000151226,0.00006756576,0.0001052282,0.9692958,0.008410775,0.005883376,0.00005617485,0.0002158076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9432272,0.00003368595,0.04112561,0.00140257,0.0003587972,0.0001666477,0.000005619062,0.0004822206,0.0131977],"genre_scores_gemma":[0.9813914,9.883356e-7,0.01813123,0.0003068482,0.00006155248,0.00001415021,0.000006319907,0.00001173075,0.0000758325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9121559,"threshold_uncertainty_score":0.59376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Richard Valenzano","is_ca":true},{"name":"Shahab Jabbari Arfaee","is_ca":true},{"name":"Jordan Thayer","is_ca":false},{"name":"Roni Stern","is_ca":false},{"name":"Nathan Sturtevant","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0787746973012493,"gpt":0.3266742291369478,"spread":0.2478995318356985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874412,0.0001034264,0.0001169241,0.0001784538,0.00009371468,0.0003566995,0.000490486,0.00004732997,0.00002741761],"category_scores_gemma":[0.0001337982,0.0000841885,0.00002652097,0.0002099878,0.00006691858,0.0004935691,0.0001678809,0.0002051414,0.000003273328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006140693,"about_ca_system_score_gemma":0.00005773113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001736518,"about_ca_topic_score_gemma":0.00000120386,"domain_scores_codex":[0.9990484,0.00001307514,0.0002451078,0.0002346216,0.0003138908,0.0001449775],"domain_scores_gemma":[0.9993209,0.00005407345,0.0001518013,0.00006322659,0.0003674468,0.00004256878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006409311,0.0001546293,0.3459557,0.0001062773,0.0001197972,0.000005604652,0.006096867,0.1497634,0.07484358,0.4158812,0.0001228347,0.006886086],"study_design_scores_gemma":[0.0001966779,0.00001640957,0.03798667,0.0002578131,0.00000199498,0.00001463918,0.0003090005,0.9554708,0.003096289,0.002562196,0.00000193978,0.00008556988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9832327,0.00001061025,0.01059161,0.001407491,0.0002063844,0.0001331912,0.000002018326,0.0001205319,0.004295411],"genre_scores_gemma":[0.9782059,0.000006044833,0.02163702,0.00008654541,0.00001611648,0.000005567767,9.215963e-7,0.00000437966,0.00003745682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8057074,"threshold_uncertainty_score":0.3439662,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Fan Xie","is_ca":true},{"name":"Hootan Nakhost","is_ca":true},{"name":"Martin Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04381493788673569,"gpt":0.2965092356913033,"spread":0.2526942978045676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009178023,0.0002187286,0.0002412728,0.0001964642,0.0003013,0.0002921469,0.001137024,0.0001209863,0.00001224937],"category_scores_gemma":[0.0001366299,0.0001677519,0.00007159213,0.0002370576,0.00009884798,0.0006244498,0.0003671745,0.0004805618,0.00001080731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005081271,"about_ca_system_score_gemma":0.00006258833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002671663,"about_ca_topic_score_gemma":1.107034e-7,"domain_scores_codex":[0.9982687,0.00002600055,0.0003504358,0.0003240023,0.0006059749,0.0004248984],"domain_scores_gemma":[0.9989746,0.0002063559,0.0002517116,0.0001214596,0.0003008097,0.0001451238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007502342,0.0003668234,0.4587279,0.0004211039,0.0006532734,0.00002113928,0.03661984,0.1485933,0.129714,0.2006471,0.002323037,0.0211622],"study_design_scores_gemma":[0.0005753291,0.0000577359,0.005201031,0.0009789307,0.00001215527,0.00006231426,0.0005686302,0.9779062,0.01369969,0.0006433421,0.00007899557,0.0002155998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9090116,0.0003138048,0.07933044,0.001790728,0.0007156556,0.0001783865,0.000005828399,0.0006185453,0.008034989],"genre_scores_gemma":[0.9827798,0.000005761039,0.01679641,0.0001993287,0.0001054394,0.000008970034,0.000004241547,0.0000136647,0.00008635598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8293129,"threshold_uncertainty_score":0.6840724,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Chiara Piacentini","is_ca":true},{"name":"Margarita P. Castro","is_ca":true},{"name":"André A. Ciré","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06534018288188553,"gpt":0.3491098881143062,"spread":0.2837697052324206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815604,0.0001862766,0.0001933176,0.0002336674,0.00025385,0.0003469465,0.001322583,0.00008098199,0.000005408685],"category_scores_gemma":[0.0005778683,0.0001499904,0.00004696989,0.0004143389,0.0001082641,0.0004397073,0.0004429268,0.0002856196,0.00001183235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000480169,"about_ca_system_score_gemma":0.00004962881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008767527,"about_ca_topic_score_gemma":1.152855e-7,"domain_scores_codex":[0.9984666,0.00001717306,0.0003788784,0.0004086116,0.0004622086,0.0002665059],"domain_scores_gemma":[0.9987142,0.00006671661,0.0003148544,0.000144934,0.0006665848,0.00009270423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006487271,0.0002981789,0.0407582,0.0002563714,0.0003865258,0.000009373552,0.03168927,0.04263869,0.2480433,0.5894772,0.0007709637,0.04502315],"study_design_scores_gemma":[0.000162112,0.0001599664,0.002427873,0.0008310353,0.000006402113,0.00002567594,0.0007774992,0.9482169,0.04662629,0.0003399355,0.0002521163,0.0001741645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8236452,0.00002064518,0.1714203,0.000764758,0.0008147702,0.0001856165,0.000002130985,0.0004946309,0.00265199],"genre_scores_gemma":[0.6067554,8.374137e-7,0.3929944,0.0001220265,0.00007923332,0.00001059758,0.000001018905,0.000008100968,0.00002835107],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9055783,"threshold_uncertainty_score":0.6116431,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Éric Beaudry","is_ca":true},{"name":"Froduald Kabanza","is_ca":true},{"name":"François Michaud","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07556528448785273,"gpt":0.3406418268058319,"spread":0.2650765423179792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766551,0.0002100246,0.0001821019,0.0001830814,0.0005328368,0.0004792993,0.0005533936,0.0001852388,0.000004586188],"category_scores_gemma":[0.0001718231,0.0001778869,0.00006905832,0.0002307121,0.00006480028,0.0005000495,0.0001054479,0.0005262995,4.319012e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007830215,"about_ca_system_score_gemma":0.0001182545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003361311,"about_ca_topic_score_gemma":0.000004292712,"domain_scores_codex":[0.9986009,0.00001712389,0.0004063555,0.000396785,0.0003178362,0.0002610099],"domain_scores_gemma":[0.9985807,0.0001663333,0.000501049,0.00009959594,0.0005713113,0.00008099839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008656145,0.0000568872,0.00356584,0.00007475096,0.0001083714,9.274159e-7,0.0007518172,0.5196881,0.3711275,0.1018115,0.0001635548,0.002564128],"study_design_scores_gemma":[0.0003665633,0.00005792575,0.001034021,0.000576561,0.00002390377,0.00002974722,0.000314608,0.9871123,0.008883289,0.0013479,0.00005410924,0.0001990194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5770373,0.00002482368,0.4201653,0.0008011301,0.001322261,0.0001830181,0.000007005094,0.0002932851,0.0001658765],"genre_scores_gemma":[0.9675068,0.000006042095,0.03212798,0.0001127574,0.0001476641,0.00002079104,0.00002950713,0.00001369327,0.00003480808],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4674242,"threshold_uncertainty_score":0.7254016,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jorge A. Baier","is_ca":true},{"name":"Adi Botea","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04285857452177985,"gpt":0.2841194638274261,"spread":0.2412608893056462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006407453,0.0002722813,0.0002632632,0.0002536894,0.0004200127,0.0004823581,0.00127672,0.0001400479,0.000004140451],"category_scores_gemma":[0.0001935336,0.0002216562,0.00006870811,0.0002887844,0.00005800109,0.0006948034,0.000202766,0.0005169357,0.000002668869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006113448,"about_ca_system_score_gemma":0.0001045433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001898914,"about_ca_topic_score_gemma":9.009253e-8,"domain_scores_codex":[0.9981476,0.00001435416,0.000455824,0.0004757666,0.0005340535,0.0003723754],"domain_scores_gemma":[0.9988309,0.00009949333,0.0005162562,0.0001548539,0.0003005375,0.00009800033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004761668,0.0002227539,0.152047,0.0004460452,0.0002679887,0.0000378414,0.01512963,0.1734903,0.5447339,0.094397,0.0005551073,0.01819618],"study_design_scores_gemma":[0.0003594668,0.0001097546,0.007470587,0.002179445,0.00001292192,0.00006909668,0.0002591874,0.9694668,0.01935232,0.0004313366,0.00002381354,0.0002652568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9885353,0.0001134733,0.005087791,0.0008524143,0.0003756628,0.0001310316,0.00000593768,0.0005687815,0.004329566],"genre_scores_gemma":[0.97508,0.000008066179,0.02441864,0.0003272225,0.00007374035,0.000003341476,0.000003540602,0.00001245243,0.00007303376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7959765,"threshold_uncertainty_score":0.9038877,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jiachen Zhang","is_ca":true},{"name":"Giovanni Lo Bianco","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03320539759888821,"gpt":0.2629384316561554,"spread":0.2297330340572672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000421345,0.0001692853,0.0001747652,0.0001931231,0.0005055694,0.000396159,0.0007929693,0.00004172834,0.00007526744],"category_scores_gemma":[0.0001155388,0.0001366209,0.00005085056,0.0003469278,0.0000633426,0.0003373446,0.0002765616,0.0003539373,0.000001340097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008473775,"about_ca_system_score_gemma":0.0001651487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001418265,"about_ca_topic_score_gemma":0.0000015947,"domain_scores_codex":[0.9984658,0.00001907037,0.000297406,0.0003656221,0.0006593977,0.0001927209],"domain_scores_gemma":[0.9990401,0.00006403613,0.0003660115,0.00009984212,0.0003715072,0.00005854239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002595041,0.0001264421,0.05987354,0.0001239991,0.000175578,0.000008493125,0.003237605,0.712589,0.02923082,0.1903711,0.0002619213,0.003742016],"study_design_scores_gemma":[0.0006476158,0.000084208,0.002039155,0.0003961215,0.00001024001,0.00003674341,0.0007742454,0.9927581,0.002504056,0.0004394664,0.00013001,0.0001800283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9210992,0.0000838042,0.05200675,0.009292482,0.000906473,0.0005027723,0.00002098734,0.001134902,0.01495256],"genre_scores_gemma":[0.9623804,0.000004526644,0.03717582,0.0002453243,0.00003159081,0.0000310652,0.000005518325,0.00001191252,0.0001138289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2801691,"threshold_uncertainty_score":0.5571238,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Doron Nussbaum","is_ca":false},{"name":"Alper Yörükçü","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05787516853285699,"gpt":0.2929854708873217,"spread":0.2351103023544647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352242,0.000163331,0.0001733977,0.0001890265,0.0001259001,0.0003480153,0.001157908,0.00006484289,0.00000205407],"category_scores_gemma":[0.0001872516,0.0001131039,0.00003061816,0.0002884549,0.00008770403,0.0004164205,0.0002849262,0.0003032801,0.000003811834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004056732,"about_ca_system_score_gemma":0.0001408313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002701726,"about_ca_topic_score_gemma":9.424402e-8,"domain_scores_codex":[0.9984374,0.00001274231,0.0002251577,0.0003382319,0.000746244,0.0002401973],"domain_scores_gemma":[0.9989035,0.00006060495,0.0001889548,0.0001155679,0.0006086823,0.0001227069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003237955,0.0002069956,0.2844292,0.0001306264,0.0003746761,0.00005576919,0.0155811,0.1379566,0.0235131,0.5341228,0.001201163,0.002104104],"study_design_scores_gemma":[0.0003977463,0.0001223769,0.004827017,0.0005471423,0.000005512458,0.00008438993,0.000785837,0.984618,0.00576908,0.002672659,0.00001401361,0.0001561961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9730144,0.00007901622,0.01383009,0.002174527,0.0004143983,0.0001402712,0.000004688808,0.0005783904,0.009764289],"genre_scores_gemma":[0.8362729,0.000001745659,0.1635126,0.00007595158,0.00002681233,0.000004985699,0.0000016471,0.000008500493,0.00009489476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8466614,"threshold_uncertainty_score":0.4612242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maliheh Aramon Bajestani","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04964498439739254,"gpt":0.2694260334571725,"spread":0.2197810490597799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003200836,0.0002075818,0.0001898428,0.0001771935,0.0001297381,0.0001065797,0.0004626233,0.0001256361,0.00005967284],"category_scores_gemma":[0.0001377971,0.0001733075,0.00007040604,0.0001798099,0.00007065884,0.0003185974,0.00007069742,0.0003183216,0.00000643468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003249082,"about_ca_system_score_gemma":0.00002622408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009439912,"about_ca_topic_score_gemma":4.606658e-7,"domain_scores_codex":[0.9988489,0.000006827923,0.0003467258,0.0002654215,0.0003183357,0.0002137832],"domain_scores_gemma":[0.9993261,0.00002734747,0.0001243416,0.0001072464,0.0003154264,0.00009954553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004979896,0.0004977089,0.1191612,0.0005973656,0.001215211,0.00002140386,0.02395103,0.6334053,0.08388717,0.1311355,0.0005375395,0.00509251],"study_design_scores_gemma":[0.0002497997,0.00004926993,0.002253279,0.0004301322,0.00002047663,0.00001967629,0.001730282,0.9796985,0.01477833,0.0005531196,0.00001208648,0.0002049843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9763944,0.00009048735,0.001059668,0.0001059747,0.0006183835,0.0001051448,0.000007621754,0.001941152,0.01967722],"genre_scores_gemma":[0.8924217,0.00002461194,0.107314,0.00006598893,0.00007105775,0.000009637894,0.000005236277,0.0000295619,0.00005816178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3462932,"threshold_uncertainty_score":0.7067277,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Christian Muise","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03352342834652276,"gpt":0.2690857539899184,"spread":0.2355623256433956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005740006,0.0001884053,0.000172633,0.000125006,0.0002322845,0.0002958695,0.0008087458,0.00008375174,0.000009593882],"category_scores_gemma":[0.000136273,0.0001308327,0.00003374757,0.0002240465,0.00006053539,0.0006227318,0.0002013906,0.000325592,0.000005701035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002773129,"about_ca_system_score_gemma":0.00006645659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001464122,"about_ca_topic_score_gemma":2.980223e-7,"domain_scores_codex":[0.9986793,0.00001203124,0.0002594999,0.0002761307,0.0004460709,0.0003268982],"domain_scores_gemma":[0.9991172,0.0001045135,0.000287169,0.0001069131,0.0002825536,0.0001016318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003183284,0.0001951788,0.4195167,0.0001915105,0.0003745145,0.00001029442,0.01273852,0.02801088,0.03566195,0.4993568,0.001025953,0.00259934],"study_design_scores_gemma":[0.0004390985,0.0001254815,0.009351161,0.001509419,0.00002102254,0.0001110311,0.000580235,0.974865,0.0118419,0.0005710142,0.0002712342,0.0003134683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.967544,0.0001312508,0.0116612,0.002609369,0.0004263421,0.0001355326,0.000007226659,0.0005888224,0.01689632],"genre_scores_gemma":[0.9403245,0.000006290812,0.05928051,0.0001861629,0.0000645637,0.00000875469,0.00000299608,0.00001176681,0.0001144227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9468541,"threshold_uncertainty_score":0.5335204,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ryo Kuroiwa","is_ca":true},{"name":"Alexander Shleyfman","is_ca":true},{"name":"Chiara Piacentini","is_ca":true},{"name":"Margarita P. Castro","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0314566558341207,"gpt":0.2930029595744092,"spread":0.2615463037402885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324181,0.0001788238,0.0002066602,0.0000959177,0.0004309546,0.0005981335,0.0004310255,0.00007114715,0.000004903727],"category_scores_gemma":[0.0003057976,0.0001423214,0.00003286158,0.0001887793,0.00007193808,0.0003274327,0.0001790137,0.0002378386,6.003897e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002219552,"about_ca_system_score_gemma":0.0001430882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000750013,"about_ca_topic_score_gemma":3.528751e-7,"domain_scores_codex":[0.9988149,0.00001022033,0.000267738,0.0003786205,0.0002956005,0.0002329527],"domain_scores_gemma":[0.9986924,0.000245339,0.000257905,0.00008392642,0.0006473816,0.00007302671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004471777,0.0002529343,0.2312562,0.0009516104,0.0008951007,0.00008321641,0.01432514,0.1441718,0.1282424,0.4733644,0.003796403,0.002213578],"study_design_scores_gemma":[0.0004835716,0.0001082093,0.001988013,0.001154345,0.0000242496,0.0001200713,0.001122971,0.9814958,0.01204132,0.001059737,0.0001864997,0.0002152294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9699812,0.0001626929,0.02632555,0.001501469,0.0001783091,0.000143968,0.00004381005,0.0002745134,0.001388511],"genre_scores_gemma":[0.9389012,0.000006510352,0.06068641,0.0002377228,0.00004530555,0.00001710293,0.00002086539,0.00001285662,0.00007199252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.837324,"threshold_uncertainty_score":0.5803698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Thayne T. Walker","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Ariel Felner","is_ca":false},{"name":"Han Zhang","is_ca":false},{"name":"Jiaoyang Li","is_ca":false},{"name":"Tushar Kumar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1842602792115214,"gpt":0.4146299869876681,"spread":0.2303697077761467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164636,0.0001058978,0.0001603388,0.0001411306,0.0002785031,0.0004336473,0.0006177049,0.00006619039,0.0001740882],"category_scores_gemma":[0.002223083,0.00007615417,0.00006130671,0.0003942429,0.0001379121,0.0001638844,0.0001490814,0.0002342018,0.00002125429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002475307,"about_ca_system_score_gemma":0.0001270604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008815376,"about_ca_topic_score_gemma":3.691241e-7,"domain_scores_codex":[0.9983069,0.00003870541,0.0003786226,0.0003238874,0.0008155741,0.0001363112],"domain_scores_gemma":[0.9976973,0.0005640275,0.0002592909,0.0001224233,0.00128789,0.00006904696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003375132,0.0001725394,0.07555837,0.00003027195,0.0001013602,0.000005106889,0.001748958,0.01377361,0.3345176,0.5656536,0.001140829,0.006960203],"study_design_scores_gemma":[0.0004594128,0.00002543148,0.01497466,0.0004341193,0.00001374921,0.00005746181,0.005066553,0.7886242,0.1779045,0.01072897,0.001540331,0.0001706002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9739712,0.00003238393,0.0007354454,0.004519347,0.0001746848,0.00009174079,0.00001885722,0.0001169166,0.02033935],"genre_scores_gemma":[0.9966925,0.000004339875,0.002372296,0.0003643483,0.00004264642,0.000009346676,0.000004825279,0.000006696687,0.0005029672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7748507,"threshold_uncertainty_score":0.4181671,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hang Ma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07027185868418233,"gpt":0.3332760815046675,"spread":0.2630042228204852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002566311,0.00009496287,0.0002014303,0.0002444385,0.00008105976,0.0001440856,0.0005305733,0.0000432223,0.00001961333],"category_scores_gemma":[0.0002554053,0.00007550433,0.00007759492,0.0006254719,0.00004552111,0.0001689319,0.0002693019,0.0001505665,6.131691e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000228389,"about_ca_system_score_gemma":0.00008027847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009105514,"about_ca_topic_score_gemma":0.000002219604,"domain_scores_codex":[0.9989779,0.00001422734,0.0002824555,0.0002415167,0.0003667231,0.0001171616],"domain_scores_gemma":[0.9987339,0.00007160089,0.0002654642,0.00008092608,0.0008033896,0.00004471336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002716409,0.0003193065,0.03540531,0.00007452363,0.001019621,0.000006452829,0.004549291,0.05518596,0.06804567,0.83436,0.00004375473,0.0009629322],"study_design_scores_gemma":[0.0002347104,0.00002335888,0.01510295,0.0003776548,0.00003741808,0.000004171379,0.0009349838,0.9743316,0.008678954,0.0001722665,0.00002525413,0.00007671682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726479,0.00008221694,0.01825986,0.002282536,0.0002298295,0.0001151121,0.00005172368,0.0001964468,0.006134363],"genre_scores_gemma":[0.9367898,0.00003054716,0.06293061,0.0001148378,0.000007353411,0.000002437987,0.00001414909,0.000003643161,0.0001066777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9191456,"threshold_uncertainty_score":0.3078977,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Christian Fritz","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03130224310975049,"gpt":0.2745356781969923,"spread":0.2432334350872418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964279,0.000170487,0.0002148248,0.0002116839,0.0001568547,0.0003105331,0.0009963159,0.00008934992,0.000002795238],"category_scores_gemma":[0.0001695072,0.0001373332,0.00004309351,0.0002552808,0.00003921567,0.0002788142,0.0001410711,0.0003696967,0.000002014321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003745842,"about_ca_system_score_gemma":0.00005145781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002098889,"about_ca_topic_score_gemma":8.85996e-7,"domain_scores_codex":[0.9986802,0.00001353546,0.0003577091,0.0003360972,0.0003550891,0.0002573583],"domain_scores_gemma":[0.9992726,0.0001167644,0.0002828574,0.00009071923,0.0001807193,0.00005634197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001995925,0.0002646027,0.2192019,0.0001089263,0.0001166402,0.00004610317,0.01240815,0.116619,0.05212204,0.5847551,0.00106612,0.01309185],"study_design_scores_gemma":[0.000418925,0.00009149627,0.02196521,0.001336797,0.000004193263,0.00003861603,0.0003864327,0.9693604,0.002927718,0.00327019,0.00002423553,0.0001757837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9783658,0.00006256727,0.005117356,0.003543457,0.0002608009,0.0001166551,0.00000487336,0.0004101451,0.01211835],"genre_scores_gemma":[0.9762074,0.000005068586,0.02333125,0.0003625153,0.00003697919,0.000001606275,0.000002528097,0.000005691998,0.00004693799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8527414,"threshold_uncertainty_score":0.5600284,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Levi H. S. Lelis","is_ca":true},{"name":"Roni Stern","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Sandra Zilles","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05816263018726656,"gpt":0.2944029400724816,"spread":0.236240309885215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279057,0.0001680126,0.0001460729,0.0001367717,0.0003400873,0.0002994593,0.0005382362,0.00008015207,0.000006675626],"category_scores_gemma":[0.0001380678,0.0001241072,0.00003543644,0.00020344,0.00005768155,0.0006775868,0.0001439653,0.0003243996,0.000002166744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004560096,"about_ca_system_score_gemma":0.00007303571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002431578,"about_ca_topic_score_gemma":4.793974e-7,"domain_scores_codex":[0.9987109,0.00001202992,0.0002599909,0.0002636055,0.0004612454,0.000292205],"domain_scores_gemma":[0.999097,0.0001254513,0.0003126167,0.00007544458,0.0002997555,0.00008969694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003406332,0.0002065036,0.6698173,0.0001578408,0.0003441584,0.000002438134,0.008053921,0.05499247,0.08512664,0.1759887,0.0003939586,0.004575372],"study_design_scores_gemma":[0.0003528006,0.0000746789,0.01478573,0.0009561003,0.00001434512,0.00007435754,0.0004634496,0.9703677,0.01245209,0.0002176399,0.00005387239,0.0001872619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9706721,0.00008378593,0.02255084,0.000979088,0.0004361413,0.0001413062,0.000007532306,0.0004898534,0.004639351],"genre_scores_gemma":[0.9483418,0.000003454983,0.05139448,0.00007208665,0.0001044135,0.0000132682,0.000005197986,0.000009367716,0.00005595068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9153752,"threshold_uncertainty_score":0.5060947,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sofia Lemons","is_ca":false},{"name":"Carlos Linares López","is_ca":false},{"name":"Robert C. Holte","is_ca":true},{"name":"Wheeler Ruml","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06016796766122735,"gpt":0.3081002708569113,"spread":0.2479323031956839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006121223,0.00009346368,0.0001122538,0.0001863369,0.0002777945,0.0003050559,0.0008973821,0.00002460985,0.00003916123],"category_scores_gemma":[0.000153388,0.00007610048,0.00002271546,0.0002188386,0.00006108979,0.0002015297,0.0009796747,0.0003091067,0.000001533008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003318823,"about_ca_system_score_gemma":0.00006269188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008782685,"about_ca_topic_score_gemma":4.602064e-8,"domain_scores_codex":[0.9987167,0.00001761047,0.0001928159,0.0002744462,0.0006436555,0.0001548329],"domain_scores_gemma":[0.9994069,0.00007575258,0.0001199579,0.00008412517,0.0002548019,0.00005840729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002628519,0.0003414452,0.03353148,0.00022258,0.0004050356,0.00002137894,0.0134757,0.1151995,0.07383852,0.7427279,0.001697675,0.01827594],"study_design_scores_gemma":[0.0002170614,0.00005988667,0.001662506,0.00006015415,0.000002841241,0.00003689149,0.0005269446,0.9932662,0.003137978,0.0008635749,0.00008480182,0.00008116001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806648,0.00009076447,0.005484942,0.004722849,0.0003046357,0.0002068198,0.00001190044,0.0002470862,0.008266208],"genre_scores_gemma":[0.9814885,0.00001471593,0.0179769,0.000151999,0.00001435809,0.00001652245,0.000001369617,0.000006338305,0.0003292756],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8780667,"threshold_uncertainty_score":0.3103288,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luigi Bonassi","is_ca":false},{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Marco Favorito","is_ca":false},{"name":"Francesco Fuggitti","is_ca":true},{"name":"Alfonso Gerevini","is_ca":false},{"name":"Enrico Scala","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06726799504584709,"gpt":0.3303011297034665,"spread":0.2630331346576195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000830644,0.0001990606,0.0002564256,0.0003291408,0.00016505,0.0002667571,0.001123401,0.0001170798,0.000003450258],"category_scores_gemma":[0.0004450117,0.0001500212,0.00007452283,0.0004309304,0.00005907176,0.0003345393,0.0002998639,0.0002528259,0.000007220753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003924378,"about_ca_system_score_gemma":0.00008094135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000982372,"about_ca_topic_score_gemma":9.255496e-7,"domain_scores_codex":[0.9984954,0.00001215257,0.0003951009,0.0004290719,0.0003562437,0.0003120138],"domain_scores_gemma":[0.9990024,0.0001512882,0.0003198153,0.000103422,0.000356939,0.00006614791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003173998,0.0002233918,0.2514802,0.0003181341,0.0001755192,0.00003534138,0.009053939,0.01014934,0.03728925,0.6855271,0.003168267,0.002262184],"study_design_scores_gemma":[0.000613189,0.0001196532,0.01783423,0.0008440433,0.000005655933,0.00001631498,0.0007163296,0.9586408,0.003108965,0.01776445,0.0001246183,0.0002118135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9847578,0.0001019384,0.002880274,0.002574406,0.0006012968,0.0003357073,0.00001047128,0.0008373077,0.007900796],"genre_scores_gemma":[0.9869102,0.000007067542,0.01251718,0.0001320189,0.00009456112,0.0000359023,0.00001064829,0.00001252984,0.0002798878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9484914,"threshold_uncertainty_score":0.6117687,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeremy Frank","is_ca":false},{"name":"N. Minh","is_ca":false},{"name":"Tony Tran","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05770532082623864,"gpt":0.2902512425959926,"spread":0.2325459217697539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003007062,0.0001276134,0.0001244381,0.0001466414,0.0002057012,0.0001979887,0.0005009688,0.00006594593,0.000007370869],"category_scores_gemma":[0.0004296559,0.00008682997,0.00005388384,0.0001675087,0.00006469554,0.0005408392,0.0001076186,0.00008710472,0.000001792474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004418162,"about_ca_system_score_gemma":0.00008394776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000265976,"about_ca_topic_score_gemma":4.738127e-7,"domain_scores_codex":[0.9989913,0.000007074672,0.0003018905,0.0002838003,0.0002620072,0.0001538968],"domain_scores_gemma":[0.9987198,0.0002089214,0.0002854321,0.00007921993,0.0006544477,0.00005214845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009391738,0.00005192143,0.04025753,0.00005309244,0.0001019194,6.419475e-7,0.000968627,0.005045245,0.08338914,0.8588503,0.0003145772,0.01087309],"study_design_scores_gemma":[0.0005664651,0.00005392432,0.01927889,0.000605114,0.00001015992,0.00001360387,0.0002684793,0.9652285,0.00646564,0.007073537,0.0002765309,0.0001591388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8288397,0.00004995416,0.1416148,0.02553411,0.0006506587,0.0004095177,0.00004110482,0.0006228695,0.002237238],"genre_scores_gemma":[0.9145139,0.0000303325,0.08489002,0.0002525657,0.00003456222,0.00001474541,0.000005126268,0.000007892233,0.0002508323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9601833,"threshold_uncertainty_score":0.3540823,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jesse Hoey","is_ca":true},{"name":"Marek Grześ","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0298389820466585,"gpt":0.2599037297562931,"spread":0.2300647477096346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003651433,0.0001299958,0.0001945929,0.0001138923,0.00006089384,0.00008872887,0.0008031152,0.00005948892,0.000006796332],"category_scores_gemma":[0.0001460052,0.0000939373,0.00002812886,0.0002472273,0.00006868883,0.0002544033,0.0001256062,0.0002207078,8.366731e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003204012,"about_ca_system_score_gemma":0.00004493906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001630684,"about_ca_topic_score_gemma":0.000001034478,"domain_scores_codex":[0.9988818,0.00001032187,0.0003241741,0.0002206547,0.0003779815,0.0001850591],"domain_scores_gemma":[0.9990369,0.00005212491,0.0004300161,0.0001000255,0.0003444144,0.00003652014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003884929,0.0001463065,0.477123,0.00009474195,0.0001813246,0.0000104392,0.00353941,0.05393176,0.01863169,0.4458118,0.00003369299,0.0001073286],"study_design_scores_gemma":[0.0008631716,0.0001012455,0.06763539,0.0007248343,0.000008366619,0.000007713636,0.0003151753,0.9241989,0.00560764,0.0004248504,0.000006432083,0.0001062377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8340549,0.00001725816,0.1611482,0.0002748168,0.00009493108,0.0001360342,0.00001267018,0.0001476917,0.004113434],"genre_scores_gemma":[0.9895632,0.000003875466,0.01033329,0.00005210815,0.000005701922,0.000005823756,0.000003225396,0.000006105443,0.00002667178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8702672,"threshold_uncertainty_score":0.3830652,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maayan Shvo","is_ca":true},{"name":"Toryn Q. Klassen","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05234666380518317,"gpt":0.2905745783898468,"spread":0.2382279145846637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105964,0.000127252,0.0001785631,0.0001464448,0.0003597574,0.00007797205,0.001434888,0.00004174826,0.00004795187],"category_scores_gemma":[0.0001850975,0.0000904869,0.00007065966,0.0002448063,0.0001251293,0.0001530736,0.0004528819,0.0003403432,6.57787e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000213227,"about_ca_system_score_gemma":0.0000789681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002333055,"about_ca_topic_score_gemma":2.951201e-7,"domain_scores_codex":[0.9986231,0.00004579795,0.000398808,0.0002378931,0.0005347083,0.0001596855],"domain_scores_gemma":[0.9987029,0.0002835419,0.0005998088,0.0001349718,0.000245995,0.00003277025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004405245,0.0003040427,0.0769818,0.0003114428,0.0007293759,0.000006150368,0.05797108,0.1258013,0.191569,0.5345268,0.001621722,0.009736767],"study_design_scores_gemma":[0.0002986926,0.0001243258,0.005760026,0.0007263178,0.00002868433,0.00003340194,0.003077887,0.9696516,0.01464194,0.005351629,0.0001637996,0.000141646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988151,0.0002396983,0.004320481,0.00135574,0.0003701691,0.0001551649,0.00005780361,0.00009182652,0.005258163],"genre_scores_gemma":[0.9944149,0.0000060148,0.005279497,0.00009724782,0.00001904546,0.0000115955,0.000004334831,0.00000699521,0.0001603146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8438503,"threshold_uncertainty_score":0.3689949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Arik Senderovich","is_ca":true},{"name":"Kyle E. C. Booth","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06287514748996063,"gpt":0.2836487717362305,"spread":0.2207736242462698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954357,0.0002099076,0.0002678932,0.0002271323,0.0001953127,0.0005900657,0.00112497,0.00009420691,0.00006465883],"category_scores_gemma":[0.0002595109,0.0001634445,0.00006131342,0.0002784677,0.00004121126,0.001381165,0.0006820179,0.0003753115,0.00003076223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001852433,"about_ca_system_score_gemma":0.00003324319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002832355,"about_ca_topic_score_gemma":0.000001496974,"domain_scores_codex":[0.9983829,0.000003246195,0.0003736787,0.000504048,0.0005311985,0.0002049479],"domain_scores_gemma":[0.9986799,0.00004639781,0.0005193235,0.0001749441,0.0005633747,0.000016108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002345138,0.0001264818,0.1439308,0.0003828615,0.0004323112,0.000002104544,0.0005538678,0.7468429,0.0302957,0.07377074,0.0002014111,0.003226342],"study_design_scores_gemma":[0.0003262719,0.000006315748,0.0009964638,0.001176825,0.00006378444,0.000001337848,0.001290241,0.9871498,0.0002876506,0.008407409,0.00009663113,0.0001973203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9878938,0.0001080334,0.0005544355,0.001456707,0.0003357785,0.00009424269,0.000008562419,0.0003283532,0.009220046],"genre_scores_gemma":[0.9974879,0.00002074802,0.001649937,0.0003322208,0.0002625803,0.000004255949,0.00007064589,0.00002402376,0.0001476981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2403069,"threshold_uncertainty_score":0.6665074,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ryo Kuroiwa","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02913668222290711,"gpt":0.2891739207322735,"spread":0.2600372385093664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664034,0.0001778542,0.0001761263,0.0002309455,0.0001581351,0.0002361611,0.000368849,0.00007883961,0.000008613083],"category_scores_gemma":[0.0001104374,0.0001385071,0.00003249177,0.0004023591,0.00006250085,0.000148462,0.0001083105,0.0003385046,0.00000577233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006676124,"about_ca_system_score_gemma":0.00003394063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005398419,"about_ca_topic_score_gemma":5.92136e-7,"domain_scores_codex":[0.9986985,0.00001081913,0.0002759915,0.0002440285,0.0004880631,0.0002826338],"domain_scores_gemma":[0.999406,0.00008009521,0.0001096632,0.00007112973,0.0002708674,0.00006221359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004568711,0.0000237773,0.02207583,0.0003302198,0.0001734805,0.000006347512,0.002896147,0.9209042,0.04772167,0.003135127,0.00004221576,0.002645275],"study_design_scores_gemma":[0.000290935,0.00004154637,0.005430016,0.001154917,0.0000120802,0.00002832574,0.001153112,0.9888298,0.002625031,0.0002526023,0.00001731425,0.0001643262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9916792,0.00003214848,0.003576491,0.0003504037,0.0001704512,0.0002229344,0.000006058566,0.001505991,0.002456346],"genre_scores_gemma":[0.9597281,0.00001449838,0.04006394,0.00001272133,0.0000222996,0.00002060218,0.000007951144,0.00003660859,0.00009325466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06792556,"threshold_uncertainty_score":0.5648155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Fan Xie","is_ca":true},{"name":"Martin Müller","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2048224908150635,"gpt":0.3098547891615983,"spread":0.1050322983465348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006713479,0.0001276704,0.0001324502,0.0001225202,0.0001901142,0.0003754754,0.0004176769,0.00007088867,5.695804e-7],"category_scores_gemma":[0.0002688103,0.0001016822,0.00002627822,0.0001122993,0.00006076783,0.0005898974,0.0001620588,0.0001557634,5.04104e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006585181,"about_ca_system_score_gemma":0.00007743962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001424196,"about_ca_topic_score_gemma":5.031135e-7,"domain_scores_codex":[0.9990502,0.000007852219,0.0002195129,0.0002731461,0.000285884,0.0001633765],"domain_scores_gemma":[0.9992269,0.0001155268,0.0002280735,0.00005770566,0.0002921948,0.00007958412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002115092,0.0000433822,0.009828092,0.0001979056,0.00009951981,0.000002237368,0.009673525,0.01658647,0.01897005,0.9376082,0.001086027,0.005693109],"study_design_scores_gemma":[0.0004145987,0.0001061,0.0001117532,0.00045643,0.00000803242,0.00001500842,0.002302793,0.9698536,0.004413051,0.02216265,0.00003184373,0.0001240928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2734844,0.0001303636,0.7168383,0.004893316,0.0005454017,0.0002522178,0.000007880531,0.0004759887,0.00337215],"genre_scores_gemma":[0.9692748,0.000003755545,0.03051019,0.0001121529,0.00003783035,0.00001131938,0.000002965443,0.00000769186,0.0000392595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9532672,"threshold_uncertainty_score":0.414648,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Shuli Hu","is_ca":false},{"name":"Daniel Harabor","is_ca":false},{"name":"Graeme Gange","is_ca":false},{"name":"Peter J. Stuckey","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06576627797060018,"gpt":0.3031903675507545,"spread":0.2374240895801543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007609857,0.0001743056,0.0001816591,0.0002079592,0.0004427804,0.000278212,0.001345737,0.00003796534,0.00001272761],"category_scores_gemma":[0.0000863782,0.0001310552,0.00004303701,0.0003095941,0.00006017337,0.0002715855,0.0007187189,0.0004855584,0.000002571771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009652558,"about_ca_system_score_gemma":0.0001156827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003504631,"about_ca_topic_score_gemma":1.219119e-7,"domain_scores_codex":[0.9981912,0.00002395653,0.0002733092,0.0004130355,0.0008373263,0.0002611566],"domain_scores_gemma":[0.9992115,0.00006612952,0.0002684668,0.0001279844,0.0002510053,0.00007487569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004305229,0.0007161903,0.4250985,0.0002403387,0.0006101788,0.0001694524,0.03081581,0.3840314,0.07320419,0.07952619,0.001285929,0.003871351],"study_design_scores_gemma":[0.0004648331,0.0001644522,0.008121721,0.0003510525,0.000006585252,0.0001251584,0.001570199,0.9864452,0.002397815,0.0001566397,0.0000260432,0.0001702605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.981716,0.00004258931,0.01361019,0.002145969,0.0004589681,0.000204871,0.0000153442,0.0004607031,0.001345336],"genre_scores_gemma":[0.8702564,0.000001885038,0.1294037,0.0001334339,0.00002169804,0.00002053715,0.000004328676,0.00001098568,0.0001470031],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6024139,"threshold_uncertainty_score":0.5344275,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ryo Kuroiwa","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03391730746902807,"gpt":0.2979461123156413,"spread":0.2640288048466133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004574604,0.0001238567,0.0001238889,0.0001910185,0.0002037962,0.0003760065,0.0004896969,0.00006066587,0.000004322041],"category_scores_gemma":[0.0000701825,0.000104972,0.00004627181,0.00037208,0.00004687928,0.0002664693,0.0001668687,0.0001390394,0.000002141859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005553717,"about_ca_system_score_gemma":0.00007994932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004496744,"about_ca_topic_score_gemma":3.308521e-7,"domain_scores_codex":[0.9988535,0.000009886359,0.0002360037,0.000291836,0.0004136284,0.0001951555],"domain_scores_gemma":[0.9991467,0.00006531327,0.0001939575,0.00007283365,0.0004675798,0.00005358889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001393932,0.00007070242,0.007087763,0.0001107205,0.0001263888,0.000002420004,0.002793545,0.6603376,0.01575331,0.3053594,0.0002455208,0.007973311],"study_design_scores_gemma":[0.0005115103,0.00005818404,0.001553971,0.0001450572,0.000004718725,0.000008426479,0.0004052555,0.9924757,0.00262905,0.002015389,0.00007739749,0.0001152702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6737019,0.00001711546,0.3158363,0.00617988,0.001442981,0.0006062937,0.00001604786,0.001076196,0.001123262],"genre_scores_gemma":[0.9226722,0.00002219752,0.0770739,0.0000404524,0.00002390017,0.00002848559,0.00001411619,0.00001054374,0.0001142117],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3321382,"threshold_uncertainty_score":0.4280635,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Simple (philosophy); Computer science; Mathematics","authors":[{"name":"Ryo Kuroiwa","is_ca":true},{"name":"Alexander Shleyfman","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04559055700428573,"gpt":0.2994431930214112,"spread":0.2538526360171255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006942575,0.0001913296,0.0002108787,0.0001840969,0.0006569842,0.0002442225,0.001315151,0.00005689248,0.00001213772],"category_scores_gemma":[0.0002686292,0.000167742,0.00007540537,0.0002459777,0.0000469998,0.0002216284,0.0005070019,0.000430026,0.000001335934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005408168,"about_ca_system_score_gemma":0.0001053889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000097841,"about_ca_topic_score_gemma":4.371164e-8,"domain_scores_codex":[0.9984452,0.00001665162,0.0003486326,0.0003965326,0.0005138251,0.0002792246],"domain_scores_gemma":[0.9988988,0.0002255278,0.000400175,0.0001083943,0.0002991408,0.00006795255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005458195,0.000219643,0.03574971,0.0002857705,0.0003616975,0.00002016722,0.01181625,0.6825941,0.02350934,0.2355603,0.006485975,0.002851174],"study_design_scores_gemma":[0.0003672504,0.0001873409,0.0003680695,0.0003224657,0.00001336423,0.00004982805,0.000791256,0.9923373,0.003214341,0.001384776,0.0007612437,0.0002027522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9420472,0.0002314395,0.04728976,0.003769221,0.001258785,0.0003626966,0.00007390797,0.0008452088,0.004121751],"genre_scores_gemma":[0.9379106,0.000002913469,0.06144939,0.0002795397,0.00007169768,0.00004335117,0.00001316009,0.00001561252,0.0002137432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3097432,"threshold_uncertainty_score":0.684032,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sara Bernardini","is_ca":false},{"name":"Maria Fox","is_ca":false},{"name":"Derek Long","is_ca":false},{"name":"Chiara Piacentini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05653941684740136,"gpt":0.3161860120499285,"spread":0.2596465952025271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007575752,0.0001594286,0.0001764603,0.0001406232,0.0004269501,0.0007636572,0.001607985,0.00006243466,0.000002315858],"category_scores_gemma":[0.0002152843,0.000115655,0.00002531832,0.00009555176,0.0000877271,0.0005562244,0.0003791869,0.0003412369,0.00000219808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003522714,"about_ca_system_score_gemma":0.00007279466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050809,"about_ca_topic_score_gemma":0.000002583163,"domain_scores_codex":[0.9986332,0.0000110956,0.000270284,0.0003627507,0.000464664,0.0002580124],"domain_scores_gemma":[0.9990489,0.0000720962,0.0003835524,0.0001767425,0.0002664373,0.00005224036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007088168,0.00005655879,0.9231908,0.0001829542,0.00006605669,0.00001368025,0.003266556,0.01605799,0.01615843,0.03911707,0.00006881031,0.001750229],"study_design_scores_gemma":[0.0004431044,0.00007434533,0.06947757,0.004327176,0.000004357067,0.00002623463,0.0001636623,0.918682,0.00566406,0.0009643402,0.00001081806,0.0001623603],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9856619,0.00006602506,0.001486626,0.002641423,0.0001532076,0.0001503292,0.000002596217,0.0001848297,0.009653125],"genre_scores_gemma":[0.9855476,0.000004911574,0.01420621,0.00007149929,0.00002238372,0.000009482545,0.00000109004,0.000008720436,0.0001280892],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.902624,"threshold_uncertainty_score":0.7363964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}