{"meta":{"query_hash":"3e7b204624f3","filters":{"venue":"Proceedings of the International Symposium on Combinatorial Search"},"cohort_total":94,"direct_labels_cover":0,"predictions_cover":94,"exported":94,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3e7b204624f3","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+International+Symposium+on+Combinatorial+Search"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.033329488121590305,"score_gpt":0.311779623732312,"score_spread":0.2784501356107217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1113434642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2513757,0.00035877628,0.7024162,0.0005169976,0.00009428022,0.00030162072,0.00017916631,0.0019168407,0.042840455],"genre_scores_gemma":[0.7337671,0.00006022026,0.2562777,0.0002088315,0.000014280259,0.00016859692,0.00020884821,0.00020965004,0.009084858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.0001795055,0.00004043427,0.00021662265,0.00020953121,0.00013891947],"domain_scores_gemma":[0.9988519,0.00048593245,0.00012195695,0.0002564379,0.00017780274,0.000105973304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139171,0.00053827744,0.00076996774,0.0007466143,0.0006456933,0.0006566203,0.0014899543,0.0007400894,0.006510031],"category_scores_gemma":[0.003624853,0.0002641721,0.00046754366,0.00046865724,0.0009875845,0.0015499028,0.0016349785,0.0006482546,0.0007443077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060723745,0.0003239702,0.009479841,0.00025868858,0.000085102285,0.00029025497,0.0006077635,0.2663391,0.01477922,0.15844285,0.009096902,0.53968894],"study_design_scores_gemma":[0.00007987088,0.00023912308,0.00094639254,0.000031308864,0.000020725396,0.00016338158,0.00009030244,0.91627294,0.0049212324,0.07128792,0.005921276,0.0000254374],"about_ca_topic_score_codex":0.002817898,"about_ca_topic_score_gemma":0.0055836705,"teacher_disagreement_score":0.006510031,"about_ca_system_score_codex":0.0012240718,"about_ca_system_score_gemma":0.0013824701,"threshold_uncertainty_score":0.021778166},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018758077535113257,"score_gpt":0.26843175903666694,"score_spread":0.24967368150155367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481890926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15547279,0.0013053627,0.70969766,0.0019042066,0.0013140598,0.0007724053,0.0046119154,0.07670542,0.04821614],"genre_scores_gemma":[0.507026,0.0002229134,0.46150526,0.0010979326,0.00009996199,0.00029761114,0.0038936248,0.0038289994,0.022027649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893576,0.00020364471,0.000097874596,0.0002540335,0.00031880205,0.00018994161],"domain_scores_gemma":[0.9946607,0.0015212863,0.00020796186,0.0024569521,0.000951738,0.00020128021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009281474,0.0007938002,0.0005756713,0.00088720536,0.0008160177,0.0015044879,0.0027900112,0.0009880201,0.015490429],"category_scores_gemma":[0.005474285,0.0004492799,0.0009042718,0.0008891523,0.0007897681,0.0023082418,0.0017331954,0.0014815199,0.0042338083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027164428,0.00068553677,0.0080624055,0.00079725386,0.00020569858,0.0004784314,0.00030603056,0.10197495,0.042487286,0.050278153,0.095681295,0.69632655],"study_design_scores_gemma":[0.00056394696,0.00081547705,0.0017306838,0.000116030664,0.00018097766,0.00050356094,0.00032630918,0.74879545,0.07366305,0.08461755,0.08855933,0.00012760148],"about_ca_topic_score_codex":0.0043261214,"about_ca_topic_score_gemma":0.0067366217,"teacher_disagreement_score":0.015490429,"about_ca_system_score_codex":0.0007654364,"about_ca_system_score_gemma":0.0022913846,"threshold_uncertainty_score":0.051820695},"labels":[],"label_agreement":null},{"id":"W1491672474","doi":"10.1609/socs.v4i1.18277","title":"SoCS 2013 Organization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Bremen; Università degli Studi di Brescia; Universidad Carlos III de Madrid; Universität des Saarlandes; Ben-Gurion University of the Negev; Albert-Ludwigs-Universität Freiburg; University of Toronto; Örebro Universitet; University College Cork; University of Denver; University of New South Wales; University of Alberta; Rice University; New Mexico State University; Universität Basel; University of Southern California","keywords":"Computer science","score_opus":0.03110446792260615,"score_gpt":0.2654526110569814,"score_spread":0.23434814313437527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491672474","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090616423,0.0039555593,0.0045669717,0.014737148,0.02228673,0.00050609524,0.023395907,0.003922541,0.92572296],"genre_scores_gemma":[0.0031554773,0.0027243712,0.0018928783,0.0012884147,0.002041616,0.00019653596,0.01327717,0.0008810844,0.9745423],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984049,0.00013930985,0.0001255753,0.00028942525,0.00070089655,0.00033994758],"domain_scores_gemma":[0.9918732,0.0002208623,0.00037204553,0.00066747237,0.0044027558,0.0024635668],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001689972,0.0010516734,0.00095099583,0.0037579373,0.0018436374,0.0086520715,0.001588551,0.0019224873,0.6941977],"category_scores_gemma":[0.004227563,0.00047399662,0.00079493,0.004670171,0.000481767,0.0021330074,0.0025526287,0.0013255002,0.76457876],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019093262,0.000014063458,0.00010493265,0.00013385057,0.000004034647,0.000024827468,0.000010574772,0.00009152816,0.00021622308,0.0035122137,0.93950415,0.056364585],"study_design_scores_gemma":[0.0000037499403,0.000008363255,0.00018713911,0.000058311674,0.0000017796908,0.000026923515,0.000017892353,0.0000850494,0.00009606372,0.00055717514,0.99895346,0.0000041478297],"about_ca_topic_score_codex":0.0051070913,"about_ca_topic_score_gemma":0.0055821347,"teacher_disagreement_score":0.6941977,"about_ca_system_score_codex":0.0024771153,"about_ca_system_score_gemma":0.0103688035,"threshold_uncertainty_score":0.43618983},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015760573196842338,"score_gpt":0.24088293891240958,"score_spread":0.22512236571556724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514904414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28100353,0.00033305914,0.7101628,0.0005300115,0.000065425746,0.00009860788,0.00046834414,0.0032123178,0.004125905],"genre_scores_gemma":[0.8575052,0.000114811,0.14072776,0.00006109429,0.000020574782,0.00013682808,0.00047378626,0.00015486623,0.0008051494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.00030020144,0.00004926586,0.00021554405,0.00026260657,0.00010988281],"domain_scores_gemma":[0.9838213,0.01252178,0.00079362444,0.0012142413,0.0014014243,0.00024775256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016979261,0.00066347787,0.00066058815,0.0013826356,0.0004394268,0.0011698651,0.0009799061,0.0010246206,0.002821169],"category_scores_gemma":[0.023361092,0.0005566847,0.0004258326,0.0010565243,0.00067425927,0.002547354,0.0007877462,0.0016276621,0.00057042064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015787901,0.0000668252,0.0065714456,0.000045923425,0.000021278714,0.000024929968,0.000027694034,0.9341526,0.00088219316,0.003964726,0.0010514598,0.053033017],"study_design_scores_gemma":[0.0000036668412,0.000010621695,0.0003606276,0.0000030114754,0.0000027610854,0.000004048972,0.000003323214,0.997282,0.00044834393,0.0018073594,0.00007143161,0.000002640006],"about_ca_topic_score_codex":0.007867999,"about_ca_topic_score_gemma":0.007975116,"teacher_disagreement_score":0.007867999,"about_ca_system_score_codex":0.001199581,"about_ca_system_score_gemma":0.0020058737,"threshold_uncertainty_score":0.015644372},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Leverage (statistics); Mathematical optimization; Computer science; Scope (computer science); Class (philosophy); Mathematics; Branching (polymer chemistry); Artificial intelligence","score_opus":0.01847776980982106,"score_gpt":0.25402562463627865,"score_spread":0.2355478548264576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521683430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045193125,0.00077182037,0.93028367,0.0005434134,0.00019937559,0.00025102327,0.00033660053,0.0010025984,0.021418385],"genre_scores_gemma":[0.30297548,0.00034175412,0.6855092,0.00045884267,0.00009964553,0.00037025698,0.0007924348,0.00037235627,0.00908007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988532,0.0003970112,0.00006322823,0.00023501259,0.00031707415,0.00013443985],"domain_scores_gemma":[0.9975661,0.0012409965,0.00015038955,0.00061421195,0.00033685096,0.00009139611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013963918,0.00087662507,0.0008493205,0.0008212083,0.0004705837,0.00085697585,0.0021597482,0.0010319218,0.0056806984],"category_scores_gemma":[0.0051233717,0.00037918572,0.0009931679,0.0011314497,0.0009301587,0.0015561522,0.0020161709,0.0020930145,0.00084841903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044655896,0.0003314798,0.0013042993,0.00027080416,0.00010964981,0.00025094268,0.0001592372,0.534596,0.008938627,0.12208616,0.010721017,0.3207851],"study_design_scores_gemma":[0.00009130698,0.00016515199,0.00035870573,0.000027944077,0.000032009182,0.00020808353,0.000036942296,0.91882557,0.003791645,0.065945655,0.010498941,0.000018064467],"about_ca_topic_score_codex":0.0016040769,"about_ca_topic_score_gemma":0.0031354304,"teacher_disagreement_score":0.0056806984,"about_ca_system_score_codex":0.00075974874,"about_ca_system_score_gemma":0.001355585,"threshold_uncertainty_score":0.019003868},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Merge (version control); Heuristics; Computer science; Variable (mathematics); Theoretical computer science; Nonlinear system; Algorithm; Mathematics; Mathematical optimization; Parallel computing","score_opus":0.018115225935575824,"score_gpt":0.28731736492347815,"score_spread":0.26920213898790235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557668034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100782085,0.00017248598,0.98682666,0.00010064223,0.000016357038,0.00014013972,0.00005808738,0.0011521584,0.0014552665],"genre_scores_gemma":[0.16630045,0.00014019277,0.8308351,0.00014998378,0.00002302894,0.00027834915,0.00026210747,0.00040685962,0.0016039425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977889,0.0007869264,0.00017872459,0.0003477333,0.000613822,0.0002837609],"domain_scores_gemma":[0.99395955,0.0033210353,0.00059216755,0.0013311871,0.0005753174,0.00022080759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036710857,0.0012895782,0.0012197607,0.0015587972,0.0013157581,0.0014053996,0.0032344456,0.0010618075,0.0044323467],"category_scores_gemma":[0.0122501915,0.0008287782,0.0015389023,0.0015300493,0.0017790571,0.0035371701,0.003957066,0.002069679,0.00070867693],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006037106,0.00027530445,0.004018114,0.00060782465,0.00023037694,0.00019894881,0.0015045118,0.32003447,0.015395225,0.18143067,0.007852977,0.46784782],"study_design_scores_gemma":[0.00006209769,0.00011719551,0.00047106808,0.00003850317,0.00007549815,0.0000707127,0.00017347353,0.9127807,0.009328683,0.070666574,0.00616971,0.000045704946],"about_ca_topic_score_codex":0.004741096,"about_ca_topic_score_gemma":0.007817294,"teacher_disagreement_score":0.004741096,"about_ca_system_score_codex":0.0018762568,"about_ca_system_score_gemma":0.002820355,"threshold_uncertainty_score":0.019414783},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"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","score_opus":0.009396174356073185,"score_gpt":0.23573789032832695,"score_spread":0.22634171597225378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581046800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63278604,0.0018921735,0.33985823,0.0033421088,0.00053281337,0.0001254845,0.0015143704,0.005792713,0.014156103],"genre_scores_gemma":[0.9510117,0.000191882,0.046281226,0.00024247209,0.00005096139,0.000066936904,0.00068486313,0.00015691377,0.0013129304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867404,0.00036641167,0.00007093474,0.0003096175,0.0002911107,0.00028790554],"domain_scores_gemma":[0.98116195,0.01346148,0.0007487374,0.0025085304,0.0014080649,0.0007113337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041699274,0.001087445,0.0012351366,0.0008368878,0.00080401736,0.001241053,0.0021866413,0.0014658602,0.00270238],"category_scores_gemma":[0.021221219,0.0005415548,0.00055500865,0.0006117139,0.0009242429,0.0025426005,0.0014716674,0.0036904362,0.0010295832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000599042,0.00013881033,0.008727341,0.00009369493,0.000041040945,0.00006555885,0.00012797884,0.93243545,0.0018042189,0.0067339954,0.0068833507,0.042349506],"study_design_scores_gemma":[0.0000117016025,0.00002918528,0.00031483328,0.0000084257845,0.0000035492812,0.00001027001,0.000011891557,0.99531305,0.0009339503,0.0031599258,0.00019569875,0.000007424986],"about_ca_topic_score_codex":0.008211786,"about_ca_topic_score_gemma":0.008216257,"teacher_disagreement_score":0.008211786,"about_ca_system_score_codex":0.0018875954,"about_ca_system_score_gemma":0.0027311137,"threshold_uncertainty_score":0.022052944},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of 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","score_opus":0.030885213682001034,"score_gpt":0.2737041193050974,"score_spread":0.24281890562309638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581836567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06628146,0.0004555131,0.9311448,0.00017166382,0.000051356918,0.00020882791,0.00014521812,0.0005018783,0.0010393405],"genre_scores_gemma":[0.4358828,0.00021824897,0.5618601,0.00017720144,0.00007123767,0.0004342067,0.0004981608,0.00011214957,0.0007458226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963387,0.0019420297,0.00022024858,0.0005171818,0.00076267193,0.00021926295],"domain_scores_gemma":[0.9626257,0.027394367,0.0029420587,0.0031354616,0.0030970813,0.0008053234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008581035,0.0008774997,0.0013408229,0.0027392884,0.00067520514,0.0018226668,0.0021518325,0.0014515871,0.0013321331],"category_scores_gemma":[0.04210436,0.0009281956,0.0014873828,0.0021683099,0.0014066463,0.0037060063,0.00129666,0.0020817262,0.00032166185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042051863,0.00019898514,0.021312414,0.00017976348,0.00015849342,0.00005274604,0.00023572093,0.82698274,0.0015477395,0.041274413,0.0014542461,0.10618209],"study_design_scores_gemma":[0.000013653786,0.000044027864,0.00053381466,0.000012161417,0.000010632443,0.000011914553,0.000015686346,0.98543537,0.000508205,0.013116418,0.00028705696,0.000011114622],"about_ca_topic_score_codex":0.0056502745,"about_ca_topic_score_gemma":0.0066252486,"teacher_disagreement_score":0.008581035,"about_ca_system_score_codex":0.0023486586,"about_ca_system_score_gemma":0.002506505,"threshold_uncertainty_score":0.045381367},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.02651344961679829,"score_gpt":0.28119017343454755,"score_spread":0.25467672381774925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591786641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14926037,0.00033626132,0.83940816,0.00028456148,0.000036687317,0.0003568231,0.00028331828,0.0035473453,0.006486551],"genre_scores_gemma":[0.47932923,0.00018803625,0.5172601,0.0001083304,0.000016525402,0.00017734623,0.00052120286,0.0003501834,0.0020490412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981793,0.0006595674,0.000096588825,0.0002498421,0.00056867074,0.0002459935],"domain_scores_gemma":[0.99505675,0.003736038,0.0002566379,0.00056704914,0.00028126733,0.000102280435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834385,0.0008475589,0.0010481252,0.0010627076,0.00093114877,0.0012491565,0.0018905982,0.001045594,0.0019989973],"category_scores_gemma":[0.009421877,0.0005519302,0.0008015537,0.0009748232,0.00087014766,0.0023743887,0.0014256496,0.0015078944,0.0004074968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009062115,0.00062660786,0.0035678875,0.0005989952,0.00014450101,0.00065352063,0.0010434843,0.3688513,0.044172566,0.08037258,0.008802985,0.49025935],"study_design_scores_gemma":[0.00007857651,0.00012015186,0.0008476945,0.000038387425,0.00003667431,0.00020544339,0.00010905326,0.94491047,0.01438736,0.03616635,0.0030763377,0.000023408253],"about_ca_topic_score_codex":0.005162003,"about_ca_topic_score_gemma":0.010893296,"teacher_disagreement_score":0.005162003,"about_ca_system_score_codex":0.0007591719,"about_ca_system_score_gemma":0.0014109651,"threshold_uncertainty_score":0.01026392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023964816352057803,"score_gpt":0.27308998156429953,"score_spread":0.24912516521224173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613844723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23837563,0.000515064,0.74804246,0.00070683047,0.000053448297,0.00011944656,0.000082330815,0.0017140269,0.0103908],"genre_scores_gemma":[0.8891218,0.00020031523,0.10761359,0.0002279451,0.000015982445,0.00016324014,0.00016805805,0.00029290063,0.0021961546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780446,0.000790024,0.00010017038,0.00041757963,0.00051737495,0.00037037337],"domain_scores_gemma":[0.9769966,0.014521029,0.0021555156,0.0041095796,0.0012500092,0.00096717756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002955818,0.00079123554,0.0011621868,0.0006535278,0.0010316308,0.0017881247,0.0023708742,0.0015562122,0.0035708805],"category_scores_gemma":[0.031109318,0.0006537588,0.0007090482,0.00071376434,0.0021593024,0.0041542333,0.0019681999,0.0026906212,0.0008257378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073368533,0.0005091404,0.004606102,0.0003651768,0.00016619275,0.0005468774,0.0010752871,0.77266926,0.013415861,0.09150646,0.0031637254,0.11124229],"study_design_scores_gemma":[0.000036175174,0.0001774165,0.00040697266,0.000022289725,0.000022943957,0.00012842653,0.00017497217,0.9347313,0.0041091335,0.05892939,0.001243989,0.000016905522],"about_ca_topic_score_codex":0.0030874733,"about_ca_topic_score_gemma":0.0029084077,"teacher_disagreement_score":0.0035708805,"about_ca_system_score_codex":0.0011445519,"about_ca_system_score_gemma":0.0019138486,"threshold_uncertainty_score":0.015632093},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; 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","score_opus":0.019990277544513574,"score_gpt":0.2756694242229075,"score_spread":0.255679146678394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634932822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45836943,0.0017178081,0.52518034,0.0020710172,0.000054992295,0.00020044435,0.0006399503,0.00046650998,0.011299625],"genre_scores_gemma":[0.9004723,0.0008138778,0.095696494,0.00013210809,0.000058795005,0.00013969735,0.00032007092,0.000069112735,0.002297528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971424,0.0013257511,0.00014076664,0.00049892976,0.0005725918,0.00031953404],"domain_scores_gemma":[0.98688865,0.009900423,0.0014313061,0.00071570656,0.0004295319,0.0006344402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020192838,0.00077403145,0.0009838664,0.002381751,0.0017562238,0.0028849507,0.0010097682,0.0014940504,0.0021574404],"category_scores_gemma":[0.016979387,0.0008751545,0.0007580128,0.0025044468,0.0024308446,0.0052902643,0.0029480557,0.0015122304,0.00041439908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005892642,0.00016955797,0.0129374135,0.00037467328,0.00015305406,0.00038465002,0.0019459253,0.52865434,0.005217222,0.34477332,0.0045161913,0.10028432],"study_design_scores_gemma":[0.000057957943,0.00007861087,0.0025592337,0.00005650488,0.000042783176,0.00039146582,0.00065759156,0.508946,0.00209251,0.47970378,0.0053635575,0.00005004508],"about_ca_topic_score_codex":0.0020780268,"about_ca_topic_score_gemma":0.0020704288,"teacher_disagreement_score":0.0028849507,"about_ca_system_score_codex":0.0017918182,"about_ca_system_score_gemma":0.0008951775,"threshold_uncertainty_score":0.0130006075},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019924925181980364,"score_gpt":0.27297429488792707,"score_spread":0.2530493697059467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1659382545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063283504,0.0001422388,0.9873204,0.00024179788,0.000038487244,0.00013319388,0.00007670251,0.002019127,0.0036995604],"genre_scores_gemma":[0.11413944,0.00016750715,0.88203436,0.0001076646,0.000018821294,0.00024137457,0.00039862777,0.00025301677,0.0026392224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990244,0.00017457022,0.00006385875,0.00026971055,0.00028758246,0.0001798674],"domain_scores_gemma":[0.9982173,0.0010039209,0.00013219663,0.0003368877,0.00020250122,0.0001071092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009261227,0.00111465,0.0010062587,0.00085151696,0.001331906,0.0011582474,0.002265531,0.0015563841,0.009073798],"category_scores_gemma":[0.004101477,0.000687192,0.0014855003,0.0013049236,0.001194825,0.002367725,0.0023991105,0.0020622166,0.0023249711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033771497,0.00037673107,0.001085419,0.00075658056,0.00011298595,0.00031985436,0.0006430416,0.27143878,0.013142185,0.10125462,0.019829767,0.5907023],"study_design_scores_gemma":[0.00017160994,0.00017362006,0.00024942038,0.000030063109,0.000038059294,0.00028354037,0.00014314581,0.92035604,0.004046819,0.06306463,0.011415814,0.000027181964],"about_ca_topic_score_codex":0.004831668,"about_ca_topic_score_gemma":0.0061301445,"teacher_disagreement_score":0.009073798,"about_ca_system_score_codex":0.001327062,"about_ca_system_score_gemma":0.0036658656,"threshold_uncertainty_score":0.030354857},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.026124778634505907,"score_gpt":0.28744674564692707,"score_spread":0.26132196701242116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806352760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012178683,0.0003969356,0.9814068,0.00018653402,0.00006909155,0.000049078822,0.00020225246,0.0010906063,0.004420011],"genre_scores_gemma":[0.22100462,0.00037479898,0.77391785,0.00015054483,0.00003707618,0.00017912558,0.000505505,0.00022740068,0.0036031043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923515,0.00021770895,0.00005944321,0.00016035012,0.00025700746,0.00007035861],"domain_scores_gemma":[0.99793136,0.0009151957,0.00020848816,0.00051145285,0.00030918134,0.00012431682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077037833,0.0005553653,0.0006153003,0.00090663566,0.00047260206,0.0011774629,0.0019000075,0.0006631337,0.0077350955],"category_scores_gemma":[0.0029782252,0.00038844696,0.0005124994,0.0016715188,0.0007462334,0.0030479508,0.0018705594,0.0011670692,0.0017401469],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009829089,0.00024221223,0.0027104102,0.00039157466,0.000098299504,0.00012281955,0.00020629734,0.3975924,0.00996083,0.15316288,0.012720622,0.42180878],"study_design_scores_gemma":[0.00011406561,0.0002161734,0.00048435718,0.00004050444,0.000025088693,0.00014524619,0.00004128276,0.9130779,0.0073115113,0.06314632,0.015367662,0.00002993962],"about_ca_topic_score_codex":0.0043462864,"about_ca_topic_score_gemma":0.0027721226,"teacher_disagreement_score":0.0077350955,"about_ca_system_score_codex":0.0006222542,"about_ca_system_score_gemma":0.0011226513,"threshold_uncertainty_score":0.025876522},"labels":[],"label_agreement":null},{"id":"W1853409189","doi":"10.1609/socs.v5i1.18308","title":"SoCS 2014 Organization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Brescia; Universidad Carlos III de Madrid; Universität des Saarlandes; Ben-Gurion University of the Negev; Albert-Ludwigs-Universität Freiburg; University College Cork; University of Denver; Rice University; New Mexico State University; King's College London; University of New South Wales; University of Alberta; Universität Basel; University of Southern California","keywords":"Computer science; Business","score_opus":0.048114592981606405,"score_gpt":0.333409202556567,"score_spread":0.28529460957496056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853409189","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016330079,0.010618818,0.015315905,0.08511675,0.32502007,0.0024690132,0.035087053,0.011702623,0.5130367],"genre_scores_gemma":[0.0093759885,0.009324052,0.008001491,0.010519427,0.050353784,0.001954735,0.03234232,0.0040585487,0.87406963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9903916,0.0011910925,0.0008178534,0.0010482088,0.0049942094,0.0015570446],"domain_scores_gemma":[0.89538634,0.0018432299,0.0025314777,0.004299688,0.0735865,0.022352656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0127120325,0.001507506,0.0021969813,0.008582036,0.003623658,0.01368317,0.0029501827,0.0032669103,0.4985795],"category_scores_gemma":[0.02350473,0.000796856,0.0016174467,0.006022705,0.0011846849,0.0033977246,0.005225643,0.0024838499,0.57020503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036400008,0.0000101209,0.00008517627,0.00019944977,0.000006198812,0.00002149885,0.000009677455,0.000056554545,0.00016093584,0.0009961368,0.9784872,0.019930627],"study_design_scores_gemma":[0.00001189553,0.000017776936,0.0002532475,0.00011327745,0.0000050654357,0.00003128763,0.000030044432,0.00012811935,0.000106292704,0.0005500766,0.998743,0.00001002808],"about_ca_topic_score_codex":0.003756693,"about_ca_topic_score_gemma":0.0048308447,"teacher_disagreement_score":0.4985795,"about_ca_system_score_codex":0.0048028463,"about_ca_system_score_gemma":0.02870309,"threshold_uncertainty_score":0.71521544},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01248162264710213,"score_gpt":0.24000576043663643,"score_spread":0.22752413778953431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959603133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048535768,0.00017331692,0.9430218,0.00019910415,0.000031587657,0.00012586596,0.00030774868,0.0027941058,0.0048106667],"genre_scores_gemma":[0.36429667,0.00026626405,0.62915057,0.00015243203,0.000015231932,0.0001963529,0.001500856,0.00039984463,0.0040217633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965036,0.000083650084,0.000017320166,0.000091404356,0.00009762008,0.00005970903],"domain_scores_gemma":[0.999461,0.00023055912,0.000057586203,0.000102154285,0.00009968221,0.00004899757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037574634,0.0007756012,0.00062177045,0.0007859947,0.0005096017,0.00065416115,0.0010963649,0.00057203905,0.0038090292],"category_scores_gemma":[0.0014707918,0.00029557475,0.0006770042,0.00090879493,0.0004541955,0.0018666259,0.0014321608,0.0007916099,0.0006910622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039860012,0.00016919014,0.0013571488,0.00024883208,0.00006131589,0.00018782355,0.00027773192,0.59687454,0.013086355,0.04380633,0.008403155,0.3351289],"study_design_scores_gemma":[0.000040407638,0.00007909764,0.00033607057,0.000012080952,0.000015173181,0.000054737633,0.00006122939,0.95832205,0.0045579975,0.030992422,0.0055176998,0.000010972235],"about_ca_topic_score_codex":0.007603721,"about_ca_topic_score_gemma":0.0063554863,"teacher_disagreement_score":0.007603721,"about_ca_system_score_codex":0.0007150154,"about_ca_system_score_gemma":0.0011309071,"threshold_uncertainty_score":0.015118957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02448131788440136,"score_gpt":0.25144941176650953,"score_spread":0.22696809388210817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121729191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023262024,0.0002209034,0.9526161,0.00013020753,0.0000542484,0.00040204107,0.0008098254,0.01742057,0.005084176],"genre_scores_gemma":[0.2589386,0.0002992555,0.73327553,0.0001230142,0.000022625612,0.00085329753,0.002386318,0.002563071,0.0015382973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910873,0.00025680073,0.000067987494,0.00024061358,0.00022251355,0.00010329207],"domain_scores_gemma":[0.9986319,0.00070012524,0.00010472609,0.00037823533,0.00013627279,0.00004862711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623456,0.0013504602,0.0009816632,0.0011141914,0.0004426455,0.001073405,0.0019359575,0.0010671578,0.007045878],"category_scores_gemma":[0.0053012664,0.0010419814,0.0012005223,0.0011485104,0.0014206675,0.0014198769,0.002046237,0.0016268549,0.0017109106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026070993,0.00012248057,0.0011491438,0.00055697147,0.00007680905,0.00035649847,0.00024120651,0.74427015,0.022130707,0.0220621,0.008311872,0.20046134],"study_design_scores_gemma":[0.00006424351,0.000050156486,0.00019749235,0.000028164766,0.00001912677,0.00007069043,0.000055020282,0.9740139,0.009570078,0.011604873,0.004308357,0.000017850058],"about_ca_topic_score_codex":0.001671569,"about_ca_topic_score_gemma":0.003938663,"teacher_disagreement_score":0.007045878,"about_ca_system_score_codex":0.0010784417,"about_ca_system_score_gemma":0.0017832529,"threshold_uncertainty_score":0.023570776},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.014948621013471504,"score_gpt":0.250929431142466,"score_spread":0.23598081012899452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139042205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03538428,0.0007957616,0.9517356,0.00041665946,0.00006667123,0.0001514788,0.00012917531,0.0018064806,0.009513857],"genre_scores_gemma":[0.30266827,0.00020770665,0.6925244,0.0004091619,0.000040744337,0.00025947293,0.00045783055,0.00034491895,0.0030875136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794465,0.0007608599,0.00010192336,0.0003776792,0.0006072839,0.00020749655],"domain_scores_gemma":[0.9962483,0.0021934994,0.00020717467,0.0009337894,0.00028537284,0.00013192568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025864793,0.00082050223,0.0016395288,0.0008344778,0.0006176264,0.001253403,0.0014152412,0.0013744204,0.0057986383],"category_scores_gemma":[0.010460983,0.0006402639,0.00092722283,0.0011787253,0.0010263798,0.0025618186,0.002092501,0.0018676985,0.0009144529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045215024,0.0002525139,0.0016853625,0.00034079174,0.00009914763,0.00008961642,0.00032521287,0.59888047,0.0053702057,0.12043119,0.011544219,0.2605291],"study_design_scores_gemma":[0.000070108836,0.00006921576,0.00023100474,0.00002092669,0.000016100123,0.000034800152,0.000036797323,0.9439478,0.0010972448,0.05171361,0.0027527402,0.000009647999],"about_ca_topic_score_codex":0.0050214217,"about_ca_topic_score_gemma":0.008235572,"teacher_disagreement_score":0.0057986383,"about_ca_system_score_codex":0.0016040036,"about_ca_system_score_gemma":0.002567326,"threshold_uncertainty_score":0.019398391},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","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","score_opus":0.014210996534451879,"score_gpt":0.25734625459628285,"score_spread":0.24313525806183098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144283734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03661723,0.0007871254,0.9446758,0.0012693611,0.00022219883,0.00010856365,0.00033115363,0.0014553053,0.014533192],"genre_scores_gemma":[0.47830132,0.00042392538,0.5094555,0.0007807881,0.00014254684,0.00027308482,0.0007908179,0.00058708544,0.009244862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969177,0.0011441025,0.00018512618,0.00078141753,0.00061063125,0.00036101742],"domain_scores_gemma":[0.98991346,0.0060179774,0.0005146264,0.0025237554,0.000810395,0.00021977689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029952629,0.0010581848,0.0016348936,0.0010984396,0.0011101306,0.0024666556,0.0020385522,0.0028412747,0.007527038],"category_scores_gemma":[0.024908818,0.0006504702,0.0014914888,0.0013019516,0.0022761435,0.0039540473,0.0017589009,0.0024480168,0.0014849091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065118243,0.00020415998,0.0032620833,0.00048758174,0.00024121282,0.00029633148,0.00026580697,0.43504757,0.0031987675,0.3083254,0.016944636,0.2310753],"study_design_scores_gemma":[0.00007693207,0.00008443358,0.0002663334,0.000051390813,0.000041092775,0.00015083139,0.00007308915,0.72317475,0.0013068839,0.26919714,0.0055558565,0.000021286876],"about_ca_topic_score_codex":0.002502432,"about_ca_topic_score_gemma":0.0040169456,"teacher_disagreement_score":0.007527038,"about_ca_system_score_codex":0.0015906972,"about_ca_system_score_gemma":0.0024527116,"threshold_uncertainty_score":0.0251804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Simple (philosophy); Computer science; State (computer science); Algorithm; Artificial intelligence; Machine learning; Biology","score_opus":0.013765679445542732,"score_gpt":0.26114596971126736,"score_spread":0.2473802902657246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187873293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11054612,0.001669803,0.8351585,0.0029818402,0.0008210284,0.00034949425,0.0008261735,0.013749789,0.033897284],"genre_scores_gemma":[0.49294016,0.0006040017,0.4864662,0.0016482681,0.00017738609,0.00029836927,0.0014618996,0.0024601165,0.013943621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947331,0.0013171335,0.0002793892,0.00071915897,0.0023517208,0.0005995112],"domain_scores_gemma":[0.99357575,0.002666001,0.000285921,0.0024764882,0.0008754867,0.00012035732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021230925,0.001075303,0.0010686758,0.0010948897,0.0017509302,0.0019355798,0.00324287,0.0019175091,0.0059554004],"category_scores_gemma":[0.01091935,0.00077649165,0.0011908035,0.0014567814,0.002413378,0.0035792137,0.0028604225,0.0031524221,0.0020681797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095343473,0.0003079312,0.00388301,0.00095343066,0.0002020824,0.0012717028,0.0011400013,0.088886425,0.042369105,0.23743412,0.046126373,0.57647234],"study_design_scores_gemma":[0.0003246495,0.00045240863,0.0018354914,0.00031845405,0.00021571736,0.0017953976,0.00045844656,0.55332273,0.09264528,0.20167963,0.14679174,0.00015994805],"about_ca_topic_score_codex":0.004354678,"about_ca_topic_score_gemma":0.007823066,"teacher_disagreement_score":0.0059554004,"about_ca_system_score_codex":0.0013996876,"about_ca_system_score_gemma":0.0029447651,"threshold_uncertainty_score":0.019922793},"labels":[],"label_agreement":null},{"id":"W2216867086","doi":"10.1609/socs.v1i1.18157","title":"SoCS 2010 Organization","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.0076957502587794435,"score_gpt":0.2365496677550636,"score_spread":0.22885391749628414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216867086","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037967341,0.010746501,0.029605677,0.062326353,0.17212513,0.0031253726,0.07965625,0.0173923,0.6212258],"genre_scores_gemma":[0.011241938,0.009250078,0.015086599,0.006125011,0.020132499,0.0015319875,0.071848415,0.0042767175,0.8605068],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99638474,0.0003979613,0.000303117,0.00049584935,0.0016839168,0.00073437655],"domain_scores_gemma":[0.9668846,0.00058396155,0.0007527361,0.0017959164,0.021692678,0.008290033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006034881,0.0018224205,0.0019359565,0.0060756933,0.0028765805,0.009571149,0.0025463607,0.0024203772,0.30510047],"category_scores_gemma":[0.00806666,0.0006386793,0.0014735099,0.00550626,0.000726292,0.0031699375,0.003039859,0.002031482,0.44355023],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041901952,0.000016383365,0.000098363584,0.00015550952,0.0000049182163,0.000023341394,0.00000684422,0.000115211755,0.00026687144,0.0011247651,0.97328025,0.02486561],"study_design_scores_gemma":[0.000015069335,0.000030184216,0.00037405427,0.00009203108,0.0000070914784,0.000057607343,0.000034814988,0.0004604765,0.00030558652,0.00063032843,0.99797875,0.000013986881],"about_ca_topic_score_codex":0.01187907,"about_ca_topic_score_gemma":0.014966454,"teacher_disagreement_score":0.30510047,"about_ca_system_score_codex":0.0052307444,"about_ca_system_score_gemma":0.018100992,"threshold_uncertainty_score":0.99118984},"labels":[],"label_agreement":null},{"id":"W2227333382","doi":"10.1609/socs.v1i1.18180","title":"Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Solver; Branch and bound; Pruning; Bounding overwatch; Mathematical optimization; Transformation (genetics); Computer science; Context (archaeology); Domain (mathematical analysis); Local search (optimization); Boolean satisfiability problem; Mathematics; Algorithm; Artificial intelligence; Boolean function","score_opus":0.01213545434067036,"score_gpt":0.2629143388659637,"score_spread":0.25077888452529334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227333382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005004511,0.00008838412,0.98906845,0.00011322401,0.000019677916,0.00006602774,0.00006241021,0.0008635907,0.004713748],"genre_scores_gemma":[0.12795174,0.00024097909,0.8682326,0.00014460586,0.000046705416,0.00033037463,0.0005594918,0.00063634384,0.001857124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997801,0.0008698679,0.00012433888,0.0002480519,0.0007855076,0.00017126754],"domain_scores_gemma":[0.9967348,0.0023627023,0.00015321623,0.00045789094,0.00024367041,0.00004771606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136211,0.0015060576,0.0011861298,0.0014726887,0.0007146118,0.0020861856,0.0015335914,0.001029748,0.010123591],"category_scores_gemma":[0.010404872,0.00051398564,0.0012143007,0.0021163307,0.0018254685,0.003074763,0.0020050376,0.0027349046,0.0021195393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002190513,0.00020980187,0.0006846333,0.00034188989,0.00006457747,0.00015372262,0.00016462764,0.445519,0.0061364397,0.24380875,0.0070132795,0.29568413],"study_design_scores_gemma":[0.00006348087,0.00006569747,0.00010296625,0.000029716222,0.000021856855,0.000053973636,0.000041679126,0.8298963,0.004293427,0.16017604,0.005242219,0.000012678798],"about_ca_topic_score_codex":0.00212466,"about_ca_topic_score_gemma":0.003097415,"teacher_disagreement_score":0.010123591,"about_ca_system_score_codex":0.0011945912,"about_ca_system_score_gemma":0.0019207946,"threshold_uncertainty_score":0.033866763},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallelizable manifold; Algorithm; Domain (mathematical analysis); Mathematical optimization; Mathematics","score_opus":0.026249021842736097,"score_gpt":0.28531714361391786,"score_spread":0.25906812177118177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242756877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031088373,0.00025278536,0.9617087,0.0002218558,0.00005217979,0.00019940028,0.000035405104,0.001860785,0.0045805373],"genre_scores_gemma":[0.44509655,0.00014443204,0.5519926,0.00023234356,0.000045222947,0.0005445217,0.0000988365,0.00044574324,0.001399687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787307,0.00096132996,0.00016480158,0.00044847123,0.00037327793,0.00017911095],"domain_scores_gemma":[0.9934963,0.0031084944,0.0005252487,0.0022184984,0.00043782752,0.00021358693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032547151,0.001470887,0.0019302452,0.00093075755,0.0008970004,0.0016575238,0.003015348,0.0018188166,0.0035691506],"category_scores_gemma":[0.018767828,0.0010044947,0.00095256465,0.001371027,0.0016775707,0.0039142435,0.0027349645,0.0032399585,0.0010519414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051419914,0.00047885886,0.0027171653,0.00027791935,0.0001919688,0.00021203545,0.0003295805,0.72031724,0.017680284,0.035942275,0.003034555,0.218304],"study_design_scores_gemma":[0.00014641556,0.00019818642,0.00028528014,0.000027816859,0.0000383393,0.00009964365,0.0000493848,0.955394,0.0065021417,0.03433242,0.0028842308,0.00004213942],"about_ca_topic_score_codex":0.0014315683,"about_ca_topic_score_gemma":0.0021444499,"teacher_disagreement_score":0.0035691506,"about_ca_system_score_codex":0.0007382565,"about_ca_system_score_gemma":0.0017020175,"threshold_uncertainty_score":0.017212749},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Heuristics; Heuristic; Computer science; Path (computing); Domain (mathematical analysis); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01715329244094359,"score_gpt":0.27468542826688014,"score_spread":0.25753213582593654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248489652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020721521,0.00028506783,0.97587806,0.000053880245,0.000024843872,0.000063428524,0.00007989272,0.0010546619,0.0018385625],"genre_scores_gemma":[0.30516574,0.0002355669,0.6926758,0.000076142176,0.000015197386,0.00021675462,0.0003078268,0.0001655856,0.0011413286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992574,0.0002964538,0.00006763008,0.00012482521,0.00017239833,0.000081350365],"domain_scores_gemma":[0.9972727,0.0017521925,0.0002184753,0.00045173435,0.00021424898,0.00009064228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011318442,0.00055889157,0.00083749887,0.0010806184,0.00060887827,0.0011939502,0.0016202612,0.000794384,0.0022707214],"category_scores_gemma":[0.0047368524,0.0005019088,0.00053068803,0.0015489992,0.0009174104,0.0020467201,0.0015308186,0.0011794504,0.0005225609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003557298,0.00019406431,0.0013113886,0.00029706582,0.00007612921,0.000107691434,0.00022745166,0.62563396,0.003920022,0.059278652,0.002637477,0.30596036],"study_design_scores_gemma":[0.000060330196,0.0001370344,0.00016560272,0.000022401207,0.000020754711,0.000065548855,0.000043799577,0.95981276,0.0034856852,0.033763867,0.0024027969,0.000019485571],"about_ca_topic_score_codex":0.0024065399,"about_ca_topic_score_gemma":0.0033356498,"teacher_disagreement_score":0.0024065399,"about_ca_system_score_codex":0.0007907712,"about_ca_system_score_gemma":0.0014206322,"threshold_uncertainty_score":0.007596314},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024311054884565798,"score_gpt":0.3153885064059963,"score_spread":0.2910774515214305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293698321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3529237,0.0018709797,0.61155707,0.0036271077,0.00015530363,0.0006732903,0.0015023969,0.0015956385,0.026094452],"genre_scores_gemma":[0.90977305,0.0007878607,0.08539072,0.00023615813,0.000033357814,0.00014330847,0.00071282167,0.00009148853,0.0028311585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.00053012295,0.000075068274,0.0002379001,0.0007523871,0.00043026637],"domain_scores_gemma":[0.9933129,0.004387912,0.00053205783,0.00035499642,0.00077035854,0.0006418137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033013597,0.0012639241,0.0013412271,0.0013234018,0.0019168075,0.001804237,0.0020152088,0.0018298503,0.0034449645],"category_scores_gemma":[0.012477737,0.00065408635,0.0006200623,0.001918696,0.001786789,0.0015846353,0.0013742422,0.001933568,0.00017847659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001185401,0.00004783468,0.0005144452,0.000055010674,0.000017154347,0.000029871044,0.000053181262,0.97214013,0.000242068,0.015721139,0.0015312012,0.009529398],"study_design_scores_gemma":[0.000064201806,0.000036981244,0.00045702493,0.000010158443,0.000009082864,0.000017779535,0.00003839523,0.9864216,0.0002878239,0.011659311,0.0009836633,0.000014094821],"about_ca_topic_score_codex":0.3597082,"about_ca_topic_score_gemma":0.30113825,"teacher_disagreement_score":0.6402918,"about_ca_system_score_codex":0.012009103,"about_ca_system_score_gemma":0.015849987,"threshold_uncertainty_score":0.7152289},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.015766394318122462,"score_gpt":0.26618553507636256,"score_spread":0.2504191407582401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293808320","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09364024,0.0019987423,0.86664295,0.000944117,0.00046081972,0.0004565158,0.0005793313,0.0017961188,0.033481188],"genre_scores_gemma":[0.6855158,0.0008059282,0.30152094,0.0005989138,0.000134573,0.0004608187,0.0007815888,0.00019662346,0.009984683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00014981633,0.000030182955,0.00008014367,0.00025333633,0.00008580311],"domain_scores_gemma":[0.99892104,0.000624954,0.00007735717,0.00017988223,0.00014136972,0.000055392124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097767,0.0006497428,0.00082567247,0.0010074999,0.00042724394,0.0008276425,0.0016330299,0.00090748956,0.0070761773],"category_scores_gemma":[0.003282562,0.0003043149,0.00041096745,0.0010458521,0.0008494338,0.001445243,0.0015994253,0.0009010526,0.0005230889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005123405,0.00023589688,0.00083245145,0.00039301938,0.00006590381,0.00032249233,0.00017610387,0.55721444,0.006963141,0.053059123,0.0077306055,0.3724944],"study_design_scores_gemma":[0.00012522143,0.00019462171,0.0002463388,0.00005372312,0.000029924951,0.0001640956,0.000046182908,0.9654195,0.004415466,0.021766763,0.007514894,0.000023305376],"about_ca_topic_score_codex":0.0027262648,"about_ca_topic_score_gemma":0.0023942979,"teacher_disagreement_score":0.0070761773,"about_ca_system_score_codex":0.0009981324,"about_ca_system_score_gemma":0.0015555723,"threshold_uncertainty_score":0.023672163},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.019377096203426453,"score_gpt":0.2739802742194933,"score_spread":0.2546031780160668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295532854","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02382506,0.058332052,0.24928972,0.5184829,0.0067783166,0.00021462353,0.0004818513,0.00089591567,0.14169951],"genre_scores_gemma":[0.7339096,0.039588965,0.10287941,0.10379434,0.010096536,0.0008147864,0.000351178,0.0005447416,0.008020327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.96029806,0.02358561,0.0026013306,0.0034407452,0.008955273,0.001118908],"domain_scores_gemma":[0.78599787,0.18777558,0.0048163286,0.008841969,0.0114417905,0.0011263639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0422175,0.0012212017,0.001341146,0.0050763558,0.003796605,0.009832144,0.006266635,0.009449951,0.005723858],"category_scores_gemma":[0.1359442,0.0011416896,0.0013377946,0.004977596,0.048397478,0.017464727,0.004343316,0.016178187,0.0021146548],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001288714,0.00003146792,0.0005432994,0.0006555136,0.00008237644,0.00021762226,0.0044657597,0.0029170413,0.00012297546,0.94302243,0.019549292,0.028263304],"study_design_scores_gemma":[0.00005383738,0.00003686403,0.00020487157,0.0007441954,0.000026071399,0.00037166645,0.0018110026,0.0032951587,0.00048088862,0.93311346,0.059802886,0.000059124905],"about_ca_topic_score_codex":0.0036872644,"about_ca_topic_score_gemma":0.0017452677,"teacher_disagreement_score":0.0422175,"about_ca_system_score_codex":0.005774842,"about_ca_system_score_gemma":0.0032852585,"threshold_uncertainty_score":0.22327018},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Frontier; Computer science; Node (physics); Work (physics); Search algorithm; Algorithm; Engineering; Geography","score_opus":0.01840111607900786,"score_gpt":0.2670439970903512,"score_spread":0.24864288101134335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296772665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012710249,0.0005535017,0.97296077,0.00018721212,0.00012371369,0.0001064947,0.00015281788,0.0011380005,0.012067133],"genre_scores_gemma":[0.21237521,0.00051403383,0.77767926,0.00020956603,0.000034434215,0.0002962623,0.00041294564,0.00030239968,0.008175943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.00017668828,0.000035979927,0.000113163456,0.00030382755,0.00010207742],"domain_scores_gemma":[0.99923146,0.00024507832,0.00006409905,0.0001602292,0.00022751954,0.000071698516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084818096,0.00080879807,0.0010960089,0.0008415294,0.00067962526,0.0014924699,0.0016230706,0.0011035716,0.008057051],"category_scores_gemma":[0.0022463535,0.0004143078,0.0007503422,0.0011158325,0.00057930686,0.0019153138,0.0022012542,0.0012034321,0.0020527733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039416857,0.00028098797,0.0017722358,0.0005448383,0.00011144733,0.00016666397,0.00023209925,0.2582295,0.015863618,0.11939411,0.007996688,0.5950137],"study_design_scores_gemma":[0.000099262536,0.00020227687,0.00023865042,0.00007923089,0.00004263772,0.00020750826,0.00008082911,0.91477835,0.0075945617,0.04513697,0.03149594,0.000043732012],"about_ca_topic_score_codex":0.0024157073,"about_ca_topic_score_gemma":0.0033013944,"teacher_disagreement_score":0.008057051,"about_ca_system_score_codex":0.0005932534,"about_ca_system_score_gemma":0.001628162,"threshold_uncertainty_score":0.026953518},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01774095050964933,"score_gpt":0.26186038778479787,"score_spread":0.24411943727514854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395906882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023091178,0.00047286574,0.97164714,0.00014237448,0.000028513237,0.00009259432,0.00014055442,0.0018983881,0.0024863975],"genre_scores_gemma":[0.30846462,0.00025071466,0.68861616,0.00013198139,0.000018820041,0.00024734612,0.00038751258,0.00021290025,0.0016698195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998418,0.0006066805,0.00009523862,0.00026487638,0.0004470482,0.00016824882],"domain_scores_gemma":[0.99775535,0.0010776608,0.00016386584,0.00078342936,0.0001244225,0.00009520791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770769,0.00091158604,0.0009028087,0.0012427452,0.00059691624,0.0013374074,0.001826122,0.00069082284,0.0026331237],"category_scores_gemma":[0.0046985243,0.0004967544,0.0012775254,0.0014060062,0.00128238,0.0027832454,0.0035461665,0.002181589,0.00040272108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026113543,0.00013611892,0.002024841,0.00038841326,0.00014353487,0.00014869784,0.00057908637,0.56658787,0.00784493,0.11747563,0.0018848096,0.302525],"study_design_scores_gemma":[0.000054129694,0.00014269532,0.00053798704,0.00004956819,0.0000476092,0.000085047584,0.00011912743,0.8665359,0.0075070634,0.11483667,0.010051502,0.00003273184],"about_ca_topic_score_codex":0.004308115,"about_ca_topic_score_gemma":0.0051524737,"teacher_disagreement_score":0.004308115,"about_ca_system_score_codex":0.0013669789,"about_ca_system_score_gemma":0.0020589426,"threshold_uncertainty_score":0.009918153},"labels":[],"label_agreement":null},{"id":"W2397134496","doi":"10.1609/socs.v3i1.18266","title":"Alternative Forms of Bounded Suboptimal 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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Bounded function; Construct (python library); Mathematical optimization; Iterative deepening depth-first search; Mathematics; Computer science; Search algorithm; Constant (computer programming); Beam search; Algorithm; Theoretical computer science; Best-first search; Artificial intelligence","score_opus":0.014294365401943414,"score_gpt":0.2740143347736901,"score_spread":0.2597199693717467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397134496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010813724,0.000341919,0.97450364,0.00036975794,0.00003979695,0.00006382824,0.000050560913,0.00042793018,0.013388911],"genre_scores_gemma":[0.4186012,0.0005101305,0.5729287,0.0007177909,0.00007241806,0.00043619357,0.00022935227,0.00030053058,0.0062036505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303126,0.002736832,0.00055066263,0.00094856054,0.0020610783,0.0006714999],"domain_scores_gemma":[0.98360276,0.00886191,0.0009936322,0.0042847674,0.0017028104,0.00055418076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007217868,0.0012213768,0.0013891178,0.0014914761,0.0011066451,0.0037626352,0.003307323,0.0023855395,0.0060089873],"category_scores_gemma":[0.03912419,0.00070698274,0.0012069931,0.001703766,0.0034369524,0.0055407844,0.0047587194,0.0027037016,0.0013843187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114306546,0.00004746949,0.00049850944,0.00013705056,0.000038157144,0.00008521324,0.00026133534,0.095217824,0.0017118795,0.86092925,0.001736083,0.039222907],"study_design_scores_gemma":[0.000045826306,0.00009513415,0.00012336731,0.00008090611,0.000025683294,0.00013523018,0.00007440856,0.5855912,0.003357124,0.40423888,0.006204556,0.000027733238],"about_ca_topic_score_codex":0.0013122814,"about_ca_topic_score_gemma":0.002084806,"teacher_disagreement_score":0.007217868,"about_ca_system_score_codex":0.0019886976,"about_ca_system_score_gemma":0.00275998,"threshold_uncertainty_score":0.038172185},"labels":[],"label_agreement":null},{"id":"W2397806795","doi":"10.1609/socs.v3i1.18236","title":"Search-Aware Conditions for Probably Approximately Correct 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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Incremental heuristic search; Speedup; Beam search; Heuristic; Bidirectional search; Iterative deepening depth-first search; Computer science; Search algorithm; Best-first search; Beam stack search; Quality (philosophy); Search problem; Field (mathematics); Guided Local Search; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Parallel computing","score_opus":0.025915963393150592,"score_gpt":0.2807167400186607,"score_spread":0.2548007766255101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397806795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026412016,0.00049227546,0.95973796,0.0009468821,0.00014083598,0.00022061983,0.0003373496,0.0006665122,0.011045523],"genre_scores_gemma":[0.64407337,0.00086006796,0.34637806,0.0007306632,0.0004103857,0.0009260562,0.0010883901,0.00058177236,0.004951202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905719,0.002702831,0.000685261,0.0016204355,0.0031342553,0.0012853197],"domain_scores_gemma":[0.90180874,0.076755665,0.0052970373,0.0068738405,0.0071326243,0.0021319776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071319058,0.001448003,0.0024438994,0.0026381325,0.0011636562,0.0037939546,0.0026055088,0.0037391202,0.00965452],"category_scores_gemma":[0.09502227,0.0012704851,0.0020390365,0.0015810521,0.004859218,0.008646368,0.003717572,0.006174174,0.001603264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008761931,0.00015669281,0.0025357888,0.0005181627,0.00010854903,0.0006557907,0.0005583382,0.3907099,0.0062189344,0.5499078,0.0059924633,0.04176138],"study_design_scores_gemma":[0.00011411882,0.00016468881,0.0004244997,0.000105779065,0.000035499797,0.0002676403,0.00009861225,0.7377587,0.0032999262,0.2550664,0.002609558,0.00005464943],"about_ca_topic_score_codex":0.0018245826,"about_ca_topic_score_gemma":0.0017624921,"teacher_disagreement_score":0.00965452,"about_ca_system_score_codex":0.0018216842,"about_ca_system_score_gemma":0.0034814272,"threshold_uncertainty_score":0.03771758},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02905911484794281,"score_gpt":0.28830203270278604,"score_spread":0.2592429178548432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400703308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08777818,0.004469759,0.8957316,0.002712093,0.0001526432,0.00010038616,0.00066724,0.0012443063,0.0071437615],"genre_scores_gemma":[0.6899663,0.0028202832,0.3026637,0.0002872979,0.00014508874,0.00017264944,0.0010545307,0.00033665093,0.0025535033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597955,0.0016181928,0.00022498232,0.00097169884,0.0009862387,0.00021926692],"domain_scores_gemma":[0.9721757,0.018718572,0.0026131934,0.0030563886,0.0029901224,0.0004459856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005174892,0.0008426998,0.0011006582,0.0020243179,0.00072567415,0.003199699,0.0014543163,0.0014464676,0.002529855],"category_scores_gemma":[0.06197331,0.0005696532,0.0006222836,0.0023626674,0.001544713,0.011128985,0.0012648171,0.0020510578,0.0012452945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047437884,0.00012402884,0.040946368,0.00043667582,0.00021612497,0.00008166935,0.0007466846,0.26079276,0.0025096352,0.08862467,0.0061405585,0.59890646],"study_design_scores_gemma":[0.000045729266,0.00036856014,0.009227436,0.00042956087,0.00009304061,0.00022204785,0.0007303834,0.80822843,0.005478476,0.15476818,0.020295328,0.000112768685],"about_ca_topic_score_codex":0.0059117107,"about_ca_topic_score_gemma":0.0040893997,"teacher_disagreement_score":0.0059117107,"about_ca_system_score_codex":0.001214177,"about_ca_system_score_gemma":0.0022197773,"threshold_uncertainty_score":0.02736777},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Pathfinding; Computer science; Theoretical computer science; Shortest path problem","score_opus":0.02463526732612297,"score_gpt":0.2993281981942744,"score_spread":0.27469293086815144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402290736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012448549,0.0004730635,0.9768515,0.0003039456,0.00017538841,0.00015674991,0.00028408386,0.00091791595,0.008388766],"genre_scores_gemma":[0.12803514,0.00046606656,0.86414677,0.0002783706,0.000104604835,0.00062554324,0.0007199378,0.00033083314,0.0052927854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985701,0.00045993345,0.00015359967,0.00028889976,0.0003919878,0.00013547369],"domain_scores_gemma":[0.9961339,0.0018571357,0.00029526433,0.0009879064,0.0005445107,0.00018143721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002001838,0.0010936362,0.0008244884,0.0014504623,0.00097195565,0.0015395135,0.0034463692,0.0016972455,0.008762071],"category_scores_gemma":[0.0060301516,0.0006295014,0.0016472349,0.0021770927,0.0011331505,0.0028078612,0.0027632024,0.0024079941,0.0018005617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004808336,0.00042971416,0.0010216247,0.0005113241,0.00017291185,0.00026356327,0.00021421433,0.2886663,0.008866867,0.33376637,0.020240672,0.3453656],"study_design_scores_gemma":[0.00011934854,0.00032894005,0.00031887437,0.000056887122,0.0000561697,0.00036389756,0.00007859472,0.78941107,0.0047880127,0.180657,0.023773931,0.00004725896],"about_ca_topic_score_codex":0.0021005394,"about_ca_topic_score_gemma":0.0024517926,"teacher_disagreement_score":0.008762071,"about_ca_system_score_codex":0.0007530836,"about_ca_system_score_gemma":0.0012791558,"threshold_uncertainty_score":0.029312015},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - 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","score_opus":0.011698521861673328,"score_gpt":0.2546399854608649,"score_spread":0.24294146359919158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402719117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23726463,0.0005369606,0.74500036,0.00056299206,0.00011321383,0.0002346042,0.00031673544,0.008686365,0.007284197],"genre_scores_gemma":[0.69685745,0.00020618351,0.29895708,0.00021877592,0.00004902559,0.00028420647,0.00093050074,0.00047273745,0.002024052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990742,0.00025442246,0.00006528212,0.00022958757,0.0002673824,0.00010906912],"domain_scores_gemma":[0.993828,0.0038479785,0.00046412868,0.00092933356,0.00080377626,0.00012675987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021000819,0.0010150679,0.0012347625,0.0012443163,0.0003560051,0.0015250383,0.0013026015,0.0011501361,0.003367414],"category_scores_gemma":[0.012857077,0.00073879666,0.00068892183,0.0008989585,0.000499918,0.0029191594,0.00087760837,0.0019953279,0.0010837106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003020942,0.00037270834,0.0049270564,0.00012104592,0.000060456365,0.000039319377,0.00007446237,0.7558352,0.0038392541,0.004601592,0.0026065344,0.22722039],"study_design_scores_gemma":[0.000020748861,0.000031873726,0.00021763715,0.000005643662,0.0000059511767,0.0000060866255,0.000005558439,0.9965982,0.0011607476,0.0015630636,0.00037972163,0.000004860058],"about_ca_topic_score_codex":0.005024987,"about_ca_topic_score_gemma":0.00562014,"teacher_disagreement_score":0.005024987,"about_ca_system_score_codex":0.0012726894,"about_ca_system_score_gemma":0.0018218706,"threshold_uncertainty_score":0.011265159},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random walk; Satisficing; Computer science; Branching (polymer chemistry); Graph; Mathematics; Theoretical computer science; Artificial intelligence; Statistics","score_opus":0.0236050720015905,"score_gpt":0.2930198622392588,"score_spread":0.2694147902376683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406156603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013894542,0.0006309644,0.9911255,0.0005158858,0.000038180107,0.00006734778,0.00009118335,0.00013909211,0.0060023624],"genre_scores_gemma":[0.26946384,0.0048888205,0.7150441,0.0008771999,0.00053917215,0.0014840859,0.00052320445,0.0003180033,0.0068616825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963566,0.0017194148,0.00021632022,0.0006567861,0.0007972429,0.000253751],"domain_scores_gemma":[0.98869926,0.009105544,0.0006635916,0.00091255514,0.00044296222,0.00017610496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040261955,0.0016615955,0.0011475568,0.0036629147,0.001079919,0.0030737736,0.0032485703,0.0023896454,0.006964386],"category_scores_gemma":[0.013427453,0.0009114962,0.0022319006,0.0036170494,0.005633868,0.006307681,0.0019593001,0.003346073,0.0014630584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006259669,0.00001729994,0.0001271831,0.00008325405,0.000020371233,0.000032751563,0.00006284556,0.05523269,0.00022647077,0.9375275,0.0005908322,0.0060725706],"study_design_scores_gemma":[0.000014362145,0.00005027982,0.000093699935,0.000050154158,0.000013604433,0.000060504844,0.000040691597,0.14099175,0.00023223314,0.85021734,0.008216512,0.000018851588],"about_ca_topic_score_codex":0.003991319,"about_ca_topic_score_gemma":0.0025615008,"teacher_disagreement_score":0.006964386,"about_ca_system_score_codex":0.003132606,"about_ca_system_score_gemma":0.0018470691,"threshold_uncertainty_score":0.023298204},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01693971839691495,"score_gpt":0.253200546666199,"score_spread":0.23626082826928407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408443083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103222996,0.001071913,0.86347896,0.0006706261,0.0001928247,0.00046338892,0.0010060889,0.008846615,0.021046713],"genre_scores_gemma":[0.41541898,0.0003702102,0.57049847,0.00058345,0.000078552,0.000484606,0.0016500772,0.0006688034,0.010246915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995486,0.00011274562,0.00003590408,0.000107491454,0.00012354551,0.00007163774],"domain_scores_gemma":[0.9982509,0.0008077615,0.00008572539,0.0006035853,0.00018789886,0.00006410764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006177041,0.00064831146,0.00055897736,0.00081734225,0.00053344213,0.0005668011,0.0016320414,0.0008068556,0.0070836726],"category_scores_gemma":[0.0025818103,0.00028021095,0.0007998427,0.0013160112,0.00073902204,0.0018669846,0.0018715141,0.00096145563,0.0015534719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057612266,0.00033442446,0.0023106425,0.00048777414,0.0000814606,0.00050601974,0.00027051542,0.09043116,0.03770797,0.036320634,0.02432345,0.8066498],"study_design_scores_gemma":[0.00017892488,0.00050560455,0.0010856881,0.00006786716,0.00010348526,0.0011564235,0.00017576427,0.8373048,0.0447023,0.08087748,0.033788726,0.00005302898],"about_ca_topic_score_codex":0.001168586,"about_ca_topic_score_gemma":0.002131149,"teacher_disagreement_score":0.0070836726,"about_ca_system_score_codex":0.0003155479,"about_ca_system_score_gemma":0.00094304176,"threshold_uncertainty_score":0.023697257},"labels":[],"label_agreement":null},{"id":"W2408598632","doi":"10.1609/socs.v3i1.18223","title":"Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract)","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; University of Regina","keywords":"Mathematical optimization; Path (computing); Focus (optics); Heuristic; Sampling (signal processing); Limit (mathematics); State space; Computer science; Space (punctuation); Total cost; Stratified sampling; Mathematics; Statistics; Economics","score_opus":0.027669585715042754,"score_gpt":0.269724330272183,"score_spread":0.24205474455714027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408598632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23593523,0.00021132114,0.7607149,0.0001709344,0.000024760559,0.00013155045,0.00023345635,0.0007525311,0.0018253577],"genre_scores_gemma":[0.8232859,0.000074029354,0.17543852,0.000052863827,0.000013819792,0.00018805558,0.00034814046,0.00007148479,0.00052718027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.00052246335,0.000054513155,0.00016508349,0.0002818618,0.00012207683],"domain_scores_gemma":[0.99289554,0.0049516605,0.0005008847,0.00064919697,0.00083208585,0.00017063454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027166284,0.0005638656,0.00093195064,0.0009383744,0.00038139513,0.0009645866,0.00086609076,0.000847527,0.0014360592],"category_scores_gemma":[0.0146665275,0.000569591,0.00055029604,0.000769205,0.0007548181,0.0014117413,0.0009773406,0.000823301,0.00035329172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004878359,0.0001548403,0.012907845,0.00007789119,0.000068054826,0.000058859372,0.00008289427,0.88972116,0.002679528,0.010971699,0.0011261718,0.08166315],"study_design_scores_gemma":[0.000008933565,0.000024677563,0.00047280066,0.000004151492,0.0000054167194,0.0000061293485,0.000008969574,0.99496245,0.00066460716,0.0037421288,0.000095774965,0.000003963403],"about_ca_topic_score_codex":0.01231613,"about_ca_topic_score_gemma":0.010778267,"teacher_disagreement_score":0.01231613,"about_ca_system_score_codex":0.0010880817,"about_ca_system_score_gemma":0.0019054707,"threshold_uncertainty_score":0.024488926},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017194737550558642,"score_gpt":0.2538083237308843,"score_spread":0.23661358618032566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573050985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012509147,0.00030061914,0.97862214,0.0004193253,0.00003489517,0.00020688403,0.000099328536,0.00020494992,0.0076028695],"genre_scores_gemma":[0.16748242,0.0004118086,0.8247681,0.00021450073,0.000036382262,0.0005440954,0.0002797697,0.00012399396,0.006138887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899966,0.0005178346,0.000035862944,0.0001362233,0.00021513579,0.00009537912],"domain_scores_gemma":[0.99871767,0.00095405633,0.00007317094,0.000081171,0.000112940084,0.000060954848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015525876,0.0011338973,0.0013211311,0.001749707,0.0011373417,0.0015281666,0.0022835135,0.0021074915,0.008150006],"category_scores_gemma":[0.0033150387,0.0008163712,0.0013965494,0.001708897,0.0014253679,0.0021612328,0.0019214968,0.0013837314,0.00074604433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001267452,0.00020995349,0.00065193797,0.00022851763,0.00007088752,0.00017333252,0.00015538243,0.82778144,0.0019274383,0.08932042,0.003260475,0.07609346],"study_design_scores_gemma":[0.00007352996,0.000120275516,0.00012955617,0.000028543647,0.000021754535,0.000091969705,0.00007292853,0.9482819,0.00058904727,0.046440348,0.004130538,0.000019621486],"about_ca_topic_score_codex":0.002858439,"about_ca_topic_score_gemma":0.004778103,"teacher_disagreement_score":0.008150006,"about_ca_system_score_codex":0.0013231302,"about_ca_system_score_gemma":0.0020205353,"threshold_uncertainty_score":0.027264476},"labels":[],"label_agreement":null},{"id":"W2573654191","doi":"10.1609/socs.v7i1.18409","title":"Numeric Planning via Search Space Abstraction (Extended Abstract)","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Leverage (statistics); Abstraction; Computer science; State space; Space (punctuation); Set (abstract data type); Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.018560106576552268,"score_gpt":0.27173650500060836,"score_spread":0.2531763984240561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573654191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007524643,0.00028688027,0.9818475,0.0002960438,0.00007809804,0.00008113666,0.00033833715,0.0027056106,0.006841726],"genre_scores_gemma":[0.31983894,0.00053941907,0.6724762,0.00020822455,0.000057502813,0.0003529053,0.0011303367,0.00046422044,0.0049324017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990545,0.00033152054,0.00007084518,0.00013595055,0.0003049291,0.000102333346],"domain_scores_gemma":[0.99863535,0.0007583416,0.00011419028,0.0003253729,0.00012768975,0.000039057915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088111404,0.00075965864,0.00051381567,0.0006686698,0.0005067161,0.001137041,0.0010357049,0.00053741597,0.008932634],"category_scores_gemma":[0.003907441,0.0004260797,0.0011438788,0.0011346585,0.0015223519,0.0017329274,0.0020782056,0.001764149,0.0013713189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020871557,0.00007749294,0.00074568845,0.00044114774,0.00006073182,0.00034411743,0.0002702998,0.67707074,0.0057934048,0.14342019,0.009868169,0.16169924],"study_design_scores_gemma":[0.000053745,0.000060388877,0.00023160617,0.00007661613,0.000035964335,0.00012402592,0.000050464878,0.79911846,0.0054500382,0.17657961,0.018194355,0.000024612451],"about_ca_topic_score_codex":0.0056080897,"about_ca_topic_score_gemma":0.006619976,"teacher_disagreement_score":0.008932634,"about_ca_system_score_codex":0.00086459913,"about_ca_system_score_gemma":0.0013193802,"threshold_uncertainty_score":0.02988261},"labels":[],"label_agreement":null},{"id":"W2573689326","doi":"10.1609/socs.v7i1.18410","title":"Searching for Real-Time Heuristic Search Algorithms","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Beam search; Null-move heuristic; Iterative deepening depth-first search; Computer science; Consistent heuristic; Heuristic; Search algorithm; Best-first search; Scheduling (production processes); Combinatorial search; Algorithm; Depth-first search; Bidirectional search; Beam stack search; Hyper-heuristic; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.016073819418587185,"score_gpt":0.27212556171222463,"score_spread":0.2560517422936374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573689326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02090316,0.0064593,0.94877195,0.00086280156,0.00025700842,0.00028769035,0.00016803795,0.0011379904,0.021152025],"genre_scores_gemma":[0.17105457,0.0034129939,0.8190746,0.00047700116,0.00015326861,0.00056406716,0.00047133127,0.00026315224,0.004528996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793756,0.0007650032,0.00012671745,0.00038283682,0.00058309874,0.00020488963],"domain_scores_gemma":[0.9950206,0.0036866423,0.00032937244,0.00039344927,0.00046929528,0.0001006591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031348031,0.0012940328,0.0012199867,0.0018365994,0.0006811195,0.0024226487,0.0019022088,0.0022424944,0.008380077],"category_scores_gemma":[0.015199037,0.0008988853,0.0012352844,0.00191974,0.0012994262,0.0027258757,0.0011580791,0.0019469468,0.002034057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003507625,0.00033214217,0.001200192,0.001009198,0.00020976971,0.00019244119,0.00025966283,0.51028234,0.0029487617,0.1638366,0.010567407,0.30881077],"study_design_scores_gemma":[0.00016288593,0.0002552424,0.0001882113,0.0002487673,0.00008200353,0.00016684236,0.00014826012,0.9081061,0.0018618949,0.07052117,0.018223168,0.000035398036],"about_ca_topic_score_codex":0.00095036457,"about_ca_topic_score_gemma":0.0012475977,"teacher_disagreement_score":0.008380077,"about_ca_system_score_codex":0.0011339718,"about_ca_system_score_gemma":0.001777216,"threshold_uncertainty_score":0.02803415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015511196088179646,"score_gpt":0.24350126534513375,"score_spread":0.22799006925695411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575840041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007972557,0.00012062483,0.98608994,0.00023355939,0.00002553943,0.00004738183,0.000026351694,0.00017284196,0.0053112777],"genre_scores_gemma":[0.18056642,0.00022506708,0.8142045,0.00022749393,0.00006290729,0.00021145616,0.00008516228,0.00011780134,0.004299284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.00022674426,0.000029684199,0.000097557495,0.00024245371,0.00006833714],"domain_scores_gemma":[0.99940085,0.0003036376,0.000032236796,0.00013983287,0.00008720062,0.00003612086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645001,0.0005109775,0.00061774533,0.0006287427,0.00077728933,0.000989435,0.0017599234,0.0008433584,0.004637862],"category_scores_gemma":[0.0018222905,0.0005098624,0.0008352745,0.00078410836,0.0014410074,0.0014830423,0.0013812844,0.0014813275,0.0005893414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006586717,0.000090884634,0.0003474935,0.00011956374,0.000059662863,0.000044854063,0.000098634395,0.696239,0.006239852,0.22634032,0.0015315167,0.06882225],"study_design_scores_gemma":[0.000020542871,0.00003141739,0.00008749128,0.0000069138564,0.00000805987,0.000019247384,0.000018098652,0.9343621,0.0012591963,0.06120437,0.0029740469,0.000008609777],"about_ca_topic_score_codex":0.0027833367,"about_ca_topic_score_gemma":0.0054593496,"teacher_disagreement_score":0.004637862,"about_ca_system_score_codex":0.0010977146,"about_ca_system_score_gemma":0.0015820361,"threshold_uncertainty_score":0.015515208},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015487406199933024,"score_gpt":0.2745171946361062,"score_spread":0.2590297884361732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576466201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056407187,0.00061718357,0.9355657,0.00035943158,0.00006689821,0.000057946723,0.000016840988,0.00039276324,0.006515955],"genre_scores_gemma":[0.8941976,0.00023076228,0.101673186,0.00013962871,0.000048091988,0.00012352229,0.000029070787,0.00007786961,0.0034802621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.00047652586,0.000052990432,0.00015963436,0.0003219476,0.00013756606],"domain_scores_gemma":[0.9953753,0.0029429602,0.00058012776,0.00042129777,0.0004887979,0.00019160574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002840795,0.0006919015,0.0009858359,0.00080667995,0.000618775,0.0016611377,0.0021277505,0.0014250239,0.0018417508],"category_scores_gemma":[0.009960738,0.0005510873,0.0004683745,0.0008946557,0.002931878,0.0034680876,0.0016222084,0.0012252271,0.0003124418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006464117,0.000040213778,0.00032888865,0.000042585107,0.000023728597,0.000034048662,0.000050323873,0.93942285,0.0007395025,0.03279993,0.00020714528,0.02624623],"study_design_scores_gemma":[0.000009385386,0.000024905836,0.000029950315,0.0000034558464,0.000002879493,0.000007941842,0.0000054554293,0.9872364,0.00027948318,0.012174046,0.00022155797,0.000004535101],"about_ca_topic_score_codex":0.0035543595,"about_ca_topic_score_gemma":0.0027048332,"teacher_disagreement_score":0.0035543595,"about_ca_system_score_codex":0.001895228,"about_ca_system_score_gemma":0.0011919054,"threshold_uncertainty_score":0.015023768},"labels":[],"label_agreement":null},{"id":"W2577228585","doi":"10.1609/socs.v7i1.18394","title":"Searching with a Corrupted Heuristic","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ciência sem Fronteiras; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Heuristics; Computer science; Exploit; Heuristic; Energy consumption; Limit (mathematics); Bounded function; Code (set theory); Class (philosophy); Error detection and correction; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Computer security","score_opus":0.015251217783203715,"score_gpt":0.25275234394018214,"score_spread":0.23750112615697844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577228585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15687822,0.0004160439,0.83281356,0.0005092688,0.0001027409,0.00009151386,0.00015180848,0.0010244899,0.008012354],"genre_scores_gemma":[0.7303656,0.00020095444,0.26502717,0.00034092506,0.000023403174,0.00013509043,0.00022395757,0.00018628473,0.0034965537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985909,0.000506197,0.00010607502,0.00026168328,0.00032130547,0.00021390502],"domain_scores_gemma":[0.993572,0.0034332832,0.00059457996,0.001720174,0.0005345949,0.00014535488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016895683,0.00075744884,0.0010798635,0.0007664546,0.000679363,0.0019606152,0.001219166,0.0018678069,0.002461871],"category_scores_gemma":[0.011395309,0.00056189176,0.00087476143,0.0007675586,0.0016176155,0.0015702342,0.0014751253,0.0013281141,0.00055692246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003999403,0.00013574166,0.0022533445,0.00021127131,0.0001290092,0.00044651024,0.00025066224,0.87989736,0.007388341,0.041709803,0.0019489666,0.065229155],"study_design_scores_gemma":[0.000043377426,0.00011202788,0.00018686053,0.00004930865,0.000047009784,0.00012418581,0.00006603218,0.97229296,0.006078644,0.018887458,0.0020947924,0.000017396973],"about_ca_topic_score_codex":0.0019005501,"about_ca_topic_score_gemma":0.0017636385,"teacher_disagreement_score":0.002461871,"about_ca_system_score_codex":0.00092364516,"about_ca_system_score_gemma":0.0017673513,"threshold_uncertainty_score":0.008935392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022153089281185496,"score_gpt":0.28496387440972265,"score_spread":0.26281078512853717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578195970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012075504,0.0005490721,0.9713093,0.0006353659,0.00031869754,0.00019534165,0.00036085755,0.0021386018,0.012417209],"genre_scores_gemma":[0.28629798,0.00040960524,0.7003579,0.0005879131,0.0003258145,0.00040032607,0.00069598464,0.000896794,0.010027676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725,0.0008004065,0.00022390517,0.000461066,0.00087699044,0.00038768782],"domain_scores_gemma":[0.9926569,0.002841168,0.00049645524,0.0020155238,0.0015321092,0.00045789627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038587842,0.0011986415,0.0011135436,0.0014568709,0.0010121535,0.0027512112,0.0034347174,0.0017532143,0.01513141],"category_scores_gemma":[0.018660776,0.00054527016,0.0012509516,0.0018210029,0.0011050422,0.004889645,0.0036560025,0.0029388682,0.004096679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083716476,0.00035422153,0.0021672784,0.0006704299,0.000072997645,0.00018309614,0.0003217841,0.12021156,0.012116268,0.28338638,0.026881551,0.5527974],"study_design_scores_gemma":[0.00014513877,0.00030200212,0.0006787959,0.000094025614,0.000049840044,0.00026154146,0.00008016073,0.75475746,0.0071461755,0.2098183,0.026599035,0.0000674494],"about_ca_topic_score_codex":0.0024525812,"about_ca_topic_score_gemma":0.0026303364,"teacher_disagreement_score":0.01513141,"about_ca_system_score_codex":0.0016907605,"about_ca_system_score_gemma":0.0026531466,"threshold_uncertainty_score":0.050619602},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020568013359232213,"score_gpt":0.28538701171315084,"score_spread":0.26481899835391864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731063979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46453527,0.001930231,0.4999835,0.002387405,0.00026856843,0.0003915478,0.00075345166,0.0034423152,0.02630775],"genre_scores_gemma":[0.7285557,0.00037227024,0.26769483,0.00036793732,0.0000692502,0.00025312562,0.0006619434,0.00046343738,0.0015615429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963193,0.0012355676,0.00017760528,0.00048188472,0.0013534318,0.00043225783],"domain_scores_gemma":[0.96990305,0.020791478,0.0018297529,0.004585501,0.0022859755,0.0006042938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005578724,0.0012064236,0.0012542438,0.0017126405,0.00086095394,0.0018610486,0.002458607,0.001604905,0.0027165017],"category_scores_gemma":[0.043896634,0.0006576286,0.0011210387,0.0017435207,0.0022304284,0.003950342,0.0027137734,0.0037703735,0.0003988888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000933121,0.00064431486,0.008932757,0.0004517579,0.00011733414,0.00016935397,0.00037876394,0.7895599,0.006200716,0.06897615,0.0061261617,0.11750961],"study_design_scores_gemma":[0.0000504525,0.00028031,0.0007624566,0.000048480615,0.000028181974,0.00005929849,0.00005762626,0.9767919,0.003256685,0.017013162,0.0016336365,0.000017807335],"about_ca_topic_score_codex":0.0035455478,"about_ca_topic_score_gemma":0.003512927,"teacher_disagreement_score":0.005578724,"about_ca_system_score_codex":0.002359049,"about_ca_system_score_gemma":0.002901647,"threshold_uncertainty_score":0.029503465},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0432312004337493,"score_gpt":0.3062496548638452,"score_spread":0.2630184544300959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734058336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015636578,0.00008654185,0.98017097,0.00023885812,0.00002895244,0.000069785405,0.00006588587,0.0013773377,0.002325061],"genre_scores_gemma":[0.61701757,0.00020802207,0.37920022,0.00021209037,0.000021372822,0.00026276888,0.00017393315,0.00029246468,0.0026115114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992613,0.00026027104,0.000050511597,0.00012313672,0.00019292845,0.00011175281],"domain_scores_gemma":[0.99717015,0.0019605474,0.00025686846,0.00026176096,0.0002314674,0.0001192156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011940502,0.0006920914,0.00047740334,0.00039010556,0.0004442387,0.0010895125,0.0012161331,0.00089209055,0.002528832],"category_scores_gemma":[0.006395522,0.0004360209,0.0007341806,0.0003934482,0.0013193161,0.0013806946,0.0011867638,0.0017220876,0.0004153552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016504596,0.00009844316,0.0008459283,0.00013464906,0.0000333378,0.0001762164,0.0002280699,0.86556506,0.0063332818,0.07145265,0.0011075987,0.05385974],"study_design_scores_gemma":[0.000020583971,0.000034385248,0.000035984813,0.000012447574,0.000010237864,0.000019036299,0.00001623561,0.9676693,0.0031473238,0.027858965,0.0011677211,0.000007874672],"about_ca_topic_score_codex":0.005760891,"about_ca_topic_score_gemma":0.007251036,"teacher_disagreement_score":0.005760891,"about_ca_system_score_codex":0.0009874748,"about_ca_system_score_gemma":0.0029531606,"threshold_uncertainty_score":0.011454701},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.036317253744548195,"score_gpt":0.33844281529169334,"score_spread":0.30212556154714515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734286001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42336512,0.0014043706,0.55625373,0.0014427206,0.00007272968,0.00024234188,0.000103214465,0.0003467989,0.016768884],"genre_scores_gemma":[0.9006002,0.00035387216,0.09704624,0.0001312071,0.000019860456,0.00014228873,0.000056402307,0.00007553756,0.0015743838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916184,0.00039521192,0.000034610577,0.00008676935,0.00017634981,0.00014509475],"domain_scores_gemma":[0.9897564,0.007915677,0.0011202655,0.000499696,0.00044061945,0.000267329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693438,0.0004418441,0.0007024616,0.0010445849,0.00056886754,0.0011657804,0.0009268012,0.0007588663,0.0025694794],"category_scores_gemma":[0.013266226,0.00040859779,0.0004906537,0.0007611898,0.0012538215,0.0021773963,0.0009877661,0.0010928613,0.00018833592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028739334,0.00022732039,0.0029578258,0.0001914235,0.00006457775,0.0001744454,0.00024203553,0.8175314,0.0050507914,0.11812999,0.0012251607,0.05391764],"study_design_scores_gemma":[0.000052113726,0.00020538874,0.0010603047,0.00004453406,0.00002710807,0.00008132347,0.00013219377,0.9171847,0.002483991,0.07707799,0.0016333743,0.000016912994],"about_ca_topic_score_codex":0.0013630255,"about_ca_topic_score_gemma":0.0021402948,"teacher_disagreement_score":0.0025694794,"about_ca_system_score_codex":0.0010261969,"about_ca_system_score_gemma":0.0011205294,"threshold_uncertainty_score":0.009886205},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Pathfinding; Traverse; Benchmark (surveying); Terminology; Constraint (computer-aided design); Key (lock); Operations research; Theoretical computer science; Shortest path problem; Mathematics; Computer security","score_opus":0.04275484513429419,"score_gpt":0.2752149483165113,"score_spread":0.2324601031822171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949992533","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08390671,0.072732314,0.749755,0.005020854,0.0011520836,0.0011892772,0.0068555274,0.0039923065,0.07539588],"genre_scores_gemma":[0.41243467,0.021474391,0.5506796,0.00075593975,0.00048693726,0.0014925771,0.0070023704,0.0009999997,0.004673539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99339396,0.0022276805,0.00060611137,0.0011075732,0.0021035834,0.0005612011],"domain_scores_gemma":[0.988049,0.007675411,0.000962854,0.0015987657,0.0012653503,0.00044856386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051000942,0.0020399448,0.0013746244,0.0036389974,0.0012331001,0.004489985,0.0046691387,0.0028534853,0.0031543437],"category_scores_gemma":[0.023044508,0.0006852839,0.0010504704,0.01084851,0.0021235936,0.0068656737,0.0028219016,0.0037725128,0.0009344367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047809756,0.00057910196,0.0031891642,0.0029647755,0.00014854566,0.00025238388,0.00034492722,0.6129848,0.0012762492,0.14357562,0.02899852,0.20520774],"study_design_scores_gemma":[0.00012773254,0.00035493955,0.0016571078,0.00068935263,0.00007907765,0.0006125347,0.0004694174,0.74152666,0.0035353166,0.18444394,0.06641805,0.000085880056],"about_ca_topic_score_codex":0.0070996853,"about_ca_topic_score_gemma":0.0052114837,"teacher_disagreement_score":0.0070996853,"about_ca_system_score_codex":0.003495203,"about_ca_system_score_gemma":0.002171683,"threshold_uncertainty_score":0.026972234},"labels":[],"label_agreement":null},{"id":"W2964537984","doi":"10.1609/socs.v10i1.18488","title":"Enriching Non-Parametric Bidirectional Search Algorithms — Extended Abstract","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Parametric statistics; Node (physics); Computer science; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Engineering; Statistics","score_opus":0.016066502135636738,"score_gpt":0.2688725451607133,"score_spread":0.25280604302507653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964537984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017676074,0.00027855812,0.97441757,0.00022411588,0.000058908332,0.00009506747,0.00014828534,0.0008111283,0.006290151],"genre_scores_gemma":[0.3170036,0.00032269518,0.67423654,0.00025380054,0.00006666375,0.000323024,0.00067189196,0.00043644334,0.006685354],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679285,0.0013064356,0.00016444366,0.00042568427,0.0009951128,0.0003155318],"domain_scores_gemma":[0.9939516,0.0031245528,0.00036556867,0.0015541892,0.0007938238,0.00021022775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032670426,0.00095209695,0.0011971799,0.0013003288,0.0006533138,0.0017183487,0.0026269248,0.0011128585,0.0069245603],"category_scores_gemma":[0.013407798,0.0005980925,0.0010604297,0.0019348633,0.0016613378,0.002985523,0.004637915,0.0022737202,0.0015149328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051285664,0.00031873788,0.00186969,0.0004532162,0.000076886114,0.00012584316,0.00024278241,0.3147699,0.009032735,0.28480244,0.0070829247,0.38071194],"study_design_scores_gemma":[0.00004889372,0.000092161536,0.00015600248,0.000052577154,0.000014848904,0.00006550882,0.000042711552,0.87442577,0.0033154117,0.114211686,0.0075576967,0.000016681177],"about_ca_topic_score_codex":0.0036069653,"about_ca_topic_score_gemma":0.00409773,"teacher_disagreement_score":0.0069245603,"about_ca_system_score_codex":0.0010355603,"about_ca_system_score_gemma":0.0021610525,"threshold_uncertainty_score":0.023164988},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02214453960801229,"score_gpt":0.2754653915602443,"score_spread":0.25332085195223203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965387939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052018175,0.0043399106,0.96095526,0.0024709464,0.00046683583,0.00006215953,0.000096434815,0.00045813486,0.025948456],"genre_scores_gemma":[0.29104087,0.0074479277,0.6792922,0.0026458523,0.00071030884,0.00031392177,0.00044758987,0.0009646482,0.017136697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935074,0.0030494907,0.0003131113,0.00094142935,0.0018181672,0.00037031708],"domain_scores_gemma":[0.987513,0.008593864,0.00033529694,0.0018279228,0.0014587786,0.00027115288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005500015,0.0013323418,0.0015840477,0.0011112954,0.0015407673,0.0033337795,0.0024734773,0.0019637463,0.00865224],"category_scores_gemma":[0.027711656,0.0007815545,0.0011424392,0.0015033573,0.004435106,0.005219081,0.0046406672,0.004468151,0.0027923007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012067656,0.000050924973,0.0008121394,0.0005554055,0.00007278758,0.0001393931,0.00044139233,0.14168929,0.0012966568,0.69789517,0.014547858,0.1423783],"study_design_scores_gemma":[0.000042045733,0.000083903346,0.00019704778,0.00036195552,0.00004151097,0.00014776729,0.00015122663,0.33785313,0.001325555,0.6050939,0.0546679,0.00003403948],"about_ca_topic_score_codex":0.006137548,"about_ca_topic_score_gemma":0.006657465,"teacher_disagreement_score":0.00865224,"about_ca_system_score_codex":0.0027403762,"about_ca_system_score_gemma":0.003850038,"threshold_uncertainty_score":0.029087245},"labels":[],"label_agreement":null},{"id":"W2965434695","doi":"10.1609/socs.v10i1.18492","title":"Unbounded Sub-Optimal Conflict-Based Search in Complex Domains","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Constraint (computer-aided design); Computer science; Mathematical optimization; Exploit; Axiom; Action (physics); Mathematics","score_opus":0.03299882872112784,"score_gpt":0.2861712336286616,"score_spread":0.25317240490753373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965434695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10250902,0.00035877572,0.88758534,0.0004724535,0.000036545003,0.0001402528,0.00021192472,0.00052818254,0.008157576],"genre_scores_gemma":[0.5815786,0.00022426521,0.4139791,0.00021315884,0.000022036664,0.00028653117,0.00035639104,0.00020371021,0.003136024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918526,0.00034123068,0.00004964008,0.00012837134,0.00017650404,0.000118876575],"domain_scores_gemma":[0.994615,0.00432916,0.00024675266,0.00029124104,0.0003218381,0.0001960416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015269796,0.0007791166,0.0009955718,0.00070243975,0.00066053023,0.0011299412,0.0013999689,0.0009806836,0.003990333],"category_scores_gemma":[0.007191786,0.0005499431,0.0005851229,0.0012382652,0.0012064547,0.0020042965,0.002117612,0.001404185,0.00032848402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119175835,0.00005839163,0.00039867606,0.00009393867,0.00002435904,0.00008797202,0.00011101367,0.9369229,0.0010010512,0.03337043,0.0012885962,0.026523408],"study_design_scores_gemma":[0.00002227157,0.000018519702,0.00005180538,0.000008147569,0.0000043613413,0.000014006374,0.000022594138,0.9826455,0.00037148804,0.016348593,0.0004879738,0.0000045764305],"about_ca_topic_score_codex":0.0064689578,"about_ca_topic_score_gemma":0.006558323,"teacher_disagreement_score":0.0064689578,"about_ca_system_score_codex":0.000997589,"about_ca_system_score_gemma":0.0014762784,"threshold_uncertainty_score":0.013348937},"labels":[],"label_agreement":null},{"id":"W2965757681","doi":"10.1609/socs.v10i1.18512","title":"Error Analysis and Correction for Weighted A*’s Suboptimality","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universidad Carlos III de Madrid","keywords":"Heuristics; Variety (cybernetics); Upper and lower bounds; Mathematics; Mathematical optimization; Computer science; Scale (ratio); Branch and bound; Algorithm; Statistics; Mathematical analysis; Physics","score_opus":0.0169845282633852,"score_gpt":0.2713468938108689,"score_spread":0.2543623655474837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965757681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07242705,0.00049252104,0.91678405,0.00087029947,0.00030114388,0.00019843061,0.00015978918,0.0017898416,0.006976806],"genre_scores_gemma":[0.45855415,0.00017836278,0.5372888,0.0002614071,0.000047115398,0.00028736275,0.00022374916,0.0005115933,0.0026474968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99163145,0.0027992285,0.0005740701,0.0013646013,0.0029455929,0.0006850534],"domain_scores_gemma":[0.9357987,0.041142363,0.0035651736,0.010622794,0.008280143,0.0005908008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006984164,0.001205159,0.001299454,0.0017118484,0.0014808718,0.0017207266,0.002450473,0.0015151752,0.0047511985],"category_scores_gemma":[0.08699933,0.0006231269,0.0010835475,0.001971524,0.0017752639,0.002772704,0.002560637,0.0032228245,0.0008454528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006657817,0.00028137694,0.007677266,0.0004812369,0.00018925185,0.00028478334,0.0006481675,0.632423,0.011228982,0.07436014,0.007907077,0.26385298],"study_design_scores_gemma":[0.000063496074,0.00016731556,0.0010864721,0.000077312565,0.00004605555,0.0001656597,0.00019262017,0.9470377,0.008894886,0.038328227,0.0038993831,0.000040877698],"about_ca_topic_score_codex":0.0070190537,"about_ca_topic_score_gemma":0.007853009,"teacher_disagreement_score":0.0070190537,"about_ca_system_score_codex":0.0018192373,"about_ca_system_score_gemma":0.0040049697,"threshold_uncertainty_score":0.036936224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"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","score_opus":0.009862664804386103,"score_gpt":0.2391165904643839,"score_spread":0.2292539256599978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966663453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023982497,0.00052830164,0.9649355,0.0002431647,0.00006426512,0.00011402183,0.00009635697,0.00148827,0.008547643],"genre_scores_gemma":[0.33525604,0.00047989702,0.6585632,0.00034538703,0.00008623186,0.00043528588,0.00048892415,0.00057602476,0.003769046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698347,0.001172642,0.00013663621,0.00034872617,0.0009804979,0.00037796458],"domain_scores_gemma":[0.99172884,0.005301049,0.0005411983,0.0012555044,0.0009803621,0.00019305835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035744233,0.0017739395,0.0014711076,0.0026141093,0.0009929494,0.001819324,0.0024925463,0.0018881316,0.005498886],"category_scores_gemma":[0.017108852,0.0008973564,0.0012435225,0.0024144333,0.0013105009,0.0035506426,0.0043511633,0.002156767,0.0015496351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032511953,0.00034661114,0.0018333937,0.00031241582,0.00010560089,0.00013283092,0.00027189506,0.5834518,0.0069857636,0.061050765,0.005458013,0.3397258],"study_design_scores_gemma":[0.000043880947,0.000059977232,0.00013791415,0.000035979523,0.000029363868,0.00003667548,0.00004092893,0.9691405,0.002375351,0.026184086,0.001901315,0.0000139670365],"about_ca_topic_score_codex":0.005036448,"about_ca_topic_score_gemma":0.005785132,"teacher_disagreement_score":0.005498886,"about_ca_system_score_codex":0.001193168,"about_ca_system_score_gemma":0.0023189401,"threshold_uncertainty_score":0.018903553},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03289317222300333,"score_gpt":0.26769560564883993,"score_spread":0.2348024334258366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037022759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20545739,0.0009009752,0.78651613,0.00065738155,0.00010974189,0.000117429285,0.000074169504,0.00029166762,0.005875161],"genre_scores_gemma":[0.91932267,0.00045753267,0.07753182,0.000086431726,0.000042175354,0.00009907868,0.00006951518,0.0000361882,0.0023546172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993166,0.00027515725,0.000028164146,0.00013982097,0.000111104375,0.00012925173],"domain_scores_gemma":[0.9983015,0.0008210538,0.0003924692,0.00015121227,0.00013741838,0.00019624911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012481016,0.00063324766,0.00057994854,0.00045711632,0.0010423166,0.0010988719,0.001217912,0.0009908114,0.0013512636],"category_scores_gemma":[0.0043046945,0.00048220856,0.00042930178,0.00049220043,0.0017873991,0.0022845306,0.0022144523,0.0007770316,0.00019885009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067975314,0.000031881336,0.001550325,0.000062090156,0.000025098037,0.00040244346,0.00027656395,0.95649636,0.0015365521,0.03018725,0.00050928426,0.008854237],"study_design_scores_gemma":[0.000028689408,0.00009170137,0.000589045,0.000012685593,0.000018425966,0.0001442588,0.00023036535,0.9729033,0.0010407118,0.021846833,0.0030808686,0.000013036792],"about_ca_topic_score_codex":0.0030717638,"about_ca_topic_score_gemma":0.0020452442,"teacher_disagreement_score":0.0030717638,"about_ca_system_score_codex":0.00065958884,"about_ca_system_score_gemma":0.0006803734,"threshold_uncertainty_score":0.006600678},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of Southern California; National Science Foundation","keywords":"Pairwise comparison; Homogeneous space; Path (computing); Context (archaeology); Computer science; Symmetry (geometry); Timeout; Symmetry breaking; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Physics; Geometry","score_opus":0.03613716419832629,"score_gpt":0.3066897939320542,"score_spread":0.2705526297337279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037524112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031151616,0.00013759972,0.99493104,0.00013902296,0.000035555386,0.000098311546,0.000035393303,0.00040340514,0.001104605],"genre_scores_gemma":[0.079767756,0.00016017651,0.91871977,0.00013174328,0.000049094262,0.00017342762,0.00014475171,0.0001706679,0.0006826026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954259,0.0011226737,0.00037616625,0.0007794643,0.0019687251,0.00032705773],"domain_scores_gemma":[0.99207133,0.0034369705,0.0010197207,0.0024871938,0.00074882706,0.00023601009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037494046,0.0014153543,0.001248308,0.0019807203,0.0013680031,0.0020652874,0.004585653,0.0017463579,0.0037369395],"category_scores_gemma":[0.013096719,0.0010017597,0.0027413953,0.0021921508,0.002325093,0.005572244,0.0052155843,0.0053888545,0.00088127196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026662482,0.00045541997,0.0023920443,0.00080761,0.00031700399,0.000625036,0.0008425503,0.24666117,0.027725153,0.2841273,0.005691773,0.43008834],"study_design_scores_gemma":[0.00009993627,0.00015031484,0.00037626098,0.000078818215,0.00008224007,0.00048329736,0.00015098808,0.78837776,0.012629587,0.18760735,0.009899468,0.00006401896],"about_ca_topic_score_codex":0.0018312513,"about_ca_topic_score_gemma":0.0021350638,"teacher_disagreement_score":0.004585653,"about_ca_system_score_codex":0.001123952,"about_ca_system_score_gemma":0.0018797821,"threshold_uncertainty_score":0.019828975},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03583909945246017,"score_gpt":0.29308537026771975,"score_spread":0.2572462708152596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037624080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01075597,0.0007440346,0.9676729,0.00078170793,0.00006538928,0.00038916979,0.0007558159,0.0015607574,0.017274272],"genre_scores_gemma":[0.16012932,0.0010364727,0.8328385,0.00028672276,0.000047343943,0.0007405913,0.001389493,0.0003291487,0.0032025184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974618,0.0009342637,0.00014768487,0.0005078402,0.00075202325,0.00019646889],"domain_scores_gemma":[0.9935057,0.004272672,0.00045039214,0.0011329436,0.000467063,0.00017111497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025913613,0.001373223,0.00079507387,0.0013692707,0.0008758732,0.002900648,0.0031412633,0.0012350578,0.008166887],"category_scores_gemma":[0.011116844,0.0007669923,0.0018205175,0.003676299,0.0013639221,0.003987367,0.0023343284,0.0035391722,0.0015130572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014842182,0.00025992238,0.0010391244,0.00070977013,0.00014693361,0.00010384721,0.00023451752,0.64728075,0.0017452609,0.15490738,0.010904335,0.18251973],"study_design_scores_gemma":[0.00004942202,0.000051612868,0.00016250137,0.000054667064,0.00003635511,0.000045086545,0.00005840768,0.9266542,0.0011446924,0.06283765,0.008890815,0.000014570356],"about_ca_topic_score_codex":0.019758359,"about_ca_topic_score_gemma":0.03148992,"teacher_disagreement_score":0.019758359,"about_ca_system_score_codex":0.0024658146,"about_ca_system_score_gemma":0.008546104,"threshold_uncertainty_score":0.039286673},"labels":[],"label_agreement":null},{"id":"W3037639738","doi":"10.1609/socs.v11i1.18537","title":"A Guide to Budgeted Tree 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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Tree (set theory); Heuristic; Mathematical optimization; Search tree; Incremental heuristic search; Exponential function; Exponential growth; Computer science; Search algorithm; Depth-first search; Mathematics; Beam search; Algorithm; Combinatorics","score_opus":0.013054752370937027,"score_gpt":0.2718941346757287,"score_spread":0.2588393823047917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037639738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054024596,0.027230604,0.8306168,0.00645619,0.0012063563,0.00034209178,0.0039796736,0.0056334557,0.1239946],"genre_scores_gemma":[0.008257482,0.022585701,0.88901496,0.0035961126,0.00069262326,0.00072519906,0.004581114,0.0028730335,0.06767373],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870586,0.00035253546,0.00013334394,0.00020527787,0.0005164087,0.00008655021],"domain_scores_gemma":[0.99741346,0.0015272077,0.00007873516,0.00023328324,0.00065634574,0.00009104097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015583631,0.0017541784,0.001084104,0.0023621314,0.00089245103,0.002961139,0.0026188428,0.0024520608,0.058063883],"category_scores_gemma":[0.008774044,0.0016232413,0.0010249809,0.0045540943,0.0013119258,0.004127973,0.0015677827,0.0050226245,0.03950607],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048741967,0.00010574623,0.00025558725,0.0007103594,0.000035814643,0.00020863509,0.00017628894,0.018584002,0.0009620663,0.22379649,0.42401835,0.3310979],"study_design_scores_gemma":[0.00003469193,0.000025899832,0.0001321837,0.00039393353,0.000008573426,0.00024307412,0.00004693522,0.019008953,0.0004181999,0.18702424,0.79262036,0.000042931122],"about_ca_topic_score_codex":0.007905586,"about_ca_topic_score_gemma":0.012970735,"teacher_disagreement_score":0.058063883,"about_ca_system_score_codex":0.0021356165,"about_ca_system_score_gemma":0.0029585427,"threshold_uncertainty_score":0.19424301},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02156412357777802,"score_gpt":0.2645110027244927,"score_spread":0.24294687914671467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140231913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025864577,0.0013550363,0.951733,0.0004086232,0.00011178041,0.0001970846,0.0002066556,0.00075897394,0.019364262],"genre_scores_gemma":[0.4044645,0.0008654026,0.58038557,0.0004197632,0.0000498381,0.0005006612,0.00063187163,0.00021009728,0.012472259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991991,0.00031800082,0.00004728369,0.00015147009,0.00019689556,0.00008729692],"domain_scores_gemma":[0.9990109,0.0004764282,0.00010113267,0.00016401886,0.00017002417,0.0000774118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111855,0.00087116886,0.0009012591,0.0010829556,0.0009310955,0.0012809786,0.0014113272,0.0014415481,0.0070862155],"category_scores_gemma":[0.003360524,0.0004250363,0.00080562243,0.001371752,0.00053983275,0.0018591435,0.0020004734,0.00090000744,0.001838821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006568299,0.00041243344,0.0024025668,0.00064153556,0.00016258736,0.00018231786,0.00033394116,0.38131055,0.009963196,0.1292827,0.013987184,0.4606642],"study_design_scores_gemma":[0.00010775149,0.0002948737,0.00029386504,0.00006803304,0.00006082951,0.00027077773,0.0001904013,0.9315917,0.0033656694,0.041168682,0.022553064,0.000034346227],"about_ca_topic_score_codex":0.0015870604,"about_ca_topic_score_gemma":0.0030905777,"teacher_disagreement_score":0.0070862155,"about_ca_system_score_codex":0.00053008925,"about_ca_system_score_gemma":0.001135834,"threshold_uncertainty_score":0.02370578},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Monash University; 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","score_opus":0.012409772200874402,"score_gpt":0.22937554500457774,"score_spread":0.21696577280370333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175350881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3601227,0.0031652285,0.5251128,0.01864293,0.0010144842,0.0003143518,0.00231429,0.025993342,0.063319914],"genre_scores_gemma":[0.78915673,0.00072474737,0.19456835,0.00083893555,0.00008920953,0.00016650217,0.0029127654,0.0010504673,0.010492327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936134,0.00018315882,0.000015819218,0.00009585973,0.00020746698,0.00013643321],"domain_scores_gemma":[0.99896383,0.0004978734,0.00003466294,0.00010717049,0.00021855858,0.00017789508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001840123,0.0006888985,0.0004903126,0.0003023585,0.0006197979,0.0008615469,0.0009885422,0.000960051,0.0047017694],"category_scores_gemma":[0.0026264251,0.0002954812,0.0005349414,0.000441771,0.0009370994,0.0011793302,0.0013470819,0.0016460881,0.0006985974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048698034,0.00016643922,0.0015977259,0.0001610101,0.00007533341,0.00033126035,0.0002277025,0.73052365,0.005838893,0.02726823,0.060109872,0.17321287],"study_design_scores_gemma":[0.00013387171,0.00014585201,0.0006780863,0.000024095401,0.000017460154,0.000051429262,0.00015010976,0.9523849,0.0028025466,0.0160679,0.027524166,0.000019594223],"about_ca_topic_score_codex":0.016818708,"about_ca_topic_score_gemma":0.021975856,"teacher_disagreement_score":0.016818708,"about_ca_system_score_codex":0.0012892055,"about_ca_system_score_gemma":0.0022181578,"threshold_uncertainty_score":0.033441603},"labels":[],"label_agreement":null},{"id":"W3196807260","doi":"10.1609/socs.v12i1.18570","title":"Avoiding Re-Expansions in Suboptimal Best-First 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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Function (biology); Mathematical optimization; Mathematics; Computer science; Mathematical economics; Mathematical analysis; Biology","score_opus":0.024842404220111764,"score_gpt":0.27005177806901226,"score_spread":0.24520937384890049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196807260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03473171,0.00074572064,0.95152414,0.00050336,0.00020583144,0.00033179758,0.00010484186,0.0017384883,0.010114263],"genre_scores_gemma":[0.44355184,0.00046835482,0.5492132,0.0005058939,0.00014227554,0.0004955182,0.00041283478,0.0010466976,0.0041633546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911617,0.0030488363,0.0007403367,0.000870399,0.0027375226,0.0014411905],"domain_scores_gemma":[0.9602577,0.028363377,0.002019614,0.0043139695,0.003906324,0.0011389005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010210409,0.0014680394,0.0029055274,0.0012576866,0.00177267,0.002441113,0.0029779873,0.0020193704,0.007955757],"category_scores_gemma":[0.06542972,0.0010471127,0.0014184031,0.0009763987,0.002536678,0.0051106806,0.00311924,0.003831588,0.0018253791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002705734,0.00053864333,0.0033435863,0.0012068198,0.00018233882,0.00075846445,0.00084696745,0.6040088,0.01620212,0.1346985,0.009677415,0.22583058],"study_design_scores_gemma":[0.00017391039,0.0005021799,0.00047284612,0.00022262853,0.00007170377,0.00036302113,0.00014035423,0.8993267,0.013736397,0.0798059,0.0051106308,0.000073786905],"about_ca_topic_score_codex":0.002520689,"about_ca_topic_score_gemma":0.0034458698,"teacher_disagreement_score":0.010210409,"about_ca_system_score_codex":0.0014706006,"about_ca_system_score_gemma":0.0041425615,"threshold_uncertainty_score":0.05399847},"labels":[],"label_agreement":null},{"id":"W3196918658","doi":"10.1609/socs.v12i1.18577","title":"Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); Online and offline; Online algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Computer network","score_opus":0.02999098797217792,"score_gpt":0.30331443087961174,"score_spread":0.2733234429074338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196918658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046420135,0.0029061309,0.86303216,0.0066627963,0.0012806068,0.000390794,0.0014709419,0.0005528105,0.077283636],"genre_scores_gemma":[0.7726227,0.0025000488,0.17611854,0.0017355343,0.002795453,0.00079493265,0.0017424697,0.00079644274,0.04089391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695766,0.0010210539,0.0001030061,0.0006303009,0.00082979427,0.00045814228],"domain_scores_gemma":[0.9752738,0.017409593,0.0017699284,0.0016803371,0.0024255756,0.001440757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028897254,0.0015829485,0.0017284859,0.0015980996,0.0015892257,0.003981016,0.0040366473,0.0027333302,0.03147687],"category_scores_gemma":[0.026226401,0.000552727,0.0014945384,0.0029117477,0.0019250722,0.0065675713,0.0026207268,0.004162337,0.002926789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006509541,0.0005340468,0.0025564546,0.00088613114,0.00017172997,0.00032733023,0.0002956115,0.32236838,0.0035865323,0.52000725,0.061250295,0.087365314],"study_design_scores_gemma":[0.000045028373,0.00012730248,0.00058371463,0.000045039542,0.000042370408,0.00013484669,0.00006569802,0.8134387,0.00067686004,0.1750044,0.0098014865,0.000034510493],"about_ca_topic_score_codex":0.0042598466,"about_ca_topic_score_gemma":0.0026001574,"teacher_disagreement_score":0.03147687,"about_ca_system_score_codex":0.0034593707,"about_ca_system_score_gemma":0.0022809457,"threshold_uncertainty_score":0.105300665},"labels":[],"label_agreement":null},{"id":"W3197111254","doi":"10.1609/socs.v12i1.18581","title":"Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Incremental heuristic search; Null-move heuristic; Iterative deepening depth-first search; Search algorithm; Algorithm; Beam search; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.017984615461359425,"score_gpt":0.2674510381562879,"score_spread":0.24946642269492847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197111254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029301153,0.0002431856,0.9618761,0.000091470014,0.00004070132,0.0000948717,0.00005577347,0.001002289,0.007294497],"genre_scores_gemma":[0.4015197,0.00019985087,0.5912511,0.00017026282,0.000029730307,0.00042476575,0.00023350611,0.0002821805,0.0058889426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00018134322,0.000028240065,0.000063480555,0.00016053804,0.00012047629],"domain_scores_gemma":[0.9990182,0.0005163478,0.00007725734,0.00016924548,0.00016842881,0.00005051824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506836,0.00074680534,0.0011744205,0.0008198996,0.0004818874,0.0009779274,0.002067365,0.001095017,0.00535127],"category_scores_gemma":[0.003802373,0.0005783513,0.0007207704,0.0009823776,0.00062980637,0.0012351214,0.002153329,0.001147813,0.0009493532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004042414,0.00024615665,0.00085258257,0.00022864835,0.00008329957,0.00010525324,0.0001971762,0.5960516,0.006203292,0.0549224,0.0023109254,0.33839443],"study_design_scores_gemma":[0.000046631398,0.000077776946,0.00006145931,0.000018322402,0.000015120111,0.000027940083,0.000025221503,0.986452,0.0020878594,0.009841318,0.0013366627,0.000009660873],"about_ca_topic_score_codex":0.004237058,"about_ca_topic_score_gemma":0.0051154103,"teacher_disagreement_score":0.00535127,"about_ca_system_score_codex":0.00070353755,"about_ca_system_score_gemma":0.0021071085,"threshold_uncertainty_score":0.017901778},"labels":[],"label_agreement":null},{"id":"W3197573625","doi":"10.1609/socs.v12i1.18594","title":"Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Grammar; Consistent heuristic; Function (biology); Incremental heuristic search; Null-move heuristic; Quality (philosophy); Pathfinding; Artificial intelligence; Beam search; Algorithm; Theoretical computer science; Search algorithm","score_opus":0.019314497431079942,"score_gpt":0.2549824422958675,"score_spread":0.23566794486478754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197573625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031814933,0.00021795815,0.95673645,0.00021621888,0.00009267772,0.00017155634,0.00013211032,0.004518621,0.006099485],"genre_scores_gemma":[0.20431288,0.00022089558,0.79210585,0.00017805085,0.00003913228,0.00017255501,0.00035842243,0.0010667088,0.001545427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858654,0.00047164905,0.00011595851,0.00025338688,0.00044127606,0.00013126645],"domain_scores_gemma":[0.99412066,0.0039811586,0.00017148316,0.0011225283,0.0005346886,0.00006948119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017826027,0.0011178454,0.00084717857,0.0009634174,0.0005317587,0.0015069433,0.0016037212,0.0010479165,0.005210977],"category_scores_gemma":[0.010245942,0.00066285406,0.0013981862,0.00072493736,0.0016219992,0.0022843385,0.0017732016,0.0019112971,0.0010003919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021927756,0.00023266234,0.0021035615,0.00048349993,0.00009488332,0.00042967158,0.00046690696,0.36447388,0.038953923,0.06720941,0.0039025361,0.52142984],"study_design_scores_gemma":[0.00008763164,0.00017083301,0.00026143144,0.00006913681,0.000086309825,0.00016119234,0.000089512185,0.90297323,0.025712518,0.05692921,0.013426689,0.000032237913],"about_ca_topic_score_codex":0.0042857896,"about_ca_topic_score_gemma":0.0065372423,"teacher_disagreement_score":0.005210977,"about_ca_system_score_codex":0.0010846262,"about_ca_system_score_gemma":0.0017038494,"threshold_uncertainty_score":0.017432392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015698394768455106,"score_gpt":0.2746142410077062,"score_spread":0.2589158462392511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198437945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12881185,0.0013747712,0.84472317,0.0010371901,0.00015895347,0.00042016874,0.00020797044,0.0026923479,0.020573635],"genre_scores_gemma":[0.505591,0.00048941455,0.48610047,0.00046869385,0.00006797464,0.0007295893,0.0005095604,0.00069846737,0.005344835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978116,0.0009746883,0.00013907619,0.0003474979,0.00044975293,0.0002774721],"domain_scores_gemma":[0.9946004,0.0036351087,0.00026661748,0.00082756544,0.00046308112,0.00020716008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048542,0.0014866684,0.0019296252,0.0011022241,0.00094270933,0.0021463896,0.0019287053,0.0020459702,0.009537645],"category_scores_gemma":[0.013835397,0.0011550451,0.0014303896,0.0013282779,0.0020196913,0.00392949,0.003914221,0.0026548493,0.001951471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036222112,0.0003305588,0.0014703529,0.00043457595,0.00009073102,0.0003427943,0.00041749168,0.78069574,0.004070191,0.06384833,0.004526663,0.1434103],"study_design_scores_gemma":[0.00008730914,0.00027182366,0.00016954012,0.0000784863,0.000036278838,0.000086702275,0.00010217281,0.93013453,0.002035512,0.063252814,0.0037167962,0.000028023103],"about_ca_topic_score_codex":0.00160171,"about_ca_topic_score_gemma":0.0026903872,"teacher_disagreement_score":0.009537645,"about_ca_system_score_codex":0.0010278946,"about_ca_system_score_gemma":0.001606775,"threshold_uncertainty_score":0.031906605},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019961159885410716,"score_gpt":0.2687441206505433,"score_spread":0.2487829607651326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312409458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15143093,0.00024252901,0.8334966,0.0002769066,0.00009675866,0.00027479045,0.00049174065,0.0027169178,0.010972871],"genre_scores_gemma":[0.5759999,0.00020396296,0.4202773,0.000103187056,0.000015956542,0.00037713887,0.000649805,0.0005368758,0.0018358242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883693,0.00038461076,0.000081886246,0.00020969337,0.00038404047,0.0001028191],"domain_scores_gemma":[0.9946439,0.0037993817,0.00022946278,0.00077002624,0.00049940404,0.00005787249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011591696,0.00077848573,0.0004955277,0.00068205973,0.00034427881,0.0016056112,0.0012581534,0.00082257757,0.004684803],"category_scores_gemma":[0.013496975,0.0003738418,0.00079392357,0.00050615973,0.0007815184,0.0012718914,0.00072302343,0.00083355117,0.0004351715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019563564,0.00017829891,0.0017280558,0.0003629484,0.00006105381,0.00023404609,0.000318665,0.7853362,0.014021663,0.047010582,0.0012786827,0.14927423],"study_design_scores_gemma":[0.00006918501,0.00013356404,0.0002561942,0.00004021633,0.00003803472,0.00006182871,0.00008942137,0.9667965,0.00935784,0.019461013,0.0036822846,0.000013939954],"about_ca_topic_score_codex":0.002798693,"about_ca_topic_score_gemma":0.0032006754,"teacher_disagreement_score":0.004684803,"about_ca_system_score_codex":0.0012363461,"about_ca_system_score_gemma":0.0016817253,"threshold_uncertainty_score":0.015672266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01488774470533181,"score_gpt":0.261163305095088,"score_spread":0.2462755603897562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312450869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019039625,0.0006845676,0.97243685,0.0002027339,0.00005142367,0.000103454346,0.000071871254,0.0031210494,0.0042883605],"genre_scores_gemma":[0.34703755,0.0004891578,0.6470257,0.00025308918,0.0000638686,0.00040175134,0.0002913372,0.0006177598,0.0038197984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986022,0.0006734944,0.00006483555,0.00021633501,0.00032639704,0.00011661931],"domain_scores_gemma":[0.9966575,0.002315791,0.00022263183,0.0004062989,0.00028569516,0.00011203839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020928434,0.0009780728,0.0014934822,0.001285622,0.00062177493,0.0008453755,0.0017232955,0.0011454991,0.0040984517],"category_scores_gemma":[0.00721494,0.0006469579,0.001005676,0.0011874513,0.001222971,0.0015603497,0.001929022,0.001824818,0.0010816205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027420922,0.0001598521,0.0005451627,0.0002479536,0.000084077394,0.00010925341,0.00018937595,0.84703547,0.0029928472,0.017515507,0.0040679104,0.12677841],"study_design_scores_gemma":[0.000048958977,0.000079223166,0.00007960927,0.000017227636,0.00002216359,0.000025152554,0.000020612057,0.99081695,0.0012794674,0.0065601785,0.0010403882,0.000010141609],"about_ca_topic_score_codex":0.005528258,"about_ca_topic_score_gemma":0.0076978835,"teacher_disagreement_score":0.005528258,"about_ca_system_score_codex":0.0010593458,"about_ca_system_score_gemma":0.0016150997,"threshold_uncertainty_score":0.013710678},"labels":[],"label_agreement":null},{"id":"W4312826258","doi":"10.1609/socs.v2i1.18189","title":"State-Set Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abstraction; Set (abstract data type); State (computer science); State space; Computer science; Domain (mathematical analysis); Theoretical computer science; Space (punctuation); Abstraction model checking; Algorithm; Mathematics; Model checking; Programming language","score_opus":0.02110703944093761,"score_gpt":0.27012043411119724,"score_spread":0.24901339467025962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312826258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02557705,0.0004960725,0.953606,0.0003885448,0.0000801608,0.00022397892,0.00039306073,0.0017990597,0.017436018],"genre_scores_gemma":[0.5135889,0.00040095477,0.47752273,0.00028868837,0.000038771857,0.000332201,0.0011959847,0.0004366608,0.0061950847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696916,0.00086013996,0.000242578,0.00074938545,0.0008857316,0.0002930495],"domain_scores_gemma":[0.99396825,0.003376629,0.0003155572,0.0015363602,0.00060479634,0.00019846411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458746,0.0007908254,0.001191785,0.0014126773,0.0012416035,0.0033435216,0.0023310005,0.0014751443,0.012708282],"category_scores_gemma":[0.012801302,0.0005236664,0.0014013369,0.0015551687,0.0024535812,0.0062358966,0.0049239704,0.0018541146,0.0018358782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003536551,0.00017364977,0.0026055402,0.00043803133,0.00015128693,0.00012270028,0.0005793671,0.15606156,0.0053816303,0.6098693,0.0060553886,0.21820787],"study_design_scores_gemma":[0.00005138257,0.00016874276,0.0005361445,0.000085910215,0.00007101771,0.00012259929,0.0001949486,0.4871783,0.008485792,0.48429674,0.018755846,0.000052627616],"about_ca_topic_score_codex":0.0026829154,"about_ca_topic_score_gemma":0.0025071858,"teacher_disagreement_score":0.012708282,"about_ca_system_score_codex":0.0019099404,"about_ca_system_score_gemma":0.002563053,"threshold_uncertainty_score":0.04251343},"labels":[],"label_agreement":null},{"id":"W4312828852","doi":"10.1609/socs.v4i1.18276","title":"Invited Speakers","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Linguistics; Theoretical computer science; Philosophy","score_opus":0.015686973692458896,"score_gpt":0.24841830991334163,"score_spread":0.23273133622088274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312828852","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016672312,0.015945632,0.004253666,0.11187763,0.7236621,0.00071838516,0.0037814996,0.001037124,0.13705683],"genre_scores_gemma":[0.011808938,0.010341801,0.0027935994,0.03513759,0.24250735,0.0010957915,0.004218151,0.0010099926,0.6910867],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744725,0.0004341957,0.00014230466,0.00046815365,0.0010507948,0.000457286],"domain_scores_gemma":[0.9864913,0.0012091602,0.00042228878,0.00033544505,0.0060200775,0.0055217026],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0038502885,0.001868253,0.0013098489,0.0020498342,0.002838138,0.0066129714,0.0020119606,0.005418752,0.3715533],"category_scores_gemma":[0.014439395,0.0005152193,0.0014748704,0.0011122169,0.00057657296,0.0031263817,0.0046276925,0.0055061714,0.20603524],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008575195,0.000023540151,0.00008399197,0.00012444286,0.00000574779,0.00009485559,0.000066079134,0.00004517414,0.00032487966,0.0011782312,0.9803704,0.017596837],"study_design_scores_gemma":[0.000020271083,0.000030117075,0.00027862017,0.00011343584,0.000008067656,0.00010999246,0.00018247768,0.00006309051,0.0001319654,0.00160439,0.9974458,0.00001174799],"about_ca_topic_score_codex":0.0011201202,"about_ca_topic_score_gemma":0.0022974515,"teacher_disagreement_score":0.6284467,"about_ca_system_score_codex":0.002069555,"about_ca_system_score_gemma":0.0032021606,"threshold_uncertainty_score":0.89640296},"labels":[],"label_agreement":null},{"id":"W4312838131","doi":"10.1609/socs.v1i1.18158","title":"Preface","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.013138482652483997,"score_gpt":0.2570469753103597,"score_spread":0.2439084926578757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312838131","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015580048,0.02192627,0.016313085,0.06718356,0.41569716,0.00066122436,0.015021709,0.0021349369,0.45950413],"genre_scores_gemma":[0.010790147,0.016303858,0.0083341235,0.020277668,0.12724474,0.0006457922,0.014292047,0.0018166788,0.800295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887794,0.00016838172,0.0000993258,0.00024014151,0.0005325735,0.0000815968],"domain_scores_gemma":[0.99006116,0.0018120176,0.00040463655,0.00063254044,0.006073741,0.0010159435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016464816,0.0012197096,0.0009047774,0.002782683,0.0019656508,0.0033745673,0.0015108495,0.0014748606,0.3471472],"category_scores_gemma":[0.016473211,0.00037608892,0.00070944894,0.0020136903,0.00071623275,0.003232913,0.0016905064,0.0041594068,0.23240139],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019744013,0.000016799264,0.00005975998,0.000093667506,0.0000019299625,0.000033979166,0.000052702497,0.000057647525,0.000118335694,0.0036499286,0.972338,0.023557337],"study_design_scores_gemma":[0.0000041826474,0.000017269926,0.00022276734,0.00014346077,0.0000018617362,0.00006880756,0.000047674203,0.000038711787,0.000074640346,0.0036492124,0.99572456,0.0000067495594],"about_ca_topic_score_codex":0.0024333887,"about_ca_topic_score_gemma":0.0022770835,"teacher_disagreement_score":0.3471472,"about_ca_system_score_codex":0.0020779457,"about_ca_system_score_gemma":0.0015283964,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4312981500","doi":"10.1609/socs.v3i1.18231","title":"Preface","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Philosophy","score_opus":0.015604662883654495,"score_gpt":0.25272188448375094,"score_spread":0.23711722160009643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312981500","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012540184,0.013401488,0.0074428017,0.06428845,0.41161823,0.00056832266,0.0127090365,0.001659485,0.4870582],"genre_scores_gemma":[0.007694827,0.008808435,0.0032260546,0.014182909,0.096932806,0.00035683397,0.009559905,0.00114878,0.85808945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992895,0.00009511254,0.00005650617,0.00013080507,0.00036481163,0.0000632952],"domain_scores_gemma":[0.9898831,0.0014232044,0.0003379638,0.0004991229,0.0066930302,0.0011635246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257743,0.0010448616,0.00082421815,0.0022880896,0.0021220108,0.003058516,0.001294254,0.001235505,0.42980415],"category_scores_gemma":[0.01318511,0.00031111581,0.0005730546,0.001598111,0.0005439698,0.0026018436,0.001451742,0.0033270356,0.26861206],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012092153,0.000010338697,0.000040486942,0.000051407264,9.978102e-7,0.000023872379,0.00003150499,0.000035913632,0.000068541354,0.0013031224,0.98368984,0.014731928],"study_design_scores_gemma":[0.0000039634992,0.000015128364,0.00021852583,0.00010958387,0.0000013312039,0.000054349905,0.000048841197,0.000033121152,0.00005463886,0.001963059,0.9974929,0.000004547556],"about_ca_topic_score_codex":0.004061661,"about_ca_topic_score_gemma":0.004039585,"teacher_disagreement_score":0.42980415,"about_ca_system_score_codex":0.0018884535,"about_ca_system_score_gemma":0.0015385154,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4313012479","doi":"10.1609/socs.v15i1.21754","title":"A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Beam search; Search algorithm; Beam stack search; Computer science; Bounded function; Best-first search; Iterative deepening depth-first search; Computation; Mathematical optimization; Scheduling (production processes); Algorithm; Theoretical computer science; Mathematics","score_opus":0.0191383338720527,"score_gpt":0.27400606642729836,"score_spread":0.25486773255524564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313012479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034679364,0.0003836441,0.9591274,0.0003741419,0.0000613268,0.000104663886,0.00011791303,0.0019792372,0.0031722698],"genre_scores_gemma":[0.1913108,0.00017199617,0.8055767,0.0002691765,0.00002799643,0.0002474318,0.00024341226,0.00043559854,0.0017168063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989526,0.0004071078,0.000056862384,0.000157121,0.00026676178,0.00015959011],"domain_scores_gemma":[0.997981,0.0011490496,0.00012550128,0.00030322967,0.0003343603,0.00010689896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019273822,0.0007676804,0.0008969294,0.0010011365,0.000656314,0.00077308464,0.0015878046,0.0011391996,0.004208314],"category_scores_gemma":[0.0067615034,0.00052221585,0.000693816,0.0013855769,0.0010972463,0.0012982659,0.0013088569,0.0013163008,0.0007217172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052914774,0.00019414976,0.0027391312,0.0002141311,0.00008576929,0.000102945625,0.00026054584,0.69251734,0.010959419,0.03994859,0.009297981,0.24315085],"study_design_scores_gemma":[0.00004155994,0.000056536555,0.00013484569,0.000013321794,0.000010567734,0.00002528915,0.000019790064,0.98583,0.0020805742,0.010207549,0.0015698895,0.000010033747],"about_ca_topic_score_codex":0.0062407386,"about_ca_topic_score_gemma":0.007903227,"teacher_disagreement_score":0.0062407386,"about_ca_system_score_codex":0.001003851,"about_ca_system_score_gemma":0.0025066338,"threshold_uncertainty_score":0.0140782595},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; 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","score_opus":0.040927950380743636,"score_gpt":0.2525866672370791,"score_spread":0.21165871685633547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313034700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007053409,0.017570544,0.94752526,0.0077617406,0.00026942327,0.00006916505,0.00008081041,0.0002861663,0.019383464],"genre_scores_gemma":[0.31402677,0.022690838,0.64625996,0.0020539947,0.0011674109,0.00041713755,0.00024197389,0.00046775144,0.012674171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980082,0.0008703232,0.00011865594,0.0003240714,0.0005252439,0.00015351674],"domain_scores_gemma":[0.9960758,0.002832398,0.00016464836,0.00037455818,0.00042490166,0.00012760186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038137531,0.00092235673,0.0017535791,0.0011427891,0.0007747167,0.0039693015,0.0028852155,0.0026556586,0.0035365717],"category_scores_gemma":[0.011275989,0.00089586363,0.0009001186,0.0016651431,0.0026978333,0.005737464,0.0028686107,0.004229852,0.0009860491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007678693,0.0001291482,0.0006613068,0.00046819658,0.00007379113,0.00006662628,0.0001388513,0.4593189,0.00026143822,0.37891153,0.0050585386,0.15483496],"study_design_scores_gemma":[0.00001250806,0.000020007466,0.00005964144,0.00010771003,0.000007862716,0.000027198297,0.000053038755,0.6242126,0.00020354979,0.36869135,0.006590949,0.000013592347],"about_ca_topic_score_codex":0.004219874,"about_ca_topic_score_gemma":0.0031409839,"teacher_disagreement_score":0.004219874,"about_ca_system_score_codex":0.00231483,"about_ca_system_score_gemma":0.0021417558,"threshold_uncertainty_score":0.020169318},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.015058930339526214,"score_gpt":0.2562940177736008,"score_spread":0.24123508743407457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313120064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032278273,0.0006648437,0.9546613,0.00044848328,0.00011313703,0.00027336073,0.0001817833,0.0018046388,0.009574174],"genre_scores_gemma":[0.5740529,0.00045618817,0.41969714,0.00047504855,0.00012396726,0.00078317855,0.0008701461,0.00030208926,0.0032392251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980063,0.0010301925,0.000101560065,0.00030553987,0.00042394167,0.00013245967],"domain_scores_gemma":[0.9910199,0.0062127304,0.00047326405,0.0013890121,0.00068243063,0.00022261207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003272354,0.001463986,0.001563718,0.0017057679,0.00061966706,0.0012898768,0.0021599177,0.0015854721,0.005147683],"category_scores_gemma":[0.023230497,0.0007945381,0.0010976389,0.0011690619,0.0016985484,0.002054289,0.0020103613,0.0020840098,0.0012246263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026223104,0.000305282,0.0027414986,0.00045340712,0.00018445244,0.00014361281,0.00019917339,0.73196596,0.0020642353,0.058855552,0.0060970695,0.19672751],"study_design_scores_gemma":[0.000049459137,0.00008362223,0.00012414463,0.000041527797,0.000018679491,0.00002634924,0.000029349043,0.9587823,0.0010255582,0.0379797,0.0018299384,0.000009323401],"about_ca_topic_score_codex":0.0012355002,"about_ca_topic_score_gemma":0.0019245398,"teacher_disagreement_score":0.005147683,"about_ca_system_score_codex":0.0012531345,"about_ca_system_score_gemma":0.001471432,"threshold_uncertainty_score":0.01730609},"labels":[],"label_agreement":null},{"id":"W4382866761","doi":"10.1609/socs.v16i1.27299","title":"Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Artificial neural network; Constraint (computer-aided design); Graph; Overhead (engineering); Vehicle routing problem; Routing (electronic design automation); Inference; Artificial intelligence; Task (project management); Constraint programming; Route planning; Mathematical optimization; Machine learning; Theoretical computer science; Engineering; Computer network; Mathematics","score_opus":0.023424752202367352,"score_gpt":0.2782809439319044,"score_spread":0.25485619172953705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010703705,0.00019859358,0.9853361,0.00020795941,0.000045147084,0.00005155546,0.00010045314,0.0007525469,0.0026039304],"genre_scores_gemma":[0.45968068,0.00023529369,0.53303444,0.00030373424,0.000075805925,0.00037577597,0.00041823884,0.0002825484,0.0055934824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999666,0.00012487163,0.000017249027,0.00007603844,0.00007910231,0.000036745816],"domain_scores_gemma":[0.9989229,0.000741448,0.000070432085,0.00007584343,0.00015134174,0.000038037095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069017964,0.0008812551,0.00072151533,0.000680881,0.00038495593,0.0008261782,0.0014385236,0.0011506754,0.004433544],"category_scores_gemma":[0.00259262,0.00045348602,0.00053689553,0.0013182485,0.00073045184,0.0012788299,0.0011227893,0.0012990215,0.0005443147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026153008,0.000020123509,0.00014688211,0.000025253972,0.000019106998,0.00002319429,0.000011506298,0.9655704,0.0004891132,0.0044254567,0.0008250584,0.02841784],"study_design_scores_gemma":[0.000002159286,0.000003652756,0.000011991635,9.919155e-7,0.0000010785516,0.0000016223344,9.4511773e-7,0.9987111,0.000090450354,0.0010590568,0.00011574658,0.0000011107189],"about_ca_topic_score_codex":0.020688836,"about_ca_topic_score_gemma":0.021069847,"teacher_disagreement_score":0.020688836,"about_ca_system_score_codex":0.00093757367,"about_ca_system_score_gemma":0.0011109319,"threshold_uncertainty_score":0.0411368},"labels":[],"label_agreement":null},{"id":"W4382866766","doi":"10.1609/socs.v16i1.27296","title":"Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Heuristic; Computer science; Front and back ends; Front (military); Task (project management); Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Systems engineering","score_opus":0.02638776788821962,"score_gpt":0.28570968329370366,"score_spread":0.25932191540548405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1324311,0.0037535604,0.83436656,0.00063159346,0.000265156,0.00042644315,0.00027287754,0.0010835277,0.026769198],"genre_scores_gemma":[0.5787412,0.0011827421,0.41469875,0.00037111397,0.000060450817,0.00035907768,0.00048610184,0.00037129558,0.0037291683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971027,0.0016157359,0.00012257215,0.00026518086,0.00054720166,0.00034659076],"domain_scores_gemma":[0.98483396,0.012302565,0.00047222344,0.0009991761,0.0010163608,0.00037579774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054691606,0.0014665778,0.001875049,0.0021676433,0.0010076128,0.001956529,0.0017330502,0.0022189165,0.0050582243],"category_scores_gemma":[0.020600451,0.000658677,0.0010945976,0.0018353803,0.0010529362,0.002722439,0.0019782656,0.0016392564,0.00088673754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072193035,0.0003282899,0.0019053521,0.0003465216,0.00013511439,0.000050926978,0.00015376678,0.83283186,0.00072860287,0.0314461,0.0016679907,0.12968357],"study_design_scores_gemma":[0.00007706627,0.00024449578,0.00030015188,0.00006430505,0.000041515294,0.00003012647,0.00012518863,0.97893745,0.0006437144,0.01815079,0.0013660133,0.00001926245],"about_ca_topic_score_codex":0.008433413,"about_ca_topic_score_gemma":0.008987548,"teacher_disagreement_score":0.008433413,"about_ca_system_score_codex":0.0018052506,"about_ca_system_score_gemma":0.0030234393,"threshold_uncertainty_score":0.028924048},"labels":[],"label_agreement":null},{"id":"W4382866785","doi":"10.1609/socs.v16i1.27309","title":"Domain-Independent Dynamic Programming (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Formalism (music); Computer science; Solver; Domain (mathematical analysis); Dynamic programming; Problem solver; Theoretical computer science; Heuristic; Programming language; Mathematical optimization; Algorithm; Artificial intelligence; Software engineering; Mathematics","score_opus":0.011695756343109182,"score_gpt":0.27560539589787847,"score_spread":0.2639096395547693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021990065,0.00037791248,0.97286904,0.0014933912,0.00019883238,0.00007580931,0.00018515707,0.00021115133,0.022389624],"genre_scores_gemma":[0.200931,0.0015417924,0.76028484,0.0013690743,0.00035255594,0.00060803024,0.0007460788,0.0003233252,0.03384333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983924,0.00055713416,0.00007526506,0.00045716003,0.00037527469,0.00014282268],"domain_scores_gemma":[0.99840397,0.0007152507,0.00011820898,0.00033269209,0.0003121811,0.00011770512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185454,0.00074762315,0.0005245651,0.00046648015,0.0006357781,0.0025880027,0.0015603304,0.0011230011,0.012698497],"category_scores_gemma":[0.004501357,0.00048616846,0.0014014436,0.0010691162,0.0016849707,0.0029690824,0.002432443,0.0038916494,0.0025394873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031472497,0.000057423207,0.0002262545,0.00015915382,0.000031930453,0.00006740918,0.00012802877,0.041377414,0.000919962,0.8930983,0.011064551,0.052838158],"study_design_scores_gemma":[0.00003980201,0.000053735865,0.00014446703,0.0001165292,0.000024013563,0.000116542535,0.00006799188,0.21866024,0.002744735,0.69690096,0.08110348,0.00002752008],"about_ca_topic_score_codex":0.0013751514,"about_ca_topic_score_gemma":0.0016684892,"teacher_disagreement_score":0.012698497,"about_ca_system_score_codex":0.0017283371,"about_ca_system_score_gemma":0.0017592115,"threshold_uncertainty_score":0.042480707},"labels":[],"label_agreement":null},{"id":"W4382866883","doi":"10.1609/socs.v16i1.27277","title":"Core Expansion in Optimization Crosswords","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Lagging; Constraint (computer-aided design); Core (optical fiber); Computer science; Focus (optics); Competition (biology); Function (biology); State (computer science); Mathematical optimization; Optimization problem; Algorithm; Mathematics; Biology; Telecommunications; Physics; Statistics; Geometry","score_opus":0.03142551140645574,"score_gpt":0.28867879628436344,"score_spread":0.2572532848779077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866883","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11352723,0.0049824854,0.83269626,0.0017559561,0.00035708075,0.0005407892,0.0008228046,0.0055053947,0.039811917],"genre_scores_gemma":[0.4144798,0.0014069536,0.5612417,0.0014802294,0.00036415915,0.00071971817,0.0029102727,0.0018244702,0.015572711],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775654,0.0010044342,0.00010193039,0.0005083961,0.0004096149,0.00021909575],"domain_scores_gemma":[0.9947076,0.0036697125,0.00022154309,0.00070591073,0.00051129144,0.00018394069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002492671,0.0019476467,0.0019172226,0.0014353489,0.0009375414,0.0018659942,0.0016444434,0.0019330638,0.011752052],"category_scores_gemma":[0.009708376,0.00071788847,0.0014336728,0.0021869037,0.0014733081,0.0039782682,0.0032088629,0.0029103567,0.0029776345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048233266,0.0007416387,0.002213837,0.001254973,0.00014068281,0.00024528685,0.00044617537,0.25499654,0.0060903667,0.058839176,0.03369797,0.64085114],"study_design_scores_gemma":[0.000110865716,0.00051789277,0.0008501094,0.00017505314,0.0000788384,0.00024543467,0.00022040393,0.85712975,0.0057211635,0.11735268,0.01755605,0.000041795312],"about_ca_topic_score_codex":0.0019326195,"about_ca_topic_score_gemma":0.0030610964,"teacher_disagreement_score":0.011752052,"about_ca_system_score_codex":0.0010027193,"about_ca_system_score_gemma":0.0012611535,"threshold_uncertainty_score":0.03931451},"labels":[],"label_agreement":null},{"id":"W4382866899","doi":"10.1609/socs.v16i1.27311","title":"Structural Bias in Heuristic Search (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data-Driven Disease Surveillance","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Queen's University","keywords":"Satisficing; Heuristic; Computer science; Sampling bias; Sampling (signal processing); Variable (mathematics); Greedy algorithm; Selection (genetic algorithm); Selection bias; Omitted-variable bias; Variation (astronomy); Machine learning; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Statistics; Sample size determination","score_opus":0.04267614711094431,"score_gpt":0.3356768622818528,"score_spread":0.2930007151709085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011526279,0.0005295059,0.98008096,0.0017859784,0.00021417387,0.0000812156,0.000059400132,0.0002092321,0.005513404],"genre_scores_gemma":[0.36371958,0.0009673952,0.6247317,0.001866491,0.0004714483,0.0004302286,0.00018571843,0.00034315753,0.007284254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943205,0.0036715653,0.00023442294,0.0007126936,0.0007838961,0.00027691352],"domain_scores_gemma":[0.94857913,0.042432133,0.0013694846,0.0040987595,0.0028820508,0.00063841895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010539161,0.0006346557,0.0011503691,0.0014060696,0.0009636979,0.0022022529,0.001947313,0.0012806162,0.007835515],"category_scores_gemma":[0.053260453,0.0005716204,0.0016044924,0.0023044376,0.0036465917,0.0035999306,0.0020964595,0.0031208582,0.0010059845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018043522,0.00015009791,0.0030401093,0.000352843,0.00017590247,0.00010497047,0.00032611287,0.20817502,0.0011197283,0.6532091,0.0070536686,0.12611191],"study_design_scores_gemma":[0.00006804311,0.00013620887,0.00040926095,0.000083005216,0.00004047566,0.00009158097,0.0000797853,0.51679397,0.0017703652,0.47324216,0.007249479,0.000035677705],"about_ca_topic_score_codex":0.0032995231,"about_ca_topic_score_gemma":0.003690298,"teacher_disagreement_score":0.010539161,"about_ca_system_score_codex":0.0022525052,"about_ca_system_score_gemma":0.002413415,"threshold_uncertainty_score":0.05573708},"labels":[],"label_agreement":null},{"id":"W4399261731","doi":"10.1609/socs.v17i1.31574","title":"Exploring Conflict Generating Decisions: Initial Results (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Political science; Psychology","score_opus":0.3167363084226703,"score_gpt":0.4212118880522874,"score_spread":0.10447557962961707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6978963,0.010346023,0.23058651,0.0042684614,0.00056290976,0.0011094922,0.0029566516,0.009271776,0.043001972],"genre_scores_gemma":[0.7821059,0.0012851255,0.20592692,0.0008580029,0.00019253245,0.00033576688,0.0045088213,0.0005480567,0.0042387955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949138,0.0022591217,0.00019852145,0.00082942017,0.0012108346,0.0005882502],"domain_scores_gemma":[0.96957976,0.024676085,0.0007019747,0.0024320022,0.0019861772,0.00062407716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004841583,0.0016359392,0.00082420406,0.0016684303,0.0007417596,0.0019675423,0.0026108762,0.0013226124,0.0072686207],"category_scores_gemma":[0.033594847,0.00042263657,0.00135495,0.0019012348,0.0012735055,0.0025187107,0.002206995,0.0030909022,0.00133907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018482214,0.0044023125,0.023149734,0.0023497879,0.00044793444,0.0004177937,0.0005556021,0.39318463,0.008035914,0.024517307,0.03707796,0.5040129],"study_design_scores_gemma":[0.00036600485,0.0008327912,0.0031448475,0.00011245818,0.00016103822,0.00016721692,0.0004066938,0.95744526,0.0066978717,0.023189256,0.0074393335,0.00003713637],"about_ca_topic_score_codex":0.0067183417,"about_ca_topic_score_gemma":0.010601054,"teacher_disagreement_score":0.0072686207,"about_ca_system_score_codex":0.0015157856,"about_ca_system_score_gemma":0.0024932611,"threshold_uncertainty_score":0.025605023},"labels":[],"label_agreement":null},{"id":"W4399261737","doi":"10.1609/socs.v17i1.31586","title":"Large-Scale Multi-Robot Coverage Path Planning via Local Search (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scale (ratio); Motion planning; Computer science; Path (computing); Robot; Artificial intelligence; Geography; Computer network; Cartography","score_opus":0.02083594025571476,"score_gpt":0.29056882867554956,"score_spread":0.2697328884198348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046986762,0.00033463206,0.9461286,0.00028071625,0.000042241387,0.00007084026,0.00019886256,0.0013290615,0.0046282834],"genre_scores_gemma":[0.63801295,0.00022774738,0.3584326,0.000115866045,0.000033988334,0.00016070998,0.0004307628,0.000194903,0.0023905332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.00004964811,0.00000643123,0.00005949643,0.000058209826,0.00003512161],"domain_scores_gemma":[0.9996437,0.00017437601,0.000041100004,0.00006359504,0.00004485313,0.00003240357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029131674,0.00050972344,0.00046526807,0.00032187474,0.00037834546,0.00055043167,0.00084497,0.00053321815,0.003244731],"category_scores_gemma":[0.0011191617,0.00020072148,0.00046803267,0.0007159823,0.0005608992,0.0007330019,0.0009920289,0.0006795504,0.00045627655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005273305,0.000042418975,0.00054206257,0.00008951453,0.000021998007,0.000115508905,0.000042005257,0.9429596,0.00380106,0.007459476,0.0028590746,0.042014457],"study_design_scores_gemma":[0.000008432019,0.000023875995,0.00012679314,0.0000027313163,0.0000044477283,0.000020234673,0.000013478749,0.9941135,0.0008848693,0.004078285,0.0007201268,0.000003249748],"about_ca_topic_score_codex":0.0058909515,"about_ca_topic_score_gemma":0.007181718,"teacher_disagreement_score":0.0058909515,"about_ca_system_score_codex":0.0005044763,"about_ca_system_score_gemma":0.00070717244,"threshold_uncertainty_score":0.011713326},"labels":[],"label_agreement":null},{"id":"W4399261742","doi":"10.1609/socs.v17i1.31553","title":"Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Denver; Canadian Institute for Advanced Research; University of Alberta; National Science Foundation","keywords":"Clique; Computer science; Mathematics; Combinatorics","score_opus":0.012409085446213029,"score_gpt":0.26638053095995334,"score_spread":0.2539714455137403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08125255,0.00036481483,0.9096615,0.00056584727,0.000072091876,0.00020606477,0.00019900383,0.00094561256,0.006732464],"genre_scores_gemma":[0.4693113,0.00016265009,0.5265988,0.00019769999,0.000043341497,0.0002607049,0.00039060562,0.0002441581,0.0027907395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.0007628677,0.000068333116,0.00028596193,0.00039503974,0.00020494197],"domain_scores_gemma":[0.99154377,0.0061646453,0.000434927,0.0010438513,0.00048204692,0.00033067373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024231465,0.0006932043,0.00097382895,0.0008701514,0.0008053876,0.0012280915,0.0027604878,0.0012503482,0.0058115097],"category_scores_gemma":[0.012305931,0.0005944499,0.0010302204,0.0015103373,0.0014848263,0.0029355518,0.0020815548,0.0019610175,0.0005225948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035933446,0.0003601419,0.0020042907,0.0002654759,0.0001035202,0.00016367789,0.00037791152,0.7456012,0.0039944733,0.09718533,0.0042610657,0.14532357],"study_design_scores_gemma":[0.00007424486,0.000064757456,0.00016058193,0.000011781945,0.000018531255,0.00004531651,0.000051045758,0.9625766,0.0012133945,0.033901885,0.001869817,0.000012063693],"about_ca_topic_score_codex":0.0056976,"about_ca_topic_score_gemma":0.006350092,"teacher_disagreement_score":0.0058115097,"about_ca_system_score_codex":0.0010192848,"about_ca_system_score_gemma":0.0020309214,"threshold_uncertainty_score":0.019441426},"labels":[],"label_agreement":null},{"id":"W4399261743","doi":"10.1609/socs.v17i1.31549","title":"Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Sequence (biology); Vehicle routing problem; Computer science; Beam search; Mathematical optimization; Mathematics; Algorithm; Search algorithm; Biology; Routing (electronic design automation); Genetics; Computer network","score_opus":0.02698770765650642,"score_gpt":0.2916023087667478,"score_spread":0.2646146011102414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11176623,0.0011348537,0.8761162,0.0009496347,0.000066570145,0.00028850837,0.00026820684,0.00074997125,0.008659809],"genre_scores_gemma":[0.46897683,0.00049358484,0.52608025,0.0003095915,0.000035407505,0.00031144122,0.0003619819,0.000209975,0.0032209663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832624,0.0010013406,0.00005782427,0.0002081879,0.00028215005,0.00012426346],"domain_scores_gemma":[0.9909512,0.007917095,0.00022586044,0.00032781396,0.00045294574,0.00012506072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029771253,0.0008579436,0.0008875685,0.00060883065,0.0006362112,0.00091240206,0.0013900648,0.0020956227,0.0036936952],"category_scores_gemma":[0.009453777,0.0005100296,0.00085426134,0.0013429424,0.0012861296,0.0012541405,0.0009997773,0.0019527104,0.0002981534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103534636,0.00011986623,0.00062325806,0.00015068438,0.00003407626,0.00026398385,0.00014622379,0.9350295,0.0012276719,0.020703092,0.0015912296,0.040006828],"study_design_scores_gemma":[0.00004644985,0.000082573024,0.000112621165,0.000015540661,0.000011475544,0.00007086493,0.000052060874,0.9819473,0.001166215,0.0146429045,0.0018436653,0.000008186495],"about_ca_topic_score_codex":0.0073585114,"about_ca_topic_score_gemma":0.0084054265,"teacher_disagreement_score":0.0073585114,"about_ca_system_score_codex":0.0012159784,"about_ca_system_score_gemma":0.0012955082,"threshold_uncertainty_score":0.015744686},"labels":[],"label_agreement":null},{"id":"W4399261744","doi":"10.1609/socs.v17i1.31552","title":"The Bench Transition System and Stochastic Exploration","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transition (genetics); Computer science; Chemistry","score_opus":0.02001600689470291,"score_gpt":0.2319384954794397,"score_spread":0.2119224885847368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100585744,0.00049806206,0.8903554,0.00052833924,0.00006055711,0.000095355696,0.00045043594,0.00083397527,0.006592199],"genre_scores_gemma":[0.8253379,0.00030843058,0.16882828,0.00017842211,0.000047505167,0.00021740896,0.00064863445,0.0001562036,0.0042772577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802774,0.00080212316,0.00013093701,0.0004176536,0.0003623336,0.00025914478],"domain_scores_gemma":[0.9903032,0.00626049,0.0010897864,0.0011445166,0.00070268486,0.00049940974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002743438,0.00061235786,0.000932791,0.0014167448,0.00084602466,0.0020696633,0.00139744,0.0013880373,0.0068590958],"category_scores_gemma":[0.016724076,0.000558096,0.0012525844,0.0014364417,0.0027012057,0.0038504605,0.00236833,0.0020494617,0.0005971082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021085158,0.00006159068,0.0036541878,0.00016832154,0.00007360679,0.00018438858,0.00025953882,0.5873339,0.002064234,0.37406352,0.0016154192,0.030310458],"study_design_scores_gemma":[0.000029382321,0.00012404796,0.00057412346,0.000029929823,0.00001917863,0.00008067908,0.00005939945,0.77269846,0.0010119439,0.22333121,0.0020094623,0.0000321173],"about_ca_topic_score_codex":0.0049496293,"about_ca_topic_score_gemma":0.0039323694,"teacher_disagreement_score":0.0068590958,"about_ca_system_score_codex":0.0017528514,"about_ca_system_score_gemma":0.0018440024,"threshold_uncertainty_score":0.02294594},"labels":[],"label_agreement":null},{"id":"W4399261791","doi":"10.1609/socs.v17i1.31550","title":"On the Properties of All-Pair Heuristics","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of 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; Mathematics; Mathematical optimization","score_opus":0.026655059834424417,"score_gpt":0.2642059223824091,"score_spread":0.23755086254798466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085401855,0.0008722718,0.89496374,0.00078736333,0.0000791515,0.00018712471,0.00026968637,0.00044095784,0.016997846],"genre_scores_gemma":[0.65644026,0.0005069189,0.33926928,0.00047182557,0.000062843545,0.00027375366,0.00034543092,0.0003644294,0.002265226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517065,0.0023121242,0.00026079372,0.0008239398,0.0009439033,0.00048862747],"domain_scores_gemma":[0.9608838,0.0304921,0.0021070484,0.004252727,0.0016571062,0.0006071576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063551217,0.00094408507,0.0014667412,0.0012826853,0.0013081478,0.0026911036,0.0016528992,0.0013880143,0.0044695893],"category_scores_gemma":[0.04607035,0.0007383111,0.0013480495,0.0017694521,0.002131086,0.004816623,0.0020632902,0.0027458223,0.000487949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046411177,0.00017458452,0.004989639,0.000348703,0.00015916201,0.00017682163,0.0004212062,0.5037284,0.002398445,0.39167425,0.003272137,0.09219246],"study_design_scores_gemma":[0.000085207605,0.000386761,0.0008509643,0.00013534549,0.00007631167,0.00022851827,0.00024229387,0.6177817,0.0026081933,0.37366632,0.0038951535,0.000043222928],"about_ca_topic_score_codex":0.0023859127,"about_ca_topic_score_gemma":0.0022829259,"teacher_disagreement_score":0.0063551217,"about_ca_system_score_codex":0.0014222263,"about_ca_system_score_gemma":0.0026253946,"threshold_uncertainty_score":0.03360951},"labels":[],"label_agreement":null},{"id":"W4399261794","doi":"10.1609/socs.v17i1.31585","title":"Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Integer programming; Mathematical optimization; Path (computing); Computer science; Motion planning; Integer (computer science); Robot; Mathematics; Artificial intelligence; Programming language","score_opus":0.02431336114452302,"score_gpt":0.2809545925918165,"score_spread":0.25664123144729345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009802152,0.00079646445,0.9826386,0.00036496288,0.000076608856,0.00016494213,0.00020445537,0.00038635,0.005565478],"genre_scores_gemma":[0.1876457,0.0009358179,0.8066345,0.0002602177,0.00010495191,0.0007614236,0.0004322054,0.00024313177,0.0029820423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987987,0.0005383874,0.000050039827,0.00018090218,0.00023689057,0.00019507189],"domain_scores_gemma":[0.9978637,0.0016699885,0.00018978499,0.00008499698,0.00011676535,0.00007473096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016247752,0.0018697156,0.0011865919,0.00095535413,0.0005041004,0.0017386657,0.0012346162,0.0011234243,0.0044685453],"category_scores_gemma":[0.0040935734,0.00085458905,0.0014492983,0.0018066097,0.0008275589,0.0014332545,0.0012211238,0.0018246823,0.00071305805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005399389,0.00007145528,0.0001672703,0.00014965257,0.00003557819,0.000054567558,0.000039748935,0.9590982,0.00089791446,0.015742945,0.0015662028,0.022122417],"study_design_scores_gemma":[0.000016705722,0.000027244036,0.00003465893,0.000012538538,0.000008326301,0.000010822687,0.000010983677,0.99161303,0.00034810096,0.006968832,0.0009441984,0.00000458601],"about_ca_topic_score_codex":0.0056526326,"about_ca_topic_score_gemma":0.0054630456,"teacher_disagreement_score":0.0056526326,"about_ca_system_score_codex":0.0017138622,"about_ca_system_score_gemma":0.0020367496,"threshold_uncertainty_score":0.014948726},"labels":[],"label_agreement":null},{"id":"W4399261803","doi":"10.1609/socs.v17i1.31546","title":"Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Educational Technology and Assessment","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Curriculum; Computer science; Space (punctuation); State space; Artificial intelligence; Machine learning; Algorithm; Mathematics education; Mathematics; Psychology; Pedagogy","score_opus":0.030860951861580783,"score_gpt":0.31345094978050564,"score_spread":0.28258999791892486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05628817,0.00034609775,0.9388527,0.00021226123,0.000031276362,0.00023598743,0.000081168284,0.0014754223,0.0024769155],"genre_scores_gemma":[0.49514896,0.0003022395,0.5005476,0.00024150561,0.000040698727,0.0010215731,0.0005320098,0.0002299138,0.0019355516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866974,0.0007292858,0.00006483016,0.0002155806,0.0002267673,0.000093787516],"domain_scores_gemma":[0.9951014,0.003385411,0.00034140988,0.00051617366,0.0005245488,0.00013109682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003405989,0.001246141,0.00088287506,0.0010960224,0.00046311738,0.0007628447,0.0018125672,0.0013782359,0.002498688],"category_scores_gemma":[0.016446032,0.00057554926,0.0006030874,0.0007031092,0.0010647805,0.0021172985,0.001489711,0.002071764,0.0006335513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016981729,0.0004520823,0.0037581574,0.0002199018,0.00003792563,0.00004210454,0.00024068946,0.69707114,0.002736194,0.020644464,0.0020227851,0.27260473],"study_design_scores_gemma":[0.000033498432,0.0001356429,0.00019413076,0.000024160503,0.0000077413915,0.000013426433,0.000017599063,0.9916082,0.0014698316,0.0054485262,0.0010409236,0.000006283535],"about_ca_topic_score_codex":0.0019579467,"about_ca_topic_score_gemma":0.0033100953,"teacher_disagreement_score":0.003405989,"about_ca_system_score_codex":0.0012843215,"about_ca_system_score_gemma":0.0016559906,"threshold_uncertainty_score":0.018012822},"labels":[],"label_agreement":null},{"id":"W4399261805","doi":"10.1609/socs.v17i1.31582","title":"On Parallel External-Memory Bidirectional Search (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Parallel computing","score_opus":0.016956833660931404,"score_gpt":0.27971612351035874,"score_spread":0.2627592898494273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023645021,0.0013974091,0.94665915,0.0005156953,0.00016125909,0.000090816786,0.00013450401,0.0010113732,0.026384827],"genre_scores_gemma":[0.53719634,0.002200874,0.43212104,0.0008068486,0.00025741698,0.00041284398,0.0005245082,0.0005496728,0.0259305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942386,0.0002062096,0.000029692214,0.00007697696,0.00016048245,0.00010281234],"domain_scores_gemma":[0.99912995,0.00041913768,0.00004887682,0.00018975128,0.00017843206,0.000033956934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161191,0.0005071812,0.0005109259,0.0006404958,0.0005143569,0.0008296786,0.0011244082,0.00049189484,0.00793499],"category_scores_gemma":[0.0036128587,0.00020161743,0.00033959612,0.0015103316,0.00085248344,0.0019995759,0.0021463556,0.0008095329,0.0012929197],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064954365,0.00019201956,0.0009019999,0.00042796414,0.00006353432,0.00017984821,0.00017971294,0.22409755,0.0081655225,0.36703393,0.015505812,0.38260254],"study_design_scores_gemma":[0.00011623488,0.00011857625,0.00024723832,0.00008129297,0.00004116522,0.00015628901,0.00006219493,0.64048415,0.008715269,0.3257345,0.024217868,0.000025203713],"about_ca_topic_score_codex":0.0017277481,"about_ca_topic_score_gemma":0.0018956909,"teacher_disagreement_score":0.00793499,"about_ca_system_score_codex":0.00035123766,"about_ca_system_score_gemma":0.0007688877,"threshold_uncertainty_score":0.026545167},"labels":[],"label_agreement":null},{"id":"W4399261823","doi":"10.1609/socs.v17i1.31557","title":"Bi-Criteria Diverse Plan Selection via Beam Search Approximation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Selection (genetic algorithm); Plan (archaeology); Computer science; Information retrieval; Mathematical optimization; Mathematics; Artificial intelligence; Biology","score_opus":0.015889032787115925,"score_gpt":0.27193041564640924,"score_spread":0.25604138285929334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01151964,0.0004136451,0.9834064,0.0002581026,0.000023392364,0.00011138501,0.00011534534,0.00046970526,0.0036823386],"genre_scores_gemma":[0.3202175,0.00046517735,0.67474973,0.00037101354,0.000040690647,0.00060045446,0.0004274704,0.0002380753,0.0028900136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980136,0.00081610953,0.00007117518,0.0002397203,0.00059518503,0.0002641119],"domain_scores_gemma":[0.9969381,0.0021926458,0.00019320066,0.00024869016,0.00028949516,0.00013779553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003100307,0.0015443513,0.0016721451,0.0013088363,0.00061445497,0.0014963556,0.0018446239,0.0016212257,0.004618786],"category_scores_gemma":[0.0074376003,0.00080382044,0.0013187025,0.001953995,0.0012131904,0.0014606828,0.001805194,0.0019359234,0.0008116242],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119882396,0.00007792509,0.00060997653,0.00009601582,0.000051944065,0.000072132534,0.000064772255,0.9344933,0.0008638784,0.022389662,0.0028654358,0.038295105],"study_design_scores_gemma":[0.00002610842,0.00003631854,0.000056415058,0.000015550493,0.0000089565665,0.000022771757,0.000015519796,0.99066883,0.00024561406,0.008290642,0.0006089536,0.0000044521435],"about_ca_topic_score_codex":0.004487032,"about_ca_topic_score_gemma":0.0047422303,"teacher_disagreement_score":0.004618786,"about_ca_system_score_codex":0.0016104785,"about_ca_system_score_gemma":0.0020884662,"threshold_uncertainty_score":0.016396165},"labels":[],"label_agreement":null},{"id":"W4412508466","doi":"10.1609/socs.v18i1.36008","title":"Suboptimal Search with Dynamic Distribution of Suboptimality (Extended Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alliance de recherche numérique du Canada; Canadian Institute for Advanced Research","keywords":"Distribution (mathematics); Computer science; Environmental science; Mathematics; Mathematical analysis","score_opus":0.010847928656989114,"score_gpt":0.2811817900214269,"score_spread":0.27033386136443777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412508466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01608992,0.0003055318,0.9728325,0.00024790736,0.0000895904,0.000068232155,0.00014172618,0.00055456726,0.009669989],"genre_scores_gemma":[0.4058335,0.00048802354,0.5812702,0.0002938136,0.00007985249,0.00033564022,0.00044743728,0.00035765654,0.010893858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.00023264541,0.000055298195,0.00017814763,0.00018825346,0.00008319351],"domain_scores_gemma":[0.9984946,0.00072308624,0.000121955076,0.00033318525,0.0002476894,0.000079373574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094216876,0.0006752065,0.0006038256,0.0005461039,0.000534528,0.0012984371,0.000832091,0.0006907063,0.007596064],"category_scores_gemma":[0.0044379393,0.00034957568,0.00067247136,0.0009763225,0.0010351415,0.0013355407,0.002130919,0.0012148897,0.0012539655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002744396,0.000097182994,0.0011607042,0.0001786373,0.00008337384,0.00024798495,0.00018353942,0.5864987,0.007707842,0.20225154,0.009692476,0.19162355],"study_design_scores_gemma":[0.000037282553,0.00006321156,0.00016066368,0.000025593274,0.000018049619,0.00009633723,0.00002411623,0.89580303,0.003297644,0.09337539,0.007082662,0.000016039217],"about_ca_topic_score_codex":0.0030932245,"about_ca_topic_score_gemma":0.003459905,"teacher_disagreement_score":0.007596064,"about_ca_system_score_codex":0.0007390639,"about_ca_system_score_gemma":0.0016549976,"threshold_uncertainty_score":0.025411427},"labels":[],"label_agreement":null},{"id":"W4412508506","doi":"10.1609/socs.v18i1.35995","title":"Augmenting Exploration with Locally Greedy Probes","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Computer science; Environmental science; Algorithm","score_opus":0.015624956764000884,"score_gpt":0.2568409622711752,"score_spread":0.2412160055071743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412508506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110996835,0.0010653212,0.87486273,0.000620492,0.00009900397,0.00020915491,0.00012397738,0.005405776,0.0066167107],"genre_scores_gemma":[0.73091453,0.00023764792,0.26561648,0.0003432583,0.000044640077,0.00033510997,0.00019912396,0.00041705446,0.001892207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980323,0.0009670505,0.00008876545,0.0002702232,0.0003929243,0.0002487296],"domain_scores_gemma":[0.99208075,0.0055245096,0.00055062346,0.0011687583,0.000405432,0.0002698998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022333963,0.0013347924,0.0010712807,0.0010159793,0.0006721696,0.0010134522,0.0020200575,0.0014441155,0.0027546945],"category_scores_gemma":[0.013656682,0.0006499617,0.0007998976,0.0010949543,0.0014149871,0.003082653,0.0028841044,0.0016972803,0.0008164031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000700646,0.0003420081,0.0057770093,0.00027376245,0.00011371419,0.00021964936,0.0005199336,0.7516954,0.009772595,0.016330106,0.00369659,0.21055856],"study_design_scores_gemma":[0.00007729976,0.00030662405,0.00042934425,0.00002936874,0.000036166464,0.000106117324,0.00007266386,0.97779375,0.0034634252,0.014537591,0.0031189234,0.000028717894],"about_ca_topic_score_codex":0.002792257,"about_ca_topic_score_gemma":0.00461774,"teacher_disagreement_score":0.002792257,"about_ca_system_score_codex":0.00085625146,"about_ca_system_score_gemma":0.0019468988,"threshold_uncertainty_score":0.011811495},"labels":[],"label_agreement":null},{"id":"W4412508555","doi":"10.1609/socs.v18i1.35996","title":"Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Psychology; Sociology","score_opus":0.03636055977328928,"score_gpt":0.3097754427812473,"score_spread":0.273414883007958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412508555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08713965,0.02119346,0.8635433,0.0034922073,0.00078140944,0.00036255072,0.00040852613,0.0031956797,0.019883253],"genre_scores_gemma":[0.49092892,0.00541151,0.49818167,0.00071511196,0.00029334566,0.00026168098,0.00074455887,0.0007416851,0.0027215853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673116,0.0013357968,0.000120585355,0.00048744917,0.0010961437,0.00022892925],"domain_scores_gemma":[0.98665035,0.009490016,0.00039519713,0.0015746556,0.0015003482,0.00038937232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005087178,0.00095257786,0.0017220309,0.001140489,0.00088836346,0.002103368,0.003562089,0.0020065,0.0029287084],"category_scores_gemma":[0.029619345,0.0004572684,0.00095687853,0.0012220767,0.0013873818,0.0037720846,0.0018824922,0.002551995,0.0007246089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034630732,0.0004964211,0.005388392,0.0009959551,0.00020008345,0.00016553723,0.00031167988,0.46713263,0.0016557552,0.067342706,0.012283354,0.44368124],"study_design_scores_gemma":[0.00005635554,0.00019098901,0.00048237736,0.00015680675,0.000041220213,0.0001177965,0.00013689103,0.97042894,0.0010900751,0.019416995,0.007859536,0.000022063023],"about_ca_topic_score_codex":0.01117084,"about_ca_topic_score_gemma":0.010953588,"teacher_disagreement_score":0.01117084,"about_ca_system_score_codex":0.0016536099,"about_ca_system_score_gemma":0.0031808866,"threshold_uncertainty_score":0.026903927},"labels":[],"label_agreement":null},{"id":"W4412508560","doi":"10.1609/socs.v18i1.36000","title":"Position Paper: On the Impact of Direction-Selection in BAE*","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Israel National Road Safety Authority; Canadian Institute for Advanced Research","keywords":"Position (finance); Selection (genetic algorithm); Computer science; Artificial intelligence; Business","score_opus":0.05215064538142036,"score_gpt":0.4000950922151399,"score_spread":0.3479444468337195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412508560","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20558651,0.0059035188,0.7049186,0.005000485,0.0007256004,0.00029719385,0.00028450062,0.0006021638,0.076681346],"genre_scores_gemma":[0.7765851,0.0023036327,0.2085263,0.0011318199,0.00021835246,0.00017381088,0.0003136288,0.00035844257,0.010388793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710685,0.0015848465,0.00009911981,0.00027251698,0.0006789448,0.00025772958],"domain_scores_gemma":[0.9693299,0.025637042,0.0008996099,0.001385216,0.0021268711,0.00062135415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004317977,0.00062416174,0.0007799006,0.00063149346,0.00047253992,0.0017519398,0.0013194877,0.0009907547,0.0076120696],"category_scores_gemma":[0.032402705,0.00032022866,0.00054427574,0.0009628004,0.00081743643,0.0033229298,0.0014893301,0.0017786404,0.0010871838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001005774,0.0005855656,0.0050338656,0.00044723664,0.00011334452,0.0001435665,0.0001919492,0.40387502,0.0054282933,0.1941843,0.0115894945,0.37740162],"study_design_scores_gemma":[0.00008469595,0.00050996593,0.00082958874,0.0001455902,0.000046758472,0.000115205716,0.00012945838,0.9255664,0.0039270855,0.060505502,0.008110448,0.000029320901],"about_ca_topic_score_codex":0.0039003822,"about_ca_topic_score_gemma":0.004684792,"teacher_disagreement_score":0.0076120696,"about_ca_system_score_codex":0.00092426053,"about_ca_system_score_gemma":0.0018041305,"threshold_uncertainty_score":0.025464952},"labels":[],"label_agreement":null},{"id":"W4412901852","doi":"10.1609/socs.v18i1.36017","title":"Frontmatter","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Royal Holloway, University of London; Universitat Politècnica de València; University of California, Irvine; Università degli Studi di Udine; RWTH Aachen University; Syddansk Universitet; Universidad Carlos III de Madrid; Ben-Gurion University of the Negev; Shanghai Jiao Tong University; Universität Konstanz; Technische Universität Wien; Università degli Studi di Trento; Linköpings Universitet; Università degli Studi di Brescia; Bar-Ilan University; Fondazione Bruno Kessler; Universität Stuttgart; Universität des Saarlandes; Technische Universiteit Delft; Monash University; University of Auckland; Amazon Robotics; University of Toronto; University of Glasgow; University of South Carolina; Institute of Software, Chinese Academy of Sciences; Helsingin Yliopisto; University of Alberta; Simon Fraser University; Universität Basel; Chinese Academy of Sciences; University of California, Los Angeles; Masarykova Univerzita; České Vysoké Učení Technické v Praze; University of Oxford; RMIT University; Mississippi State University; Carnegie Mellon University; Univerzita Karlova v Praze; University of Southern California","keywords":"Computer science","score_opus":0.012928365130839085,"score_gpt":0.2653881100871542,"score_spread":0.2524597449563151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412901852","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078002416,0.0024022541,0.026287578,0.010398939,0.02172307,0.00047333736,0.018775089,0.029796876,0.88936293],"genre_scores_gemma":[0.0025217284,0.0012409895,0.0048251497,0.0025611052,0.0031121005,0.00018869607,0.01249253,0.008339695,0.9647181],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986878,0.0001428874,0.000068373025,0.0002024412,0.0007040725,0.0001944064],"domain_scores_gemma":[0.9954079,0.0006999371,0.00020166975,0.0007602885,0.0017820145,0.0011480309],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001528387,0.0013833448,0.0013172069,0.0031796165,0.0018788439,0.009144931,0.0029122143,0.0028827898,0.8597202],"category_scores_gemma":[0.010046187,0.0008265344,0.0010015406,0.0030917148,0.00052671926,0.0074866903,0.004471062,0.0027402681,0.76248056],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025071595,0.000014577317,0.000038626655,0.00006329309,0.0000014218729,0.000025814392,0.000020440077,0.000052840853,0.0001407835,0.0025278213,0.94909054,0.047998782],"study_design_scores_gemma":[0.0000070167653,0.000010511697,0.000052919655,0.00003204323,0.0000010444838,0.00003967977,0.000012811102,0.00013134754,0.00012428669,0.0013169731,0.99826616,0.000005134055],"about_ca_topic_score_codex":0.0013493514,"about_ca_topic_score_gemma":0.0030811233,"teacher_disagreement_score":0.14027983,"about_ca_system_score_codex":0.0015272632,"about_ca_system_score_gemma":0.001631496,"threshold_uncertainty_score":0.20009214},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01008616326361533,"score_gpt":0.21989138575806066,"score_spread":0.20980522249444533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52101158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20850097,0.001844168,0.5445978,0.008518543,0.00083579635,0.0025789551,0.017328627,0.0043212282,0.21147391],"genre_scores_gemma":[0.7038541,0.0010406132,0.20628496,0.0009994007,0.00013850754,0.00066571176,0.010042117,0.0006789718,0.0762957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982546,0.0002906656,0.00004816703,0.0004237195,0.00032656858,0.0006562499],"domain_scores_gemma":[0.9984755,0.00051861483,0.000102852304,0.00014518712,0.00032965577,0.0004282073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012048779,0.0017848307,0.0017031676,0.0010195859,0.0035362744,0.0025183798,0.0044093262,0.0032638886,0.030393226],"category_scores_gemma":[0.0039468464,0.0006591414,0.0012629571,0.0029606025,0.001739679,0.0031192373,0.0019557367,0.0021758056,0.0019770062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000887533,0.00046310044,0.0026151382,0.00075105316,0.00021597093,0.0009157395,0.00060339976,0.5437116,0.0019719081,0.2008304,0.12677684,0.120257296],"study_design_scores_gemma":[0.00027454674,0.00017067425,0.0018424087,0.000067476685,0.00012501917,0.0005164421,0.00088797655,0.82466686,0.001992116,0.08753926,0.08176744,0.00014982397],"about_ca_topic_score_codex":0.53425974,"about_ca_topic_score_gemma":0.5538508,"teacher_disagreement_score":0.46574026,"about_ca_system_score_codex":0.009818973,"about_ca_system_score_gemma":0.020492125,"threshold_uncertainty_score":0.9369662},"labels":[],"label_agreement":null},{"id":"W941090075","doi":"10.1609/socs.v6i1.18356","title":"The Spurious Path Problem in Abstraction","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious relationship; Abstraction; Computer science; Path (computing); Heuristic; State (computer science); Semaphore; Algorithm; Artificial intelligence; Programming language; Machine learning","score_opus":0.010806567439150198,"score_gpt":0.24468284029385778,"score_spread":0.23387627285470758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W941090075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018913448,0.00040752316,0.9739083,0.0006891894,0.00006141764,0.000065068656,0.00010131138,0.00068570947,0.0051679793],"genre_scores_gemma":[0.44332993,0.00073709886,0.54865295,0.0006258941,0.00006139571,0.00038487086,0.0003559341,0.0005041203,0.005347719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931124,0.0027467886,0.0005001582,0.00097647565,0.00210784,0.0005563398],"domain_scores_gemma":[0.985499,0.008436821,0.00093835796,0.003952662,0.0009208958,0.00025222442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051173307,0.00093685876,0.0011084012,0.0012188137,0.002460405,0.0023784891,0.0020741483,0.0019199929,0.0035398097],"category_scores_gemma":[0.024955424,0.0011341517,0.0018652199,0.001997603,0.0066460753,0.008555519,0.0076047895,0.004025559,0.0005183892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017932172,0.000040965395,0.002623923,0.0003574768,0.0000811679,0.0006488612,0.0013867927,0.07127513,0.0027987866,0.84416246,0.0030054415,0.07343959],"study_design_scores_gemma":[0.000023218508,0.000059108974,0.0003285359,0.00010362854,0.00007299625,0.00039232126,0.00021353504,0.11034461,0.0048300107,0.87005895,0.013537692,0.00003534975],"about_ca_topic_score_codex":0.0026543038,"about_ca_topic_score_gemma":0.0029483319,"teacher_disagreement_score":0.0051173307,"about_ca_system_score_codex":0.0015063665,"about_ca_system_score_gemma":0.0030516768,"threshold_uncertainty_score":0.02706331},"labels":[],"label_agreement":null}]}