{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005100094,0.002039945,0.001374624,0.003638997,0.0012331,0.004489985,0.004669139,0.002853485,0.003154344],"category_scores_gemma":[0.02304451,0.0006852839,0.00105047,0.01084851,0.002123594,0.006865674,0.002821902,0.003772513,0.0009344367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003495203,"about_ca_system_score_gemma":0.002171683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007099685,"about_ca_topic_score_gemma":0.005211484,"domain_scores_codex":[0.993394,0.002227681,0.0006061114,0.001107573,0.002103583,0.0005612011],"domain_scores_gemma":[0.988049,0.007675411,0.000962854,0.001598766,0.00126535,0.0004485639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004780976,0.000579102,0.003189164,0.002964776,0.0001485457,0.0002523839,0.0003449272,0.6129848,0.001276249,0.1435756,0.02899852,0.2052077],"study_design_scores_gemma":[0.0001277325,0.0003549395,0.001657108,0.0006893526,0.00007907765,0.0006125347,0.0004694174,0.7415267,0.003535317,0.1844439,0.06641805,0.00008588006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.08390671,0.07273231,0.749755,0.005020854,0.001152084,0.001189277,0.006855527,0.003992307,0.07539588],"genre_scores_gemma":[0.4124347,0.02147439,0.5506796,0.0007559397,0.0004869373,0.001492577,0.00700237,0.0009999997,0.004673539],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.007099685,"threshold_uncertainty_score":0.02697223,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645,0.0005109775,0.0006177453,0.0006287427,0.0007772893,0.000989435,0.001759923,0.0008433584,0.004637862],"category_scores_gemma":[0.00182229,0.0005098624,0.0008352745,0.0007841084,0.001441007,0.001483042,0.001381284,0.001481327,0.0005893414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097715,"about_ca_system_score_gemma":0.001582036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002783337,"about_ca_topic_score_gemma":0.00545935,"domain_scores_codex":[0.9993352,0.0002267443,0.0000296842,0.00009755749,0.0002424537,0.00006833714],"domain_scores_gemma":[0.9994009,0.0003036376,0.0000322368,0.0001398329,0.00008720062,0.00003612086],"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.00006586717,0.00009088463,0.0003474935,0.0001195637,0.00005966286,0.00004485406,0.00009863439,0.696239,0.006239852,0.2263403,0.001531517,0.06882225],"study_design_scores_gemma":[0.00002054287,0.00003141739,0.00008749128,0.000006913856,0.00000805987,0.00001924738,0.00001809865,0.9343621,0.001259196,0.06120437,0.002974047,0.000008609777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007972557,0.0001206248,0.9860899,0.0002335594,0.00002553943,0.00004738183,0.00002635169,0.000172842,0.005311278],"genre_scores_gemma":[0.1805664,0.0002250671,0.8142045,0.0002274939,0.00006290729,0.0002114562,0.00008516228,0.0001178013,0.004299284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004637862,"threshold_uncertainty_score":0.01551521,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019284,0.0007740314,0.0009838664,0.002381751,0.001756224,0.002884951,0.001009768,0.00149405,0.00215744],"category_scores_gemma":[0.01697939,0.0008751545,0.0007580128,0.002504447,0.002430845,0.005290264,0.002948056,0.00151223,0.0004143991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001791818,"about_ca_system_score_gemma":0.0008951775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002078027,"about_ca_topic_score_gemma":0.002070429,"domain_scores_codex":[0.9971424,0.001325751,0.0001407666,0.0004989298,0.0005725918,0.000319534],"domain_scores_gemma":[0.9868886,0.009900423,0.001431306,0.0007157066,0.0004295319,0.0006344402],"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.0005892642,0.000169558,0.01293741,0.0003746733,0.0001530541,0.00038465,0.001945925,0.5286543,0.005217222,0.3447733,0.004516191,0.1002843],"study_design_scores_gemma":[0.00005795794,0.00007861087,0.002559234,0.00005650488,0.00004278318,0.0003914658,0.0006575916,0.508946,0.00209251,0.4797038,0.005363557,0.00005004508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4583694,0.001717808,0.5251803,0.002071017,0.0000549923,0.0002004444,0.0006399503,0.00046651,0.01129963],"genre_scores_gemma":[0.9004723,0.0008138778,0.09569649,0.0001321081,0.00005879501,0.0001396974,0.0003200709,0.00006911274,0.002297528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002884951,"threshold_uncertainty_score":0.01300061,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009261227,0.00111465,0.001006259,0.000851517,0.001331906,0.001158247,0.002265531,0.001556384,0.009073798],"category_scores_gemma":[0.004101477,0.000687192,0.0014855,0.001304924,0.001194825,0.002367725,0.00239911,0.002062217,0.002324971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327062,"about_ca_system_score_gemma":0.003665866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004831668,"about_ca_topic_score_gemma":0.006130144,"domain_scores_codex":[0.9990244,0.0001745702,0.00006385875,0.0002697106,0.0002875825,0.0001798674],"domain_scores_gemma":[0.9982173,0.001003921,0.0001321966,0.0003368877,0.0002025012,0.0001071092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000337715,0.0003767311,0.001085419,0.0007565806,0.000112986,0.0003198544,0.0006430416,0.2714388,0.01314219,0.1012546,0.01982977,0.5907023],"study_design_scores_gemma":[0.0001716099,0.0001736201,0.0002494204,0.00003006311,0.00003805929,0.0002835404,0.0001431458,0.920356,0.004046819,0.06306463,0.01141581,0.00002718196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00632835,0.0001422388,0.9873204,0.0002417979,0.00003848724,0.0001331939,0.00007670251,0.002019127,0.00369956],"genre_scores_gemma":[0.1141394,0.0001675072,0.8820344,0.0001076646,0.00001882129,0.0002413746,0.0003986278,0.0002530168,0.002639222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009073798,"threshold_uncertainty_score":0.03035486,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00330136,0.001263924,0.001341227,0.001323402,0.001916807,0.001804237,0.002015209,0.00182985,0.003444965],"category_scores_gemma":[0.01247774,0.0006540864,0.0006200623,0.001918696,0.001786789,0.001584635,0.001374242,0.001933568,0.0001784766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0120091,"about_ca_system_score_gemma":0.01584999,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.3597082,"about_ca_topic_score_gemma":0.3011383,"domain_scores_codex":[0.9979743,0.000530123,0.00007506827,0.0002379001,0.0007523871,0.0004302664],"domain_scores_gemma":[0.9933129,0.004387912,0.0005320578,0.0003549964,0.0007703585,0.0006418137],"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.0001185401,0.00004783468,0.0005144452,0.00005501067,0.00001715435,0.00002987104,0.00005318126,0.9721401,0.000242068,0.01572114,0.001531201,0.009529398],"study_design_scores_gemma":[0.00006420181,0.00003698124,0.0004570249,0.00001015844,0.000009082864,0.00001777954,0.00003839523,0.9864216,0.0002878239,0.01165931,0.0009836633,0.00001409482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3529237,0.00187098,0.6115571,0.003627108,0.0001553036,0.0006732903,0.001502397,0.001595638,0.02609445],"genre_scores_gemma":[0.9097731,0.0007878607,0.08539072,0.0002361581,0.00003335781,0.0001433085,0.0007128217,0.00009148853,0.002831158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6402918,"threshold_uncertainty_score":0.7152289,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003749405,0.001415354,0.001248308,0.00198072,0.001368003,0.002065287,0.004585653,0.001746358,0.00373694],"category_scores_gemma":[0.01309672,0.00100176,0.002741395,0.002192151,0.002325093,0.005572244,0.005215584,0.005388855,0.000881272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123952,"about_ca_system_score_gemma":0.001879782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001831251,"about_ca_topic_score_gemma":0.002135064,"domain_scores_codex":[0.9954259,0.001122674,0.0003761663,0.0007794643,0.001968725,0.0003270577],"domain_scores_gemma":[0.9920713,0.003436971,0.001019721,0.002487194,0.0007488271,0.0002360101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002666248,0.00045542,0.002392044,0.00080761,0.000317004,0.000625036,0.0008425503,0.2466612,0.02772515,0.2841273,0.005691773,0.4300883],"study_design_scores_gemma":[0.00009993627,0.0001503148,0.000376261,0.00007881822,0.00008224007,0.0004832974,0.0001509881,0.7883778,0.01262959,0.1876073,0.009899468,0.00006401896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003115162,0.0001375997,0.994931,0.000139023,0.00003555539,0.00009831155,0.0000353933,0.0004034051,0.001104605],"genre_scores_gemma":[0.07976776,0.0001601765,0.9187198,0.0001317433,0.00004909426,0.0001734276,0.0001447517,0.0001706679,0.0006826026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004585653,"threshold_uncertainty_score":0.01982898,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119405,0.0006920914,0.0004774033,0.0003901056,0.0004442387,0.001089512,0.001216133,0.0008920906,0.002528832],"category_scores_gemma":[0.006395522,0.0004360209,0.0007341806,0.0003934482,0.001319316,0.001380695,0.001186764,0.001722088,0.0004153552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009874748,"about_ca_system_score_gemma":0.002953161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005760891,"about_ca_topic_score_gemma":0.007251036,"domain_scores_codex":[0.9992613,0.000260271,0.0000505116,0.0001231367,0.0001929284,0.0001117528],"domain_scores_gemma":[0.9971702,0.001960547,0.0002568685,0.000261761,0.0002314674,0.0001192156],"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.000165046,0.00009844316,0.0008459283,0.0001346491,0.0000333378,0.0001762164,0.0002280699,0.8655651,0.006333282,0.07145265,0.001107599,0.05385974],"study_design_scores_gemma":[0.00002058397,0.00003438525,0.00003598481,0.00001244757,0.00001023786,0.0000190363,0.00001623561,0.9676693,0.003147324,0.02785897,0.001167721,0.000007874672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01563658,0.00008654185,0.980171,0.0002388581,0.00002895244,0.0000697854,0.00006588587,0.001377338,0.002325061],"genre_scores_gemma":[0.6170176,0.0002080221,0.3792002,0.0002120904,0.00002137282,0.0002627689,0.0001739331,0.0002924647,0.002611511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005760891,"threshold_uncertainty_score":0.0114547,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0422175,0.001221202,0.001341146,0.005076356,0.003796605,0.009832144,0.006266635,0.009449951,0.005723858],"category_scores_gemma":[0.1359442,0.00114169,0.001337795,0.004977596,0.04839748,0.01746473,0.004343316,0.01617819,0.002114655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005774842,"about_ca_system_score_gemma":0.003285259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003687264,"about_ca_topic_score_gemma":0.001745268,"domain_scores_codex":[0.9602981,0.02358561,0.002601331,0.003440745,0.008955273,0.001118908],"domain_scores_gemma":[0.7859979,0.1877756,0.004816329,0.008841969,0.01144179,0.001126364],"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.0001288714,0.00003146792,0.0005432994,0.0006555136,0.00008237644,0.0002176223,0.00446576,0.002917041,0.0001229755,0.9430224,0.01954929,0.0282633],"study_design_scores_gemma":[0.00005383738,0.00003686403,0.0002048716,0.0007441954,0.0000260714,0.0003716665,0.001811003,0.003295159,0.0004808886,0.9331135,0.05980289,0.0000591249],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.02382506,0.05833205,0.2492897,0.5184829,0.006778317,0.0002146235,0.0004818513,0.0008959157,0.1416995],"genre_scores_gemma":[0.7339096,0.03958897,0.1028794,0.1037943,0.01009654,0.0008147864,0.000351178,0.0005447416,0.008020327],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.0422175,"threshold_uncertainty_score":0.2232702,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006177041,0.0006483115,0.0005589774,0.0008173423,0.0005334421,0.0005668011,0.001632041,0.0008068556,0.007083673],"category_scores_gemma":[0.00258181,0.000280211,0.0007998427,0.001316011,0.000739022,0.001866985,0.001871514,0.0009614556,0.001553472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003155479,"about_ca_system_score_gemma":0.0009430418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168586,"about_ca_topic_score_gemma":0.002131149,"domain_scores_codex":[0.9995486,0.0001127456,0.00003590408,0.0001074915,0.0001235455,0.00007163774],"domain_scores_gemma":[0.9982509,0.0008077615,0.00008572539,0.0006035853,0.0001878989,0.00006410764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005761227,0.0003344245,0.002310643,0.0004877741,0.0000814606,0.0005060197,0.0002705154,0.09043116,0.03770797,0.03632063,0.02432345,0.8066498],"study_design_scores_gemma":[0.0001789249,0.0005056045,0.001085688,0.00006786716,0.0001034853,0.001156423,0.0001757643,0.8373048,0.0447023,0.08087748,0.03378873,0.00005302898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103223,0.001071913,0.863479,0.0006706261,0.0001928247,0.0004633889,0.001006089,0.008846615,0.02104671],"genre_scores_gemma":[0.415419,0.0003702102,0.5704985,0.00058345,0.000078552,0.000484606,0.001650077,0.0006688034,0.01024691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007083673,"threshold_uncertainty_score":0.02369726,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131844,0.0005588916,0.0008374989,0.001080618,0.0006088783,0.00119395,0.001620261,0.000794384,0.002270721],"category_scores_gemma":[0.004736852,0.0005019088,0.000530688,0.001548999,0.0009174104,0.00204672,0.001530819,0.00117945,0.0005225609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007907712,"about_ca_system_score_gemma":0.001420632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00240654,"about_ca_topic_score_gemma":0.00333565,"domain_scores_codex":[0.9992574,0.0002964538,0.00006763008,0.0001248252,0.0001723983,0.00008135036],"domain_scores_gemma":[0.9972727,0.001752193,0.0002184753,0.0004517343,0.000214249,0.00009064228],"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.0003557298,0.0001940643,0.001311389,0.0002970658,0.00007612921,0.0001076914,0.0002274517,0.625634,0.003920022,0.05927865,0.002637477,0.3059604],"study_design_scores_gemma":[0.0000603302,0.0001370344,0.0001656027,0.00002240121,0.00002075471,0.00006554885,0.00004379958,0.9598128,0.003485685,0.03376387,0.002402797,0.00001948557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02072152,0.0002850678,0.9758781,0.00005388025,0.00002484387,0.00006342852,0.00007989272,0.001054662,0.001838563],"genre_scores_gemma":[0.3051657,0.0002355669,0.6926758,0.00007614218,0.00001519739,0.0002167546,0.0003078268,0.0001655856,0.001141329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00240654,"threshold_uncertainty_score":0.007596314,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162346,0.00135046,0.0009816632,0.001114191,0.0004426455,0.001073405,0.001935957,0.001067158,0.007045878],"category_scores_gemma":[0.005301266,0.001041981,0.001200522,0.00114851,0.001420668,0.001419877,0.002046237,0.001626855,0.001710911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078442,"about_ca_system_score_gemma":0.001783253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001671569,"about_ca_topic_score_gemma":0.003938663,"domain_scores_codex":[0.9991087,0.0002568007,0.00006798749,0.0002406136,0.0002225136,0.0001032921],"domain_scores_gemma":[0.9986319,0.0007001252,0.0001047261,0.0003782353,0.0001362728,0.00004862711],"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.0002607099,0.0001224806,0.001149144,0.0005569715,0.00007680905,0.0003564985,0.0002412065,0.7442701,0.02213071,0.0220621,0.008311872,0.2004613],"study_design_scores_gemma":[0.00006424351,0.00005015649,0.0001974924,0.00002816477,0.00001912677,0.00007069043,0.00005502028,0.9740139,0.009570078,0.01160487,0.004308357,0.00001785006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02326202,0.0002209034,0.9526161,0.0001302075,0.0000542484,0.0004020411,0.0008098254,0.01742057,0.005084176],"genre_scores_gemma":[0.2589386,0.0002992555,0.7332755,0.0001230142,0.00002262561,0.0008532975,0.002386318,0.002563071,0.001538297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007045878,"threshold_uncertainty_score":0.02357078,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003254715,0.001470887,0.001930245,0.0009307576,0.0008970004,0.001657524,0.003015348,0.001818817,0.003569151],"category_scores_gemma":[0.01876783,0.001004495,0.0009525646,0.001371027,0.001677571,0.003914244,0.002734964,0.003239959,0.001051941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007382565,"about_ca_system_score_gemma":0.001702018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001431568,"about_ca_topic_score_gemma":0.00214445,"domain_scores_codex":[0.9978731,0.00096133,0.0001648016,0.0004484712,0.0003732779,0.000179111],"domain_scores_gemma":[0.9934963,0.003108494,0.0005252487,0.002218498,0.0004378275,0.0002135869],"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.0005141991,0.0004788589,0.002717165,0.0002779193,0.0001919688,0.0002120354,0.0003295805,0.7203172,0.01768028,0.03594228,0.003034555,0.218304],"study_design_scores_gemma":[0.0001464156,0.0001981864,0.0002852801,0.00002781686,0.0000383393,0.00009964365,0.0000493848,0.955394,0.006502142,0.03433242,0.002884231,0.00004213942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03108837,0.0002527854,0.9617087,0.0002218558,0.00005217979,0.0001994003,0.0000354051,0.001860785,0.004580537],"genre_scores_gemma":[0.4450966,0.000144432,0.5519926,0.0002323436,0.00004522295,0.0005445217,0.0000988365,0.0004457432,0.001399687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003569151,"threshold_uncertainty_score":0.01721275,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003272354,0.001463986,0.001563718,0.001705768,0.0006196671,0.001289877,0.002159918,0.001585472,0.005147683],"category_scores_gemma":[0.0232305,0.0007945381,0.001097639,0.001169062,0.001698548,0.002054289,0.002010361,0.00208401,0.001224626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001253134,"about_ca_system_score_gemma":0.001471432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012355,"about_ca_topic_score_gemma":0.00192454,"domain_scores_codex":[0.9980063,0.001030192,0.0001015601,0.0003055399,0.0004239417,0.0001324597],"domain_scores_gemma":[0.9910199,0.00621273,0.0004732641,0.001389012,0.0006824306,0.0002226121],"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.000262231,0.000305282,0.002741499,0.0004534071,0.0001844524,0.0001436128,0.0001991734,0.731966,0.002064235,0.05885555,0.006097069,0.1967275],"study_design_scores_gemma":[0.00004945914,0.00008362223,0.0001241446,0.0000415278,0.00001867949,0.00002634924,0.00002934904,0.9587823,0.001025558,0.0379797,0.001829938,0.000009323401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03227827,0.0006648437,0.9546613,0.0004484833,0.000113137,0.0002733607,0.0001817833,0.001804639,0.009574174],"genre_scores_gemma":[0.5740529,0.0004561882,0.4196971,0.0004750486,0.0001239673,0.0007831785,0.0008701461,0.0003020893,0.003239225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005147683,"threshold_uncertainty_score":0.01730609,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001840123,0.0006888985,0.0004903126,0.0003023585,0.0006197979,0.0008615469,0.0009885422,0.000960051,0.004701769],"category_scores_gemma":[0.002626425,0.0002954812,0.0005349414,0.000441771,0.0009370994,0.00117933,0.001347082,0.001646088,0.0006985974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001289206,"about_ca_system_score_gemma":0.002218158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01681871,"about_ca_topic_score_gemma":0.02197586,"domain_scores_codex":[0.9993613,0.0001831588,0.00001581922,0.00009585973,0.000207467,0.0001364332],"domain_scores_gemma":[0.9989638,0.0004978734,0.00003466294,0.0001071705,0.0002185586,0.0001778951],"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.0004869803,0.0001664392,0.001597726,0.0001610101,0.00007533341,0.0003312604,0.0002277025,0.7305236,0.005838893,0.02726823,0.06010987,0.1732129],"study_design_scores_gemma":[0.0001338717,0.000145852,0.0006780863,0.0000240954,0.00001746015,0.00005142926,0.0001501098,0.9523849,0.002802547,0.0160679,0.02752417,0.00001959422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3601227,0.003165229,0.5251128,0.01864293,0.001014484,0.0003143518,0.00231429,0.02599334,0.06331991],"genre_scores_gemma":[0.7891567,0.0007247474,0.1945684,0.0008389355,0.00008920953,0.0001665022,0.002912765,0.001050467,0.01049233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01681871,"threshold_uncertainty_score":0.0334416,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001697926,0.0006634779,0.0006605881,0.001382636,0.0004394268,0.001169865,0.0009799061,0.001024621,0.002821169],"category_scores_gemma":[0.02336109,0.0005566847,0.0004258326,0.001056524,0.0006742593,0.002547354,0.0007877462,0.001627662,0.0005704206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001199581,"about_ca_system_score_gemma":0.002005874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007867999,"about_ca_topic_score_gemma":0.007975116,"domain_scores_codex":[0.9990625,0.0003002014,0.00004926586,0.000215544,0.0002626066,0.0001098828],"domain_scores_gemma":[0.9838213,0.01252178,0.0007936244,0.001214241,0.001401424,0.0002477526],"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.000157879,0.0000668252,0.006571446,0.00004592343,0.00002127871,0.00002492997,0.00002769403,0.9341526,0.0008821932,0.003964726,0.00105146,0.05303302],"study_design_scores_gemma":[0.000003666841,0.00001062169,0.0003606276,0.000003011475,0.000002761085,0.000004048972,0.000003323214,0.997282,0.0004483439,0.001807359,0.00007143161,0.000002640006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2810035,0.0003330591,0.7101628,0.0005300115,0.00006542575,0.00009860788,0.0004683441,0.003212318,0.004125905],"genre_scores_gemma":[0.8575052,0.000114811,0.1407278,0.00006109429,0.00002057478,0.0001368281,0.0004737863,0.0001548662,0.0008051494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007867999,"threshold_uncertainty_score":0.01564437,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001396392,0.0008766251,0.0008493205,0.0008212083,0.0004705837,0.0008569759,0.002159748,0.001031922,0.005680698],"category_scores_gemma":[0.005123372,0.0003791857,0.0009931679,0.00113145,0.0009301587,0.001556152,0.002016171,0.002093015,0.000848419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007597487,"about_ca_system_score_gemma":0.001355585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001604077,"about_ca_topic_score_gemma":0.00313543,"domain_scores_codex":[0.9988532,0.0003970112,0.00006322823,0.0002350126,0.0003170742,0.0001344398],"domain_scores_gemma":[0.9975661,0.001240997,0.0001503895,0.000614212,0.000336851,0.00009139611],"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.000446559,0.0003314798,0.001304299,0.0002708042,0.0001096498,0.0002509427,0.0001592372,0.534596,0.008938627,0.1220862,0.01072102,0.3207851],"study_design_scores_gemma":[0.00009130698,0.000165152,0.0003587057,0.00002794408,0.00003200918,0.0002080835,0.0000369423,0.9188256,0.003791645,0.06594566,0.01049894,0.00001806447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04519312,0.0007718204,0.9302837,0.0005434134,0.0001993756,0.0002510233,0.0003366005,0.001002598,0.02141839],"genre_scores_gemma":[0.3029755,0.0003417541,0.6855092,0.0004588427,0.00009964553,0.000370257,0.0007924348,0.0003723563,0.00908007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005680698,"threshold_uncertainty_score":0.01900387,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003671086,0.001289578,0.001219761,0.001558797,0.001315758,0.0014054,0.003234446,0.001061808,0.004432347],"category_scores_gemma":[0.01225019,0.0008287782,0.001538902,0.001530049,0.001779057,0.00353717,0.003957066,0.002069679,0.0007086769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001876257,"about_ca_system_score_gemma":0.002820355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004741096,"about_ca_topic_score_gemma":0.007817294,"domain_scores_codex":[0.9977889,0.0007869264,0.0001787246,0.0003477333,0.000613822,0.0002837609],"domain_scores_gemma":[0.9939595,0.003321035,0.0005921675,0.001331187,0.0005753174,0.0002208076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006037106,0.0002753045,0.004018114,0.0006078247,0.0002303769,0.0001989488,0.001504512,0.3200345,0.01539523,0.1814307,0.007852977,0.4678478],"study_design_scores_gemma":[0.00006209769,0.0001171955,0.0004710681,0.00003850317,0.00007549815,0.0000707127,0.0001734735,0.9127807,0.009328683,0.07066657,0.00616971,0.00004570495],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01007821,0.000172486,0.9868267,0.0001006422,0.00001635704,0.0001401397,0.00005808738,0.001152158,0.001455266],"genre_scores_gemma":[0.1663004,0.0001401928,0.8308351,0.0001499838,0.00002302894,0.0002783492,0.0002621075,0.0004068596,0.001603942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004741096,"threshold_uncertainty_score":0.01941478,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001552588,0.001133897,0.001321131,0.001749707,0.001137342,0.001528167,0.002283514,0.002107491,0.008150006],"category_scores_gemma":[0.003315039,0.0008163712,0.001396549,0.001708897,0.001425368,0.002161233,0.001921497,0.001383731,0.0007460443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132313,"about_ca_system_score_gemma":0.002020535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002858439,"about_ca_topic_score_gemma":0.004778103,"domain_scores_codex":[0.9989997,0.0005178346,0.00003586294,0.0001362233,0.0002151358,0.00009537912],"domain_scores_gemma":[0.9987177,0.0009540563,0.00007317094,0.000081171,0.0001129401,0.00006095485],"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.0001267452,0.0002099535,0.000651938,0.0002285176,0.00007088752,0.0001733325,0.0001553824,0.8277814,0.001927438,0.08932042,0.003260475,0.07609346],"study_design_scores_gemma":[0.00007352996,0.0001202755,0.0001295562,0.00002854365,0.00002175453,0.0000919697,0.00007292853,0.9482819,0.0005890473,0.04644035,0.004130538,0.00001962149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01250915,0.0003006191,0.9786221,0.0004193253,0.00003489517,0.000206884,0.00009932854,0.0002049499,0.00760287],"genre_scores_gemma":[0.1674824,0.0004118086,0.8247681,0.0002145007,0.00003638226,0.0005440954,0.0002797697,0.000123994,0.006138887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008150006,"threshold_uncertainty_score":0.02726448,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757463,0.0007756012,0.0006217705,0.0007859947,0.0005096017,0.0006541612,0.001096365,0.000572039,0.003809029],"category_scores_gemma":[0.001470792,0.0002955747,0.0006770042,0.0009087949,0.0004541955,0.001866626,0.001432161,0.0007916099,0.0006910622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007150154,"about_ca_system_score_gemma":0.001130907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007603721,"about_ca_topic_score_gemma":0.006355486,"domain_scores_codex":[0.9996504,0.00008365008,0.00001732017,0.00009140436,0.00009762008,0.00005970903],"domain_scores_gemma":[0.999461,0.0002305591,0.0000575862,0.0001021543,0.00009968221,0.00004899757],"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.0003986001,0.0001691901,0.001357149,0.0002488321,0.00006131589,0.0001878235,0.0002777319,0.5968745,0.01308636,0.04380633,0.008403155,0.3351289],"study_design_scores_gemma":[0.00004040764,0.00007909764,0.0003360706,0.00001208095,0.00001517318,0.00005473763,0.00006122939,0.958322,0.004557997,0.03099242,0.0055177,0.00001097224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04853577,0.0001733169,0.9430218,0.0001991041,0.00003158766,0.000125866,0.0003077487,0.002794106,0.004810667],"genre_scores_gemma":[0.3642967,0.000266264,0.6291506,0.000152432,0.00001523193,0.0001963529,0.001500856,0.0003998446,0.004021763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007603721,"threshold_uncertainty_score":0.01511896,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003574423,0.001773939,0.001471108,0.002614109,0.0009929494,0.001819324,0.002492546,0.001888132,0.005498886],"category_scores_gemma":[0.01710885,0.0008973564,0.001243523,0.002414433,0.001310501,0.003550643,0.004351163,0.002156767,0.001549635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001193168,"about_ca_system_score_gemma":0.00231894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005036448,"about_ca_topic_score_gemma":0.005785132,"domain_scores_codex":[0.9969835,0.001172642,0.0001366362,0.0003487262,0.0009804979,0.0003779646],"domain_scores_gemma":[0.9917288,0.005301049,0.0005411983,0.001255504,0.0009803621,0.0001930584],"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.0003251195,0.0003466111,0.001833394,0.0003124158,0.0001056009,0.0001328309,0.0002718951,0.5834518,0.006985764,0.06105077,0.005458013,0.3397258],"study_design_scores_gemma":[0.00004388095,0.00005997723,0.0001379141,0.00003597952,0.00002936387,0.00003667548,0.00004092893,0.9691405,0.002375351,0.02618409,0.001901315,0.00001396704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0239825,0.0005283016,0.9649355,0.0002431647,0.00006426512,0.0001140218,0.00009635697,0.00148827,0.008547643],"genre_scores_gemma":[0.335256,0.000479897,0.6585632,0.000345387,0.00008623186,0.0004352859,0.0004889242,0.0005760248,0.003769046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005498886,"threshold_uncertainty_score":0.01890355,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586479,0.0008205022,0.001639529,0.0008344778,0.0006176264,0.001253403,0.001415241,0.00137442,0.005798638],"category_scores_gemma":[0.01046098,0.0006402639,0.0009272228,0.001178725,0.00102638,0.002561819,0.002092501,0.001867699,0.0009144529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001604004,"about_ca_system_score_gemma":0.002567326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005021422,"about_ca_topic_score_gemma":0.008235572,"domain_scores_codex":[0.9979447,0.0007608599,0.0001019234,0.0003776792,0.0006072839,0.0002074965],"domain_scores_gemma":[0.9962483,0.002193499,0.0002071747,0.0009337894,0.0002853728,0.0001319257],"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.0004521502,0.0002525139,0.001685363,0.0003407917,0.00009914763,0.00008961642,0.0003252129,0.5988805,0.005370206,0.1204312,0.01154422,0.2605291],"study_design_scores_gemma":[0.00007010884,0.00006921576,0.0002310047,0.00002092669,0.00001610012,0.00003480015,0.00003679732,0.9439478,0.001097245,0.05171361,0.00275274,0.000009647999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03538428,0.0007957616,0.9517356,0.0004166595,0.00006667123,0.0001514788,0.0001291753,0.001806481,0.009513857],"genre_scores_gemma":[0.3026683,0.0002077066,0.6925244,0.0004091619,0.00004074434,0.0002594729,0.0004578306,0.000344919,0.003087514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005798638,"threshold_uncertainty_score":0.01939839,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483439,0.0008475589,0.001048125,0.001062708,0.0009311488,0.001249157,0.001890598,0.001045594,0.001998997],"category_scores_gemma":[0.009421877,0.0005519302,0.0008015537,0.0009748232,0.0008701477,0.002374389,0.00142565,0.001507894,0.0004074968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007591719,"about_ca_system_score_gemma":0.001410965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005162003,"about_ca_topic_score_gemma":0.0108933,"domain_scores_codex":[0.9981793,0.0006595674,0.00009658882,0.0002498421,0.0005686707,0.0002459935],"domain_scores_gemma":[0.9950567,0.003736038,0.0002566379,0.0005670491,0.0002812673,0.0001022804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009062115,0.0006266079,0.003567887,0.0005989952,0.000144501,0.0006535206,0.001043484,0.3688513,0.04417257,0.08037258,0.008802985,0.4902593],"study_design_scores_gemma":[0.00007857651,0.0001201519,0.0008476945,0.00003838742,0.00003667431,0.0002054434,0.0001090533,0.9449105,0.01438736,0.03616635,0.003076338,0.00002340825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1492604,0.0003362613,0.8394082,0.0002845615,0.00003668732,0.0003568231,0.0002833183,0.003547345,0.006486551],"genre_scores_gemma":[0.4793292,0.0001880363,0.5172601,0.0001083304,0.0000165254,0.0001773462,0.0005212029,0.0003501834,0.002049041],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005162003,"threshold_uncertainty_score":0.01026392,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004169927,0.001087445,0.001235137,0.0008368878,0.0008040174,0.001241053,0.002186641,0.00146586,0.00270238],"category_scores_gemma":[0.02122122,0.0005415548,0.0005550086,0.0006117139,0.0009242429,0.002542601,0.001471667,0.003690436,0.001029583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001887595,"about_ca_system_score_gemma":0.002731114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008211786,"about_ca_topic_score_gemma":0.008216257,"domain_scores_codex":[0.998674,0.0003664117,0.00007093474,0.0003096175,0.0002911107,0.0002879055],"domain_scores_gemma":[0.981162,0.01346148,0.0007487374,0.00250853,0.001408065,0.0007113337],"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.000599042,0.0001388103,0.008727341,0.00009369493,0.00004104094,0.00006555885,0.0001279788,0.9324355,0.001804219,0.006733995,0.006883351,0.04234951],"study_design_scores_gemma":[0.0000117016,0.00002918528,0.0003148333,0.000008425784,0.000003549281,0.00001027001,0.00001189156,0.995313,0.0009339503,0.003159926,0.0001956988,0.000007424986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.632786,0.001892174,0.3398582,0.003342109,0.0005328134,0.0001254845,0.00151437,0.005792713,0.0141561],"genre_scores_gemma":[0.9510117,0.000191882,0.04628123,0.0002424721,0.00005096139,0.0000669369,0.0006848631,0.0001569138,0.00131293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008211786,"threshold_uncertainty_score":0.02205294,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002840795,0.0006919015,0.0009858359,0.0008066799,0.000618775,0.001661138,0.002127751,0.001425024,0.001841751],"category_scores_gemma":[0.009960738,0.0005510873,0.0004683745,0.0008946557,0.002931878,0.003468088,0.001622208,0.001225227,0.0003124418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001895228,"about_ca_system_score_gemma":0.001191905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00355436,"about_ca_topic_score_gemma":0.002704833,"domain_scores_codex":[0.9988513,0.0004765259,0.00005299043,0.0001596344,0.0003219476,0.0001375661],"domain_scores_gemma":[0.9953753,0.00294296,0.0005801278,0.0004212978,0.0004887979,0.0001916057],"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.00006464117,0.00004021378,0.0003288887,0.00004258511,0.0000237286,0.00003404866,0.00005032387,0.9394228,0.0007395025,0.03279993,0.0002071453,0.02624623],"study_design_scores_gemma":[0.000009385386,0.00002490584,0.00002995032,0.000003455846,0.000002879493,0.000007941842,0.000005455429,0.9872364,0.0002794832,0.01217405,0.000221558,0.000004535101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05640719,0.0006171836,0.9355657,0.0003594316,0.00006689821,0.00005794672,0.00001684099,0.0003927632,0.006515955],"genre_scores_gemma":[0.8941976,0.0002307623,0.1016732,0.0001396287,0.00004809199,0.0001235223,0.00002907079,0.00007786961,0.003480262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00355436,"threshold_uncertainty_score":0.01502377,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002955818,0.0007912355,0.001162187,0.0006535278,0.001031631,0.001788125,0.002370874,0.001556212,0.003570881],"category_scores_gemma":[0.03110932,0.0006537588,0.0007090482,0.0007137643,0.002159302,0.004154233,0.0019682,0.002690621,0.0008257378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144552,"about_ca_system_score_gemma":0.001913849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003087473,"about_ca_topic_score_gemma":0.002908408,"domain_scores_codex":[0.9978045,0.000790024,0.0001001704,0.0004175796,0.000517375,0.0003703734],"domain_scores_gemma":[0.9769966,0.01452103,0.002155516,0.00410958,0.001250009,0.0009671776],"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.0007336853,0.0005091404,0.004606102,0.0003651768,0.0001661928,0.0005468774,0.001075287,0.7726693,0.01341586,0.09150646,0.003163725,0.1112423],"study_design_scores_gemma":[0.00003617517,0.0001774165,0.0004069727,0.00002228973,0.00002294396,0.0001284265,0.0001749722,0.9347313,0.004109134,0.05892939,0.001243989,0.00001690552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2383756,0.000515064,0.7480425,0.0007068305,0.0000534483,0.0001194466,0.00008233081,0.001714027,0.0103908],"genre_scores_gemma":[0.8891218,0.0002003152,0.1076136,0.0002279451,0.00001598244,0.0001632401,0.000168058,0.0002929006,0.002196155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003570881,"threshold_uncertainty_score":0.01563209,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097767,0.0006497428,0.0008256725,0.0010075,0.0004272439,0.0008276425,0.00163303,0.0009074896,0.007076177],"category_scores_gemma":[0.003282562,0.0003043149,0.0004109674,0.001045852,0.0008494338,0.001445243,0.001599425,0.0009010526,0.0005230889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009981324,"about_ca_system_score_gemma":0.001555572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002726265,"about_ca_topic_score_gemma":0.002394298,"domain_scores_codex":[0.9994009,0.0001498163,0.00003018296,0.00008014367,0.0002533363,0.00008580311],"domain_scores_gemma":[0.998921,0.000624954,0.00007735717,0.0001798822,0.0001413697,0.00005539212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005123405,0.0002358969,0.0008324514,0.0003930194,0.00006590381,0.0003224923,0.0001761039,0.5572144,0.006963141,0.05305912,0.007730606,0.3724944],"study_design_scores_gemma":[0.0001252214,0.0001946217,0.0002463388,0.00005372312,0.00002992495,0.0001640956,0.00004618291,0.9654195,0.004415466,0.02176676,0.007514894,0.00002330538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09364024,0.001998742,0.866643,0.000944117,0.0004608197,0.0004565158,0.0005793313,0.001796119,0.03348119],"genre_scores_gemma":[0.6855158,0.0008059282,0.3015209,0.0005989138,0.000134573,0.0004608187,0.0007815888,0.0001966235,0.009984683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007076177,"threshold_uncertainty_score":0.02367216,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005174892,0.0008426998,0.001100658,0.002024318,0.0007256742,0.003199699,0.001454316,0.001446468,0.002529855],"category_scores_gemma":[0.06197331,0.0005696532,0.0006222836,0.002362667,0.001544713,0.01112899,0.001264817,0.002051058,0.001245294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214177,"about_ca_system_score_gemma":0.002219777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005911711,"about_ca_topic_score_gemma":0.0040894,"domain_scores_codex":[0.9959795,0.001618193,0.0002249823,0.0009716988,0.0009862387,0.0002192669],"domain_scores_gemma":[0.9721757,0.01871857,0.002613193,0.003056389,0.002990122,0.0004459856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004743788,0.0001240288,0.04094637,0.0004366758,0.000216125,0.00008166935,0.0007466846,0.2607928,0.002509635,0.08862467,0.006140559,0.5989065],"study_design_scores_gemma":[0.00004572927,0.0003685601,0.009227436,0.0004295609,0.00009304061,0.0002220478,0.0007303834,0.8082284,0.005478476,0.1547682,0.02029533,0.0001127687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08777818,0.004469759,0.8957316,0.002712093,0.0001526432,0.0001003862,0.00066724,0.001244306,0.007143761],"genre_scores_gemma":[0.6899663,0.002820283,0.3026637,0.0002872979,0.0001450887,0.0001726494,0.001054531,0.0003366509,0.002553503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005911711,"threshold_uncertainty_score":0.02736777,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248102,0.0006332477,0.0005799485,0.0004571163,0.001042317,0.001098872,0.001217912,0.0009908114,0.001351264],"category_scores_gemma":[0.004304694,0.0004822086,0.0004293018,0.0004922004,0.001787399,0.002284531,0.002214452,0.0007770316,0.0001988501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006595888,"about_ca_system_score_gemma":0.0006803734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003071764,"about_ca_topic_score_gemma":0.002045244,"domain_scores_codex":[0.9993166,0.0002751572,0.00002816415,0.000139821,0.0001111044,0.0001292517],"domain_scores_gemma":[0.9983015,0.0008210538,0.0003924692,0.0001512123,0.0001374184,0.0001962491],"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.00006797531,0.00003188134,0.001550325,0.00006209016,0.00002509804,0.0004024435,0.000276564,0.9564964,0.001536552,0.03018725,0.0005092843,0.008854237],"study_design_scores_gemma":[0.00002868941,0.00009170137,0.000589045,0.00001268559,0.00001842597,0.0001442588,0.0002303653,0.9729033,0.001040712,0.02184683,0.003080869,0.00001303679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2054574,0.0009009752,0.7865161,0.0006573815,0.0001097419,0.0001174293,0.0000741695,0.0002916676,0.005875161],"genre_scores_gemma":[0.9193227,0.0004575327,0.07753182,0.00008643173,0.00004217535,0.00009907868,0.00006951518,0.0000361882,0.002354617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003071764,"threshold_uncertainty_score":0.006600678,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003858784,0.001198641,0.001113544,0.001456871,0.001012153,0.002751211,0.003434717,0.001753214,0.01513141],"category_scores_gemma":[0.01866078,0.0005452702,0.001250952,0.001821003,0.001105042,0.004889645,0.003656002,0.002938868,0.004096679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169076,"about_ca_system_score_gemma":0.002653147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002452581,"about_ca_topic_score_gemma":0.002630336,"domain_scores_codex":[0.99725,0.0008004065,0.0002239052,0.000461066,0.0008769904,0.0003876878],"domain_scores_gemma":[0.9926569,0.002841168,0.0004964552,0.002015524,0.001532109,0.0004578963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008371648,0.0003542215,0.002167278,0.0006704299,0.00007299765,0.0001830961,0.0003217841,0.1202116,0.01211627,0.2833864,0.02688155,0.5527974],"study_design_scores_gemma":[0.0001451388,0.0003020021,0.0006787959,0.00009402561,0.00004984004,0.0002615415,0.00008016073,0.7547575,0.007146175,0.2098183,0.02659903,0.0000674494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0120755,0.0005490721,0.9713093,0.0006353659,0.0003186975,0.0001953417,0.0003608575,0.002138602,0.01241721],"genre_scores_gemma":[0.286298,0.0004096052,0.7003579,0.0005879131,0.0003258145,0.0004003261,0.0006959846,0.000896794,0.01002768],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01513141,"threshold_uncertainty_score":0.0506196,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092843,0.0009780728,0.001493482,0.001285622,0.0006217749,0.0008453755,0.001723296,0.001145499,0.004098452],"category_scores_gemma":[0.00721494,0.0006469579,0.001005676,0.001187451,0.001222971,0.00156035,0.001929022,0.001824818,0.00108162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059346,"about_ca_system_score_gemma":0.0016151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005528258,"about_ca_topic_score_gemma":0.007697884,"domain_scores_codex":[0.9986022,0.0006734944,0.00006483555,0.000216335,0.000326397,0.0001166193],"domain_scores_gemma":[0.9966575,0.002315791,0.0002226318,0.0004062989,0.0002856952,0.0001120384],"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.0002742092,0.0001598521,0.0005451627,0.0002479536,0.00008407739,0.0001092534,0.0001893759,0.8470355,0.002992847,0.01751551,0.00406791,0.1267784],"study_design_scores_gemma":[0.00004895898,0.00007922317,0.00007960927,0.00001722764,0.00002216359,0.00002515255,0.00002061206,0.990817,0.001279467,0.006560178,0.001040388,0.00001014161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01903963,0.0006845676,0.9724368,0.0002027339,0.00005142367,0.0001034543,0.00007187125,0.003121049,0.00428836],"genre_scores_gemma":[0.3470376,0.0004891578,0.6470257,0.0002530892,0.0000638686,0.0004017513,0.0002913372,0.0006177598,0.003819798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005528258,"threshold_uncertainty_score":0.01371068,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204878,0.001784831,0.001703168,0.001019586,0.003536274,0.00251838,0.004409326,0.003263889,0.03039323],"category_scores_gemma":[0.003946846,0.0006591414,0.001262957,0.002960603,0.001739679,0.003119237,0.001955737,0.002175806,0.001977006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009818973,"about_ca_system_score_gemma":0.02049213,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.5342597,"about_ca_topic_score_gemma":0.5538508,"domain_scores_codex":[0.9982546,0.0002906656,0.00004816703,0.0004237195,0.0003265686,0.0006562499],"domain_scores_gemma":[0.9984755,0.0005186148,0.0001028523,0.0001451871,0.0003296558,0.0004282073],"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.000887533,0.0004631004,0.002615138,0.0007510532,0.0002159709,0.0009157395,0.0006033998,0.5437116,0.001971908,0.2008304,0.1267768,0.1202573],"study_design_scores_gemma":[0.0002745467,0.0001706742,0.001842409,0.00006747669,0.0001250192,0.0005164421,0.0008879766,0.8246669,0.001992116,0.08753926,0.08176744,0.000149824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.208501,0.001844168,0.5445978,0.008518543,0.0008357964,0.002578955,0.01732863,0.004321228,0.2114739],"genre_scores_gemma":[0.7038541,0.001040613,0.206285,0.0009994007,0.0001385075,0.0006657118,0.01004212,0.0006789718,0.0762957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4657403,"threshold_uncertainty_score":0.9369662,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000848181,0.0008087981,0.001096009,0.0008415294,0.0006796253,0.00149247,0.001623071,0.001103572,0.008057051],"category_scores_gemma":[0.002246354,0.0004143078,0.0007503422,0.001115832,0.0005793069,0.001915314,0.002201254,0.001203432,0.002052773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932534,"about_ca_system_score_gemma":0.001628162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002415707,"about_ca_topic_score_gemma":0.003301394,"domain_scores_codex":[0.9992682,0.0001766883,0.00003597993,0.0001131635,0.0003038275,0.0001020774],"domain_scores_gemma":[0.9992315,0.0002450783,0.00006409905,0.0001602292,0.0002275195,0.00007169852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003941686,0.000280988,0.001772236,0.0005448383,0.0001114473,0.000166664,0.0002320992,0.2582295,0.01586362,0.1193941,0.007996688,0.5950137],"study_design_scores_gemma":[0.00009926254,0.0002022769,0.0002386504,0.00007923089,0.00004263772,0.0002075083,0.00008082911,0.9147784,0.007594562,0.04513697,0.03149594,0.00004373201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01271025,0.0005535017,0.9729608,0.0001872121,0.0001237137,0.0001064947,0.0001528179,0.001138001,0.01206713],"genre_scores_gemma":[0.2123752,0.0005140338,0.7776793,0.000209566,0.00003443422,0.0002962623,0.0004129456,0.0003023997,0.008175943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008057051,"threshold_uncertainty_score":0.02695352,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002001838,0.001093636,0.0008244884,0.001450462,0.0009719557,0.001539513,0.003446369,0.001697246,0.008762071],"category_scores_gemma":[0.006030152,0.0006295014,0.001647235,0.002177093,0.001133151,0.002807861,0.002763202,0.002407994,0.001800562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007530836,"about_ca_system_score_gemma":0.001279156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002100539,"about_ca_topic_score_gemma":0.002451793,"domain_scores_codex":[0.9985701,0.0004599334,0.0001535997,0.0002888998,0.0003919878,0.0001354737],"domain_scores_gemma":[0.9961339,0.001857136,0.0002952643,0.0009879064,0.0005445107,0.0001814372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004808336,0.0004297142,0.001021625,0.0005113241,0.0001729119,0.0002635633,0.0002142143,0.2886663,0.008866867,0.3337664,0.02024067,0.3453656],"study_design_scores_gemma":[0.0001193485,0.00032894,0.0003188744,0.00005688712,0.0000561697,0.0003638976,0.00007859472,0.7894111,0.004788013,0.180657,0.02377393,0.00004725896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01244855,0.0004730635,0.9768515,0.0003039456,0.0001753884,0.0001567499,0.0002840839,0.000917916,0.008388766],"genre_scores_gemma":[0.1280351,0.0004660666,0.8641468,0.0002783706,0.0001046048,0.0006255432,0.0007199378,0.0003308331,0.005292785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008762071,"threshold_uncertainty_score":0.02931201,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123093,0.001075303,0.001068676,0.00109489,0.00175093,0.00193558,0.00324287,0.001917509,0.0059554],"category_scores_gemma":[0.01091935,0.0007764917,0.001190803,0.001456781,0.002413378,0.003579214,0.002860422,0.003152422,0.00206818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001399688,"about_ca_system_score_gemma":0.002944765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004354678,"about_ca_topic_score_gemma":0.007823066,"domain_scores_codex":[0.9947331,0.001317134,0.0002793892,0.000719159,0.002351721,0.0005995112],"domain_scores_gemma":[0.9935758,0.002666001,0.000285921,0.002476488,0.0008754867,0.0001203573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009534347,0.0003079312,0.00388301,0.0009534307,0.0002020824,0.001271703,0.001140001,0.08888642,0.0423691,0.2374341,0.04612637,0.5764723],"study_design_scores_gemma":[0.0003246495,0.0004524086,0.001835491,0.0003184541,0.0002157174,0.001795398,0.0004584466,0.5533227,0.09264528,0.2016796,0.1467917,0.000159948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1105461,0.001669803,0.8351585,0.00298184,0.0008210284,0.0003494943,0.0008261735,0.01374979,0.03389728],"genre_scores_gemma":[0.4929402,0.0006040017,0.4864662,0.001648268,0.0001773861,0.0002983693,0.0014619,0.002460117,0.01394362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0059554,"threshold_uncertainty_score":0.01992279,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005500015,0.001332342,0.001584048,0.001111295,0.001540767,0.00333378,0.002473477,0.001963746,0.00865224],"category_scores_gemma":[0.02771166,0.0007815545,0.001142439,0.001503357,0.004435106,0.005219081,0.004640667,0.004468151,0.002792301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002740376,"about_ca_system_score_gemma":0.003850038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006137548,"about_ca_topic_score_gemma":0.006657465,"domain_scores_codex":[0.9935074,0.003049491,0.0003131113,0.0009414293,0.001818167,0.0003703171],"domain_scores_gemma":[0.987513,0.008593864,0.0003352969,0.001827923,0.001458779,0.0002711529],"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.0001206766,0.00005092497,0.0008121394,0.0005554055,0.00007278758,0.0001393931,0.0004413923,0.1416893,0.001296657,0.6978952,0.01454786,0.1423783],"study_design_scores_gemma":[0.00004204573,0.00008390335,0.0001970478,0.0003619555,0.00004151097,0.0001477673,0.0001512266,0.3378531,0.001325555,0.6050939,0.0546679,0.00003403948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005201817,0.004339911,0.9609553,0.002470946,0.0004668358,0.00006215953,0.00009643481,0.0004581349,0.02594846],"genre_scores_gemma":[0.2910409,0.007447928,0.6792922,0.002645852,0.0007103088,0.0003139218,0.0004475899,0.0009646482,0.0171367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00865224,"threshold_uncertainty_score":0.02908725,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048542,0.001486668,0.001929625,0.001102224,0.0009427093,0.00214639,0.001928705,0.00204597,0.009537645],"category_scores_gemma":[0.0138354,0.001155045,0.00143039,0.001328278,0.002019691,0.00392949,0.003914221,0.002654849,0.001951471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001027895,"about_ca_system_score_gemma":0.001606775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160171,"about_ca_topic_score_gemma":0.002690387,"domain_scores_codex":[0.9978116,0.0009746883,0.0001390762,0.0003474979,0.0004497529,0.0002774721],"domain_scores_gemma":[0.9946004,0.003635109,0.0002666175,0.0008275654,0.0004630811,0.0002071601],"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.0003622211,0.0003305588,0.001470353,0.000434576,0.00009073102,0.0003427943,0.0004174917,0.7806957,0.004070191,0.06384833,0.004526663,0.1434103],"study_design_scores_gemma":[0.00008730914,0.0002718237,0.0001695401,0.0000784863,0.00003627884,0.00008670228,0.0001021728,0.9301345,0.002035512,0.06325281,0.003716796,0.0000280231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1288119,0.001374771,0.8447232,0.00103719,0.0001589535,0.0004201687,0.0002079704,0.002692348,0.02057363],"genre_scores_gemma":[0.505591,0.0004894146,0.4861005,0.0004686938,0.00006797464,0.0007295893,0.0005095604,0.0006984674,0.005344835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009537645,"threshold_uncertainty_score":0.0319066,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008581035,0.0008774997,0.001340823,0.002739288,0.0006752051,0.001822667,0.002151832,0.001451587,0.001332133],"category_scores_gemma":[0.04210436,0.0009281956,0.001487383,0.00216831,0.001406646,0.003706006,0.00129666,0.002081726,0.0003216618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002348659,"about_ca_system_score_gemma":0.002506505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005650274,"about_ca_topic_score_gemma":0.006625249,"domain_scores_codex":[0.9963387,0.00194203,0.0002202486,0.0005171818,0.0007626719,0.0002192629],"domain_scores_gemma":[0.9626257,0.02739437,0.002942059,0.003135462,0.003097081,0.0008053234],"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.0004205186,0.0001989851,0.02131241,0.0001797635,0.0001584934,0.00005274604,0.0002357209,0.8269827,0.001547739,0.04127441,0.001454246,0.1061821],"study_design_scores_gemma":[0.00001365379,0.00004402786,0.0005338147,0.00001216142,0.00001063244,0.00001191455,0.00001568635,0.9854354,0.000508205,0.01311642,0.000287057,0.00001111462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06628146,0.0004555131,0.9311448,0.0001716638,0.00005135692,0.0002088279,0.0001452181,0.0005018783,0.001039341],"genre_scores_gemma":[0.4358828,0.000218249,0.5618601,0.0001772014,0.00007123767,0.0004342067,0.0004981608,0.0001121496,0.0007458226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008581035,"threshold_uncertainty_score":0.04538137,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591361,0.001373223,0.0007950739,0.001369271,0.0008758732,0.002900648,0.003141263,0.001235058,0.008166887],"category_scores_gemma":[0.01111684,0.0007669923,0.001820517,0.003676299,0.001363922,0.003987367,0.002334328,0.003539172,0.001513057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002465815,"about_ca_system_score_gemma":0.008546104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01975836,"about_ca_topic_score_gemma":0.03148992,"domain_scores_codex":[0.9974618,0.0009342637,0.0001476849,0.0005078402,0.0007520232,0.0001964689],"domain_scores_gemma":[0.9935057,0.004272672,0.0004503921,0.001132944,0.000467063,0.000171115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001484218,0.0002599224,0.001039124,0.0007097701,0.0001469336,0.0001038472,0.0002345175,0.6472808,0.001745261,0.1549074,0.01090434,0.1825197],"study_design_scores_gemma":[0.00004942202,0.00005161287,0.0001625014,0.00005466706,0.00003635511,0.00004508654,0.00005840768,0.9266542,0.001144692,0.06283765,0.008890815,0.00001457036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01075597,0.0007440346,0.9676729,0.0007817079,0.00006538928,0.0003891698,0.0007558159,0.001560757,0.01727427],"genre_scores_gemma":[0.1601293,0.001036473,0.8328385,0.0002867228,0.00004734394,0.0007405913,0.001389493,0.0003291487,0.003202518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01975836,"threshold_uncertainty_score":0.03928667,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003813753,0.0009223567,0.001753579,0.001142789,0.0007747167,0.003969301,0.002885215,0.002655659,0.003536572],"category_scores_gemma":[0.01127599,0.0008958636,0.0009001186,0.001665143,0.002697833,0.005737464,0.002868611,0.004229852,0.0009860491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00231483,"about_ca_system_score_gemma":0.002141756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004219874,"about_ca_topic_score_gemma":0.003140984,"domain_scores_codex":[0.9980082,0.0008703232,0.0001186559,0.0003240714,0.0005252439,0.0001535167],"domain_scores_gemma":[0.9960758,0.002832398,0.0001646484,0.0003745582,0.0004249017,0.0001276019],"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.00007678693,0.0001291482,0.0006613068,0.0004681966,0.00007379113,0.00006662628,0.0001388513,0.4593189,0.0002614382,0.3789115,0.005058539,0.154835],"study_design_scores_gemma":[0.00001250806,0.00002000747,0.00005964144,0.00010771,0.000007862716,0.0000271983,0.00005303876,0.6242126,0.0002035498,0.3686914,0.006590949,0.00001359235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007053409,0.01757054,0.9475253,0.007761741,0.0002694233,0.00006916505,0.00008081041,0.0002861663,0.01938346],"genre_scores_gemma":[0.3140268,0.02269084,0.64626,0.002053995,0.001167411,0.0004171375,0.0002419739,0.0004677514,0.01267417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004219874,"threshold_uncertainty_score":0.02016932,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111855,0.0008711689,0.0009012591,0.001082956,0.0009310955,0.001280979,0.001411327,0.001441548,0.007086216],"category_scores_gemma":[0.003360524,0.0004250363,0.0008056224,0.001371752,0.0005398327,0.001859143,0.002000473,0.0009000074,0.001838821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005300893,"about_ca_system_score_gemma":0.001135834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00158706,"about_ca_topic_score_gemma":0.003090578,"domain_scores_codex":[0.9991991,0.0003180008,0.00004728369,0.0001514701,0.0001968956,0.00008729692],"domain_scores_gemma":[0.9990109,0.0004764282,0.0001011327,0.0001640189,0.0001700242,0.0000774118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006568299,0.0004124334,0.002402567,0.0006415356,0.0001625874,0.0001823179,0.0003339412,0.3813106,0.009963196,0.1292827,0.01398718,0.4606642],"study_design_scores_gemma":[0.0001077515,0.0002948737,0.000293865,0.00006803304,0.00006082951,0.0002707777,0.0001904013,0.9315917,0.003365669,0.04116868,0.02255306,0.00003434623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02586458,0.001355036,0.951733,0.0004086232,0.0001117804,0.0001970846,0.0002066556,0.0007589739,0.01936426],"genre_scores_gemma":[0.4044645,0.0008654026,0.5803856,0.0004197632,0.0000498381,0.0005006612,0.0006318716,0.0002100973,0.01247226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007086216,"threshold_uncertainty_score":0.02370578,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002995263,0.001058185,0.001634894,0.00109844,0.001110131,0.002466656,0.002038552,0.002841275,0.007527038],"category_scores_gemma":[0.02490882,0.0006504702,0.001491489,0.001301952,0.002276144,0.003954047,0.001758901,0.002448017,0.001484909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001590697,"about_ca_system_score_gemma":0.002452712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002502432,"about_ca_topic_score_gemma":0.004016946,"domain_scores_codex":[0.9969177,0.001144103,0.0001851262,0.0007814175,0.0006106313,0.0003610174],"domain_scores_gemma":[0.9899135,0.006017977,0.0005146264,0.002523755,0.000810395,0.0002197769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006511824,0.00020416,0.003262083,0.0004875817,0.0002412128,0.0002963315,0.000265807,0.4350476,0.003198768,0.3083254,0.01694464,0.2310753],"study_design_scores_gemma":[0.00007693207,0.00008443358,0.0002663334,0.00005139081,0.00004109278,0.0001508314,0.00007308915,0.7231748,0.001306884,0.2691971,0.005555857,0.00002128688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03661723,0.0007871254,0.9446758,0.001269361,0.0002221988,0.0001085636,0.0003311536,0.001455305,0.01453319],"genre_scores_gemma":[0.4783013,0.0004239254,0.5094555,0.0007807881,0.0001425468,0.0002730848,0.0007908179,0.0005870854,0.009244862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007527038,"threshold_uncertainty_score":0.0251804,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139171,0.0005382774,0.0007699677,0.0007466143,0.0006456933,0.0006566203,0.001489954,0.0007400894,0.006510031],"category_scores_gemma":[0.003624853,0.0002641721,0.0004675437,0.0004686572,0.0009875845,0.001549903,0.001634978,0.0006482546,0.0007443077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001224072,"about_ca_system_score_gemma":0.00138247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002817898,"about_ca_topic_score_gemma":0.00558367,"domain_scores_codex":[0.999215,0.0001795055,0.00004043427,0.0002166226,0.0002095312,0.0001389195],"domain_scores_gemma":[0.9988519,0.0004859325,0.000121957,0.0002564379,0.0001778027,0.0001059733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006072375,0.0003239702,0.009479841,0.0002586886,0.00008510229,0.000290255,0.0006077635,0.2663391,0.01477922,0.1584429,0.009096902,0.5396889],"study_design_scores_gemma":[0.00007987088,0.0002391231,0.0009463925,0.00003130886,0.0000207254,0.0001633816,0.00009030244,0.9162729,0.004921232,0.07128792,0.005921276,0.0000254374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2513757,0.0003587763,0.7024162,0.0005169976,0.00009428022,0.0003016207,0.0001791663,0.001916841,0.04284045],"genre_scores_gemma":[0.7337671,0.00006022026,0.2562777,0.0002088315,0.00001428026,0.0001685969,0.0002088482,0.00020965,0.009084858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006510031,"threshold_uncertainty_score":0.02177817,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770769,0.000911586,0.0009028087,0.001242745,0.0005969162,0.001337407,0.001826122,0.0006908228,0.002633124],"category_scores_gemma":[0.004698524,0.0004967544,0.001277525,0.001406006,0.00128238,0.002783245,0.003546166,0.002181589,0.0004027211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366979,"about_ca_system_score_gemma":0.002058943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004308115,"about_ca_topic_score_gemma":0.005152474,"domain_scores_codex":[0.998418,0.0006066805,0.00009523862,0.0002648764,0.0004470482,0.0001682488],"domain_scores_gemma":[0.9977553,0.001077661,0.0001638658,0.0007834294,0.0001244225,0.00009520791],"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.0002611354,0.0001361189,0.002024841,0.0003884133,0.0001435349,0.0001486978,0.0005790864,0.5665879,0.00784493,0.1174756,0.00188481,0.302525],"study_design_scores_gemma":[0.00005412969,0.0001426953,0.000537987,0.00004956819,0.0000476092,0.00008504758,0.0001191274,0.8665359,0.007507063,0.1148367,0.0100515,0.00003273184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02309118,0.0004728657,0.9716471,0.0001423745,0.00002851324,0.00009259432,0.0001405544,0.001898388,0.002486398],"genre_scores_gemma":[0.3084646,0.0002507147,0.6886162,0.0001319814,0.00001882004,0.0002473461,0.0003875126,0.0002129003,0.001669819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004308115,"threshold_uncertainty_score":0.009918153,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115917,0.0007784857,0.0004955277,0.0006820597,0.0003442788,0.001605611,0.001258153,0.0008225776,0.004684803],"category_scores_gemma":[0.01349698,0.0003738418,0.0007939236,0.0005061597,0.0007815184,0.001271891,0.0007230234,0.0008335512,0.0004351715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001236346,"about_ca_system_score_gemma":0.001681725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002798693,"about_ca_topic_score_gemma":0.003200675,"domain_scores_codex":[0.9988369,0.0003846108,0.00008188625,0.0002096934,0.0003840405,0.0001028191],"domain_scores_gemma":[0.9946439,0.003799382,0.0002294628,0.0007700262,0.000499404,0.00005787249],"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.0001956356,0.0001782989,0.001728056,0.0003629484,0.00006105381,0.0002340461,0.000318665,0.7853362,0.01402166,0.04701058,0.001278683,0.1492742],"study_design_scores_gemma":[0.00006918501,0.000133564,0.0002561942,0.00004021633,0.00003803472,0.00006182871,0.00008942137,0.9667965,0.00935784,0.01946101,0.003682285,0.00001393995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1514309,0.000242529,0.8334966,0.0002769066,0.00009675866,0.0002747905,0.0004917406,0.002716918,0.01097287],"genre_scores_gemma":[0.5759999,0.000203963,0.4202773,0.0001031871,0.00001595654,0.0003771389,0.000649805,0.0005368758,0.001835824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004684803,"threshold_uncertainty_score":0.01567227,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009281474,0.0007938002,0.0005756713,0.0008872054,0.0008160177,0.001504488,0.002790011,0.0009880201,0.01549043],"category_scores_gemma":[0.005474285,0.0004492799,0.0009042718,0.0008891523,0.0007897681,0.002308242,0.001733195,0.00148152,0.004233808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007654364,"about_ca_system_score_gemma":0.002291385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004326121,"about_ca_topic_score_gemma":0.006736622,"domain_scores_codex":[0.9989358,0.0002036447,0.0000978746,0.0002540335,0.000318802,0.0001899416],"domain_scores_gemma":[0.9946607,0.001521286,0.0002079619,0.002456952,0.000951738,0.0002012802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002716443,0.0006855368,0.008062406,0.0007972539,0.0002056986,0.0004784314,0.0003060306,0.1019749,0.04248729,0.05027815,0.09568129,0.6963266],"study_design_scores_gemma":[0.000563947,0.000815477,0.001730684,0.0001160307,0.0001809777,0.0005035609,0.0003263092,0.7487954,0.07366305,0.08461755,0.08855933,0.0001276015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1554728,0.001305363,0.7096977,0.001904207,0.00131406,0.0007724053,0.004611915,0.07670542,0.04821614],"genre_scores_gemma":[0.507026,0.0002229134,0.4615053,0.001097933,0.00009996199,0.0002976111,0.003893625,0.003828999,0.02202765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01549043,"threshold_uncertainty_score":0.0518207,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004026196,0.001661596,0.001147557,0.003662915,0.001079919,0.003073774,0.00324857,0.002389645,0.006964386],"category_scores_gemma":[0.01342745,0.0009114962,0.002231901,0.003617049,0.005633868,0.006307681,0.0019593,0.003346073,0.001463058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003132606,"about_ca_system_score_gemma":0.001847069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003991319,"about_ca_topic_score_gemma":0.002561501,"domain_scores_codex":[0.9963566,0.001719415,0.0002163202,0.0006567861,0.0007972429,0.000253751],"domain_scores_gemma":[0.9886993,0.009105544,0.0006635916,0.0009125551,0.0004429622,0.000176105],"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.000006259669,0.00001729994,0.0001271831,0.00008325405,0.00002037123,0.00003275156,0.00006284556,0.05523269,0.0002264708,0.9375275,0.0005908322,0.006072571],"study_design_scores_gemma":[0.00001436214,0.00005027982,0.00009369993,0.00005015416,0.00001360443,0.00006050484,0.0000406916,0.1409917,0.0002322331,0.8502173,0.008216512,0.00001885159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001389454,0.0006309644,0.9911255,0.0005158858,0.00003818011,0.00006734778,0.00009118335,0.0001390921,0.006002362],"genre_scores_gemma":[0.2694638,0.00488882,0.7150441,0.0008771999,0.0005391721,0.001484086,0.0005232044,0.0003180033,0.006861683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006964386,"threshold_uncertainty_score":0.0232982,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001869344,0.0004418441,0.0007024616,0.001044585,0.0005688675,0.00116578,0.0009268012,0.0007588663,0.002569479],"category_scores_gemma":[0.01326623,0.0004085978,0.0004906537,0.0007611898,0.001253822,0.002177396,0.0009877661,0.001092861,0.0001883359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026197,"about_ca_system_score_gemma":0.001120529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363026,"about_ca_topic_score_gemma":0.002140295,"domain_scores_codex":[0.9991618,0.0003952119,0.00003461058,0.00008676935,0.0001763498,0.0001450947],"domain_scores_gemma":[0.9897564,0.007915677,0.001120265,0.000499696,0.0004406194,0.000267329],"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.0002873933,0.0002273204,0.002957826,0.0001914235,0.00006457775,0.0001744454,0.0002420355,0.8175314,0.005050791,0.11813,0.001225161,0.05391764],"study_design_scores_gemma":[0.00005211373,0.0002053887,0.001060305,0.00004453406,0.00002710807,0.00008132347,0.0001321938,0.9171847,0.002483991,0.07707799,0.001633374,0.00001691299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4233651,0.001404371,0.5562537,0.001442721,0.00007272968,0.0002423419,0.0001032145,0.0003467989,0.01676888],"genre_scores_gemma":[0.9006002,0.0003538722,0.09704624,0.0001312071,0.00001986046,0.0001422887,0.00005640231,0.00007553756,0.001574384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002569479,"threshold_uncertainty_score":0.009886205,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703783,0.0005553653,0.0006153003,0.0009066357,0.0004726021,0.001177463,0.001900007,0.0006631337,0.007735095],"category_scores_gemma":[0.002978225,0.000388447,0.0005124994,0.001671519,0.0007462334,0.003047951,0.001870559,0.001167069,0.001740147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006222542,"about_ca_system_score_gemma":0.001122651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004346286,"about_ca_topic_score_gemma":0.002772123,"domain_scores_codex":[0.9992352,0.0002177089,0.00005944321,0.0001603501,0.0002570075,0.00007035861],"domain_scores_gemma":[0.9979314,0.0009151957,0.0002084882,0.0005114528,0.0003091813,0.0001243168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009829089,0.0002422122,0.00271041,0.0003915747,0.0000982995,0.0001228195,0.0002062973,0.3975924,0.00996083,0.1531629,0.01272062,0.4218088],"study_design_scores_gemma":[0.0001140656,0.0002161734,0.0004843572,0.00004050444,0.00002508869,0.0001452462,0.00004128276,0.9130779,0.007311511,0.06314632,0.01536766,0.00002993962],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01217868,0.0003969356,0.9814068,0.000186534,0.00006909155,0.00004907882,0.0002022525,0.001090606,0.004420011],"genre_scores_gemma":[0.2210046,0.000374799,0.7739179,0.0001505448,0.00003707618,0.0001791256,0.000505505,0.0002274007,0.003603104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007735095,"threshold_uncertainty_score":0.02587652,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005578724,0.001206424,0.001254244,0.001712641,0.0008609539,0.001861049,0.002458607,0.001604905,0.002716502],"category_scores_gemma":[0.04389663,0.0006576286,0.001121039,0.001743521,0.002230428,0.003950342,0.002713773,0.003770374,0.0003988888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002359049,"about_ca_system_score_gemma":0.002901647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003545548,"about_ca_topic_score_gemma":0.003512927,"domain_scores_codex":[0.9963193,0.001235568,0.0001776053,0.0004818847,0.001353432,0.0004322578],"domain_scores_gemma":[0.9699031,0.02079148,0.001829753,0.004585501,0.002285975,0.0006042938],"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.000933121,0.0006443149,0.008932757,0.0004517579,0.0001173341,0.000169354,0.0003787639,0.7895599,0.006200716,0.06897615,0.006126162,0.1175096],"study_design_scores_gemma":[0.0000504525,0.00028031,0.0007624566,0.00004848062,0.00002818197,0.00005929849,0.00005762626,0.9767919,0.003256685,0.01701316,0.001633637,0.00001780734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4645353,0.001930231,0.4999835,0.002387405,0.0002685684,0.0003915478,0.0007534517,0.003442315,0.02630775],"genre_scores_gemma":[0.7285557,0.0003722702,0.2676948,0.0003679373,0.0000692502,0.0002531256,0.0006619434,0.0004634374,0.001561543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005578724,"threshold_uncertainty_score":0.02950346,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002100082,0.001015068,0.001234762,0.001244316,0.0003560051,0.001525038,0.001302602,0.001150136,0.003367414],"category_scores_gemma":[0.01285708,0.0007387967,0.0006889218,0.0008989585,0.000499918,0.002919159,0.0008776084,0.001995328,0.001083711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001272689,"about_ca_system_score_gemma":0.001821871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005024987,"about_ca_topic_score_gemma":0.00562014,"domain_scores_codex":[0.9990742,0.0002544225,0.00006528212,0.0002295876,0.0002673824,0.0001090691],"domain_scores_gemma":[0.993828,0.003847979,0.0004641287,0.0009293336,0.0008037763,0.0001267599],"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.0003020942,0.0003727083,0.004927056,0.0001210459,0.00006045636,0.00003931938,0.00007446237,0.7558352,0.003839254,0.004601592,0.002606534,0.2272204],"study_design_scores_gemma":[0.00002074886,0.00003187373,0.0002176371,0.000005643662,0.000005951177,0.000006086625,0.000005558439,0.9965982,0.001160748,0.001563064,0.0003797216,0.000004860058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2372646,0.0005369606,0.7450004,0.0005629921,0.0001132138,0.0002346042,0.0003167354,0.008686365,0.007284197],"genre_scores_gemma":[0.6968575,0.0002061835,0.2989571,0.0002187759,0.00004902559,0.0002842065,0.0009305007,0.0004727374,0.002024052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005024987,"threshold_uncertainty_score":0.01126516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}