{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001855936,0.0007442396,0.0008835496,0.0007503147,0.0005419132,0.001034163,0.001570881,0.0009190558,0.002443073],"category_scores_gemma":[0.009938689,0.0006617996,0.00101991,0.0009318219,0.001272712,0.003295652,0.002273164,0.001860601,0.000473524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001128635,"about_ca_system_score_gemma":0.002078321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004382154,"about_ca_topic_score_gemma":0.007597966,"domain_scores_codex":[0.9981536,0.0006408492,0.00010938,0.0003666139,0.0005571857,0.0001723451],"domain_scores_gemma":[0.9948534,0.003577173,0.0003408346,0.0008356371,0.0002853883,0.0001075337],"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.0001661872,0.0001121233,0.0006001446,0.0001602971,0.00004141318,0.0001463254,0.0001865358,0.8662734,0.002833439,0.04070538,0.001324018,0.08745073],"study_design_scores_gemma":[0.00001732663,0.00004432094,0.0001200403,0.00001129913,0.00001252141,0.00002011515,0.00001196449,0.9600626,0.00144409,0.03716441,0.001078413,0.00001298386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02052064,0.000316249,0.9745594,0.0002672813,0.0000467357,0.00008130843,0.00009738289,0.001084545,0.003026398],"genre_scores_gemma":[0.5839281,0.0003673375,0.412396,0.0001661691,0.00005659645,0.0002026528,0.000378553,0.0002490403,0.002255659],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004382154,"threshold_uncertainty_score":0.009815276,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766897,0.0008472868,0.0005827183,0.0008982187,0.0003406516,0.001615774,0.001674784,0.0008416541,0.002221718],"category_scores_gemma":[0.01323193,0.0004363173,0.001200491,0.0008853024,0.00171645,0.002592271,0.000995047,0.001745124,0.0003488501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001766768,"about_ca_system_score_gemma":0.001844125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005662168,"about_ca_topic_score_gemma":0.009398586,"domain_scores_codex":[0.9981962,0.0006266865,0.0001209352,0.0004306948,0.00048669,0.0001388655],"domain_scores_gemma":[0.9915495,0.006258479,0.0008412967,0.0006781178,0.0005512209,0.0001214192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002333226,0.0002115478,0.003680854,0.0002660306,0.00009975328,0.0003418057,0.0006390561,0.7894779,0.005373979,0.1298726,0.001294895,0.06850826],"study_design_scores_gemma":[0.00001482281,0.00003526843,0.0001083325,0.00001609845,0.00001341038,0.00002446526,0.00002721121,0.9253917,0.001535789,0.07231309,0.0005124592,0.000007384541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02629115,0.0000822114,0.970918,0.0003865029,0.00001492047,0.00005659529,0.0003452387,0.0007417713,0.001163661],"genre_scores_gemma":[0.5848973,0.0002213172,0.4112509,0.0002488689,0.00003757054,0.0002802999,0.001261674,0.0001236497,0.001678369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005662168,"threshold_uncertainty_score":0.01281887,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003956326,0.001478674,0.001022978,0.001639278,0.0009612266,0.001744779,0.001647864,0.002222237,0.00713283],"category_scores_gemma":[0.03379838,0.001092509,0.002232244,0.000760543,0.001777482,0.003109493,0.002520334,0.002817871,0.000639118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001609738,"about_ca_system_score_gemma":0.002678099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002905747,"about_ca_topic_score_gemma":0.005337484,"domain_scores_codex":[0.9953451,0.001826754,0.0005656442,0.0007621918,0.001151816,0.0003485557],"domain_scores_gemma":[0.9689305,0.02579519,0.00161577,0.001590861,0.001607188,0.0004604401],"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.0003796096,0.0002029835,0.003396875,0.0009758436,0.0002023965,0.00127537,0.001447881,0.3859012,0.003690002,0.528806,0.006562163,0.06715961],"study_design_scores_gemma":[0.0001323195,0.00007307995,0.0003203122,0.0001378064,0.00005834788,0.0001095338,0.0001074745,0.5657699,0.002415383,0.4263096,0.004524836,0.00004139426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02371372,0.0001903814,0.9700456,0.0008567456,0.00004065691,0.0002357099,0.00117846,0.00134176,0.002396938],"genre_scores_gemma":[0.4208842,0.0002986977,0.5733094,0.0003082238,0.00007324651,0.0008751899,0.002628358,0.0002596093,0.001363171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00713283,"threshold_uncertainty_score":0.02386171,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007754535,0.001054197,0.0009599312,0.001227662,0.001553521,0.001188355,0.002266566,0.001845227,0.007421783],"category_scores_gemma":[0.002216324,0.0005518098,0.0009750744,0.001312806,0.000726238,0.001588445,0.001965931,0.002035805,0.002395174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189804,"about_ca_system_score_gemma":0.003017764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005261781,"about_ca_topic_score_gemma":0.006389877,"domain_scores_codex":[0.9991793,0.000234534,0.00004754901,0.0002369844,0.0001977462,0.000103859],"domain_scores_gemma":[0.9990181,0.0004009421,0.0001200776,0.0001564117,0.0001881503,0.0001163998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003254416,0.00044696,0.0008014904,0.0002663334,0.00008599147,0.000138742,0.0001397537,0.3624319,0.006304887,0.03222232,0.01985796,0.5769783],"study_design_scores_gemma":[0.00007742093,0.0001136027,0.0001102113,0.00001789989,0.00001550524,0.00007774455,0.00003505796,0.9757204,0.001950648,0.0140096,0.00785224,0.00001955084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004232226,0.0001614546,0.990651,0.00023459,0.00008073983,0.0001125352,0.00008908569,0.001570059,0.002868366],"genre_scores_gemma":[0.0755665,0.0001206714,0.9194245,0.0001986534,0.00003644759,0.0003219102,0.0003023596,0.0002189015,0.003810029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007421783,"threshold_uncertainty_score":0.02482837,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001501223,0.0005849361,0.0008204827,0.0004420885,0.0004702579,0.000709361,0.001140796,0.0006472977,0.001852462],"category_scores_gemma":[0.004777886,0.0004604514,0.0004659542,0.000431663,0.0006782376,0.001199033,0.001105208,0.001330138,0.0002406454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008007422,"about_ca_system_score_gemma":0.001297042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002783373,"about_ca_topic_score_gemma":0.003537816,"domain_scores_codex":[0.9995235,0.0001668468,0.00002896228,0.0000823141,0.0001228299,0.00007557579],"domain_scores_gemma":[0.9972832,0.002049479,0.0001551637,0.0002269709,0.0001888317,0.00009638236],"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.0001193831,0.00005961927,0.0005233021,0.00008821355,0.00002091102,0.00008614371,0.00004902323,0.9473028,0.0009667077,0.01009326,0.000782795,0.0399078],"study_design_scores_gemma":[0.0000108454,0.00001511673,0.00003513092,0.000004241344,0.000002989667,0.00001182219,0.000008866974,0.9933541,0.0005545018,0.005666673,0.0003329701,0.000002695453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03969911,0.0002739655,0.9554786,0.0002191388,0.00005236039,0.00009008132,0.0001383048,0.001278843,0.002769599],"genre_scores_gemma":[0.7471653,0.0002056062,0.2509288,0.0001131279,0.00001757582,0.0002188153,0.0003088528,0.0001142705,0.0009276991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002783373,"threshold_uncertainty_score":0.007939279,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009220642,0.0009569907,0.0005375133,0.0006097186,0.0004079099,0.001480293,0.001455946,0.001081959,0.006749719],"category_scores_gemma":[0.005684379,0.0005982025,0.0006770623,0.000517505,0.001794475,0.001640313,0.001322975,0.002123857,0.001077303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001306321,"about_ca_system_score_gemma":0.001919818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003426971,"about_ca_topic_score_gemma":0.006519923,"domain_scores_codex":[0.9992112,0.0003161285,0.00005373417,0.000100082,0.0002556878,0.00006314241],"domain_scores_gemma":[0.9979942,0.001351066,0.0001562772,0.0002469936,0.0001727549,0.00007872783],"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.00009262133,0.00007409706,0.0004924997,0.0001763637,0.0000248787,0.0001459938,0.0002575604,0.7572356,0.003579811,0.1765729,0.002220862,0.05912674],"study_design_scores_gemma":[0.00002269827,0.00002142736,0.00003591673,0.00002557314,0.000006792798,0.00001223307,0.00001836432,0.919943,0.001454306,0.07597709,0.00247506,0.000007546843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005288735,0.00007858952,0.9906295,0.0001631021,0.00002312505,0.00007829276,0.0001444219,0.001160016,0.002434113],"genre_scores_gemma":[0.3212537,0.0002858556,0.6735141,0.0001364569,0.00003465522,0.0007330088,0.000551039,0.0003549987,0.003136263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006749719,"threshold_uncertainty_score":0.02258009,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495078,0.001057896,0.0005316161,0.0007879096,0.0006861475,0.002568349,0.001573678,0.001114188,0.005798193],"category_scores_gemma":[0.008872671,0.0005287741,0.001416946,0.0009959798,0.002966783,0.002318453,0.001862954,0.002312405,0.001446187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002356835,"about_ca_system_score_gemma":0.003153654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003399967,"about_ca_topic_score_gemma":0.004646565,"domain_scores_codex":[0.9972497,0.0009769473,0.0002185951,0.0003908275,0.0009791102,0.0001848653],"domain_scores_gemma":[0.9946349,0.003643903,0.0002979759,0.0008217429,0.0004999962,0.0001014887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006967931,0.00007630766,0.0003645518,0.0005999936,0.00004654791,0.0003506005,0.000412045,0.2342037,0.006205636,0.67386,0.004427321,0.07938354],"study_design_scores_gemma":[0.00005494873,0.00005984754,0.00008295104,0.0002191593,0.00005003039,0.0001122123,0.00009560599,0.3830687,0.01068605,0.5647489,0.04079071,0.00003094509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002350124,0.0004462104,0.9841988,0.0004583433,0.0001000783,0.0001513036,0.0001902633,0.001166429,0.01093844],"genre_scores_gemma":[0.1630784,0.001369291,0.8249691,0.0006067409,0.0001205165,0.0008537422,0.001026202,0.0008548939,0.007121223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005798193,"threshold_uncertainty_score":0.0193969,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004153052,0.0009590453,0.0006032719,0.001741125,0.001174286,0.002921735,0.00337412,0.001437296,0.004769116],"category_scores_gemma":[0.005798199,0.001025937,0.002939316,0.00208985,0.004745184,0.007987451,0.004785086,0.004665032,0.00106532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001903634,"about_ca_system_score_gemma":0.003948603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006215814,"about_ca_topic_score_gemma":0.00921071,"domain_scores_codex":[0.996935,0.001298019,0.0002360137,0.000489794,0.000772983,0.0002681568],"domain_scores_gemma":[0.996713,0.001941405,0.0002061019,0.000742619,0.0002480469,0.0001487593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009905682,0.00008297324,0.000504402,0.0004009121,0.00004064958,0.0002896349,0.0008492329,0.05474275,0.002720532,0.8096435,0.003911681,0.1267146],"study_design_scores_gemma":[0.00007151438,0.00008838405,0.0001271104,0.0001222356,0.00005484322,0.000213843,0.0001932611,0.2048312,0.003676189,0.7376896,0.05290132,0.00003047863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005624422,0.0003241931,0.9794496,0.001361367,0.00006913669,0.0001768659,0.0001935543,0.001300693,0.01150006],"genre_scores_gemma":[0.0766876,0.0006933829,0.9183902,0.0004018266,0.00009018317,0.0002953137,0.0003615117,0.0002862344,0.002793774],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006215814,"threshold_uncertainty_score":0.02196372,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002364571,0.0008323594,0.001138272,0.001237861,0.0005719259,0.001145515,0.001702668,0.001660279,0.004541897],"category_scores_gemma":[0.00867091,0.0007359402,0.000878337,0.001343821,0.001212301,0.001352967,0.0008840755,0.0015979,0.0004351811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393904,"about_ca_system_score_gemma":0.001761408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01104964,"about_ca_topic_score_gemma":0.01509925,"domain_scores_codex":[0.9989543,0.000543115,0.00003824588,0.0001208804,0.0002553287,0.00008814511],"domain_scores_gemma":[0.9933809,0.005612085,0.0002569542,0.0002832427,0.0003042866,0.0001624889],"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.00002335075,0.00002030839,0.000191829,0.00002545466,0.00001705327,0.00002178652,0.0000174939,0.9793643,0.0001882892,0.01322503,0.0003836238,0.006521366],"study_design_scores_gemma":[0.000006042078,0.000004767695,0.00002314695,0.000003290225,0.000002182495,0.000003254847,0.000002195241,0.9951416,0.00005360113,0.004563469,0.000193724,0.000002631169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01782582,0.0004082675,0.9757774,0.0004231678,0.00004566342,0.0001015065,0.0001272268,0.0006060686,0.004684848],"genre_scores_gemma":[0.4462222,0.0005826164,0.5474324,0.0002737464,0.00008436299,0.0004956057,0.0003427788,0.0003306963,0.004235612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01104964,"threshold_uncertainty_score":0.02197063,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006392614,0.002529912,0.002367801,0.002145246,0.001054149,0.003508917,0.002879291,0.002346559,0.007614249],"category_scores_gemma":[0.03297301,0.001587453,0.001975626,0.0021859,0.002665601,0.007076513,0.00480345,0.00612553,0.0009079652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003056564,"about_ca_system_score_gemma":0.003363205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005978278,"about_ca_topic_score_gemma":0.006031266,"domain_scores_codex":[0.9948444,0.00146938,0.0002579106,0.000734637,0.002069771,0.000623869],"domain_scores_gemma":[0.9837852,0.01263546,0.0007268854,0.001524449,0.001020839,0.0003071851],"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.0001513276,0.00005545614,0.0003097547,0.0001830831,0.00003564066,0.00005668522,0.0001495877,0.8976502,0.0006908915,0.06732286,0.001785608,0.03160899],"study_design_scores_gemma":[0.00002008815,0.00003440375,0.00005600803,0.00006820095,0.00001164463,0.000009594281,0.00002224099,0.9470762,0.0004819167,0.05106321,0.001148285,0.000008235039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01404261,0.001251603,0.9737225,0.0006079366,0.0001291287,0.00008317846,0.0002346732,0.0008081527,0.00912012],"genre_scores_gemma":[0.4540453,0.001729639,0.5380231,0.0005387226,0.0002089823,0.0005931359,0.0006994277,0.000750541,0.003411224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007614249,"threshold_uncertainty_score":0.03380775,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001826397,0.001353217,0.0009664882,0.001563198,0.0003898422,0.001208228,0.001957755,0.001149437,0.001683952],"category_scores_gemma":[0.01832219,0.0007661441,0.0009630779,0.001344352,0.0006569789,0.002306479,0.0008698186,0.002337615,0.000477521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001572778,"about_ca_system_score_gemma":0.001547734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01009019,"about_ca_topic_score_gemma":0.01177961,"domain_scores_codex":[0.998933,0.0002729354,0.00006767864,0.0003471017,0.0002707701,0.0001085293],"domain_scores_gemma":[0.9904541,0.006349393,0.0009855285,0.001278815,0.0007396505,0.0001926474],"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.00009232489,0.00005168787,0.003599217,0.00004801199,0.00002226174,0.0000243058,0.00002577326,0.9659165,0.0004851928,0.001042043,0.001356933,0.02733566],"study_design_scores_gemma":[0.000004619164,0.00001268165,0.0003282358,0.000004058535,0.000005254269,0.00000593884,0.000002235828,0.9981838,0.0003229449,0.0009705154,0.0001563914,0.000003299308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3991513,0.001340249,0.5707297,0.000990059,0.0001262416,0.0001861951,0.005696725,0.01663029,0.005149221],"genre_scores_gemma":[0.8679723,0.000222791,0.1263367,0.00009503526,0.00004975369,0.0002036031,0.003639798,0.000599227,0.0008807202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01009019,"threshold_uncertainty_score":0.02006292,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003368763,0.001482962,0.00184689,0.0009278676,0.000906121,0.001746388,0.003016182,0.001818063,0.004066486],"category_scores_gemma":[0.01959464,0.001019603,0.0009258915,0.001305479,0.001798553,0.003831826,0.002773652,0.003310641,0.001207239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007900659,"about_ca_system_score_gemma":0.001897866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001755604,"about_ca_topic_score_gemma":0.002525771,"domain_scores_codex":[0.9978092,0.0009827878,0.0001646468,0.0004767709,0.0003778515,0.0001887424],"domain_scores_gemma":[0.9934492,0.003191732,0.0005190877,0.002155022,0.0004619343,0.0002230022],"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.0004831236,0.0004397114,0.002533625,0.000292872,0.0001941423,0.0001921377,0.0003330538,0.7393194,0.01514738,0.03807653,0.003467437,0.1995206],"study_design_scores_gemma":[0.0001282902,0.0001771192,0.0002542924,0.00003159092,0.00003636755,0.00007954334,0.00005038586,0.9568755,0.005095391,0.03436596,0.002868098,0.00003746367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02682149,0.000289467,0.9652892,0.0002450074,0.00006264326,0.000198303,0.00003890031,0.001968213,0.005086854],"genre_scores_gemma":[0.4457327,0.000161275,0.5510011,0.0002789924,0.00005052751,0.0005461026,0.0001116687,0.0005056694,0.001611884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004066486,"threshold_uncertainty_score":0.01781595,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003635728,0.001602667,0.001203958,0.002223122,0.001644857,0.002127471,0.005007133,0.001842068,0.004074323],"category_scores_gemma":[0.0152638,0.001112467,0.002897566,0.002326881,0.002362767,0.006254588,0.005041542,0.005784674,0.0009695732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197349,"about_ca_system_score_gemma":0.002431926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002564962,"about_ca_topic_score_gemma":0.003204959,"domain_scores_codex":[0.9946701,0.001189872,0.0004529299,0.0009710874,0.00229697,0.000418977],"domain_scores_gemma":[0.9904093,0.004202351,0.00122278,0.00294897,0.0009630592,0.0002535609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000315312,0.0004777876,0.002702737,0.0009077336,0.0003013794,0.0007858583,0.000999699,0.1929282,0.03259133,0.2427697,0.008241176,0.5169791],"study_design_scores_gemma":[0.0001140872,0.000155574,0.0004543735,0.0001076405,0.0001034365,0.0005833098,0.0002122971,0.7719958,0.01939492,0.1929944,0.01380243,0.0000817677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003232186,0.000144379,0.9944899,0.0001565446,0.0000451782,0.0001047407,0.00005017758,0.0005988915,0.001177995],"genre_scores_gemma":[0.07862236,0.0001662337,0.9197026,0.0001571671,0.00006196966,0.0001568922,0.000195588,0.0002394297,0.0006976732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005007133,"threshold_uncertainty_score":0.0192278,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004440727,0.001141856,0.00151523,0.0007608965,0.0006687648,0.001211709,0.002325661,0.001963597,0.009488648],"category_scores_gemma":[0.01718115,0.0008968971,0.001164648,0.0007782021,0.001625979,0.001718535,0.002245581,0.002495904,0.001618013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001943492,"about_ca_system_score_gemma":0.00333839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008154825,"about_ca_topic_score_gemma":0.00756196,"domain_scores_codex":[0.998329,0.0007643506,0.0001089607,0.0002498881,0.0003408526,0.0002068769],"domain_scores_gemma":[0.9934015,0.005022779,0.0003207705,0.0003177623,0.0007152898,0.0002218982],"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.00013772,0.0000653892,0.0005372522,0.0001089631,0.0000367139,0.00009513203,0.0001326974,0.8966503,0.0006357373,0.0472204,0.001122033,0.0532577],"study_design_scores_gemma":[0.00001716287,0.0000229478,0.00002394039,0.00001160149,0.00000352415,0.00001075502,0.000008213703,0.9865328,0.000267103,0.01257117,0.0005248712,0.000005755543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001563044,0.00003336978,0.9973261,0.00006302762,0.00001471809,0.00003740693,0.00001551577,0.0001718515,0.0007748767],"genre_scores_gemma":[0.1830614,0.00007511047,0.8121565,0.0001626978,0.00003293215,0.0004429504,0.000130744,0.0002331215,0.003704538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009488648,"threshold_uncertainty_score":0.03174269,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002519101,0.001133179,0.001517066,0.0009298858,0.0008317854,0.001105081,0.002317173,0.001410644,0.00181761],"category_scores_gemma":[0.01157087,0.0006965545,0.0009789333,0.00103193,0.001326712,0.002177102,0.001997835,0.001197387,0.0004012297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049133,"about_ca_system_score_gemma":0.001986103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003512288,"about_ca_topic_score_gemma":0.002951138,"domain_scores_codex":[0.9977335,0.0005827224,0.0001358483,0.0006535474,0.0007005067,0.000193801],"domain_scores_gemma":[0.994352,0.003380179,0.0008284468,0.0007072294,0.0005890712,0.00014303],"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.0001231084,0.00002475355,0.0005535466,0.0001087113,0.00005591006,0.00008978802,0.00005432561,0.9483435,0.002845415,0.01232873,0.0007236297,0.03474858],"study_design_scores_gemma":[0.00001438979,0.0000366946,0.00009108083,0.000006482729,0.00001029372,0.00004188665,0.00001410276,0.9886629,0.001484888,0.009003654,0.0006236476,0.00001003829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009355963,0.0001758103,0.9887977,0.0001232768,0.00001806782,0.00004879564,0.00004818638,0.0004877514,0.0009444499],"genre_scores_gemma":[0.5698254,0.0002630725,0.4278302,0.00009935939,0.00003163722,0.0001731724,0.0002344948,0.0001590728,0.001383478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003512288,"threshold_uncertainty_score":0.01332241,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662525,0.001763383,0.001462876,0.002786352,0.001013467,0.001025772,0.002909612,0.001754461,0.005058896],"category_scores_gemma":[0.008801645,0.0007387319,0.001505605,0.001881755,0.002122801,0.002183229,0.002312347,0.00308878,0.0009732442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826317,"about_ca_system_score_gemma":0.003860742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0131569,"about_ca_topic_score_gemma":0.01974553,"domain_scores_codex":[0.9965823,0.0009472013,0.0001543148,0.0005298707,0.001465661,0.0003206397],"domain_scores_gemma":[0.9941421,0.003730093,0.0005214628,0.000743248,0.000701087,0.0001619411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007667701,0.0007540172,0.00215249,0.0004045906,0.000119249,0.0001125206,0.0003674155,0.2554328,0.00573889,0.02716993,0.01102248,0.6959589],"study_design_scores_gemma":[0.0003572121,0.0005115854,0.001466306,0.00005620741,0.0001101886,0.0001957341,0.0001314484,0.9511721,0.01090623,0.02122449,0.01381091,0.00005767322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01688573,0.0006912109,0.9697435,0.0005694771,0.00009401388,0.0005615557,0.0002225745,0.005262766,0.005969142],"genre_scores_gemma":[0.102851,0.0002457073,0.8920072,0.00020321,0.00005996911,0.0005339617,0.0005829459,0.0005069602,0.00300899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0131569,"threshold_uncertainty_score":0.0261606,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003362872,0.001154064,0.0010876,0.001486438,0.0005381253,0.001029948,0.002674926,0.001473991,0.002965182],"category_scores_gemma":[0.01849863,0.0005959268,0.0007664556,0.00154749,0.001533557,0.004250411,0.002342789,0.001521299,0.0004268055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00202716,"about_ca_system_score_gemma":0.002399593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007814169,"about_ca_topic_score_gemma":0.01163518,"domain_scores_codex":[0.9969897,0.001224727,0.0001480399,0.0003147684,0.0009854921,0.0003371199],"domain_scores_gemma":[0.9846713,0.01122518,0.0005986528,0.00242091,0.0007459228,0.0003380353],"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.001608565,0.0004685484,0.001824725,0.0004356511,0.0001336623,0.00009234523,0.0003720906,0.7436613,0.003927126,0.01524237,0.002127964,0.2301057],"study_design_scores_gemma":[0.0003612052,0.001184223,0.002261213,0.00009764187,0.0001508298,0.0001559303,0.0002358425,0.9633964,0.007841714,0.01640252,0.007857966,0.00005455698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5030714,0.003325159,0.4363013,0.001504331,0.0001677386,0.0006767296,0.0006835528,0.007237501,0.04703232],"genre_scores_gemma":[0.8605182,0.0005530028,0.1356286,0.0001974084,0.00003354049,0.0002236015,0.0004147483,0.0002752035,0.002155692],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007814169,"threshold_uncertainty_score":0.01778483,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080042,0.001113276,0.001460277,0.0004700945,0.0009864056,0.001194929,0.001841506,0.001248932,0.003752018],"category_scores_gemma":[0.002606386,0.0007266921,0.0006516839,0.001070095,0.0006880547,0.00234854,0.001482594,0.001284275,0.0005138495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009582904,"about_ca_system_score_gemma":0.001550764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01213599,"about_ca_topic_score_gemma":0.01204752,"domain_scores_codex":[0.9990017,0.0003100787,0.00005698216,0.0002787606,0.0001430586,0.0002095886],"domain_scores_gemma":[0.9988925,0.0005084095,0.0001391748,0.0002118688,0.0001114156,0.0001365507],"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.0001655914,0.00009547933,0.0008833419,0.00008582578,0.00003083567,0.0001107142,0.00008960715,0.9577885,0.001796645,0.003184703,0.0011691,0.03459953],"study_design_scores_gemma":[0.000009851007,0.00003362834,0.0002150164,0.000003789855,0.00000666955,0.00002702443,0.00004858737,0.9960892,0.0004695982,0.002472352,0.0006195232,0.000004702686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2651885,0.001068086,0.723385,0.0005963068,0.000116456,0.0002320125,0.0006472453,0.001877158,0.006889188],"genre_scores_gemma":[0.930325,0.000223326,0.06637369,0.00007274449,0.0000232616,0.00006618846,0.0005719078,0.0001003219,0.002243451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01213599,"threshold_uncertainty_score":0.0241307,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005768453,0.001694073,0.001635321,0.00336599,0.001541103,0.008917711,0.003737879,0.003251961,0.004414028],"category_scores_gemma":[0.0073303,0.001527241,0.002648985,0.002235362,0.01245828,0.0149525,0.004940713,0.00982749,0.001074792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004891186,"about_ca_system_score_gemma":0.0034099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004792717,"about_ca_topic_score_gemma":0.003666099,"domain_scores_codex":[0.9945287,0.002398686,0.000346365,0.0009060836,0.001478334,0.0003417777],"domain_scores_gemma":[0.9929332,0.004176911,0.0005596143,0.00119578,0.0007643734,0.0003700935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000012217,0.00001483013,0.00004414733,0.00005656199,0.000009029529,0.00002374508,0.0001699234,0.006540883,0.0002459412,0.9880471,0.0003269222,0.004508582],"study_design_scores_gemma":[0.00001684008,0.00002182317,0.00008108146,0.00005817399,0.0000144904,0.00002600022,0.0001161462,0.03928502,0.00033985,0.9476284,0.0123947,0.00001747215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003021664,0.00299658,0.9643375,0.004068834,0.0001599752,0.00006827632,0.00008321626,0.0002194438,0.02504443],"genre_scores_gemma":[0.2094339,0.006083635,0.7698075,0.001832465,0.001072986,0.00078481,0.0003109303,0.0003066419,0.01036726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008917711,"threshold_uncertainty_score":0.03548819,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007322401,0.001052352,0.001577032,0.002027745,0.001130296,0.002115238,0.001775221,0.001874309,0.008035867],"category_scores_gemma":[0.05663881,0.001259647,0.001487351,0.001425465,0.003197481,0.007069243,0.002877188,0.003371411,0.001225922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009227383,"about_ca_system_score_gemma":0.002980581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001923001,"about_ca_topic_score_gemma":0.002226893,"domain_scores_codex":[0.9934633,0.002586976,0.0004416539,0.000915424,0.001427972,0.001164703],"domain_scores_gemma":[0.9449419,0.04430097,0.002922669,0.002546207,0.004114402,0.001173827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007458141,0.000317787,0.003839673,0.0007417638,0.0001141743,0.000597496,0.0007388304,0.4829718,0.0129919,0.4538768,0.003223298,0.03984065],"study_design_scores_gemma":[0.0001343038,0.0002644233,0.0007572588,0.0002508738,0.00007097919,0.0001973821,0.0004705306,0.740652,0.01144164,0.2417481,0.00394602,0.00006651277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06715021,0.0003123911,0.9214025,0.0004493671,0.00003624939,0.0002752631,0.0003585463,0.0005222415,0.009493172],"genre_scores_gemma":[0.7021334,0.0006293398,0.2906514,0.0003696778,0.00007574543,0.001312368,0.001234847,0.0005125473,0.003080723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008035867,"threshold_uncertainty_score":0.03872502,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940901,0.0007409931,0.0005026868,0.0003088624,0.0006697375,0.0008423843,0.001029434,0.001013322,0.004527765],"category_scores_gemma":[0.002861526,0.0003073191,0.0005348106,0.0004386759,0.0009819303,0.001227133,0.001393958,0.001798405,0.0006912568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001369572,"about_ca_system_score_gemma":0.002514395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02024444,"about_ca_topic_score_gemma":0.0254308,"domain_scores_codex":[0.9993285,0.0001879708,0.00001631072,0.0001020873,0.0002170696,0.0001480406],"domain_scores_gemma":[0.9988688,0.0005318839,0.00003811685,0.0001129236,0.0002500587,0.0001982963],"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.0005308383,0.0001664613,0.001593192,0.0001664821,0.00007894595,0.0003474067,0.0002492363,0.7299665,0.005965115,0.02547464,0.06660496,0.1688562],"study_design_scores_gemma":[0.0001414423,0.0001454264,0.000675288,0.00002395735,0.00001805891,0.00004778197,0.0001587402,0.9527918,0.002798878,0.01573638,0.02744176,0.00002052822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3524325,0.003403232,0.5272508,0.02095365,0.001202851,0.0003456688,0.002713159,0.02980319,0.06189489],"genre_scores_gemma":[0.7863993,0.0007655119,0.1974925,0.0008783239,0.00009876824,0.0001795325,0.00317603,0.001064726,0.009945199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02024444,"threshold_uncertainty_score":0.04025322,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523593,0.001188087,0.001162251,0.0007379776,0.0005500137,0.00125192,0.001708522,0.001374224,0.003292712],"category_scores_gemma":[0.01666202,0.0007863921,0.0008970175,0.0007855929,0.001762682,0.002556908,0.002488741,0.002291246,0.0003828112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204261,"about_ca_system_score_gemma":0.003050577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005841655,"about_ca_topic_score_gemma":0.008769387,"domain_scores_codex":[0.998534,0.0004754557,0.00009295596,0.0002658152,0.0004537574,0.0001780349],"domain_scores_gemma":[0.9914072,0.006447691,0.000481231,0.001000697,0.000391469,0.0002716843],"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.0001272948,0.00005216053,0.0005820984,0.0001127161,0.00002773471,0.00006497955,0.00005898827,0.9412,0.0008473005,0.01675772,0.001332331,0.03883663],"study_design_scores_gemma":[0.00001909227,0.00004402167,0.0000678951,0.00001133349,0.000007427148,0.00001938486,0.00001251404,0.975674,0.0007402183,0.02282408,0.0005734622,0.000006557474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07132992,0.0005822197,0.9168584,0.00060919,0.00008665494,0.0001366765,0.000351594,0.004186802,0.005858541],"genre_scores_gemma":[0.6351615,0.00032042,0.3611915,0.0002633244,0.0000415176,0.0002140501,0.0006990144,0.0005322398,0.001576399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005841655,"threshold_uncertainty_score":0.01334614,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014354,0.001117979,0.0007923367,0.001071009,0.0006854163,0.001997201,0.00182368,0.001118967,0.003167836],"category_scores_gemma":[0.01911166,0.0005931284,0.0009632413,0.002148057,0.001456693,0.003230302,0.001886579,0.003127842,0.0003063698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864135,"about_ca_system_score_gemma":0.004181787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01527286,"about_ca_topic_score_gemma":0.02539518,"domain_scores_codex":[0.9971252,0.001364332,0.0001365187,0.0004344746,0.0006724932,0.0002669096],"domain_scores_gemma":[0.9852705,0.01181566,0.0004363784,0.0013273,0.0008173722,0.0003328006],"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.0002896544,0.0001855108,0.001540175,0.0003851709,0.0001112129,0.00007195822,0.0002096322,0.8084512,0.002092614,0.03643868,0.002184964,0.1480392],"study_design_scores_gemma":[0.00003326846,0.00009891077,0.0002778124,0.000031423,0.00003614138,0.00002485266,0.00007892332,0.9715368,0.001647159,0.02335078,0.002866906,0.00001699855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09343936,0.002526367,0.883769,0.00164098,0.0002073276,0.0002456944,0.0002743074,0.002016681,0.01588022],"genre_scores_gemma":[0.4656086,0.0009391895,0.5297212,0.0004177023,0.00007802027,0.0002392476,0.0003688407,0.0005928011,0.00203432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01527286,"threshold_uncertainty_score":0.03036791,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919754,0.0006749591,0.0004101166,0.0004437355,0.000512477,0.0008959041,0.00103307,0.0006127952,0.003477259],"category_scores_gemma":[0.006046241,0.0004772627,0.0009565122,0.0003826405,0.001582861,0.001624361,0.001949036,0.001314253,0.0003547301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007823876,"about_ca_system_score_gemma":0.001999106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004698941,"about_ca_topic_score_gemma":0.00980872,"domain_scores_codex":[0.9985279,0.0005446956,0.0001119115,0.0002025258,0.0004581592,0.0001548144],"domain_scores_gemma":[0.9957241,0.002961086,0.0002136384,0.0006640499,0.0003291357,0.0001079149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002904212,0.0001128153,0.00150002,0.0004665339,0.0000734326,0.0007083765,0.0004530819,0.545011,0.0093802,0.3385873,0.002962554,0.1004541],"study_design_scores_gemma":[0.00004713763,0.00007959252,0.0003519729,0.00005655511,0.00004699265,0.0001241244,0.00005431947,0.7768881,0.01023196,0.2006177,0.01146816,0.00003334938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02261206,0.0001665747,0.965916,0.0002384922,0.00005466342,0.0001121293,0.0002252965,0.002070785,0.008603849],"genre_scores_gemma":[0.5338708,0.0003010156,0.4599418,0.0001590894,0.0000282682,0.0002545932,0.0004864185,0.0003338347,0.004624189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004698941,"threshold_uncertainty_score":0.01163256,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01099419,0.001780691,0.001473451,0.002769696,0.001168297,0.004804524,0.002983937,0.002322481,0.00397531],"category_scores_gemma":[0.05230232,0.001055788,0.001594395,0.002783329,0.005928267,0.005976907,0.005113819,0.004085638,0.0009451142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003461841,"about_ca_system_score_gemma":0.003384061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002209857,"about_ca_topic_score_gemma":0.002984209,"domain_scores_codex":[0.986196,0.006756525,0.0006463281,0.001546027,0.003928724,0.0009262894],"domain_scores_gemma":[0.9582028,0.03150754,0.001871995,0.005942522,0.001929092,0.0005460827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009410526,0.00007043851,0.0005408894,0.0001831518,0.00006832052,0.00006850346,0.0002967578,0.3373528,0.00133873,0.5999086,0.001700799,0.05837694],"study_design_scores_gemma":[0.00002561678,0.00005473243,0.00008004806,0.00008123028,0.00002758718,0.00004540036,0.00003564691,0.7569099,0.001596786,0.2377423,0.003379568,0.00002117237],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0050395,0.0005375164,0.9871833,0.0003628655,0.00003634464,0.00003809779,0.00001826723,0.000306587,0.006477527],"genre_scores_gemma":[0.2780109,0.0007804114,0.7169895,0.0004984492,0.0001310884,0.0003219848,0.0001040191,0.0003023393,0.002861417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01099419,"threshold_uncertainty_score":0.0581435,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108822,0.0008275983,0.0009581754,0.001012571,0.0004227609,0.0008286968,0.001345026,0.0009111831,0.003679554],"category_scores_gemma":[0.003561313,0.0006533518,0.0007838678,0.0009534959,0.00106181,0.001147186,0.001610823,0.001068242,0.0009658318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008431997,"about_ca_system_score_gemma":0.00130852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003072469,"about_ca_topic_score_gemma":0.00482454,"domain_scores_codex":[0.9990758,0.0003629871,0.00004191487,0.0001630867,0.0002821463,0.00007404904],"domain_scores_gemma":[0.9988871,0.0006982209,0.00009236943,0.000133914,0.0001376736,0.00005069088],"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.00008156343,0.00004268964,0.0002376225,0.000124874,0.00004775535,0.0001017261,0.00007643193,0.9159289,0.002163823,0.02589362,0.002262745,0.05303824],"study_design_scores_gemma":[0.00003600911,0.00003969485,0.00003721489,0.000009330504,0.000008691075,0.00002539109,0.000008553509,0.9832791,0.0007823154,0.01434937,0.001414721,0.000009663811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007671111,0.0002540957,0.9863994,0.0001116012,0.00001754672,0.0001034562,0.00008963213,0.001440793,0.003912298],"genre_scores_gemma":[0.388564,0.0004752073,0.6043546,0.0001773192,0.0000300414,0.0007341265,0.0005013756,0.000401997,0.004761316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003679554,"threshold_uncertainty_score":0.01230931,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132551,0.00111456,0.0006301993,0.0006739416,0.0004125829,0.001220805,0.0007833642,0.0005822318,0.003995216],"category_scores_gemma":[0.005074996,0.0006955841,0.0008033917,0.0007502764,0.0009879072,0.001040915,0.001281785,0.001616242,0.0007904793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007144422,"about_ca_system_score_gemma":0.00172492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665991,"about_ca_topic_score_gemma":0.002497462,"domain_scores_codex":[0.9988967,0.000418866,0.00007338995,0.0001643552,0.0003317012,0.0001148917],"domain_scores_gemma":[0.9981129,0.00129192,0.0001702434,0.0002341025,0.0001547477,0.00003601683],"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.00006778292,0.00006516718,0.0003495629,0.0002654563,0.00002809238,0.0001282632,0.000083478,0.859787,0.002580907,0.04993401,0.002495394,0.08421494],"study_design_scores_gemma":[0.00001613793,0.00003587731,0.00005057824,0.00004742427,0.0000125302,0.00003479097,0.00002601112,0.9643022,0.002982857,0.02786354,0.004620312,0.000007604922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006162268,0.000156091,0.9860142,0.0001554709,0.00005899551,0.00007587305,0.00007884479,0.001514661,0.00578351],"genre_scores_gemma":[0.1823232,0.0003664947,0.8144006,0.0001309001,0.00005191793,0.0003217254,0.0003034436,0.0005027882,0.001598894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003995216,"threshold_uncertainty_score":0.01336533,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003109679,0.0007933532,0.0009315871,0.001361406,0.000726885,0.001320487,0.001674761,0.00109239,0.002237031],"category_scores_gemma":[0.01212249,0.00108613,0.001327321,0.001037269,0.001369952,0.003052885,0.001577364,0.001590905,0.0002584954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039336,"about_ca_system_score_gemma":0.002949156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01694985,"about_ca_topic_score_gemma":0.02473101,"domain_scores_codex":[0.9980286,0.0007532461,0.00009853987,0.0003983967,0.0005091408,0.0002121288],"domain_scores_gemma":[0.992386,0.006231478,0.0004996069,0.0002808384,0.0004041482,0.0001980325],"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.0001698874,0.00005939768,0.001421358,0.00005883447,0.00006209206,0.0001801528,0.0002278896,0.941389,0.0009853666,0.02993507,0.0004814253,0.02502944],"study_design_scores_gemma":[0.00002100456,0.00002041558,0.0001755117,0.000009870777,0.00001735318,0.00002131626,0.00002389449,0.9766752,0.0004725473,0.02214226,0.0004094959,0.00001118085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05525865,0.0001887663,0.9406998,0.0003699709,0.00001487883,0.0001691772,0.0002263669,0.0005941202,0.002478279],"genre_scores_gemma":[0.7347317,0.0002810528,0.2621022,0.0001089396,0.00002805741,0.0004626875,0.000551353,0.0001092737,0.001624744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01694985,"threshold_uncertainty_score":0.03370237,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199562,0.001125892,0.0007575917,0.0009463536,0.0005649197,0.001049144,0.001765862,0.000753158,0.003277916],"category_scores_gemma":[0.008250393,0.0006385798,0.0007785432,0.0008227034,0.0007335718,0.001971742,0.001367477,0.001494075,0.0006788798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000868883,"about_ca_system_score_gemma":0.001884703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005602723,"about_ca_topic_score_gemma":0.008511561,"domain_scores_codex":[0.9984537,0.0006228842,0.00009357338,0.0002376912,0.0004054066,0.0001867144],"domain_scores_gemma":[0.9959236,0.002774665,0.0002572704,0.0006417413,0.0002804943,0.0001221276],"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.0008553691,0.0002869258,0.002007779,0.0003189357,0.00009925479,0.0002225379,0.0002934614,0.7165137,0.01393358,0.01028096,0.005414045,0.2497734],"study_design_scores_gemma":[0.0001075274,0.0001730804,0.0003605684,0.00002167939,0.00003689058,0.00006146081,0.00005865113,0.9829096,0.00836414,0.006041991,0.001841336,0.00002311384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1538554,0.000898607,0.8221924,0.0004799124,0.00008097449,0.0002884449,0.0003957634,0.01058644,0.0112221],"genre_scores_gemma":[0.4807134,0.0002762479,0.5159059,0.0001251572,0.00002083673,0.0001354222,0.0008177463,0.0003661194,0.001639038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005602723,"threshold_uncertainty_score":0.0116325,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567193,0.0007342352,0.001113353,0.0003522183,0.000665338,0.001021226,0.001667603,0.001022308,0.005034938],"category_scores_gemma":[0.003625816,0.0006383884,0.0007748304,0.0006117061,0.0007564058,0.001038349,0.001063035,0.001254832,0.0005898153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009478209,"about_ca_system_score_gemma":0.002240408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007285293,"about_ca_topic_score_gemma":0.009796454,"domain_scores_codex":[0.999272,0.0003029448,0.00003204329,0.0001419637,0.0001377514,0.0001132645],"domain_scores_gemma":[0.9978174,0.001500865,0.0001955312,0.0001846492,0.000175758,0.0001256767],"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.0001876416,0.0001588521,0.0006069205,0.0002277153,0.00004787926,0.00005528356,0.00006497727,0.945084,0.001902111,0.01481022,0.002279739,0.03457459],"study_design_scores_gemma":[0.00002442753,0.00003156169,0.00006407229,0.000006626791,0.000004132695,0.000005689977,0.00001408028,0.9955952,0.0003001847,0.003186352,0.0007646877,0.000003088266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04978616,0.0005039842,0.9389638,0.000605608,0.0001336345,0.0002401648,0.00016529,0.0009321182,0.008669208],"genre_scores_gemma":[0.3871638,0.0002509312,0.6078917,0.000330929,0.00005208163,0.0004327986,0.0002987089,0.0002024555,0.003376567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007285293,"threshold_uncertainty_score":0.01684362,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003144377,0.0006851167,0.0005363605,0.0006012626,0.0004421723,0.0004696419,0.0009533846,0.0004367683,0.003268181],"category_scores_gemma":[0.001051073,0.0002907804,0.0005563219,0.0006612905,0.0003832925,0.001434245,0.001237603,0.0006698897,0.0005908239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006159854,"about_ca_system_score_gemma":0.001120235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007309958,"about_ca_topic_score_gemma":0.007742565,"domain_scores_codex":[0.9997419,0.00005743903,0.00001266218,0.00007229079,0.000074636,0.00004119936],"domain_scores_gemma":[0.9995655,0.0001803783,0.00005137525,0.0000822391,0.00007935314,0.00004113592],"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.0003853496,0.0001906013,0.001816983,0.0002746848,0.00006670619,0.0002282065,0.0003684795,0.5801115,0.02312362,0.03093762,0.00793774,0.3545585],"study_design_scores_gemma":[0.00003393191,0.00009181989,0.0004518693,0.00001032765,0.00001619514,0.00005742003,0.00005688626,0.9690552,0.005933612,0.0195704,0.004713434,0.000008843138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.061535,0.0001299495,0.9306793,0.0001690441,0.00002254212,0.0001274791,0.0002724031,0.003154769,0.003909606],"genre_scores_gemma":[0.3603066,0.0001916506,0.6342805,0.0001139029,0.00001122604,0.0001720917,0.001269355,0.0003342119,0.003320433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007309958,"threshold_uncertainty_score":0.01453477,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585656,0.0007525363,0.0009018682,0.0004052992,0.0006011362,0.0008644637,0.0008188998,0.0006770055,0.004707454],"category_scores_gemma":[0.001711442,0.0004878406,0.0008635075,0.000500266,0.0005522807,0.0008498346,0.0005712996,0.0007222415,0.0004251022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005638062,"about_ca_system_score_gemma":0.001277552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002426728,"about_ca_topic_score_gemma":0.002054024,"domain_scores_codex":[0.9994522,0.0001980431,0.00002804983,0.0001114353,0.0001168133,0.00009358177],"domain_scores_gemma":[0.9993262,0.0003594681,0.00008518263,0.00007300426,0.00008539524,0.000070675],"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.0002229491,0.0001292369,0.0007332821,0.0002940201,0.00006091034,0.0003113707,0.0002149711,0.880384,0.01434098,0.03922534,0.002235024,0.06184787],"study_design_scores_gemma":[0.00007063853,0.0002541931,0.00042354,0.00001997756,0.00002702252,0.000120816,0.00009870411,0.9645113,0.004378229,0.02400228,0.006074342,0.00001891055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0863083,0.0002995177,0.9059713,0.0002739684,0.00006374316,0.0002623445,0.0004064496,0.0004696541,0.00594465],"genre_scores_gemma":[0.5539167,0.0004806692,0.4370298,0.000121386,0.00006841549,0.0002580354,0.0008879992,0.0001369515,0.007100116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004707454,"threshold_uncertainty_score":0.01574802,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164114,0.0009359845,0.0004485148,0.0004642037,0.0003622772,0.0007996019,0.0008204146,0.0005944116,0.002563164],"category_scores_gemma":[0.003305599,0.0005526214,0.000891647,0.0007733038,0.0008201032,0.001604363,0.00137112,0.001633148,0.0003514508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007633796,"about_ca_system_score_gemma":0.001300035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002275476,"about_ca_topic_score_gemma":0.004856212,"domain_scores_codex":[0.999199,0.0003228869,0.00003899422,0.0001135415,0.0002272411,0.00009841787],"domain_scores_gemma":[0.9987979,0.0008310041,0.0001277433,0.0001317503,0.00007529635,0.00003627652],"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.0002150543,0.0001342112,0.0005339132,0.0002640331,0.00005072729,0.0002290569,0.0002188221,0.8303056,0.007221732,0.06144125,0.002981282,0.09640435],"study_design_scores_gemma":[0.0000787094,0.0001601523,0.0002165678,0.00004894668,0.00003513907,0.00008803979,0.0001497411,0.8891972,0.009013674,0.09411996,0.006870464,0.00002148607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05597319,0.0002767789,0.9313916,0.0004117765,0.00004854507,0.0002572022,0.0003913644,0.001078259,0.01017137],"genre_scores_gemma":[0.3313144,0.000318402,0.6636029,0.0002029391,0.00003177358,0.0003213798,0.0007747984,0.0002707804,0.003162668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002563164,"threshold_uncertainty_score":0.008574665,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627076,0.0009740963,0.0007617449,0.001061298,0.0005475946,0.001067435,0.001399721,0.001041042,0.005993613],"category_scores_gemma":[0.005903268,0.0004631768,0.0007176895,0.001375658,0.001663511,0.001579544,0.001093441,0.001835589,0.0005387756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001734801,"about_ca_system_score_gemma":0.001905738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002855798,"about_ca_topic_score_gemma":0.004125028,"domain_scores_codex":[0.998776,0.0005135125,0.00007175098,0.0001706941,0.0003304142,0.0001375119],"domain_scores_gemma":[0.9972325,0.00197563,0.0002461239,0.0002502782,0.0001788128,0.0001167674],"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.0002070332,0.0001215725,0.0004054828,0.0002481152,0.00002199474,0.0001221623,0.00009223571,0.8449719,0.002602716,0.07299747,0.002384773,0.07582454],"study_design_scores_gemma":[0.00004956601,0.00008125955,0.00013214,0.00004336852,0.000009928606,0.00004018759,0.00003160301,0.9290458,0.001843421,0.06647202,0.002236895,0.0000137446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03117618,0.0003580237,0.9517906,0.0003345891,0.00008015077,0.0002122161,0.0002918559,0.0009255299,0.01483094],"genre_scores_gemma":[0.2751556,0.0001666194,0.7211844,0.0001744638,0.00003317382,0.0003111727,0.0004498716,0.0001730156,0.00235171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005993613,"threshold_uncertainty_score":0.02005059,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001462009,0.0006472527,0.0008656993,0.001199663,0.0005838992,0.0008029087,0.002355903,0.0009636207,0.004447906],"category_scores_gemma":[0.006321534,0.000324876,0.0006457511,0.001647504,0.0006493655,0.001547613,0.001510715,0.00114087,0.0004311052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008407535,"about_ca_system_score_gemma":0.001529148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003138246,"about_ca_topic_score_gemma":0.002761899,"domain_scores_codex":[0.9987689,0.0004039593,0.00007733314,0.0001743042,0.0004360092,0.0001394239],"domain_scores_gemma":[0.9971474,0.001759672,0.000231262,0.0003096895,0.0004381882,0.0001138133],"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.000316969,0.0002574166,0.002159691,0.0002406418,0.00008778321,0.0001595572,0.0001986992,0.551312,0.005656301,0.1047766,0.005501365,0.3293329],"study_design_scores_gemma":[0.00005441466,0.00009398102,0.0002037955,0.00001206959,0.00002301161,0.00009500844,0.00002516743,0.9749963,0.00183575,0.01992788,0.002721384,0.00001125029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05187462,0.000426497,0.9352917,0.0002820551,0.00005604655,0.0001662802,0.0001250609,0.0006154904,0.01116221],"genre_scores_gemma":[0.4512432,0.0002472902,0.5445513,0.0001579819,0.00002468431,0.0002496154,0.0003531287,0.0001216197,0.003051153],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004447906,"threshold_uncertainty_score":0.0148797,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003458442,0.001688105,0.001836283,0.001361788,0.001620413,0.003168428,0.004348559,0.001997944,0.0072544],"category_scores_gemma":[0.02736465,0.0007489135,0.001212094,0.001937478,0.002371239,0.006189651,0.002268574,0.002743292,0.0009222259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003370658,"about_ca_system_score_gemma":0.002855525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005592062,"about_ca_topic_score_gemma":0.00311143,"domain_scores_codex":[0.9958527,0.001291067,0.0001334796,0.0008221744,0.001161163,0.0007395182],"domain_scores_gemma":[0.9714656,0.02194344,0.001951128,0.001844431,0.001641859,0.00115356],"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.0006125075,0.0004867234,0.002872144,0.0004836268,0.0001589737,0.0002531704,0.0003451309,0.7357164,0.005897796,0.183067,0.005492297,0.06461427],"study_design_scores_gemma":[0.00003399568,0.00009810154,0.0002231088,0.00001036435,0.00002057277,0.00008633125,0.00004134121,0.9593786,0.0007702968,0.03800301,0.001320515,0.00001376462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09475861,0.001232879,0.8722067,0.001681909,0.000133306,0.0002801135,0.000414485,0.0005060163,0.02878599],"genre_scores_gemma":[0.8381854,0.0008327143,0.1538033,0.0003713898,0.000254801,0.0003563573,0.000378296,0.0002621834,0.005555512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0072544,"threshold_uncertainty_score":0.02445596,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00311046,0.001078474,0.001202058,0.001687584,0.0005908709,0.001435186,0.001261138,0.001182496,0.00177871],"category_scores_gemma":[0.01560633,0.0009821174,0.00167673,0.001021263,0.002558056,0.002621073,0.002263934,0.001504878,0.0002788581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001839359,"about_ca_system_score_gemma":0.002050295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005849578,"about_ca_topic_score_gemma":0.004336264,"domain_scores_codex":[0.997452,0.0008285494,0.0001777136,0.0005379027,0.0007586465,0.0002451524],"domain_scores_gemma":[0.9908728,0.007065551,0.0007275667,0.0006813575,0.0004414498,0.0002114513],"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.0001157248,0.00002495143,0.0006075561,0.00008786538,0.00005558034,0.0001083579,0.00009205623,0.957187,0.001417431,0.02057224,0.000287294,0.01944395],"study_design_scores_gemma":[0.00001655076,0.00003068495,0.0001223015,0.000009662991,0.0000136395,0.00001630418,0.00002236322,0.9559943,0.001198274,0.04234312,0.0002242187,0.000008629692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06567939,0.0002486468,0.9306722,0.0002160112,0.00001725257,0.00008971429,0.0002685116,0.001393905,0.00141445],"genre_scores_gemma":[0.6404954,0.0002208098,0.3575198,0.00006865563,0.00003120296,0.0001848623,0.0006181023,0.0001852794,0.0006758243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005849578,"threshold_uncertainty_score":0.01644987,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002848455,0.0007211771,0.0009656092,0.001269066,0.000466506,0.0009800578,0.001041651,0.001153332,0.001467052],"category_scores_gemma":[0.02061095,0.0006878265,0.000612016,0.0009413927,0.0007800166,0.001705887,0.0009280298,0.00105395,0.0003970478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364186,"about_ca_system_score_gemma":0.002014435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01414811,"about_ca_topic_score_gemma":0.01403552,"domain_scores_codex":[0.9987963,0.0005306897,0.00006377546,0.0001799255,0.0003138313,0.0001153033],"domain_scores_gemma":[0.9889362,0.007729771,0.0007670188,0.001264606,0.001104168,0.0001982526],"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.0002729495,0.00009023877,0.009363391,0.00004756559,0.00005375879,0.00004271396,0.00006872189,0.9357862,0.0014375,0.008657491,0.000810427,0.04336909],"study_design_scores_gemma":[0.000007460452,0.00001394174,0.0004122463,0.000002800777,0.00000405436,0.000004212118,0.000007527977,0.9951637,0.0003991661,0.003894825,0.00008652564,0.000003445106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.305301,0.0003216432,0.6902965,0.0002354113,0.00002646341,0.0001267532,0.0003067524,0.00105171,0.002333777],"genre_scores_gemma":[0.8352076,0.00009487817,0.1632662,0.0000504912,0.00001167081,0.0002003765,0.0005259819,0.00008791867,0.0005548666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01414811,"threshold_uncertainty_score":0.02813154,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005696455,0.001851258,0.002402924,0.00212353,0.001010407,0.002688888,0.002870779,0.002571339,0.0146995],"category_scores_gemma":[0.01875958,0.001349513,0.002027377,0.002672032,0.001651927,0.005551975,0.003021389,0.004351318,0.00434266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525883,"about_ca_system_score_gemma":0.002946925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007497427,"about_ca_topic_score_gemma":0.007512536,"domain_scores_codex":[0.996172,0.001400948,0.0001783125,0.0005488764,0.001410698,0.0002891136],"domain_scores_gemma":[0.9923394,0.004325844,0.0004363576,0.001457175,0.001255567,0.0001856269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005313485,0.0002269815,0.001534107,0.000561649,0.0002376097,0.0001507282,0.0003792328,0.3028927,0.008479758,0.1651318,0.03168786,0.4881864],"study_design_scores_gemma":[0.0002552847,0.0001580905,0.0003418031,0.0002321753,0.00007358639,0.0001733779,0.00008852003,0.8610642,0.003572377,0.1061461,0.02783892,0.00005563732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007139287,0.002003346,0.9772887,0.0006966484,0.0002186824,0.0001605958,0.0001960251,0.002009704,0.01028702],"genre_scores_gemma":[0.08035788,0.001366324,0.9054767,0.001461721,0.0002791132,0.0006197559,0.0005560587,0.001487266,0.008395161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0146995,"threshold_uncertainty_score":0.04917467,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001535753,0.0006668001,0.0003847323,0.0006926001,0.0006342104,0.001383391,0.001230412,0.0005895801,0.004231965],"category_scores_gemma":[0.004243732,0.000476127,0.0008624351,0.000886463,0.001606045,0.002705144,0.001448859,0.001311515,0.0005329496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001732218,"about_ca_system_score_gemma":0.002169931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01007068,"about_ca_topic_score_gemma":0.01740364,"domain_scores_codex":[0.9988983,0.0004141956,0.00006596585,0.0001861301,0.0002645869,0.0001707886],"domain_scores_gemma":[0.9976715,0.001644886,0.0001928538,0.0002151122,0.0001742137,0.0001012973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000720678,0.0003346007,0.002745576,0.0008678854,0.0001245798,0.0009476173,0.001158093,0.5298626,0.01751592,0.298514,0.007122869,0.1400856],"study_design_scores_gemma":[0.0000706498,0.0001286911,0.0003811371,0.00005658132,0.00005801809,0.0001446199,0.0001426554,0.8845692,0.01576167,0.08948602,0.009168973,0.00003185271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09828173,0.0005042379,0.8763705,0.0006611441,0.0000812272,0.0001466772,0.0008225937,0.008242765,0.01488904],"genre_scores_gemma":[0.5365755,0.0003421259,0.4571124,0.0002179446,0.00003414739,0.0001407972,0.0009031076,0.0005510758,0.004122908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01007068,"threshold_uncertainty_score":0.02002412,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623843,0.0005289881,0.0003339642,0.0002891429,0.0005120285,0.0006938467,0.0004837619,0.0004418837,0.003226291],"category_scores_gemma":[0.001590033,0.0003188417,0.0003353354,0.0004524219,0.0003186308,0.0004426586,0.0002914398,0.0005082207,0.0002436541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433572,"about_ca_system_score_gemma":0.002713691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02888492,"about_ca_topic_score_gemma":0.034858,"domain_scores_codex":[0.9997718,0.00006792565,0.000007591016,0.00004135211,0.00003944582,0.00007184334],"domain_scores_gemma":[0.9992623,0.000328214,0.0001153674,0.00004415521,0.0001223261,0.0001277569],"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.0004091426,0.000203195,0.002706583,0.00007663017,0.00003002857,0.00009268831,0.00008376383,0.952453,0.008851047,0.002073858,0.002228692,0.03079137],"study_design_scores_gemma":[0.00005055459,0.000230517,0.001568248,0.000004093627,0.00001273793,0.00000964532,0.0001073321,0.9923535,0.003316975,0.0009810493,0.001356776,0.000008650405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7603179,0.0001614084,0.2199471,0.0006845542,0.00009995149,0.00059941,0.0008505873,0.001114589,0.01622458],"genre_scores_gemma":[0.9358017,0.00008817642,0.06147754,0.00005114744,0.00001272977,0.0001299756,0.0004251889,0.00006380827,0.001949836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02888492,"threshold_uncertainty_score":0.05743361,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461834,0.0009725096,0.001314273,0.000329802,0.000943075,0.001167903,0.001722438,0.001005182,0.002082478],"category_scores_gemma":[0.004090379,0.0006910619,0.0006270625,0.000371497,0.001907244,0.001231672,0.002844833,0.00170312,0.0002503915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174446,"about_ca_system_score_gemma":0.001677247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01099199,"about_ca_topic_score_gemma":0.008735782,"domain_scores_codex":[0.9992625,0.0001680861,0.00003442586,0.0002618368,0.0001329331,0.0001401942],"domain_scores_gemma":[0.997658,0.001436143,0.0002767989,0.0001916562,0.0002222553,0.0002151737],"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.00007916016,0.00004435632,0.0002830895,0.0000321525,0.00001997802,0.00008403161,0.00007324862,0.9864071,0.001278718,0.003008853,0.0001777832,0.008511489],"study_design_scores_gemma":[0.00002788714,0.0000263428,0.00007781457,0.000002045389,0.000003691961,0.000007558583,0.00001399377,0.9963407,0.0002243126,0.003119482,0.0001526911,0.000003360363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08842686,0.0001879701,0.9069676,0.0003502815,0.00006718203,0.00009802449,0.00004254959,0.0005923818,0.003267077],"genre_scores_gemma":[0.9604593,0.00006500552,0.03770987,0.00005132174,0.00002431206,0.0001432903,0.00004034622,0.00002765441,0.001478948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01099199,"threshold_uncertainty_score":0.02185601,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01752023,0.001520621,0.0009355431,0.003360399,0.00276705,0.01062128,0.004292131,0.003303085,0.003486735],"category_scores_gemma":[0.05836134,0.001612563,0.002594177,0.001920463,0.009990457,0.01731761,0.006611655,0.007158833,0.0006042456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005012096,"about_ca_system_score_gemma":0.006618462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01024523,"about_ca_topic_score_gemma":0.01014965,"domain_scores_codex":[0.986667,0.007578482,0.0007382967,0.001413236,0.003028389,0.0005746108],"domain_scores_gemma":[0.944313,0.04316473,0.003753456,0.005301006,0.002728791,0.0007389535],"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.0005193709,0.0002473567,0.006699043,0.001087102,0.0005141608,0.001583691,0.02189883,0.1011346,0.005576297,0.6710749,0.006125025,0.1835395],"study_design_scores_gemma":[0.00008191403,0.00008041559,0.0006132699,0.0002832261,0.0001625537,0.0003085133,0.002636799,0.2086345,0.003450881,0.7685893,0.01505395,0.0001047465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02912167,0.0007900838,0.9539829,0.005510661,0.0001201487,0.000139751,0.0001113975,0.001216267,0.009007095],"genre_scores_gemma":[0.5565706,0.000913972,0.4386599,0.0009643061,0.00009715365,0.0002592603,0.000379035,0.0001931295,0.001962657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01752023,"threshold_uncertainty_score":0.09265697,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002303396,0.001416438,0.0006977966,0.001288787,0.0003796067,0.001375157,0.002027462,0.001136323,0.001825213],"category_scores_gemma":[0.01150373,0.0009407185,0.001211487,0.001294309,0.0006853944,0.001916669,0.000924446,0.002442,0.0003931858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001665263,"about_ca_system_score_gemma":0.002405331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01074355,"about_ca_topic_score_gemma":0.01850317,"domain_scores_codex":[0.9988962,0.0003681509,0.0000798636,0.0003537076,0.0002198568,0.00008220661],"domain_scores_gemma":[0.9903795,0.00775809,0.0005066326,0.0005519215,0.0006125863,0.000191253],"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.00005513585,0.0001040585,0.001867626,0.00006348356,0.00003314004,0.00005524881,0.00004196399,0.9717225,0.0002899298,0.003011336,0.001118464,0.02163721],"study_design_scores_gemma":[0.000009274301,0.000009660675,0.0001075258,0.000004099209,0.000003932698,0.000005128921,0.00001237117,0.9945857,0.0002270023,0.00473085,0.0003021885,0.000002341759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09270708,0.0003101555,0.8982129,0.001179762,0.00008174234,0.0002470633,0.002944487,0.002519602,0.001797246],"genre_scores_gemma":[0.5721614,0.0004319542,0.4168536,0.0002757299,0.00008635876,0.0005598704,0.007889194,0.000200848,0.001541091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01074355,"threshold_uncertainty_score":0.02136207,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001693075,0.0014295,0.001074915,0.0007241789,0.0004761571,0.001656498,0.002038897,0.001343936,0.004378292],"category_scores_gemma":[0.004712573,0.0006710159,0.001211032,0.001250765,0.0009537566,0.001752231,0.001599898,0.001867873,0.0006449193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003097,"about_ca_system_score_gemma":0.002537584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004089835,"about_ca_topic_score_gemma":0.005839742,"domain_scores_codex":[0.9988134,0.0004958851,0.00006963927,0.0002091951,0.0002666948,0.0001451807],"domain_scores_gemma":[0.9975304,0.001550188,0.0002462475,0.000383011,0.0001959224,0.00009419295],"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.0001182883,0.0001907963,0.0005682047,0.0002384979,0.000101544,0.0000648316,0.00006657602,0.8768296,0.001535294,0.02858363,0.002703385,0.08899946],"study_design_scores_gemma":[0.00005824417,0.00004665229,0.00005421296,0.00001679487,0.00001556932,0.00001935635,0.00002353663,0.9881982,0.0008363266,0.008728747,0.001995557,0.000006764252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0147297,0.0003732149,0.9770608,0.0002053335,0.00005156934,0.0001285523,0.00009847745,0.0008631978,0.006489225],"genre_scores_gemma":[0.1956855,0.0004136006,0.8009113,0.0002182792,0.00004174044,0.0004110733,0.0003065316,0.0002414723,0.001770456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004378292,"threshold_uncertainty_score":0.01464683,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244285,0.001022582,0.0009328044,0.000805682,0.0007409803,0.001229624,0.001221369,0.0008261446,0.004130099],"category_scores_gemma":[0.006327174,0.00052143,0.0008412444,0.0009652117,0.001654367,0.002721406,0.002338866,0.001768854,0.0005874912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001253528,"about_ca_system_score_gemma":0.002216368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007950091,"about_ca_topic_score_gemma":0.009831643,"domain_scores_codex":[0.9989758,0.0003378669,0.0000391291,0.0001773901,0.0003168791,0.0001529789],"domain_scores_gemma":[0.9980848,0.001259549,0.0001073457,0.0003129796,0.000168961,0.00006639679],"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.0001455397,0.00007011519,0.001267442,0.0002490807,0.0000331196,0.00009539312,0.0003256504,0.7841231,0.003746018,0.04695265,0.003652246,0.1593396],"study_design_scores_gemma":[0.00002575382,0.00005231834,0.0002470638,0.00003343428,0.00001704961,0.00003938194,0.00008306389,0.9461133,0.00248444,0.04720271,0.003687413,0.00001399013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04873975,0.001389785,0.9377747,0.0006302603,0.00005530121,0.000077362,0.0001025577,0.002449384,0.008781046],"genre_scores_gemma":[0.5245824,0.0008099619,0.469947,0.0001946266,0.00005113671,0.0001948818,0.0002665393,0.0005665278,0.003386987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007950091,"threshold_uncertainty_score":0.01580763,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005114531,0.0004610443,0.0005747394,0.0005771643,0.000496732,0.0006193323,0.0009290795,0.0005709804,0.002729383],"category_scores_gemma":[0.001514882,0.0002434298,0.000375808,0.0008622356,0.0006610873,0.000992225,0.001241167,0.000929713,0.0004246925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005634865,"about_ca_system_score_gemma":0.001704658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006566016,"about_ca_topic_score_gemma":0.008282413,"domain_scores_codex":[0.9996151,0.00009731066,0.00002260001,0.00007380806,0.0001440607,0.00004711761],"domain_scores_gemma":[0.9995091,0.0002081575,0.00004299248,0.00008397803,0.0001013372,0.00005450263],"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.0003809164,0.0001396888,0.001239255,0.0001568843,0.00005054195,0.0001615793,0.0001265263,0.7086121,0.009121652,0.04657548,0.003317424,0.2301179],"study_design_scores_gemma":[0.00002901484,0.00005310652,0.00008585736,0.000003591176,0.00000685551,0.00002292889,0.00001211319,0.9901888,0.002163088,0.005747238,0.001681899,0.00000554804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01707758,0.0001228721,0.9781099,0.00008275056,0.00004016337,0.00006780021,0.00006334748,0.001287185,0.003148423],"genre_scores_gemma":[0.3938951,0.0001170961,0.6028639,0.00006313562,0.00001935624,0.0001313045,0.0002423284,0.0001195079,0.002548263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006566016,"threshold_uncertainty_score":0.01305562,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205433,0.001451506,0.001017125,0.001110859,0.0005666874,0.002470883,0.002483446,0.001640567,0.005158152],"category_scores_gemma":[0.005359576,0.0008745698,0.001978728,0.002169215,0.001632333,0.002799305,0.002651821,0.003344464,0.0008165455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001720523,"about_ca_system_score_gemma":0.003121483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005077083,"about_ca_topic_score_gemma":0.007424579,"domain_scores_codex":[0.9984188,0.0006553555,0.00009692716,0.0002892819,0.0004111551,0.000128542],"domain_scores_gemma":[0.9980339,0.001264086,0.0001573148,0.0003280263,0.0001536013,0.00006304751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004270742,0.00007913866,0.0003806631,0.0003003265,0.00006349826,0.0000602521,0.00009138048,0.6825181,0.00120678,0.2438719,0.004359737,0.06702553],"study_design_scores_gemma":[0.00001712781,0.00001453983,0.00002865391,0.00002797048,0.000008497509,0.00002066235,0.00001770033,0.9154052,0.0007321766,0.0780587,0.005659976,0.000008793625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001868844,0.0001784203,0.9934415,0.0002119113,0.0000240628,0.00006367478,0.0001577807,0.0004508374,0.00360303],"genre_scores_gemma":[0.09662265,0.0005954393,0.8985479,0.0002676193,0.00004180269,0.0005321818,0.000616663,0.0003774933,0.00239825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005158152,"threshold_uncertainty_score":0.01725572,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415637,0.001136329,0.0009412447,0.001361733,0.0004906993,0.001088896,0.001268196,0.001147415,0.007387501],"category_scores_gemma":[0.006103185,0.0005747394,0.0008698894,0.001403536,0.001075599,0.001311062,0.001223727,0.001777056,0.0007572972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001835779,"about_ca_system_score_gemma":0.001882871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003950563,"about_ca_topic_score_gemma":0.006342037,"domain_scores_codex":[0.9989445,0.0004741836,0.00005313931,0.0001427223,0.000265466,0.0001201175],"domain_scores_gemma":[0.9972314,0.002191594,0.0001556901,0.0001658095,0.0001784281,0.00007699703],"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.0001556301,0.00007197056,0.0004383633,0.0002669404,0.00003123825,0.0001103,0.0000792081,0.8676476,0.001487694,0.03292225,0.004196129,0.09259265],"study_design_scores_gemma":[0.00004212671,0.00005236833,0.0001172333,0.00005847355,0.00001582712,0.00003563711,0.00002592697,0.9574096,0.0008538751,0.03903743,0.00234219,0.000009389052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01149439,0.0007912388,0.9779563,0.0002095225,0.00004229116,0.0001476584,0.0002884943,0.001141265,0.007928815],"genre_scores_gemma":[0.2617546,0.0005415182,0.7323189,0.0002911584,0.00005440165,0.0006152841,0.001126832,0.0003790866,0.00291812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007387501,"threshold_uncertainty_score":0.02471364,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002577512,0.001286065,0.001572303,0.001105128,0.0008745935,0.001362667,0.001707937,0.002176135,0.00408179],"category_scores_gemma":[0.01215456,0.0006643748,0.0007722876,0.0009849966,0.001855307,0.002843885,0.002981544,0.002312591,0.0007445677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001282767,"about_ca_system_score_gemma":0.001735792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003497471,"about_ca_topic_score_gemma":0.004962069,"domain_scores_codex":[0.9987851,0.0004390092,0.00005761975,0.0001988199,0.0003670843,0.0001523982],"domain_scores_gemma":[0.9965203,0.002335171,0.0002185465,0.0003773895,0.0003646854,0.000183833],"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.0002652561,0.0001659704,0.001513392,0.0002663728,0.00004489318,0.0001371273,0.0004044216,0.7262642,0.002397601,0.1342463,0.005614808,0.1286797],"study_design_scores_gemma":[0.00003140588,0.00005297083,0.0001294305,0.00002116895,0.00001171224,0.00002223197,0.00003235844,0.9321992,0.0005117735,0.065249,0.001732046,0.000006673428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05920121,0.0007054519,0.9281924,0.0008936102,0.00008747844,0.0001152139,0.0001346625,0.001504623,0.009165411],"genre_scores_gemma":[0.6478961,0.0004243259,0.3455304,0.000427861,0.0001489444,0.0002265613,0.0004911911,0.0002902437,0.004564441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00408179,"threshold_uncertainty_score":0.01365495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}