{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":94,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":94,"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":"3e7b204624f3","filters":{"venue":"Proceedings of the International Symposium on Combinatorial Search"}},"results":[{"id":"W2949992533","doi":"10.1609/socs.v10i1.18510","title":"Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":276,"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":"Computer science; Pathfinding; Traverse; Benchmark (surveying); Terminology; Constraint (computer-aided design); Key (lock); Operations research; Theoretical computer science; Shortest path problem; Mathematics; Computer security","authors":[{"name":"Roni Stern","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Ariel Felner","is_ca":false},{"name":"Sven Koenig","is_ca":false},{"name":"Hang Ma","is_ca":false},{"name":"Thayne T. Walker","is_ca":false},{"name":"Jiaoyang Li","is_ca":false},{"name":"Dor Atzmon","is_ca":false},{"name":"Liron Cohen","is_ca":false},{"name":"T. K. Satish Kumar","is_ca":false},{"name":"Roman Barták","is_ca":false},{"name":"Eli Boyarski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04275484513429419,"gpt":0.2752149483165113,"spread":0.2324601031822171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001081765,0.0003539103,0.0004022031,0.0002008082,0.0002440622,0.0009493278,0.003695951,0.0003263706,0.00001668015],"category_scores_gemma":[0.0004335906,0.0003080135,0.0002086521,0.0003018849,0.0001291891,0.0002998063,0.006050449,0.00119993,0.000005645536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003476575,"about_ca_system_score_gemma":0.0002708383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001681122,"about_ca_topic_score_gemma":5.602631e-7,"domain_scores_codex":[0.9963878,0.00005128188,0.0005665958,0.000955048,0.001663336,0.0003759062],"domain_scores_gemma":[0.9977111,0.0002362502,0.0004344799,0.0004254239,0.001038351,0.0001544023],"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.0001496297,0.002816711,0.01929136,0.0008169729,0.001146934,0.00007016418,0.006998152,0.003026274,0.06127611,0.8973351,0.005068517,0.002004043],"study_design_scores_gemma":[0.009739325,0.001129503,0.07735433,0.009245012,0.0003151605,0.0004524016,0.001092051,0.641916,0.1398222,0.1129097,0.002235597,0.003788735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8563405,0.0005404134,0.01040001,0.02876768,0.07544325,0.002596935,0.0002263705,0.0004026548,0.02528219],"genre_scores_gemma":[0.9532281,0.0002642351,0.04550761,0.0001658842,0.0005298405,0.00008412103,0.0000419578,0.00003368742,0.0001445291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7844254,"threshold_uncertainty_score":0.9999372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2575840041","doi":"10.1609/socs.v7i1.18390","title":"A Hybrid Quantum-Classical Approach to Solving Scheduling Problems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"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":"NIH Office of the Director; Advanced Exploration Systems; Ames Research Center; Intelligence Advanced Research Projects Activity; Air Force Research Laboratory; Office of the Director of National Intelligence; National Aeronautics and Space Administration","keywords":"Quantum annealing; Computer science; Heuristics; Scheduling (production processes); Mathematical optimization; Quantum; Simulated annealing; Quantum computer; Algorithm; Mathematics","authors":[{"name":"Tony Tran","is_ca":true},{"name":"N. Minh","is_ca":false},{"name":"Eleanor Rieffel","is_ca":false},{"name":"Jeremy Frank","is_ca":false},{"name":"Zhihui Wang","is_ca":false},{"name":"Bryan O’Gorman","is_ca":false},{"name":"Davide Venturelli","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01551119608817965,"gpt":0.2435012653451337,"spread":0.2279900692569541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246152,0.0002080341,0.0002461525,0.0001181136,0.0002704305,0.0005277336,0.002804038,0.00006506003,0.000004030044],"category_scores_gemma":[0.0003210248,0.0001626796,0.0001875654,0.0005790497,0.00006343592,0.0002204336,0.001936875,0.000555309,0.00001450527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001542322,"about_ca_system_score_gemma":0.0001521769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002500069,"about_ca_topic_score_gemma":2.064408e-7,"domain_scores_codex":[0.997019,0.00002999382,0.0003813175,0.0006766881,0.001483394,0.0004096419],"domain_scores_gemma":[0.9983409,0.0001551933,0.0001397473,0.0002735344,0.0009277057,0.0001629],"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.00004015548,0.0006617255,0.0003288967,0.0000695052,0.00007758363,0.000003491518,0.0008784024,0.01214269,0.09608508,0.8869137,0.0008572493,0.001941543],"study_design_scores_gemma":[0.0008184362,0.0002199175,0.0002889722,0.000323036,0.000008043909,0.00009339399,0.00005067566,0.771936,0.1848827,0.03726029,0.003800697,0.0003177884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9307831,0.00003556671,0.01550484,0.02699606,0.006945164,0.0005061355,0.000007839169,0.0001971656,0.01902416],"genre_scores_gemma":[0.9849193,0.000004970803,0.01385811,0.0003082194,0.0006728857,0.00002315429,0.000001731862,0.00002154068,0.0001901289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8496534,"threshold_uncertainty_score":0.6633881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1634932822","doi":"10.1609/socs.v2i1.18200","title":"Degrees of Separation in Social Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":66,"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; Node (physics); Degree (music); Six degrees of separation; The Internet; Greedy algorithm; Social network (sociolinguistics); Theoretical computer science; Social media; World Wide Web; Algorithm; Engineering","authors":[{"name":"Reza Bakhshandeh","is_ca":false},{"name":"Mehdi Samadi","is_ca":false},{"name":"Zohreh Azimifar","is_ca":false},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01999027754451357,"gpt":0.2756694242229075,"spread":0.255679146678394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004130113,0.00007482827,0.000130985,0.00006704741,0.00007001052,0.0000876776,0.001022385,0.00005999817,0.00000481627],"category_scores_gemma":[0.00007430929,0.00006435417,0.00009996839,0.0003622435,0.0000386771,0.0002215149,0.0004322591,0.0002033356,0.000001556219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022548,"about_ca_system_score_gemma":0.00006023683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000103818,"about_ca_topic_score_gemma":0.000005328767,"domain_scores_codex":[0.9987115,0.00002018345,0.000253783,0.0002045748,0.0006798595,0.0001300589],"domain_scores_gemma":[0.9990703,0.00007966572,0.0001197461,0.00008262625,0.0006263789,0.00002128537],"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.00009552395,0.0002789749,0.0112939,0.00001625445,0.00003501065,0.000001379664,0.0004271712,0.001598707,0.08940233,0.8954108,0.0008128915,0.0006270363],"study_design_scores_gemma":[0.004872672,0.0004857195,0.05210719,0.0005412674,0.00002505086,0.00002878729,0.0003442681,0.4524007,0.4499484,0.037182,0.001493084,0.0005709234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9814582,0.00002458851,0.0002870428,0.004445734,0.002873447,0.0001086887,0.000002309095,0.00002027606,0.01077969],"genre_scores_gemma":[0.9994026,0.00001347662,0.00007123918,0.00004857654,0.0002642954,0.000005762573,0.000001242881,0.000004650022,0.0001881918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8582288,"threshold_uncertainty_score":0.2624287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1659382545","doi":"10.1609/socs.v2i1.18205","title":"A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","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":"University of Alberta","funders":"","keywords":"Pathfinding; Tree (set theory); Computer science; Time complexity; Variety (cybernetics); Constructive; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Shortest path problem; Process (computing); Combinatorics; Graph; Programming language","authors":[{"name":"Mokhtar Khorshid","is_ca":true},{"name":"Robert C. Holte","is_ca":true},{"name":"Nathan Sturtevant","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01992492518198036,"gpt":0.2729742948879271,"spread":0.2530493697059467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008462198,0.000222402,0.0002805255,0.0001191813,0.0002522071,0.0003614081,0.002512117,0.000121144,0.00001052205],"category_scores_gemma":[0.0002780436,0.0001925385,0.0002451869,0.0004116342,0.00006843813,0.0003564325,0.001054053,0.0003059406,0.00003512385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003243881,"about_ca_system_score_gemma":0.0002068561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002770525,"about_ca_topic_score_gemma":8.403142e-8,"domain_scores_codex":[0.9973431,0.00002030146,0.0004227614,0.0006087325,0.001169475,0.0004356575],"domain_scores_gemma":[0.9979525,0.0002604668,0.0002290147,0.0002517318,0.001178977,0.0001273113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002567453,0.002839665,0.002353979,0.0001567265,0.0007453046,0.00004066743,0.003801944,0.002613235,0.8907481,0.03795072,0.02989229,0.02860058],"study_design_scores_gemma":[0.00220968,0.0002412621,0.0004757571,0.000165239,0.00001510094,0.00003594224,0.00005090627,0.5922694,0.4019206,0.0003560354,0.002003349,0.0002566628],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4941734,0.0001123506,0.3657448,0.03994996,0.0767971,0.004864091,0.0003642068,0.0008049646,0.01718916],"genre_scores_gemma":[0.4485005,0.00001990117,0.5432491,0.0004510542,0.002280093,0.0002197212,0.0000235041,0.00009002596,0.005166026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5896562,"threshold_uncertainty_score":0.7851494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293698321","doi":"10.1609/socs.v1i1.18154","title":"High-Quality Policies for the Canadian Traveler's Problem","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Quality (philosophy); Path (computing); Adverse weather; Property (philosophy); Operations research; Distribution (mathematics); Mathematical optimization; Mathematics; Geography","authors":[{"name":"Patrick Eyerich","is_ca":false},{"name":"Thomas Keller","is_ca":false},{"name":"Malte Helmert","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0243110548845658,"gpt":0.3153885064059963,"spread":0.2910774515214305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508172,0.00008103622,0.00009147561,0.00006414405,0.001029295,0.0002223517,0.0009396633,0.0001104971,0.00004481499],"category_scores_gemma":[0.0003401247,0.00005550602,0.00008398519,0.0002122408,0.0002530633,0.0001380878,0.00002086028,0.0002743628,0.000003217129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001489864,"about_ca_system_score_gemma":0.0003437197,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.2471268,"about_ca_topic_score_gemma":0.1039426,"domain_scores_codex":[0.9985341,0.00001435257,0.000224931,0.0001542439,0.0008357897,0.0002365861],"domain_scores_gemma":[0.9984515,0.0002435633,0.0001283668,0.00006784942,0.001010936,0.00009780937],"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.00006326436,0.00003966763,0.007485502,0.000007895846,0.00002227735,2.526138e-8,0.003413804,0.0001887222,0.004299349,0.9828709,0.001416773,0.0001917563],"study_design_scores_gemma":[0.004698595,0.0004047378,0.194602,0.0001819376,0.0001238829,0.000002328463,0.005946116,0.0009734694,0.09438878,0.212262,0.4855138,0.0009023829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8227155,0.00000399906,0.000019202,0.1055521,0.008973865,0.001131234,0.0001081607,0.00005752497,0.06143847],"genre_scores_gemma":[0.9976791,0.000008298839,0.0002444438,0.0001957556,0.0007955468,0.0000524313,0.000007787885,0.00001023671,0.001006472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.770609,"threshold_uncertainty_score":0.9124081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037524112","doi":"10.1609/socs.v11i1.18524","title":"New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","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); Context (archaeology); Computer science; Symmetry (geometry); Timeout; Symmetry breaking; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Physics; Geometry","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.03613716419832629,"gpt":0.3066897939320542,"spread":0.2705526297337279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009184407,0.0001658142,0.000215231,0.0001661339,0.000112887,0.0002465608,0.001960615,0.0001058785,0.000004042793],"category_scores_gemma":[0.0004774471,0.0001449754,0.0001394703,0.0005474547,0.00002831603,0.0003250059,0.0008029601,0.000312871,0.000003660231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003874115,"about_ca_system_score_gemma":0.0001982121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001251562,"about_ca_topic_score_gemma":0.000001003045,"domain_scores_codex":[0.9978748,0.00002155902,0.0003848037,0.0004787944,0.0009132945,0.0003267514],"domain_scores_gemma":[0.9986761,0.0002626977,0.0001815424,0.0001931086,0.00059951,0.00008709246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001711564,0.001062102,0.02827174,0.0001940625,0.0001510235,0.00002601994,0.002192905,0.0004500498,0.1736988,0.7603459,0.004564571,0.0288716],"study_design_scores_gemma":[0.002920677,0.0004075285,0.004479036,0.001162204,0.00001448963,0.00004741,0.0001363626,0.0851998,0.8795759,0.02223695,0.003354076,0.0004655403],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4802926,0.0003120477,0.3649836,0.06386807,0.05397664,0.005613956,0.00009484933,0.001264371,0.02959383],"genre_scores_gemma":[0.8391007,0.00001496871,0.1594521,0.0001601839,0.0005632378,0.00006101835,0.000003637525,0.00002707816,0.0006170421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.738109,"threshold_uncertainty_score":0.5911925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734058336","doi":"10.1609/socs.v8i1.18421","title":"Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"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":"Markov decision process; Linear temporal logic; Automaton; Computer science; Markov process; Temporal logic; Mathematical optimization; Planner; State (computer science); Quality (philosophy); Finite-state machine; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm","authors":[{"name":"Alberto Rivas","is_ca":true},{"name":"Oscar Chen","is_ca":false},{"name":"Scott Sanner","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0432312004337493,"gpt":0.3062496548638452,"spread":0.2630184544300959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689851,0.0002029098,0.0002639154,0.0002413691,0.0001794826,0.0003572887,0.003466487,0.0001444787,0.00002090391],"category_scores_gemma":[0.0006937144,0.0001858596,0.0001493849,0.001090127,0.00009620345,0.0008036686,0.001664973,0.0004723988,0.0000164528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005705086,"about_ca_system_score_gemma":0.0002003766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001621876,"about_ca_topic_score_gemma":0.000002049774,"domain_scores_codex":[0.9963443,0.0000738926,0.0005911122,0.0006559202,0.001896529,0.0004382819],"domain_scores_gemma":[0.9977181,0.000194127,0.0001947547,0.0004071331,0.001379857,0.0001060286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001516239,0.0003211859,0.005558209,0.00009510909,0.00004636274,0.000006128371,0.001633969,0.0002534516,0.6469468,0.3418897,0.0004301817,0.002667311],"study_design_scores_gemma":[0.0009897404,0.0001287996,0.003246268,0.0003791031,0.00000458158,0.00001647081,0.0001308979,0.04507723,0.9337495,0.01463273,0.001406566,0.0002381189],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9298789,0.0000324062,0.005958208,0.0123934,0.009673551,0.0006845643,0.000008190449,0.0001255727,0.04124523],"genre_scores_gemma":[0.9809046,0.00003590183,0.01822399,0.0001604919,0.0003736033,0.0000417659,0.000002379429,0.00002487182,0.0002323424],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.327257,"threshold_uncertainty_score":0.7579135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295532854","doi":"10.1609/socs.v1i1.18160","title":"Common Misconceptions Concerning Heuristic Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":34,"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":"Heuristics; Incremental heuristic search; Heuristic; Node (physics); Null-move heuristic; Beam search; Consistent heuristic; Bidirectional search; Simple (philosophy); Computer science; Best-first search; Search algorithm; Function (biology); Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Epistemology; Engineering","authors":[{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01937709620342645,"gpt":0.2739802742194933,"spread":0.2546031780160668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252469,0.0001655759,0.0001815256,0.0001100476,0.0003797823,0.0003672467,0.003141575,0.0001132311,0.00005159861],"category_scores_gemma":[0.0002208428,0.0001343751,0.0001206266,0.0003554201,0.000222577,0.0003411403,0.0007482808,0.000986249,0.00004386852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009722846,"about_ca_system_score_gemma":0.0001168507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002066988,"about_ca_topic_score_gemma":0.000002986018,"domain_scores_codex":[0.9977111,0.00003315333,0.000327618,0.0003900391,0.001203856,0.0003342431],"domain_scores_gemma":[0.9983813,0.0004433343,0.0001541737,0.000252791,0.0006484094,0.0001199867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005858083,0.0001607859,0.01786193,0.00002903734,0.00004486311,0.000001634221,0.0009768826,0.0002920633,0.1603824,0.8170647,0.001831239,0.001295898],"study_design_scores_gemma":[0.004297404,0.0009911504,0.01149416,0.0008603719,0.00004582881,0.0001161558,0.0003483828,0.1119116,0.7538172,0.07672968,0.03815055,0.001237509],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9393705,0.0000123697,0.0005303187,0.01203144,0.007134639,0.0003289472,0.00001489078,0.0001497481,0.0404272],"genre_scores_gemma":[0.997801,0.000004417301,0.001026357,0.0001406385,0.0004614909,0.00001633563,0.00000327743,0.00001583916,0.0005306176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.740335,"threshold_uncertainty_score":0.5837881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408443083","doi":"10.1609/socs.v3i1.18227","title":"Partial-Expansion A* with Selective Node Generation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"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":"Node (physics); A priori and a posteriori; Computer science; Branching (polymer chemistry); Domain (mathematical analysis); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Mathematical optimization; Engineering","authors":[{"name":"Ariel Felner","is_ca":false},{"name":"Meir Goldenberg","is_ca":false},{"name":"Guni Sharon","is_ca":false},{"name":"Roni Stern","is_ca":false},{"name":"Tal Beja","is_ca":false},{"name":"Nathan Sturtevant","is_ca":false},{"name":"Robert C. Holte","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01693971839691495,"gpt":0.253200546666199,"spread":0.2362608282692841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775497,0.0001222372,0.0001274485,0.00004801096,0.000194931,0.0002601477,0.001164114,0.00005891388,0.0000124389],"category_scores_gemma":[0.00006648192,0.00008329333,0.00006030286,0.0003927167,0.00004306778,0.0005323924,0.0006716879,0.0002203423,0.000008429983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001300206,"about_ca_system_score_gemma":0.0001383502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005159025,"about_ca_topic_score_gemma":0.00000149013,"domain_scores_codex":[0.9980552,0.00002019087,0.0002017618,0.0004038209,0.001136952,0.0001821159],"domain_scores_gemma":[0.9983211,0.00005384831,0.0001223884,0.0002017127,0.001240383,0.00006063332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001339924,0.0004732624,0.002244786,0.00001492322,0.00006975929,0.000003902887,0.0004570603,0.0004298382,0.5536497,0.4364556,0.004423901,0.001643201],"study_design_scores_gemma":[0.0008483897,0.0001863417,0.0007670566,0.00008514601,0.000006421759,0.00001865357,0.00002272988,0.04258331,0.9496563,0.002791257,0.002903783,0.0001305807],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9528295,0.0000304906,0.008679268,0.01583515,0.006933942,0.0004220121,0.00001773065,0.0001184524,0.01513343],"genre_scores_gemma":[0.9966128,0.00001760554,0.002416257,0.0001767538,0.0005225343,0.0000183832,0.000007784513,0.00001056352,0.000217332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4336644,"threshold_uncertainty_score":0.3396603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2248489652","doi":"10.1609/socs.v1i1.18169","title":"Portal-Based True-Distance Heuristics for Path Finding","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":26,"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","keywords":"Heuristics; Heuristic; Computer science; Path (computing); Domain (mathematical analysis); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","authors":[{"name":"Meir Goldenberg","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01715329244094359,"gpt":0.2746854282668801,"spread":0.2575321358259365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009022553,0.0001733238,0.000187805,0.00009944235,0.0002133838,0.0002514192,0.002945513,0.0001087663,0.000006850522],"category_scores_gemma":[0.0006244319,0.0001418017,0.0001430809,0.0002889467,0.00009845501,0.0002328917,0.0003089623,0.0004399486,0.000006602089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009117241,"about_ca_system_score_gemma":0.0001317492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001820353,"about_ca_topic_score_gemma":4.368761e-7,"domain_scores_codex":[0.9977505,0.000008449982,0.0003492023,0.0004224808,0.001146209,0.0003231976],"domain_scores_gemma":[0.9981658,0.0003613094,0.0002588491,0.0002541015,0.0008624509,0.00009750726],"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.0001066123,0.000281138,0.004721742,0.00005381354,0.00003803645,0.000002252722,0.0002052299,0.0004391544,0.06333312,0.9274329,0.002891403,0.000494607],"study_design_scores_gemma":[0.003922565,0.0007621753,0.003241244,0.0003398258,0.00002762509,0.0000276222,0.0000410325,0.527409,0.3879014,0.0634737,0.01218926,0.0006646437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.717859,0.00002193562,0.1168099,0.03285681,0.08675823,0.00300317,0.0002122598,0.0006309045,0.0418478],"genre_scores_gemma":[0.9725756,0.000001155854,0.02640131,0.0001283559,0.0005821101,0.00004706502,0.000004303446,0.00002037104,0.0002397043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8639592,"threshold_uncertainty_score":0.5782504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121729191","doi":"10.1609/socs.v4i1.18293","title":"Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Planner; Benchmark (surveying); Computer science; Domain (mathematical analysis); Heuristics; Parameterized complexity; Context (archaeology); Set (abstract data type); Range (aeronautics); Preprocessor; Heuristic; Work (physics); Automated planning and scheduling; Mathematical optimization; Artificial intelligence; Algorithm; Engineering; Mathematics","authors":[{"name":"Mauro Vallati","is_ca":false},{"name":"Chris Fawcett","is_ca":true},{"name":"Alfonso Gerevini","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Alessandro Saetti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02448131788440136,"gpt":0.2514494117665095,"spread":0.2269680938821082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007764124,0.0001835966,0.0003021032,0.0001456347,0.0001551,0.0001995792,0.001587248,0.0001112389,0.0000347065],"category_scores_gemma":[0.0002808362,0.0001500684,0.0001671863,0.0006281321,0.0000739534,0.0001574032,0.0004545125,0.0002729152,0.000007981259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001828559,"about_ca_system_score_gemma":0.0001847066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001309554,"about_ca_topic_score_gemma":6.224823e-7,"domain_scores_codex":[0.9973578,0.00006263526,0.0005135167,0.0004457374,0.001362399,0.000257911],"domain_scores_gemma":[0.9981412,0.0004300699,0.0003601777,0.0002470246,0.0007348646,0.00008661258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000414122,0.0007972889,0.003172927,0.0001012118,0.0004513516,0.00001005575,0.003278551,0.05180185,0.7433401,0.1900177,0.005344247,0.001270637],"study_design_scores_gemma":[0.002400838,0.0001691395,0.0003308475,0.0002234355,0.00002168686,0.00000815134,0.0001168654,0.4616834,0.5298149,0.004536829,0.0004709106,0.0002230217],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875673,0.00005682272,0.002229416,0.003297351,0.004101735,0.0002334083,0.00003081577,0.00006848083,0.002414683],"genre_scores_gemma":[0.9841596,0.0000106669,0.01529154,0.0001150919,0.0002772375,0.00001862643,0.00002639646,0.00001468849,0.00008614307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4098815,"threshold_uncertainty_score":0.6119613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2242756877","doi":"10.1609/socs.v1i1.18151","title":"Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":20,"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.0262490218427361,"gpt":0.2853171436139179,"spread":0.2590681217711818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001825352,0.0003509955,0.0003368148,0.000289143,0.0004278605,0.000773703,0.004309813,0.000133997,0.000005263067],"category_scores_gemma":[0.001047181,0.0002700032,0.0001437179,0.0005371181,0.0001687575,0.0007483399,0.00104341,0.0009389502,0.00001177525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002835379,"about_ca_system_score_gemma":0.0001426254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002461462,"about_ca_topic_score_gemma":0.000004926989,"domain_scores_codex":[0.9955012,0.00004893708,0.0004733605,0.0009691491,0.002248181,0.0007592175],"domain_scores_gemma":[0.9957575,0.001294544,0.0002313852,0.0004190418,0.001937142,0.0003603751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001769508,0.001978652,0.008928552,0.000138971,0.0004224251,0.00003037562,0.01303345,0.06855953,0.8073879,0.08436458,0.0004483801,0.01293769],"study_design_scores_gemma":[0.001617839,0.001976835,0.0003403309,0.0001838155,0.00001230329,0.000054563,0.0001934348,0.7599496,0.2332742,0.00143864,0.0005851933,0.0003731922],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9242519,0.000002646779,0.0605474,0.006991976,0.005203195,0.001705168,0.00005010439,0.0001964661,0.001051191],"genre_scores_gemma":[0.8406617,6.961605e-7,0.158093,0.000220318,0.0007365569,0.00009237273,0.000006885783,0.00005030927,0.0001381956],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6913901,"threshold_uncertainty_score":0.9999752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313120064","doi":"10.1609/socs.v1i1.18159","title":"Bootstrap Learning of Heuristic Functions","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":16,"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","keywords":"Heuristic; Bootstrapping (finance); Null-move heuristic; Incremental heuristic search; Consistent heuristic; Computer science; Process (computing); Mathematical optimization; Algorithm; Sequence (biology); Mathematics; Artificial intelligence; Beam search; Search algorithm; Econometrics","authors":[{"name":"Shahab Jabbari Arfaee","is_ca":true},{"name":"Sandra Zilles","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01505893033952621,"gpt":0.2562940177736008,"spread":0.2412350874340746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007310787,0.0001107952,0.0001362102,0.0001056621,0.00018612,0.0001153803,0.001729688,0.00008071832,0.00002786957],"category_scores_gemma":[0.0003216255,0.00008900623,0.0001049228,0.0003033831,0.00009272886,0.000222589,0.0003743083,0.0006806562,0.00001308987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003720343,"about_ca_system_score_gemma":0.00007437092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009420775,"about_ca_topic_score_gemma":7.921489e-7,"domain_scores_codex":[0.9984286,0.00001422706,0.000280183,0.0002511426,0.000836121,0.0001897513],"domain_scores_gemma":[0.9986767,0.0002524731,0.0002085726,0.0001460661,0.0006541627,0.00006200328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007251387,0.0001853869,0.02655324,0.00004090863,0.00005158989,4.86188e-7,0.0004775336,0.0004710871,0.2774408,0.692557,0.001371369,0.0007780799],"study_design_scores_gemma":[0.002875333,0.001558655,0.01450977,0.0005686147,0.00004777746,0.0000537039,0.0002054714,0.07038131,0.8183884,0.05923177,0.03146483,0.0007143444],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9476995,0.000008526912,0.001011197,0.005048013,0.008328986,0.0002009918,0.000007035951,0.00009730184,0.03759846],"genre_scores_gemma":[0.9984167,0.000002625122,0.000568069,0.00002967674,0.0002683823,0.000007921284,0.000001540136,0.000009545138,0.0006955512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6333252,"threshold_uncertainty_score":0.3629569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3175350881","doi":"10.1609/socs.v12i1.18576","title":"Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":16,"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; University of Southern California; Simon Fraser University; National Science Foundation","keywords":"Scalability; Computer science; Train; Distributed computing; Deadlock; Software; Simulated annealing; Plan (archaeology); Motion planning; Graph; Mathematical optimization; Artificial intelligence; Theoretical computer science; Robot; 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.0124097722008744,"gpt":0.2293755450045777,"spread":0.2169657728037033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004768945,0.0001396669,0.0001614584,0.00003612371,0.0001949062,0.0001679053,0.0005064571,0.00007775625,0.00001628563],"category_scores_gemma":[0.0001011787,0.00009459298,0.00006456606,0.0002147714,0.00006491453,0.0001278864,0.0002214253,0.0003121367,0.000003819936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007605835,"about_ca_system_score_gemma":0.0000232601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003801233,"about_ca_topic_score_gemma":7.224675e-7,"domain_scores_codex":[0.9986501,0.00001052678,0.0002548014,0.0002291506,0.0006300168,0.0002253857],"domain_scores_gemma":[0.9993831,0.0001163166,0.00005996027,0.0001152192,0.0002689475,0.000056482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003984964,0.0004022756,0.09211958,0.0007120917,0.0008318544,0.00004104452,0.0110909,0.07085788,0.4500259,0.3350326,0.03693125,0.001556146],"study_design_scores_gemma":[0.007299251,0.0008412499,0.03165996,0.003725783,0.0001350575,0.0004796667,0.005289,0.1954223,0.529384,0.01393862,0.2099953,0.001829819],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9217496,0.0004601739,0.000005831636,0.00357837,0.003428178,0.0001151788,0.00000351163,0.00006461022,0.07059458],"genre_scores_gemma":[0.9984549,0.00008362522,0.00002126491,0.00003423414,0.0007033282,0.00001390988,0.000001715348,0.0000243954,0.0006626807],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.321094,"threshold_uncertainty_score":0.385739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1514904414","doi":"10.1609/socs.v2i1.18196","title":"Predicting Solution Cost with Conditional Probabilities","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","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 Alberta","funders":"Alberta Innovates; University of Regina","keywords":"Heuristic; Consistent heuristic; Path (computing); Incremental heuristic search; Mathematical optimization; Computer science; Bidirectional search; Algorithm; Bounded function; Best-first search; Search algorithm; Beam search; Mathematics","authors":[{"name":"Levi H. S. Lelis","is_ca":true},{"name":"Roni Stern","is_ca":false},{"name":"Shahab Jabbari Arfaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01576057319684234,"gpt":0.2408829389124096,"spread":0.2251223657155672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005589072,0.0001282326,0.000131091,0.0000565614,0.000272415,0.0002665465,0.001094671,0.00006402838,0.00001648806],"category_scores_gemma":[0.0001834851,0.00009743241,0.00007186906,0.0003163657,0.0001024368,0.0004351654,0.000417651,0.0003100704,0.000006764418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001937478,"about_ca_system_score_gemma":0.0002221527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000576529,"about_ca_topic_score_gemma":0.000002484789,"domain_scores_codex":[0.9979724,0.00002396877,0.0002435518,0.0003516353,0.001170136,0.0002383153],"domain_scores_gemma":[0.9981703,0.0002301398,0.0001534061,0.0001416532,0.00124124,0.00006323173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001160543,0.0002111374,0.04158414,0.00005919299,0.00008002871,0.000002816933,0.0006690625,0.0008870425,0.0199007,0.9351592,0.001041945,0.0002886527],"study_design_scores_gemma":[0.003826174,0.001001925,0.009831894,0.001285974,0.00003792527,0.0002098508,0.0003862861,0.0749075,0.7209611,0.1774659,0.009405069,0.0006804414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8972421,0.00004990516,0.005563898,0.04247907,0.005655099,0.000808098,0.00005958712,0.0002757254,0.04786656],"genre_scores_gemma":[0.9974534,0.000003489864,0.001567476,0.0001382691,0.000294999,0.00003705696,0.00001110473,0.00001019242,0.0004840172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7576934,"threshold_uncertainty_score":0.3973178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1521683430","doi":"10.1609/socs.v4i1.18288","title":"Optimal-Generation Variants of EPEA*","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Leverage (statistics); Mathematical optimization; Computer science; Scope (computer science); Class (philosophy); Mathematics; Branching (polymer chemistry); Artificial intelligence","authors":[{"name":"Meir Goldenberg","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Nathan Sturtevant","is_ca":false},{"name":"Robert C. Holte","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01847776980982106,"gpt":0.2540256246362786,"spread":0.2355478548264576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003510545,0.00008829149,0.0001217149,0.00007255966,0.00008422392,0.0001223972,0.0008336694,0.00005876278,0.00006492242],"category_scores_gemma":[0.0001768807,0.00007602504,0.00009162538,0.0003800649,0.00005057822,0.0003401509,0.0003514224,0.0001371009,0.000005735765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009207844,"about_ca_system_score_gemma":0.0001223807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002039012,"about_ca_topic_score_gemma":0.000001145647,"domain_scores_codex":[0.998496,0.00001840774,0.000295405,0.0002522391,0.0008198421,0.0001181335],"domain_scores_gemma":[0.9983021,0.00005860705,0.0001715441,0.0001438278,0.001281581,0.00004233059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002473298,0.0001630103,0.001671439,0.00001289121,0.00004126626,5.928014e-7,0.0002410399,0.001578054,0.3074154,0.6870543,0.0006086163,0.001188602],"study_design_scores_gemma":[0.0009035631,0.0001044217,0.003871563,0.00006530294,0.00000823858,0.00001809606,0.00004450944,0.06037216,0.9302526,0.003402885,0.0008311342,0.0001255336],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9115099,0.00001947406,0.01148903,0.01773796,0.01267162,0.0003785096,0.00001778803,0.00007870558,0.04609702],"genre_scores_gemma":[0.9958088,0.00002311777,0.003536148,0.00008291316,0.0002090953,0.000005986679,0.000003414125,0.000006476108,0.0003240143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6836514,"threshold_uncertainty_score":0.3100211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557668034","doi":"10.1609/socs.v5i1.18330","title":"Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Advanced Database Systems and Queries","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Merge (version control); Heuristics; Computer science; Variable (mathematics); Theoretical computer science; Nonlinear system; Algorithm; Mathematics; Mathematical optimization; Parallel computing","authors":[{"name":"Gaojian Fan","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.01811522593557582,"gpt":0.2873173649234781,"spread":0.2692021389879024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872947,0.0001365521,0.0001675354,0.00007852279,0.0002018738,0.0001694467,0.0006603318,0.00004118364,0.00001312463],"category_scores_gemma":[0.0001566601,0.000109394,0.00008744186,0.0002721431,0.000049338,0.0006327387,0.0003834592,0.0002033608,0.000003124027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009677981,"about_ca_system_score_gemma":0.000162162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006978324,"about_ca_topic_score_gemma":0.000002324347,"domain_scores_codex":[0.9985666,0.00001058742,0.0002626914,0.0003714456,0.0005911561,0.0001975027],"domain_scores_gemma":[0.998509,0.0002451683,0.0001307111,0.0001846112,0.0008721826,0.00005825378],"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.0000905478,0.0001319983,0.0001363233,0.00005533996,0.000035435,5.735612e-7,0.0001604425,0.001735496,0.05356229,0.9434052,0.0005335291,0.0001528015],"study_design_scores_gemma":[0.002295577,0.0004015983,0.0001423195,0.0006583207,0.00002018119,0.00001672694,0.0005426087,0.4644732,0.3944351,0.03607291,0.1005577,0.000383813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2764278,0.00007823834,0.4988809,0.05354185,0.0480342,0.002676894,0.0003411436,0.0004263898,0.1195926],"genre_scores_gemma":[0.9824135,0.000009352351,0.0162732,0.000218621,0.000440795,0.00008151666,0.000009069346,0.00001693594,0.0005369749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9073323,"threshold_uncertainty_score":0.446096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573050985","doi":"10.1609/socs.v7i1.18385","title":"A Multi-Phase Search Approach to the LEGO Construction Problem","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"BIM and Construction Integration","field":"Engineering","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 Calgary","funders":"","keywords":"Heuristics; Component (thermodynamics); Computer science; Construct (python library); Search problem; Task (project management); Search algorithm; Connected component; Brick; Selection (genetic algorithm); Beam search; Local search (optimization); Phase (matter); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Engineering","authors":[{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01719473755055864,"gpt":0.2538083237308843,"spread":0.2366135861803257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003814138,0.000153984,0.0001433963,0.00008776582,0.0001834208,0.0002051036,0.000676516,0.00009608459,0.00003846665],"category_scores_gemma":[0.00006169485,0.0001081387,0.000115525,0.0005032268,0.0001012082,0.000175102,0.0001744016,0.0004404716,0.00002590597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002238759,"about_ca_system_score_gemma":0.00006813393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003720151,"about_ca_topic_score_gemma":0.000002936708,"domain_scores_codex":[0.9983416,0.00001978503,0.0003075823,0.0002642701,0.0008451737,0.0002216096],"domain_scores_gemma":[0.9987367,0.00004446745,0.00004764671,0.0001413547,0.0009524523,0.00007732175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001838957,0.0004839248,0.0009088602,0.0001100736,0.0001965344,5.257352e-7,0.001245948,0.003785068,0.3360141,0.6471147,0.003866068,0.006090302],"study_design_scores_gemma":[0.003574386,0.0002163445,0.0005305423,0.0002142045,0.00004231443,0.0001848966,0.002048329,0.0608728,0.8934836,0.004601321,0.03381538,0.0004158234],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8616078,0.00006447339,0.002120589,0.01058736,0.01244505,0.001230026,0.00006703187,0.0002494783,0.1116282],"genre_scores_gemma":[0.9958252,0.00002495327,0.002887042,0.00007578567,0.0005900714,0.00008928411,0.000008730012,0.00002697215,0.0004719269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6425133,"threshold_uncertainty_score":0.4409768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1959603133","doi":"10.1609/socs.v6i1.18345","title":"Moving Target Search with Subgoal Graphs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); Robotics; Abstraction; Artificial intelligence; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Robot; Programming language","authors":[{"name":"Doron Nussbaum","is_ca":true},{"name":"Alper Yörükçü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01248162264710213,"gpt":0.2400057604366364,"spread":0.2275241377895343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313418,0.0001537512,0.0001583715,0.0001195157,0.0001856252,0.0005758066,0.002956937,0.00004754876,0.00003488335],"category_scores_gemma":[0.00006512793,0.0001129362,0.00009845131,0.0007409717,0.00009123445,0.0007888114,0.001688892,0.0003136059,0.00001814579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067521,"about_ca_system_score_gemma":0.0001014017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000633923,"about_ca_topic_score_gemma":0.00000111667,"domain_scores_codex":[0.9972014,0.00001970021,0.0002306557,0.000477307,0.001755276,0.0003156784],"domain_scores_gemma":[0.9985188,0.00008334179,0.00009335869,0.00026404,0.0009576767,0.00008283236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006686152,0.0002635721,0.007238302,0.00003227082,0.00009804371,0.00000859277,0.0002155343,0.00006707072,0.01853785,0.971302,0.001521831,0.0006480826],"study_design_scores_gemma":[0.003668798,0.0007129374,0.006796926,0.0003738776,0.00002854815,0.00005308187,0.0003542952,0.02608458,0.8646086,0.07807294,0.01855229,0.0006931539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8463137,0.00006027853,0.002408009,0.03620784,0.009732349,0.0007408233,0.0000376624,0.000244556,0.1042548],"genre_scores_gemma":[0.9937508,0.00002184778,0.004071884,0.00015954,0.000287374,0.00001524619,0.000007673929,0.00001686297,0.001668798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.893229,"threshold_uncertainty_score":0.5552516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966663453","doi":"10.1609/socs.v10i1.18508","title":"Improving Bidirectional Heuristic Search by Bounds Propagation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","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 Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Heuristics; Heuristic; Computer science; Node (physics); Bidirectional search; Incremental heuristic search; Algorithm; Mathematical optimization; Running time; Search algorithm; Beam search; Upper and lower bounds; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","authors":[{"name":"Shahaf Shperberg","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Solomon Eyal Shimony","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Avi Hayoun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009862664804386103,"gpt":0.2391165904643839,"spread":0.2292539256599978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209657,0.0001315663,0.0001272935,0.00009804309,0.000260332,0.0004376124,0.00092786,0.00007896651,0.00007740251],"category_scores_gemma":[0.0002628646,0.000115908,0.0001008389,0.0005641627,0.00008539238,0.0004892274,0.0004508355,0.0003030322,0.00001583158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003109464,"about_ca_system_score_gemma":0.0002382458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007821547,"about_ca_topic_score_gemma":0.00000198777,"domain_scores_codex":[0.9976985,0.00003140272,0.000309036,0.000411182,0.001334454,0.0002154265],"domain_scores_gemma":[0.9980445,0.0001159189,0.0001395221,0.0001497609,0.001471971,0.00007836083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008143534,0.0003782223,0.005751733,0.00005159653,0.00007290903,0.000001620902,0.0003005581,0.000371047,0.4380272,0.5435933,0.003700097,0.007670285],"study_design_scores_gemma":[0.001407283,0.0001784534,0.00257753,0.0001004827,0.00001245267,0.00005539775,0.00008746424,0.08109336,0.9038069,0.005955313,0.004428997,0.0002963791],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8001244,0.00008388502,0.0419666,0.05592831,0.02632924,0.001288699,0.00007361727,0.0005055548,0.07369968],"genre_scores_gemma":[0.997193,0.00002066749,0.00107281,0.0001450271,0.0002602429,0.00001820515,0.00001035134,0.00001286005,0.00126679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5376379,"threshold_uncertainty_score":0.4726592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139042205","doi":"10.1609/socs.v2i1.18203","title":"Faster Optimal and Suboptimal Hierarchical Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","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":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristic; Incremental heuristic search; Weighting; Computer science; Beam search; Best-first search; Search algorithm; Simple (philosophy); Greedy algorithm; Local search (optimization); Function (biology); Bidirectional search; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Michael Leighton","is_ca":false},{"name":"Wheeler Ruml","is_ca":false},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0149486210134715,"gpt":0.250929431142466,"spread":0.2359808101289945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431372,0.000154927,0.0001761264,0.00008789569,0.0002185567,0.000433458,0.001499478,0.00009743624,0.00002614937],"category_scores_gemma":[0.0001511407,0.00012523,0.00009587989,0.0003340617,0.0001572627,0.0003450215,0.001335677,0.0005496176,0.0000120579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008775607,"about_ca_system_score_gemma":0.0001422168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003094035,"about_ca_topic_score_gemma":3.05692e-7,"domain_scores_codex":[0.9977129,0.00004472802,0.000269559,0.0004713495,0.001174358,0.0003271532],"domain_scores_gemma":[0.9986273,0.0003043542,0.00007570872,0.0001770493,0.0006885774,0.0001269828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002083897,0.0002806793,0.01366923,0.00006897059,0.0001008547,0.00001307183,0.001385142,0.0005335468,0.07735037,0.9025163,0.001327636,0.002545814],"study_design_scores_gemma":[0.003888429,0.0008889686,0.009112708,0.0006452761,0.00003006157,0.0002810586,0.0002908374,0.1145298,0.834953,0.02312844,0.01142848,0.0008229068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9557149,0.00004738472,0.00102593,0.02371405,0.00207943,0.0001855678,0.00001010719,0.00007071694,0.01715194],"genre_scores_gemma":[0.9949095,0.00001601981,0.003845866,0.0002049953,0.0002724831,0.000008532653,0.000002657147,0.0000135314,0.0007263893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8793879,"threshold_uncertainty_score":0.5106732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1591786641","doi":"10.1609/socs.v2i1.18187","title":"Automatic Move Pruning in General Single-Player Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"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":"Pruning; Computer science; Reduction (mathematics); Tree (set theory); Overhead (engineering); Class (philosophy); Search tree; Range (aeronautics); Depth-first search; State (computer science); Artificial intelligence; Algorithm; Machine learning; Search algorithm; Mathematics; Engineering","authors":[{"name":"Neil Burch","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02651344961679829,"gpt":0.2811901734345476,"spread":0.2546767238177493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904972,0.0001612574,0.0002069961,0.0001386399,0.00009248346,0.0003532473,0.002263578,0.00009062385,0.00005046148],"category_scores_gemma":[0.0004726324,0.0001369941,0.0001196932,0.0006468889,0.00009405486,0.0005126488,0.0009961836,0.0003457906,0.00002686551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003390502,"about_ca_system_score_gemma":0.0001249901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001078113,"about_ca_topic_score_gemma":0.000006215819,"domain_scores_codex":[0.9975101,0.00003275215,0.0004720431,0.0004373035,0.001228685,0.000319079],"domain_scores_gemma":[0.9985297,0.0002132738,0.0001711378,0.0002254511,0.0007940089,0.00006642987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002940742,0.0004833214,0.009322912,0.00002822793,0.00004101177,0.000007947377,0.001452784,0.0004563789,0.2771683,0.7046517,0.0005013132,0.005856788],"study_design_scores_gemma":[0.0002891154,0.00009874865,0.001920128,0.0001955996,0.000003690502,0.00001610166,0.0001438868,0.07183284,0.8843521,0.04000824,0.0009668628,0.0001726749],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9692729,0.00002165737,0.0001608294,0.008376474,0.00444312,0.000204795,0.000002080326,0.00006700846,0.01745117],"genre_scores_gemma":[0.9970281,0.000009843369,0.001858326,0.0002216424,0.0003034956,0.00002034176,8.160998e-7,0.0000151597,0.0005423225],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6646434,"threshold_uncertainty_score":0.5586459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1581046800","doi":"10.1609/socs.v2i1.18198","title":"Improved Prediction of IDA*'s Performance via Epsilon-Truncation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"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":"Alberta Innovates; University of Regina","keywords":"Discretization; Truncation (statistics); Discretization error; Computer science; Line (geometry); Truncation error; Mean squared prediction error; Algorithm; Mathematics; Applied mathematics; Artificial intelligence; Machine learning; Econometrics; Statistics; Mathematical analysis","authors":[{"name":"Levi H. S. Lelis","is_ca":true},{"name":"Sandra Zilles","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009396174356073185,"gpt":0.235737890328327,"spread":0.2263417159722538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005514899,0.0001136464,0.0001465418,0.00007573946,0.0001168314,0.00009545481,0.001272773,0.00006574178,0.00001432176],"category_scores_gemma":[0.0001521203,0.00008972337,0.000100794,0.0004077186,0.00005318162,0.0003573761,0.000477038,0.000283169,0.000004669344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046021,"about_ca_system_score_gemma":0.00008666031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006099292,"about_ca_topic_score_gemma":3.127936e-7,"domain_scores_codex":[0.9982908,0.00001911897,0.0003209626,0.0002984288,0.0009094714,0.0001611709],"domain_scores_gemma":[0.9982868,0.00007256176,0.0002237323,0.0001838991,0.001186535,0.00004643852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001214425,0.0005540702,0.02303263,0.0001389158,0.0001040964,5.070962e-7,0.0007153506,0.0004402141,0.7644184,0.2008968,0.000429811,0.009147805],"study_design_scores_gemma":[0.0007895667,0.000313,0.01047149,0.0001144522,0.000007925905,0.00001389632,0.00002038673,0.2566921,0.7269034,0.003682477,0.0008923393,0.00009904558],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9760986,0.00001558375,0.001639812,0.005512584,0.00642363,0.0002068256,0.000008563247,0.00006959855,0.0100248],"genre_scores_gemma":[0.9978262,0.00002144157,0.001334321,0.00004388285,0.0002708221,0.00001154184,0.000004232332,0.000009111307,0.0004784499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2562518,"threshold_uncertainty_score":0.3658813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576466201","doi":"10.1609/socs.v7i1.18396","title":"Weighted Lateral Learning in Real-Time Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"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":"Computer science; Null-move heuristic; Incremental heuristic search; Heuristic; Robustness (evolution); Artificial intelligence; Property (philosophy); Consistent heuristic; Machine learning; Weighting; Search algorithm; Beam search; Algorithm; Mathematical optimization; Mathematics","authors":[{"name":"Vadim Bulitko","is_ca":true},{"name":"Alexander Sampley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548740619993302,"gpt":0.2745171946361062,"spread":0.2590297884361732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187362,0.0001917427,0.000285926,0.0002831812,0.000175853,0.0004677577,0.002578656,0.0001126967,0.000188233],"category_scores_gemma":[0.000787807,0.0001647566,0.0001231337,0.001363489,0.0001342019,0.0003958507,0.001575333,0.0007574653,0.00009951197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003652577,"about_ca_system_score_gemma":0.0003149311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001354785,"about_ca_topic_score_gemma":9.792869e-7,"domain_scores_codex":[0.9958777,0.0001676183,0.0005244936,0.0006147547,0.002343876,0.0004715035],"domain_scores_gemma":[0.9971274,0.0004825736,0.0001331831,0.0002709916,0.001844806,0.0001410979],"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.0002823843,0.001165995,0.01761399,0.000123611,0.000154142,0.00006111228,0.001198367,0.003158835,0.1808099,0.7912313,0.001329005,0.002871318],"study_design_scores_gemma":[0.003428569,0.0003359749,0.00777601,0.000337854,0.00001133311,0.0000585175,0.00007844111,0.6759459,0.2930279,0.01551813,0.002962313,0.0005189875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8580521,0.00002982538,0.001210803,0.02353417,0.004630444,0.0008753819,0.00001444215,0.0002721371,0.1113806],"genre_scores_gemma":[0.9889089,0.0001181513,0.003901183,0.00007088397,0.0002739174,0.00002749505,0.00000927925,0.00003260696,0.00665752],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7757132,"threshold_uncertainty_score":0.6718578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1613844723","doi":"10.1609/socs.v5i1.18331","title":"Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"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":"Heuristic; Computer science; Bounded function; Computation; Data scrubbing; Mathematical optimization; Field (mathematics); State (computer science); State space; Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Nathan Sturtevant","is_ca":false},{"name":"Vadim Bulitko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0239648163520578,"gpt":0.2730899815642995,"spread":0.2491251652122417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983261,0.0001829298,0.0002111771,0.0001210075,0.0003780611,0.0005260245,0.002627709,0.00009866036,0.00003677546],"category_scores_gemma":[0.0002773892,0.0001349968,0.0001277544,0.000683038,0.00008791283,0.0003826825,0.001139081,0.00075688,0.00003243525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003372508,"about_ca_system_score_gemma":0.0002349648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008150756,"about_ca_topic_score_gemma":0.000003704882,"domain_scores_codex":[0.9971256,0.0000864207,0.000409461,0.0005013536,0.001455971,0.0004211471],"domain_scores_gemma":[0.998271,0.0005332052,0.0001495167,0.0002993624,0.0006628978,0.00008405718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002410599,0.0009433469,0.05992382,0.0001255097,0.0001299255,0.00004849498,0.008704294,0.001312926,0.4192177,0.5012119,0.005917894,0.002223151],"study_design_scores_gemma":[0.004293152,0.0007253609,0.02055033,0.002202974,0.00007029053,0.000170407,0.0007940219,0.1244507,0.8013515,0.03880627,0.005447876,0.001137045],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9584393,0.00003429499,0.00008041946,0.01568757,0.002342087,0.0003988711,0.00001356744,0.00008469745,0.02291922],"genre_scores_gemma":[0.9975197,0.00002524391,0.0006984503,0.0002174101,0.0002684582,0.00003352743,0.000003797106,0.00002013704,0.001213236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4624056,"threshold_uncertainty_score":0.5505009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293808320","doi":"10.1609/socs.v2i1.18213","title":"The Compressed Differential Heuristic","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Uncompressed video; Heuristic; Differential (mechanical device); Computer science; Compression (physics); State (computer science); Algorithm; State space; Space (punctuation); Theoretical computer science; Mathematics; Artificial intelligence; Statistics; Engineering","authors":[{"name":"Meir Goldenberg","is_ca":false},{"name":"Nathan Sturtevant","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01576639431812246,"gpt":0.2661855350763626,"spread":0.2504191407582401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718384,0.0001523842,0.0001760116,0.00006301754,0.0004597412,0.0008332106,0.004071773,0.0000648326,0.00006358861],"category_scores_gemma":[0.0007943386,0.00009818874,0.0001454676,0.0005749444,0.0001746349,0.0002094122,0.001642239,0.0004157909,0.00003025015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001393155,"about_ca_system_score_gemma":0.0001704839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000264033,"about_ca_topic_score_gemma":8.309304e-7,"domain_scores_codex":[0.9965026,0.00006762598,0.0003970138,0.0004149972,0.002286334,0.0003314209],"domain_scores_gemma":[0.9965522,0.0006355685,0.0001646391,0.0003765535,0.002163135,0.0001079175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008365243,0.00032475,0.0004057584,0.00002215773,0.0001047988,0.000002712216,0.000156418,0.00020749,0.03450233,0.9575335,0.005264126,0.001392331],"study_design_scores_gemma":[0.003413138,0.0002960271,0.003448721,0.0001688658,0.00002811283,0.00004876299,0.0001172616,0.3460074,0.5425082,0.05557366,0.04790223,0.0004876628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.389643,0.0004299957,0.04587664,0.2723411,0.08671361,0.003517568,0.00008668524,0.0006984049,0.200693],"genre_scores_gemma":[0.9954756,0.0001152538,0.001153767,0.0001460463,0.0004933119,0.00003427801,0.00000317679,0.00001910969,0.002559437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9019598,"threshold_uncertainty_score":0.8034669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400703308","doi":"10.1609/socs.v3i1.18241","title":"Are We There Yet? — Estimating Search Progress","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Beam search; Heuristic; Best-first search; Iterative deepening depth-first search; Bidirectional search; Search algorithm; Computer science; Focus (optics); Path (computing); Mathematical optimization; Beam stack search; Search problem; Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Jordan Thayer","is_ca":false},{"name":"Roni Stern","is_ca":false},{"name":"Levi H. S. Lelis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02905911484794281,"gpt":0.288302032702786,"spread":0.2592429178548432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056724,0.0001786511,0.0002033197,0.00008205175,0.0003030909,0.0005333361,0.002465994,0.0001004652,0.00002765657],"category_scores_gemma":[0.0002405359,0.0001421864,0.0001309713,0.0005339968,0.0000981185,0.000365004,0.001126305,0.0005328333,0.00002049726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001602105,"about_ca_system_score_gemma":0.0001568443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000312249,"about_ca_topic_score_gemma":7.51013e-7,"domain_scores_codex":[0.9972534,0.00004325203,0.0003242467,0.0004813387,0.001536781,0.0003609693],"domain_scores_gemma":[0.9978558,0.0002749056,0.0002578086,0.0002466297,0.001265324,0.00009950885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000165742,0.0007562184,0.08306169,0.0003784677,0.0002412798,0.00004084049,0.002710501,0.002150438,0.02411739,0.8704406,0.009022506,0.006914324],"study_design_scores_gemma":[0.003026133,0.0005206721,0.006469116,0.003970208,0.00003366074,0.0001294903,0.0007477506,0.235339,0.6601921,0.07802203,0.01061665,0.0009331473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8417601,0.0003971348,0.00136081,0.1133453,0.0150835,0.0006770011,0.00002755812,0.0003521749,0.0269964],"genre_scores_gemma":[0.9926602,0.00001426628,0.006032897,0.0001581866,0.0004617374,0.00002159943,0.000002324299,0.00002059711,0.0006281816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7924186,"threshold_uncertainty_score":0.5798191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037022759","doi":"10.1609/socs.v11i1.18525","title":"Moving Agents in Formation in Congested Environments","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","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":"Simon Fraser University","funders":"","keywords":"Swarm behaviour; Computer science; Focus (optics); Path (computing); Phase (matter); Swarm robotics; Field (mathematics); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Physics","authors":[{"name":"Jiaoyang Li","is_ca":false},{"name":"Kexuan Sun","is_ca":false},{"name":"Hang Ma","is_ca":true},{"name":"Ariel Felner","is_ca":false},{"name":"T. K. Satish Kumar","is_ca":false},{"name":"Sven Koenig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03289317222300333,"gpt":0.2676956056488399,"spread":0.2348024334258366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000398855,0.0000915511,0.0001147873,0.0001175106,0.00004169447,0.0001255676,0.001476955,0.0000523401,0.0000154409],"category_scores_gemma":[0.0001417564,0.00007937833,0.00004075604,0.000463493,0.0000313439,0.0006879124,0.0005655447,0.000254112,0.00001724941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002267826,"about_ca_system_score_gemma":0.00002202118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004072714,"about_ca_topic_score_gemma":0.000001777752,"domain_scores_codex":[0.9983532,0.00002429808,0.0003229638,0.0002413648,0.0008706212,0.0001874825],"domain_scores_gemma":[0.9996023,0.0000511436,0.0001068338,0.00007607414,0.00009659418,0.0000670197],"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.000417121,0.001084284,0.06856143,0.0001416654,0.00004720933,0.000008300257,0.01027241,0.01851658,0.182026,0.7149479,0.00141278,0.002564275],"study_design_scores_gemma":[0.004941166,0.0003756177,0.0190447,0.0002510824,0.000002598058,0.000004275775,0.0001918714,0.787236,0.1771102,0.007489512,0.003046942,0.0003060462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9425089,0.000006648342,0.0008446715,0.03810106,0.001394916,0.0008362457,0.000004023055,0.00004518207,0.01625836],"genre_scores_gemma":[0.9991414,0.0000236241,0.0002790702,0.0004158582,0.00005255954,0.00001891951,0.00000170766,0.000006862543,0.0000599925],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7687195,"threshold_uncertainty_score":0.3236954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2578195970","doi":"10.1609/socs.v7i1.18399","title":"Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","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 Alberta","funders":"","keywords":"Bidirectional search; Correctness; Heuristic; Node (physics); Incremental heuristic search; Computer science; Search algorithm; State (computer science); Function (biology); Sketch; Best-first search; Algorithm; Evaluation function; Beam search; Search problem; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","authors":[{"name":"Guni Sharon","is_ca":false},{"name":"Robert C. Holte","is_ca":true},{"name":"Ariel Felner","is_ca":false},{"name":"Nathan Sturtevant","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0221530892811855,"gpt":0.2849638744097227,"spread":0.2628107851285372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350134,0.0001595498,0.0001738206,0.0001206434,0.0003252429,0.0004689043,0.00146234,0.000109962,0.00005883486],"category_scores_gemma":[0.000373931,0.0001376647,0.0001557669,0.0004819791,0.00009784268,0.0006884178,0.0004770891,0.0003640478,0.000009231311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00023096,"about_ca_system_score_gemma":0.0003184361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004757584,"about_ca_topic_score_gemma":0.000002678996,"domain_scores_codex":[0.9974472,0.00003563675,0.0003687673,0.0005579122,0.001262949,0.0003275492],"domain_scores_gemma":[0.9963384,0.0002375941,0.0001333409,0.0002336187,0.002909313,0.0001476968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003480579,0.001090313,0.0006736197,0.00008620465,0.0001004953,6.786332e-7,0.0002991518,0.0004093774,0.2213168,0.7707138,0.0007711441,0.004190308],"study_design_scores_gemma":[0.0059119,0.001632134,0.01872949,0.0001905064,0.00003734671,0.00002942974,0.000227984,0.3028576,0.540596,0.1098588,0.01917855,0.0007502866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7799451,0.0001034969,0.05448993,0.05080493,0.04423541,0.005223289,0.0002050247,0.0009513615,0.0640414],"genre_scores_gemma":[0.9951836,0.00002583411,0.002961827,0.000172379,0.0005217903,0.00006925125,0.00001753399,0.00002110182,0.001026724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6608551,"threshold_uncertainty_score":0.5613802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312450869","doi":"10.1609/socs.v1i1.18166","title":"Improving Local Search for Resource-Constrained Planning","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Planner; Heuristic; Margin (machine learning); Focus (optics); Local search (optimization); Resource (disambiguation); Feature (linguistics); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","authors":[{"name":"Hootan Nakhost","is_ca":true},{"name":"Jörg Hoffmann","is_ca":false},{"name":"Martin Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01488774470533181,"gpt":0.261163305095088,"spread":0.2462755603897562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743192,0.0001810104,0.0001839427,0.000145544,0.0003647035,0.0003579089,0.002852838,0.0001474957,0.00001001328],"category_scores_gemma":[0.0002459513,0.000146662,0.0001496325,0.000287079,0.0001666444,0.0003228045,0.0006439711,0.0007594696,0.000005963072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001004865,"about_ca_system_score_gemma":0.0001548152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001045641,"about_ca_topic_score_gemma":7.677518e-7,"domain_scores_codex":[0.9977074,0.00001648114,0.0003422768,0.0004625639,0.001046759,0.000424464],"domain_scores_gemma":[0.998255,0.000544069,0.0001696656,0.0002152115,0.0006940169,0.0001221016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003095419,0.0001549828,0.004849141,0.00008881344,0.00006351537,0.000001501567,0.001253736,0.001032969,0.2852644,0.6986836,0.001802293,0.006495479],"study_design_scores_gemma":[0.002794204,0.0007431059,0.0005364362,0.0003260206,0.00001722283,0.00003920269,0.0002837174,0.236428,0.7321631,0.01476617,0.01141023,0.0004925561],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9100468,0.00001835913,0.03137803,0.0174273,0.009933539,0.001142527,0.00003676797,0.0002973858,0.02971931],"genre_scores_gemma":[0.9949939,4.638438e-7,0.003911456,0.0001482239,0.000639988,0.00003272946,0.000003961217,0.00002085496,0.0002484836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6839174,"threshold_uncertainty_score":0.5980702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W52101158","doi":"10.1609/socs.v2i1.18197","title":"Repeated-Task Canadian Traveler Problem","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Heuristics; Disjoint sets; Computer science; Task (project management); Mathematical optimization; Fraction (chemistry); Path (computing); Tree traversal; Graph; Mathematics; Algorithm; Theoretical computer science; Combinatorics","authors":[{"name":"Zahy Bnaya","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Dror Fried","is_ca":false},{"name":"Olga Maksin","is_ca":false},{"name":"Solomon Eyal Shimony","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01008616326361533,"gpt":0.2198913857580607,"spread":0.2098052224944453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001885365,0.0001014204,0.0001020605,0.00009128636,0.0000855338,0.00006823894,0.0003980279,0.00007475582,0.000117902],"category_scores_gemma":[0.00003771291,0.00009199503,0.00007593858,0.0004384081,0.00003800779,0.0001071956,0.00002355963,0.0002464481,0.00001616736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002487737,"about_ca_system_score_gemma":0.0001312099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00175573,"about_ca_topic_score_gemma":0.0010346,"domain_scores_codex":[0.9988864,0.000003710988,0.000270875,0.0001653,0.0004844035,0.0001893281],"domain_scores_gemma":[0.9989352,0.00001924618,0.00003166541,0.00009216349,0.0008331551,0.00008857353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003294164,0.0001517542,0.008707807,0.00008390784,0.000156501,0.000002882346,0.0008377458,0.001751251,0.3050706,0.6751755,0.007454754,0.0005742951],"study_design_scores_gemma":[0.00173347,0.00008968828,0.02680685,0.000209199,0.00004140054,0.00002022586,0.0003725181,0.002050382,0.8330877,0.01238079,0.1227713,0.0004364456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8181875,0.00001137041,0.000006929695,0.00647643,0.003212876,0.00024993,0.00006783549,0.00009977444,0.1716874],"genre_scores_gemma":[0.9989058,0.00001759186,0.00008346642,0.0001230771,0.0001502995,0.0000240599,0.00002137032,0.00001943194,0.0006549217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6627948,"threshold_uncertainty_score":0.3751448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296772665","doi":"10.1609/socs.v1i1.18153","title":"Single-Frontier Bidirectional Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"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":"Frontier; Computer science; Node (physics); Work (physics); Search algorithm; Algorithm; Engineering; Geography","authors":[{"name":"Carsten Moldenhauer","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01840111607900786,"gpt":0.2670439970903512,"spread":0.2486428810113434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001788533,0.0001851347,0.0001964008,0.000273051,0.0002536829,0.000507372,0.004107234,0.0001315362,0.0001978771],"category_scores_gemma":[0.0007129803,0.000146099,0.000153707,0.000826598,0.0002773182,0.0005146113,0.001273367,0.0008635992,0.00007229651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001775922,"about_ca_system_score_gemma":0.0001710869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006469571,"about_ca_topic_score_gemma":0.000001335799,"domain_scores_codex":[0.9957317,0.00004239086,0.0004010211,0.0005331306,0.002897049,0.0003947814],"domain_scores_gemma":[0.9969851,0.0002866657,0.0001377077,0.0003409564,0.002076128,0.0001734334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008639098,0.000622103,0.002379819,0.00001957999,0.00007475848,0.00000120351,0.0001836825,0.0001303886,0.256207,0.7322488,0.003799548,0.004246752],"study_design_scores_gemma":[0.001794798,0.0003330533,0.002526806,0.00006258454,0.0000104806,0.00004913545,0.00004063727,0.08703454,0.8487874,0.01838186,0.04056039,0.0004183516],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6295579,0.00002200873,0.01016877,0.05414808,0.04869964,0.001721582,0.00004510864,0.0004524848,0.2551844],"genre_scores_gemma":[0.9852042,0.0000119654,0.01041421,0.0001247662,0.0008344243,0.0000329018,0.000002840214,0.00002846868,0.003346271],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7138669,"threshold_uncertainty_score":0.7632331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402290736","doi":"10.1609/socs.v3i1.18259","title":"A* Variants for Optimal Multi-Agent Pathfinding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Natural Language Processing Techniques","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":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Pathfinding; Computer science; Theoretical computer science; Shortest path problem","authors":[{"name":"Meir Goldenberg","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Roni Stern","is_ca":false},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02463526732612297,"gpt":0.2993281981942744,"spread":0.2746929308681514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324715,0.0001484767,0.0001665691,0.00008182345,0.000186805,0.0003556768,0.002459045,0.00009590787,0.000008391204],"category_scores_gemma":[0.0004770544,0.0001176715,0.000152131,0.0003497099,0.00004647326,0.0004102015,0.001060119,0.0002642812,0.000004138767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002168234,"about_ca_system_score_gemma":0.0001189043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001675007,"about_ca_topic_score_gemma":4.060516e-7,"domain_scores_codex":[0.9981191,0.00001374705,0.0002865007,0.0004383896,0.0008710921,0.0002712242],"domain_scores_gemma":[0.9981049,0.0001412141,0.0001690762,0.0001900065,0.001330005,0.00006485406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005430098,0.0002581319,0.000389243,0.00004426583,0.00004493863,0.000002628246,0.0003259017,0.00001509571,0.3180544,0.6789317,0.0007772495,0.001102167],"study_design_scores_gemma":[0.0009568262,0.000123174,0.0001326645,0.0001586705,0.000008074317,0.00001998043,0.00003411215,0.01140886,0.956706,0.02891323,0.001369776,0.0001685661],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.681987,0.0007432102,0.194572,0.06323588,0.04273497,0.00351802,0.00013634,0.001415612,0.01165693],"genre_scores_gemma":[0.878213,0.00001161523,0.1206907,0.0001931159,0.0003086064,0.00005085956,0.000002887764,0.0000180285,0.0005112558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6500184,"threshold_uncertainty_score":0.4798505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2187873293","doi":"10.1609/socs.v3i1.18232","title":"Automatic Move Pruning Revisited","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Algorithms and Data Compression","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 Alberta","funders":"","keywords":"Pruning; Simple (philosophy); Computer science; State (computer science); Algorithm; Artificial intelligence; Machine learning; Biology","authors":[{"name":"Neil Burch","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01376567944554273,"gpt":0.2611459697112674,"spread":0.2473802902657246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004428939,0.0001228724,0.0001604074,0.00006396863,0.0001593253,0.0003373321,0.002235349,0.00006080135,0.00004808534],"category_scores_gemma":[0.0002341819,0.00009261622,0.0001034461,0.0004691929,0.00004057651,0.000498024,0.001625238,0.0002571126,0.00001997158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000122629,"about_ca_system_score_gemma":0.00008619636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002311392,"about_ca_topic_score_gemma":1.244331e-7,"domain_scores_codex":[0.997941,0.00002013749,0.0002880844,0.0003594581,0.001191039,0.0002003032],"domain_scores_gemma":[0.9984881,0.000120737,0.0001555929,0.0002645711,0.0009019785,0.00006900204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002343452,0.0002982675,0.001695632,0.00005273608,0.00006135218,0.000004485568,0.0003136938,0.00004095614,0.08120106,0.9067832,0.004037677,0.005487527],"study_design_scores_gemma":[0.001935614,0.0001990875,0.00526637,0.0008579569,0.00001697913,0.00005661858,0.00008797338,0.2494143,0.6770321,0.04922381,0.01551671,0.0003925308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9135783,0.00009331731,0.00146429,0.01925534,0.01048298,0.0005164098,0.00002491101,0.0002655564,0.0543189],"genre_scores_gemma":[0.9957753,0.00002329474,0.003224129,0.0002368289,0.0003365944,0.00001105703,0.000004719605,0.00001200445,0.0003761062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8575594,"threshold_uncertainty_score":0.4153872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965387939","doi":"10.1609/socs.v10i1.18498","title":"Revisiting Suboptimal Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","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 Alberta","funders":"","keywords":"Bounded function; Search algorithm; Beam search; Iterative deepening depth-first search; Best-first search; Computer science; Mathematical optimization; Upper and lower bounds; Incremental heuristic search; Beam stack search; Bidirectional search; Node (physics); Search problem; Mathematics; Algorithm","authors":[{"name":"Jingwei Chen","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true},{"name":"William Doyle","is_ca":false},{"name":"Wheeler Ruml","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02214453960801229,"gpt":0.2754653915602443,"spread":0.253320851952232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001353408,0.0001592067,0.0002042237,0.00009183673,0.000203981,0.0003943967,0.002844098,0.00008504606,0.0000214287],"category_scores_gemma":[0.0004494086,0.0001335468,0.0001485053,0.0006352236,0.0000992108,0.0003918849,0.001480518,0.0004792001,0.00003974268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002196613,"about_ca_system_score_gemma":0.0001774002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003295634,"about_ca_topic_score_gemma":5.086331e-8,"domain_scores_codex":[0.9969089,0.0000445183,0.000354187,0.0005031929,0.001823912,0.0003653044],"domain_scores_gemma":[0.9977738,0.0002755331,0.0001327699,0.0002725965,0.001440558,0.0001047309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005186886,0.0002279016,0.007418774,0.00006031185,0.00009600996,0.00001948923,0.0005918851,0.001124336,0.1176625,0.8688948,0.0009349481,0.002917203],"study_design_scores_gemma":[0.001674531,0.0001873242,0.005990483,0.000580999,0.00001577921,0.0001566495,0.0001700579,0.09403087,0.8831698,0.01059099,0.002984462,0.0004480229],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7619923,0.0001096562,0.005030813,0.06607684,0.01623614,0.0006776343,0.00002117353,0.0003642287,0.1494912],"genre_scores_gemma":[0.9862417,0.00001654567,0.01190155,0.0001860526,0.0007616655,0.00001052492,0.000002505581,0.00001885266,0.0008605742],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8583037,"threshold_uncertainty_score":0.5445881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198437945","doi":"10.1609/socs.v12i1.18547","title":"Scaling Up Search with Partial Initial States in Optimization Crosswords","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"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":"Pruning; Solver; Computer science; Heuristic; Constraint (computer-aided design); Local search (optimization); Scaling; State (computer science); Mathematical optimization; Optimization problem; Competition (biology); Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Adi Botea","is_ca":false},{"name":"Vadim Bulitko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01569839476845511,"gpt":0.2746142410077062,"spread":0.2589158462392511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005126728,0.0001327986,0.0001500978,0.0001341742,0.0001479764,0.0004323277,0.0008161932,0.00007367902,0.0000669158],"category_scores_gemma":[0.0001331159,0.0001092433,0.00006082259,0.0007344157,0.0001050725,0.0005656352,0.0003919553,0.000306791,0.000004384432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002109955,"about_ca_system_score_gemma":0.0002350425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000872575,"about_ca_topic_score_gemma":0.000007114591,"domain_scores_codex":[0.9978961,0.00003573929,0.0003287826,0.0003797791,0.00111381,0.0002457894],"domain_scores_gemma":[0.9984348,0.0001350387,0.000107845,0.0001362364,0.001117636,0.00006844455],"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.0007070858,0.0005771788,0.03534984,0.00006214764,0.0001016947,0.00001229918,0.002984782,0.4730049,0.009701977,0.4718306,0.0002260629,0.005441366],"study_design_scores_gemma":[0.003466806,0.000200795,0.003234075,0.0002621642,0.00000889244,0.00003982292,0.000390277,0.6394478,0.3493905,0.002688705,0.0005571894,0.0003129761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9299566,0.0000121021,0.035561,0.01586936,0.006428539,0.0005519607,0.00001571527,0.0001220588,0.01148272],"genre_scores_gemma":[0.996142,0.00003040012,0.003351015,0.0001194794,0.0001805687,0.00001574871,0.00000879447,0.00001290619,0.0001390298],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4691419,"threshold_uncertainty_score":0.4454812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1581836567","doi":"10.1609/socs.v4i1.18281","title":"Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"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 Regina","keywords":"Heuristics; Cluster analysis; Sampling (signal processing); Heuristic; Partition (number theory); Tree (set theory); Computer science; Type (biology); Mathematics; Chen; Algorithm; Data mining; Mathematical optimization; Artificial intelligence; Combinatorics","authors":[{"name":"Levi H. S. Lelis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03088521368200103,"gpt":0.2737041193050974,"spread":0.2428189056230964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110109,0.0001901883,0.0002566815,0.00005931558,0.0003038976,0.0003125793,0.001439378,0.00008219992,0.000002158794],"category_scores_gemma":[0.0003165107,0.0001164114,0.00007291592,0.0005292292,0.0001182453,0.0001902411,0.0002757602,0.0003801144,4.571369e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001554582,"about_ca_system_score_gemma":0.0005051895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003274362,"about_ca_topic_score_gemma":0.00001883869,"domain_scores_codex":[0.9975265,0.00005221517,0.000379207,0.0004197001,0.001311657,0.0003107534],"domain_scores_gemma":[0.9954459,0.001277791,0.0003373805,0.0002544946,0.002617534,0.00006689119],"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.007699934,0.001190086,0.03047491,0.002512826,0.001249586,0.00000862849,0.009139063,0.4081119,0.1248246,0.4129207,0.000506519,0.001361335],"study_design_scores_gemma":[0.00418189,0.003284042,0.001851026,0.00277987,0.00008976836,0.00003634073,0.001191629,0.8003042,0.1836911,0.001844373,0.0003041084,0.0004416823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9389713,0.00006194664,0.036642,0.006599019,0.004242627,0.00260504,0.0001043256,0.0001770598,0.01059671],"genre_scores_gemma":[0.9959201,0.000010399,0.003584369,0.00002999006,0.0002178722,0.00005486743,0.00000736736,0.0000254373,0.0001496653],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4110763,"threshold_uncertainty_score":0.474712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037624080","doi":"10.1609/socs.v11i1.18529","title":"Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Heuristics; Constraint programming; Plan (archaeology); Computer science; Constraint (computer-aided design); Mathematical optimization; Combinatorial optimization; Class (philosophy); Theoretical computer science; Mathematics; Artificial intelligence; Stochastic programming","authors":[{"name":"Behrouz Babaki","is_ca":true},{"name":"Gilles Pesant","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03583909945246017,"gpt":0.2930853702677197,"spread":0.2572462708152596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132744,0.0001532658,0.0001725125,0.0001330083,0.0003009765,0.0005652319,0.0007671046,0.0001037127,0.00001287752],"category_scores_gemma":[0.0001345669,0.0001364094,0.00008000037,0.0003315236,0.00008297025,0.0005740272,0.0008685203,0.0004976538,0.000001874217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002256974,"about_ca_system_score_gemma":0.0001821308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003765705,"about_ca_topic_score_gemma":7.366075e-7,"domain_scores_codex":[0.9976788,0.00003379618,0.0003373428,0.0004589033,0.001212824,0.0002782954],"domain_scores_gemma":[0.9986598,0.0001145991,0.0001038671,0.0001287323,0.0008876186,0.000105392],"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.000109353,0.000261444,0.02681817,0.0001060632,0.0001393694,0.00001134873,0.003009275,0.307112,0.1837563,0.4767253,0.0001370291,0.001814352],"study_design_scores_gemma":[0.0007228552,0.00005344512,0.0005152819,0.0003089284,0.000008033023,0.00006367345,0.0001828782,0.9582077,0.0349448,0.004695787,0.0001356062,0.000161017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9176597,0.00005776244,0.06219974,0.01051412,0.003206721,0.0003565095,0.000004617542,0.0001062481,0.005894591],"genre_scores_gemma":[0.9973789,0.00001165245,0.002157463,0.0001396288,0.0001987054,0.000006226962,0.000001775718,0.00001440822,0.00009117106],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6510957,"threshold_uncertainty_score":0.5562614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313034700","doi":"10.1609/socs.v15i1.21758","title":"Optimal Search with Neural Networks: Challenges and Approaches","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"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":"Israel Science Foundation; United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Computer science; Machine learning; Artificial neural network; Heuristic; Artificial intelligence; Implementation; Classifier (UML); Beam search; Incremental heuristic search; Search algorithm; Algorithm","authors":[{"name":"Tianhua Li","is_ca":true},{"name":"Ruimin Chen","is_ca":true},{"name":"Borislav Mavrin","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Doron Nadav","is_ca":false},{"name":"Ariel Felner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04092795038074364,"gpt":0.2525866672370791,"spread":0.2116587168563355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001496069,0.0001690417,0.000196097,0.0001729041,0.0003939309,0.0002709402,0.002861581,0.00004211344,0.00003008093],"category_scores_gemma":[0.00007861282,0.0001268896,0.00006098502,0.0004876243,0.000181523,0.0003363084,0.002805365,0.0006445181,0.00000148602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001702606,"about_ca_system_score_gemma":0.00007351946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002521976,"about_ca_topic_score_gemma":3.290594e-7,"domain_scores_codex":[0.9963713,0.00008587979,0.0002592095,0.0005438263,0.00238391,0.0003558301],"domain_scores_gemma":[0.9987809,0.0002298237,0.0001174082,0.0002298689,0.0005186058,0.0001233806],"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.0004876068,0.0005593632,0.0009175203,0.00005491493,0.0001502429,0.000005333641,0.001687736,0.1282885,0.0005397946,0.856572,0.0003233107,0.01041365],"study_design_scores_gemma":[0.001171419,0.0007894121,0.0009090505,0.00001937045,0.000006744863,0.00006107672,0.0003955908,0.9921149,0.002642474,0.000924454,0.000777774,0.000187721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8229221,0.001025433,0.009628237,0.1037064,0.008347123,0.003267087,0.00003685459,0.0003760376,0.0506908],"genre_scores_gemma":[0.9962807,0.0001140805,0.002892153,0.00006294272,0.000223964,0.00009491174,0.000002052974,0.00002217846,0.000306986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8638265,"threshold_uncertainty_score":0.5317578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3140231913","doi":"10.1609/socs.v11i1.18518","title":"Multi-Directional Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":5,"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":"Heuristics; Task (project management); Mathematical optimization; Computer science; Path (computing); Search algorithm; Search problem; Algorithm; Mathematics; Engineering","authors":[{"name":"Dor Atzmon","is_ca":false},{"name":"Jiaoyang Li","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Eliran Nachmani","is_ca":false},{"name":"Shahaf Shperberg","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Sven Koenig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02156412357777802,"gpt":0.2645110027244927,"spread":0.2429468791467147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015863,0.0001617805,0.0001628944,0.0001103591,0.0002016682,0.0003252519,0.002632369,0.00006848406,0.00008678842],"category_scores_gemma":[0.0001373945,0.0001373203,0.00017248,0.0007024857,0.00009914714,0.0003282625,0.001816518,0.0003573395,0.00005576346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004370995,"about_ca_system_score_gemma":0.0001694777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006381304,"about_ca_topic_score_gemma":0.000002162955,"domain_scores_codex":[0.9968666,0.00004690585,0.0003245211,0.0005486301,0.001885826,0.0003274902],"domain_scores_gemma":[0.9981095,0.0001757713,0.0001104018,0.0002902367,0.001213155,0.0001009025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008221735,0.0007811883,0.003563585,0.00004769312,0.0001760162,0.000008883851,0.0002220309,0.001530668,0.1045205,0.8784417,0.008176272,0.002449226],"study_design_scores_gemma":[0.002663662,0.0002076083,0.004836963,0.000201049,0.00001797913,0.00003298418,0.0000939528,0.07075562,0.8704804,0.008154026,0.04213998,0.0004158384],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6984079,0.0001632124,0.01086362,0.07250266,0.04239754,0.002124598,0.00003654993,0.000622551,0.1728813],"genre_scores_gemma":[0.9920273,0.00003943393,0.00385037,0.0003976573,0.0005130231,0.00004758466,0.000003612544,0.00001904073,0.003101962],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8702877,"threshold_uncertainty_score":0.5599759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144283734","doi":"10.1609/socs.v2i1.18207","title":"Probably Approximately Correct Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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","keywords":"Generalization; Heuristic; Beam search; Incremental heuristic search; Task (project management); Bidirectional search; Search algorithm; Computer science; Best-first search; Quality (philosophy); Algorithm; Sequence (biology); Beam stack search; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","authors":[{"name":"Roni Stern","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01421099653445188,"gpt":0.2573462545962829,"spread":0.243135258061831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045084,0.0001761166,0.0002095398,0.00009155805,0.0002231463,0.0004443042,0.002591793,0.00007927311,0.00003656234],"category_scores_gemma":[0.0004302617,0.0001379561,0.0001506101,0.0006274706,0.0001085656,0.0002627013,0.001247676,0.0005873253,0.00004617083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001600856,"about_ca_system_score_gemma":0.0001805431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008105225,"about_ca_topic_score_gemma":5.450842e-7,"domain_scores_codex":[0.9971054,0.00005723687,0.000316704,0.0005236167,0.001649545,0.000347493],"domain_scores_gemma":[0.9980793,0.0002183658,0.0001245553,0.0002565246,0.001215098,0.0001061612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000851444,0.0005578538,0.00387567,0.0000912164,0.00008743494,0.00001002468,0.0005791081,0.0003845278,0.04536201,0.941925,0.002091677,0.004950359],"study_design_scores_gemma":[0.002654161,0.0005566411,0.002902747,0.000455074,0.00002278683,0.0001928176,0.0001626656,0.1229858,0.8044645,0.04860764,0.0163415,0.0006536217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.711372,0.0000945615,0.00389943,0.04705405,0.02359718,0.001012054,0.000025313,0.0004873348,0.2124581],"genre_scores_gemma":[0.9953901,0.00001762914,0.001652662,0.0001625489,0.0004624127,0.00001956534,0.000003309964,0.00001935738,0.002272393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8933173,"threshold_uncertainty_score":0.5625688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1113434642","doi":"10.1609/socs.v6i1.18358","title":"Sibling Conspiracy Number Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"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":"Monte Carlo tree search; Heuristic; Champion; Computer science; Null-move heuristic; Iterative deepening depth-first search; Tree (set theory); Game tree; Search algorithm; Node (physics); Search tree; Beam search; Incremental heuristic search; Bidirectional search; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Monte Carlo method; Statistics; Combinatorics; Game theory; Sequential game; Mathematical economics; Engineering","authors":[{"name":"Jakub Pawlewicz","is_ca":false},{"name":"Ryan Hayward","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0333294881215903,"gpt":0.311779623732312,"spread":0.2784501356107217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027053,0.000164668,0.0001924558,0.00008790811,0.0002199741,0.0005068438,0.003089716,0.00009829379,0.0001397532],"category_scores_gemma":[0.0005667626,0.0001381233,0.0001728531,0.0008005489,0.0002125571,0.0005665918,0.001587353,0.0004664496,0.0001819017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002114348,"about_ca_system_score_gemma":0.0002210786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001013186,"about_ca_topic_score_gemma":0.000001495303,"domain_scores_codex":[0.996901,0.00004057772,0.000423444,0.0005057335,0.001769745,0.0003595009],"domain_scores_gemma":[0.9969449,0.0003999268,0.0001308887,0.0002944132,0.002123823,0.0001060533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003934636,0.0002575524,0.009333632,0.00001944687,0.00005079918,0.000004651475,0.0005774435,0.0001270208,0.08704254,0.8996911,0.0009856797,0.001870759],"study_design_scores_gemma":[0.0002609756,0.00005496827,0.0003834101,0.0001086259,0.000005192896,0.00002744046,0.0001863482,0.006135054,0.9425625,0.04419049,0.005914536,0.0001704555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8415285,0.00002191948,0.0009192148,0.02562286,0.008046721,0.0003164079,0.00000702239,0.0001303602,0.1234069],"genre_scores_gemma":[0.9968259,0.00002748216,0.001146793,0.0003354647,0.0004352323,0.0000135765,0.000001047281,0.00001723713,0.001197243],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.85552,"threshold_uncertainty_score":0.5741513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395906882","doi":"10.1609/socs.v3i1.18234","title":"Multimapping Abstractions and Hierarchical Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"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":"Computer science; Abstraction; Domain (mathematical analysis); Benchmark (surveying); Heuristic; Set (abstract data type); Abstract interpretation; State (computer science); Theoretical computer science; State space; Function (biology); Space (punctuation); Key (lock); Programming language; Artificial intelligence; Mathematics","authors":[{"name":"Bo Pang","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01774095050964933,"gpt":0.2618603877847979,"spread":0.2441194372751485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774265,0.0001219802,0.000140731,0.00008704405,0.0002977808,0.0003378929,0.001042741,0.00007532848,0.00001835202],"category_scores_gemma":[0.0002848332,0.0001033671,0.00007681359,0.0002843917,0.0001181861,0.0002670125,0.0007298755,0.000545676,0.00001337327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000075854,"about_ca_system_score_gemma":0.0001278429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006950766,"about_ca_topic_score_gemma":6.603292e-7,"domain_scores_codex":[0.9981756,0.00003392585,0.00025326,0.0003856731,0.000900441,0.0002510965],"domain_scores_gemma":[0.9985204,0.0004919014,0.00007937624,0.0001511729,0.000652938,0.0001042093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006977501,0.0002828354,0.008306055,0.00007989167,0.00008706261,0.000009249702,0.0009400283,0.0004776883,0.0980776,0.8879958,0.000930201,0.00274382],"study_design_scores_gemma":[0.004474701,0.0005899522,0.03156155,0.001270077,0.000049192,0.0003870163,0.00047853,0.2012157,0.6538935,0.08036116,0.02463775,0.001080912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9039879,0.00008993305,0.002550721,0.04380073,0.004967471,0.0003524809,0.00002066001,0.0001622638,0.04406778],"genre_scores_gemma":[0.9968995,0.00002176348,0.002280624,0.0001257767,0.0002178706,0.000008724066,0.000002430066,0.000009942214,0.000433403],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8076347,"threshold_uncertainty_score":0.4215187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312409458","doi":"10.1609/socs.v15i1.21749","title":"Portability and Explainability of Synthesized Formula-based Heuristics","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"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":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Pathfinding; Heuristics; Computer science; Parameterized complexity; Heuristic; Simulated annealing; Theoretical computer science; Graph; Mathematical optimization; Fitness function; Algorithm; Genetic algorithm; Artificial intelligence; Machine learning; Mathematics; Shortest path problem","authors":[{"name":"Vadim Bulitko","is_ca":true},{"name":"Shuwei Wang","is_ca":true},{"name":"J. R. Stevens","is_ca":true},{"name":"Levi H. S. Lelis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01996115988541072,"gpt":0.2687441206505433,"spread":0.2487829607651326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00162012,0.0001212855,0.0002038314,0.0000853092,0.0002276933,0.00006673363,0.002218329,0.00003894212,0.00003482693],"category_scores_gemma":[0.0008081409,0.000102347,0.0001138417,0.0003268129,0.0002287625,0.0001914038,0.00128448,0.0002807658,8.627368e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002430606,"about_ca_system_score_gemma":0.0001193932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001517582,"about_ca_topic_score_gemma":0.000001049859,"domain_scores_codex":[0.9975884,0.00004617705,0.0004585203,0.0003594638,0.00135685,0.0001905979],"domain_scores_gemma":[0.9981289,0.0005591871,0.0002691514,0.000256054,0.0007289259,0.00005780117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003999717,0.000736981,0.03751477,0.00007681951,0.0000328029,6.673131e-7,0.0007551531,0.0005270616,0.03135687,0.927052,0.0001843818,0.001362486],"study_design_scores_gemma":[0.0005401112,0.0005877494,0.003826785,0.00004382687,0.00001219631,0.000005755665,0.0003479706,0.04636596,0.7631292,0.1839961,0.0009306442,0.0002137658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9896816,0.000008617169,0.0004159002,0.004977038,0.001920866,0.0003995861,0.00001852307,0.00003658708,0.002541263],"genre_scores_gemma":[0.9991395,0.000002187051,0.0006530356,0.00006313821,0.00005772717,0.00004593586,5.648705e-7,0.000008357522,0.00002952198],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.743056,"threshold_uncertainty_score":0.4173589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481890926","doi":"10.1609/socs.v5i1.18319","title":"A* with Lookahead Re-Evaluated","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":4,"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":"Computer science; Pruning; Node (physics); Bounded function; Value (mathematics); Unit (ring theory); Algorithm; Mathematical optimization; Parallel computing; Mathematics; Machine learning","authors":[{"name":"Zhaoxing Bu","is_ca":true},{"name":"Roni Stern","is_ca":false},{"name":"Ariel Felner","is_ca":false},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01875807753511326,"gpt":0.2684317590366669,"spread":0.2496736815015537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004035482,0.0001265628,0.0001574961,0.00004774088,0.0001349737,0.0001208112,0.001132216,0.00004446774,0.00002384712],"category_scores_gemma":[0.0001336017,0.0000856261,0.00006725996,0.0004375111,0.00007945419,0.0004823646,0.0006800391,0.0002098652,0.00001476063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001201303,"about_ca_system_score_gemma":0.0001387199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005180952,"about_ca_topic_score_gemma":0.000004810486,"domain_scores_codex":[0.9979191,0.00001787651,0.0002352574,0.0003674281,0.001259291,0.0002010414],"domain_scores_gemma":[0.9981078,0.00008390555,0.0001346715,0.000247675,0.001363003,0.0000629795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008706572,0.0001308431,0.001168897,0.00002356493,0.00004770571,0.000003957751,0.0001979677,0.00004901956,0.04916093,0.947818,0.001048225,0.000263862],"study_design_scores_gemma":[0.001796156,0.0003739766,0.0009215263,0.0003792185,0.00001144359,0.00006045358,0.0001955936,0.002619305,0.9312877,0.01343463,0.04863965,0.0002803294],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7745442,0.00008944251,0.008072184,0.04192379,0.01301108,0.0009027952,0.00005802826,0.0002853411,0.1611132],"genre_scores_gemma":[0.9950215,0.00001438627,0.003478747,0.0001741203,0.0002794497,0.00002139162,0.00000427807,0.00001391339,0.000992241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9343833,"threshold_uncertainty_score":0.3491731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406156603","doi":"10.1609/socs.v3i1.18247","title":"A Theoretical Framework for Studying Random Walk Planning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"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; Computer science; Branching (polymer chemistry); Graph; Mathematics; Theoretical computer science; Artificial intelligence; Statistics","authors":[{"name":"Hootan Nakhost","is_ca":true},{"name":"Martin Mueller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0236050720015905,"gpt":0.2930198622392588,"spread":0.2694147902376683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180774,0.000153619,0.0002171587,0.00006601141,0.0002980031,0.0003763163,0.001836502,0.0001131333,0.00002435496],"category_scores_gemma":[0.0008935899,0.0001204857,0.000173635,0.0003232963,0.00008858997,0.0002154027,0.000649657,0.0004297614,0.000004450212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001050141,"about_ca_system_score_gemma":0.0001150356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006244868,"about_ca_topic_score_gemma":5.340406e-8,"domain_scores_codex":[0.9979505,0.00003154826,0.000316676,0.0004191044,0.0009694094,0.000312787],"domain_scores_gemma":[0.9973721,0.001357852,0.000145658,0.0001863866,0.0008580199,0.00008000155],"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.0002577413,0.0001336193,0.002614629,0.00003676854,0.00007252061,0.000002158963,0.001019822,0.0002465055,0.007500071,0.9871645,0.0005492375,0.000402405],"study_design_scores_gemma":[0.002700119,0.0003077671,0.0002823806,0.000772085,0.00002100777,0.00001992499,0.0001979898,0.03211403,0.1793596,0.7822307,0.00172746,0.0002668974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7402225,0.0002747004,0.1206854,0.0692841,0.02380991,0.001748912,0.0000399001,0.0004119928,0.0435226],"genre_scores_gemma":[0.9878791,0.000004945124,0.01116438,0.0002873541,0.0005088034,0.00004425356,0.000002420668,0.00001624179,0.00009249918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2476566,"threshold_uncertainty_score":0.4913266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734286001","doi":"10.1609/socs.v8i1.18432","title":"Cost-Based Heuristics and Node Re-Expansions across the Phase Transition","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"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":"Maxima and minima; Heuristics; Heuristic; Mathematical optimization; Node (physics); Operator (biology); Phase transition; Computer science; Incremental heuristic search; Function (biology); Mathematics; Search algorithm; Beam search; Physics; Chemistry","authors":[{"name":"Eldan Cohen","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03631725374454819,"gpt":0.3384428152916933,"spread":0.3021255615471451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151187,0.0001524814,0.0001746396,0.00006222188,0.000442807,0.0005489754,0.001723101,0.00007829647,0.00003759131],"category_scores_gemma":[0.0007666604,0.0001063854,0.0001012555,0.0006318579,0.0002203613,0.0002438146,0.0006216638,0.0004240316,0.000008218127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001274807,"about_ca_system_score_gemma":0.0001909385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003453191,"about_ca_topic_score_gemma":0.000001564547,"domain_scores_codex":[0.9971755,0.000070121,0.000356664,0.0004290128,0.001663266,0.0003054661],"domain_scores_gemma":[0.99704,0.000499811,0.0001324712,0.0003010396,0.001906384,0.0001203223],"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.0008166078,0.003888292,0.001010748,0.0002388498,0.0003250977,0.00003271324,0.006961789,0.008859742,0.1162601,0.8405146,0.009726183,0.01136527],"study_design_scores_gemma":[0.005021597,0.0003029345,0.0003950383,0.0001549794,0.00002291901,0.00003125178,0.0004020755,0.6926606,0.2850839,0.00764525,0.007996113,0.000283304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4704867,0.0001496831,0.1661514,0.3295205,0.01511457,0.00296084,0.0003880217,0.000318609,0.01490971],"genre_scores_gemma":[0.9942102,0.00006008306,0.004425111,0.0006934881,0.0002613472,0.00005143815,0.00001046128,0.00001894187,0.0002688756],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8328694,"threshold_uncertainty_score":0.5293782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1806352760","doi":"10.1609/socs.v2i1.18210","title":"Abstract: Block A* and Any-Angle Path-Planning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"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":"Grid; Block (permutation group theory); Path (computing); Any-angle path planning; Motion planning; Boundary (topology); Computer science; Algorithm; City block; Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Geography","authors":[{"name":"Peter Yap","is_ca":true},{"name":"Neil Burch","is_ca":true},{"name":"Robert C. Holte","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02612477863450591,"gpt":0.2874467456469271,"spread":0.2613219670124212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696518,0.0001281655,0.000143728,0.00006015657,0.0001581524,0.0003509917,0.001476181,0.00007560165,0.00001926849],"category_scores_gemma":[0.0002868707,0.0001065695,0.00007788472,0.0002859599,0.0001022123,0.0003750993,0.0009198169,0.0002844144,0.00001631512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009522521,"about_ca_system_score_gemma":0.00007692717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004877557,"about_ca_topic_score_gemma":6.117739e-7,"domain_scores_codex":[0.9981364,0.000009813361,0.000294132,0.000380043,0.0009405388,0.0002390688],"domain_scores_gemma":[0.9985888,0.000186101,0.0001329655,0.0001683155,0.0008405782,0.00008325322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005179162,0.0002992784,0.01305457,0.00004051593,0.00006097783,0.00001384721,0.001494988,0.0001448425,0.2312856,0.7493805,0.002149051,0.002024086],"study_design_scores_gemma":[0.0002841696,0.0001102597,0.0053399,0.0002134306,0.000006349634,0.00004095991,0.0002445912,0.004377625,0.9377303,0.0460837,0.005365829,0.0002029349],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9607211,0.00006094783,0.00006347849,0.00984396,0.00398625,0.0001477137,0.000004058372,0.00005944998,0.02511308],"genre_scores_gemma":[0.9986767,0.000021939,0.0004973943,0.0001609785,0.0003205346,0.000008595861,4.892313e-7,0.00001058602,0.0003027484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7064447,"threshold_uncertainty_score":0.4345776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2731063979","doi":"10.1609/socs.v8i1.18433","title":"An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"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":"University of Toronto","keywords":"Heuristic; Benchmark (surveying); Solver; Consistent heuristic; Computer science; Incremental heuristic search; Algorithm; Function (biology); Mathematical optimization; Mathematics; Beam search; Artificial intelligence; Search algorithm","authors":[{"name":"Richard Valenzano","is_ca":true},{"name":"Danniel Sihui Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02056801335923221,"gpt":0.2853870117131508,"spread":0.2648189983539186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435696,0.0001078414,0.0001814789,0.00005679519,0.0002395802,0.000173236,0.002185932,0.00004296082,0.00000573118],"category_scores_gemma":[0.0003015578,0.00006147047,0.0001518107,0.0005901261,0.0001132999,0.0001453023,0.0006010382,0.0001613518,6.867308e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007887496,"about_ca_system_score_gemma":0.00007352975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007835432,"about_ca_topic_score_gemma":0.000002572215,"domain_scores_codex":[0.9982114,0.0000294755,0.0002879118,0.0003174215,0.0009761562,0.0001775787],"domain_scores_gemma":[0.9981173,0.0004124876,0.0002131862,0.0003110629,0.0009019828,0.00004397121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001668775,0.0009467409,0.0347493,0.0001319419,0.001313099,0.000001273753,0.002960664,0.002948019,0.1702616,0.7832794,0.0007782808,0.002462797],"study_design_scores_gemma":[0.001093902,0.000306445,0.02305818,0.0001327324,0.0002163426,0.000009256559,0.0002242014,0.2917966,0.6644287,0.01776567,0.0007750145,0.0001929756],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9094948,0.0001507557,0.03912803,0.03534283,0.01117085,0.00125559,0.00005467157,0.00005514709,0.003347357],"genre_scores_gemma":[0.9971589,0.00001821003,0.00226771,0.0000898033,0.000172771,0.00003395505,0.000001482343,0.000006849516,0.0002503399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7655137,"threshold_uncertainty_score":0.4062043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402719117","doi":"10.1609/socs.v3i1.18258","title":"Learning Heuristic Functions Faster by Using Predicted Solution Costs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"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 - Technology Futures; University of Regina","keywords":"Heuristics; Heuristic; Speedup; Computer science; Process (computing); Set (abstract data type); Hyper-heuristic; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","authors":[{"name":"Levi H. S. Lelis","is_ca":true},{"name":"Shahab Jabbari Arfaee","is_ca":true},{"name":"Sandra Zilles","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01169852186167333,"gpt":0.2546399854608649,"spread":0.2429414635991916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004414687,0.0001396239,0.0001449045,0.00007479358,0.0003410881,0.0003116896,0.001040574,0.00007719127,0.0000293565],"category_scores_gemma":[0.0003610005,0.0001196371,0.000105621,0.0004601444,0.00005870375,0.0003072245,0.0006812905,0.0005586053,0.0000127633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002725124,"about_ca_system_score_gemma":0.0000923046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001253459,"about_ca_topic_score_gemma":4.551632e-7,"domain_scores_codex":[0.9979787,0.00005044641,0.0002708172,0.0003897532,0.001058674,0.0002515754],"domain_scores_gemma":[0.9985615,0.000124217,0.0001645556,0.0001367723,0.0009341737,0.0000787567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001840059,0.0008693194,0.02731972,0.00009339109,0.0003006081,0.000006752479,0.001104185,0.00335935,0.8139266,0.1318349,0.01141188,0.009589314],"study_design_scores_gemma":[0.002403593,0.0005847599,0.001767197,0.0004006622,0.00004084588,0.00009238762,0.0001921774,0.7618452,0.2113355,0.002757309,0.01809832,0.0004820459],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9413309,0.00004510718,0.01248193,0.0122843,0.0127669,0.0003199468,0.00002659768,0.0002517821,0.02049252],"genre_scores_gemma":[0.9966703,0.000008390196,0.0005617047,0.000080735,0.000422786,0.000008096957,0.00001048162,0.00001507529,0.002222442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7584858,"threshold_uncertainty_score":0.487866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}