{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84152853,0.000021919477,0.0009192148,0.025622861,0.008046721,0.00031640785,0.0000070223896,0.00013036022,0.12340693],"genre_scores_gemma":[0.99682593,0.00002748216,0.0011467934,0.00033546472,0.00043523233,0.000013576502,0.0000010472811,0.000017237133,0.0011972426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996901,0.000040577717,0.000423444,0.0005057335,0.0017697446,0.0003595009],"domain_scores_gemma":[0.9969449,0.0003999268,0.00013088867,0.00029441318,0.0021238232,0.0001060533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270526,0.00016466796,0.00019245577,0.000087908105,0.00021997413,0.00050684385,0.0030897164,0.000098293785,0.00013975325],"category_scores_gemma":[0.0005667626,0.00013812333,0.00017285314,0.0008005489,0.00021255715,0.0005665918,0.0015873528,0.00046644956,0.0001819017],"study_design_candidate":"bench_or_experimental","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.000039346356,0.00025755243,0.009333632,0.00001944687,0.00005079918,0.000004651475,0.0005774435,0.00012702077,0.08704254,0.8996911,0.0009856797,0.0018707591],"study_design_scores_gemma":[0.00026097562,0.000054968274,0.00038341008,0.000108625856,0.0000051928955,0.000027440465,0.00018634825,0.0061350544,0.9425625,0.044190485,0.005914536,0.00017045553],"about_ca_topic_score_codex":0.00010131862,"about_ca_topic_score_gemma":0.0000014953032,"teacher_disagreement_score":0.85551995,"about_ca_system_score_codex":0.00021143477,"about_ca_system_score_gemma":0.00022107856,"threshold_uncertainty_score":0.57415134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7745442,0.00008944251,0.008072184,0.041923787,0.013011085,0.00090279523,0.000058028258,0.00028534108,0.16111316],"genre_scores_gemma":[0.99502146,0.000014386266,0.003478747,0.00017412026,0.00027944968,0.000021391616,0.0000042780703,0.000013913386,0.000992241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979191,0.000017876508,0.00023525738,0.00036742812,0.0012592914,0.00020104136],"domain_scores_gemma":[0.9981078,0.00008390555,0.00013467153,0.00024767502,0.0013630029,0.0000629795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040354815,0.00012656275,0.00015749615,0.000047740883,0.00013497374,0.00012081119,0.0011322156,0.000044467743,0.000023847122],"category_scores_gemma":[0.00013360172,0.000085626096,0.00006725996,0.0004375111,0.00007945419,0.0004823646,0.00068003905,0.00020986519,0.00001476063],"study_design_candidate":"bench_or_experimental","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.000087065724,0.00013084312,0.0011688973,0.000023564928,0.000047705707,0.000003957751,0.00019796769,0.000049019563,0.049160935,0.947818,0.0010482254,0.000263862],"study_design_scores_gemma":[0.0017961559,0.0003739766,0.00092152634,0.0003792185,0.000011443585,0.00006045358,0.00019559356,0.0026193052,0.9312877,0.01343463,0.04863965,0.00028032938],"about_ca_topic_score_codex":0.00005180952,"about_ca_topic_score_gemma":0.0000048104857,"teacher_disagreement_score":0.93438333,"about_ca_system_score_codex":0.000120130266,"about_ca_system_score_gemma":0.00013871987,"threshold_uncertainty_score":0.3491731},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8863523,0.000018948711,0.000024244708,0.03248623,0.010059747,0.000214755,0.000009505035,0.00007869867,0.07075558],"genre_scores_gemma":[0.9964644,0.000031285952,0.000022959424,0.00062818074,0.0019564547,0.0000050315307,0.000026461874,0.000021491964,0.00084378925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985004,0.0000022998875,0.00023233204,0.00025477068,0.0008457572,0.00016441812],"domain_scores_gemma":[0.9970664,0.000032794538,0.00016056154,0.00011790271,0.0026121046,0.000010242362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000256407,0.00011736063,0.00011868148,0.000078023484,0.00016111726,0.00039909245,0.00095888495,0.000071547074,0.00060562836],"category_scores_gemma":[0.0003988033,0.00009270712,0.00006256349,0.00079446356,0.00006460007,0.00075967156,0.0007122064,0.00017627672,0.00019316433],"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.00006433298,0.00032683305,0.03483831,0.00009289293,0.00004796101,0.0000010810933,0.000037593545,0.000038808845,0.09793432,0.8310922,0.034978867,0.0005468084],"study_design_scores_gemma":[0.0011982721,0.00002765249,0.012647592,0.00033072068,0.000061077815,0.000014311951,0.00024152093,0.0016282955,0.64517695,0.045443084,0.29277372,0.00045679972],"about_ca_topic_score_codex":0.0002184018,"about_ca_topic_score_gemma":0.0000042072884,"teacher_disagreement_score":0.7856491,"about_ca_system_score_codex":0.00006759314,"about_ca_system_score_gemma":0.00003963129,"threshold_uncertainty_score":0.66312057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89724207,0.000049905164,0.0055638975,0.042479068,0.0056550987,0.000808098,0.000059587117,0.0002757254,0.04786656],"genre_scores_gemma":[0.9974534,0.0000034898635,0.0015674761,0.00013826907,0.00029499902,0.00003705696,0.0000111047275,0.000010192418,0.00048401716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797237,0.000023968767,0.00024355177,0.00035163533,0.0011701356,0.00023831532],"domain_scores_gemma":[0.9981703,0.0002301398,0.00015340612,0.00014165317,0.0012412403,0.00006323173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005589072,0.00012823257,0.00013109096,0.000056561395,0.000272415,0.00026654647,0.0010946714,0.000064028376,0.000016488057],"category_scores_gemma":[0.00018348506,0.00009743241,0.000071869064,0.0003163657,0.00010243683,0.00043516542,0.00041765103,0.0003100704,0.0000067644182],"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.000116054325,0.00021113742,0.041584138,0.000059192986,0.00008002871,0.0000028169334,0.00066906255,0.0008870425,0.019900698,0.9351592,0.0010419452,0.0002886527],"study_design_scores_gemma":[0.0038261744,0.0010019252,0.009831894,0.0012859737,0.000037925267,0.0002098508,0.0003862861,0.0749075,0.7209611,0.17746589,0.009405069,0.0006804414],"about_ca_topic_score_codex":0.0000576529,"about_ca_topic_score_gemma":0.0000024847886,"teacher_disagreement_score":0.75769335,"about_ca_system_score_codex":0.00019374784,"about_ca_system_score_gemma":0.0002221527,"threshold_uncertainty_score":0.39731783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115099,0.000019474064,0.011489029,0.017737964,0.012671619,0.0003785096,0.000017788027,0.000078705576,0.04609702],"genre_scores_gemma":[0.99580884,0.000023117775,0.0035361475,0.00008291316,0.00020909528,0.000005986679,0.0000034141253,0.0000064761084,0.0003240143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998496,0.000018407738,0.00029540496,0.00025223906,0.0008198421,0.00011813351],"domain_scores_gemma":[0.9983021,0.000058607046,0.0001715441,0.00014382784,0.0012815808,0.000042330594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003510545,0.00008829149,0.00012171486,0.00007255966,0.00008422392,0.00012239722,0.00083366944,0.00005876278,0.000064922424],"category_scores_gemma":[0.00017688068,0.00007602504,0.00009162538,0.00038006494,0.000050578223,0.0003401509,0.00035142244,0.00013710091,0.0000057357647],"study_design_candidate":"bench_or_experimental","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.000024732979,0.00016301028,0.001671439,0.000012891208,0.00004126626,5.9280137e-7,0.00024103987,0.0015780544,0.30741543,0.68705434,0.0006086163,0.0011886016],"study_design_scores_gemma":[0.00090356305,0.000104421735,0.0038715634,0.00006530294,0.00000823858,0.00001809606,0.000044509437,0.060372155,0.9302526,0.003402885,0.00083113415,0.00012553361],"about_ca_topic_score_codex":0.00002039012,"about_ca_topic_score_gemma":0.0000011456468,"teacher_disagreement_score":0.68365145,"about_ca_system_score_codex":0.000092078444,"about_ca_system_score_gemma":0.00012238073,"threshold_uncertainty_score":0.31002113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27642778,0.00007823834,0.49888092,0.05354185,0.048034202,0.0026768937,0.0003411436,0.0004263898,0.11959257],"genre_scores_gemma":[0.98241353,0.000009352351,0.016273199,0.000218621,0.00044079497,0.00008151666,0.000009069346,0.000016935941,0.00053697487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985666,0.000010587418,0.0002626914,0.0003714456,0.00059115613,0.00019750274],"domain_scores_gemma":[0.99850905,0.00024516828,0.00013071108,0.0001846112,0.0008721826,0.000058253776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038729468,0.0001365521,0.00016753543,0.00007852279,0.00020187377,0.00016944669,0.0006603318,0.000041183644,0.000013124627],"category_scores_gemma":[0.00015666007,0.000109394045,0.00008744186,0.00027214305,0.000049338,0.0006327387,0.0003834592,0.0002033608,0.000003124027],"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.0000905478,0.00013199825,0.00013632326,0.000055339962,0.000035435,5.735612e-7,0.00016044248,0.0017354961,0.053562295,0.9434052,0.0005335291,0.00015280154],"study_design_scores_gemma":[0.0022955772,0.00040159828,0.00014231955,0.0006583207,0.000020181185,0.000016726943,0.00054260873,0.46447316,0.39443508,0.03607291,0.10055769,0.00038381296],"about_ca_topic_score_codex":0.00006978324,"about_ca_topic_score_gemma":0.0000023243472,"teacher_disagreement_score":0.9073323,"about_ca_system_score_codex":0.00009677981,"about_ca_system_score_gemma":0.00016216205,"threshold_uncertainty_score":0.44609597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760986,0.000015583752,0.0016398121,0.0055125845,0.0064236303,0.00020682561,0.000008563247,0.00006959855,0.010024805],"genre_scores_gemma":[0.9978262,0.000021441572,0.0013343212,0.00004388285,0.00027082214,0.000011541844,0.000004232332,0.000009111307,0.00047844986],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829084,0.000019118972,0.00032096257,0.0002984288,0.0009094714,0.00016117089],"domain_scores_gemma":[0.99828684,0.000072561765,0.00022373229,0.0001838991,0.0011865345,0.000046438523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005514899,0.00011364639,0.00014654182,0.00007573946,0.00011683143,0.00009545481,0.0012727729,0.000065741784,0.000014321764],"category_scores_gemma":[0.0001521203,0.00008972337,0.000100794,0.00040771862,0.000053181622,0.0003573761,0.00047703803,0.000283169,0.000004669344],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000121442514,0.00055407017,0.023032626,0.00013891584,0.000104096354,5.070962e-7,0.0007153506,0.00044021406,0.76441836,0.20089677,0.000429811,0.009147805],"study_design_scores_gemma":[0.0007895667,0.000313,0.010471487,0.000114452196,0.000007925905,0.000013896317,0.00002038673,0.25669205,0.7269034,0.0036824774,0.00089233933,0.00009904558],"about_ca_topic_score_codex":0.00006099292,"about_ca_topic_score_gemma":3.127936e-7,"teacher_disagreement_score":0.25625184,"about_ca_system_score_codex":0.000104602084,"about_ca_system_score_gemma":0.00008666031,"threshold_uncertainty_score":0.3658813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9389713,0.000061946645,0.036642,0.0065990193,0.004242627,0.0026050396,0.000104325605,0.00017705979,0.010596712],"genre_scores_gemma":[0.99592006,0.000010398996,0.0035843689,0.000029990057,0.00021787218,0.000054867432,0.0000073673605,0.000025437304,0.00014966528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752647,0.00005221517,0.00037920696,0.0004197001,0.0013116566,0.00031075344],"domain_scores_gemma":[0.9954459,0.001277791,0.00033738048,0.00025449463,0.0026175343,0.00006689119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011010896,0.00019018831,0.0002566815,0.000059315582,0.00030389757,0.0003125793,0.0014393775,0.00008219992,0.0000021587941],"category_scores_gemma":[0.0003165107,0.00011641143,0.00007291592,0.00052922923,0.000118245254,0.00019024109,0.00027576025,0.0003801144,4.571369e-7],"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.0076999343,0.0011900859,0.030474909,0.0025128257,0.0012495859,0.00000862849,0.009139063,0.40811187,0.124824576,0.41292068,0.00050651905,0.001361335],"study_design_scores_gemma":[0.00418189,0.0032840418,0.0018510259,0.00277987,0.000089768364,0.00003634073,0.0011916289,0.8003042,0.18369108,0.0018443726,0.00030410843,0.0004416823],"about_ca_topic_score_codex":0.00032743622,"about_ca_topic_score_gemma":0.000018838686,"teacher_disagreement_score":0.4110763,"about_ca_system_score_codex":0.0001554582,"about_ca_system_score_gemma":0.0005051895,"threshold_uncertainty_score":0.474712},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96927285,0.00002165737,0.00016082941,0.0083764745,0.00444312,0.00020479495,0.000002080326,0.000067008456,0.017451175],"genre_scores_gemma":[0.99702805,0.000009843369,0.0018583261,0.00022164237,0.00030349565,0.000020341764,8.160998e-7,0.000015159697,0.00054232246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751014,0.000032752152,0.0004720431,0.0004373035,0.0012286855,0.000319079],"domain_scores_gemma":[0.9985297,0.00021327379,0.00017113777,0.00022545106,0.0007940089,0.00006642987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904972,0.00016125737,0.00020699606,0.00013863994,0.00009248346,0.00035324733,0.002263578,0.00009062385,0.000050461484],"category_scores_gemma":[0.0004726324,0.00013699415,0.000119693235,0.0006468889,0.000094054856,0.00051264884,0.0009961836,0.00034579056,0.000026865515],"study_design_candidate":"bench_or_experimental","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.000029407422,0.00048332143,0.009322912,0.00002822793,0.00004101177,0.000007947377,0.0014527839,0.00045637885,0.27716827,0.70465165,0.0005013132,0.005856788],"study_design_scores_gemma":[0.00028911536,0.00009874865,0.0019201284,0.00019559958,0.0000036905021,0.00001610166,0.0001438868,0.07183284,0.8843521,0.04000824,0.00096686283,0.00017267492],"about_ca_topic_score_codex":0.000107811335,"about_ca_topic_score_gemma":0.0000062158188,"teacher_disagreement_score":0.6646434,"about_ca_system_score_codex":0.00033905017,"about_ca_system_score_gemma":0.00012499013,"threshold_uncertainty_score":0.5586459},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584393,0.000034294993,0.000080419464,0.015687566,0.0023420865,0.00039887114,0.000013567442,0.00008469745,0.022919225],"genre_scores_gemma":[0.99751973,0.000025243915,0.00069845025,0.00021741011,0.00026845824,0.00003352743,0.0000037971056,0.000020137037,0.0012132355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971256,0.0000864207,0.00040946103,0.0005013536,0.001455971,0.0004211471],"domain_scores_gemma":[0.998271,0.00053320517,0.0001495167,0.00029936238,0.0006628978,0.00008405718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019832605,0.00018292983,0.00021117712,0.00012100749,0.00037806112,0.0005260245,0.002627709,0.00009866036,0.000036775462],"category_scores_gemma":[0.00027738925,0.0001349968,0.00012775444,0.00068303803,0.00008791283,0.0003826825,0.001139081,0.00075688,0.000032435255],"study_design_candidate":"bench_or_experimental","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.00024105988,0.00094334694,0.059923824,0.00012550967,0.00012992552,0.000048494978,0.008704294,0.0013129264,0.41921768,0.5012119,0.0059178937,0.002223151],"study_design_scores_gemma":[0.0042931517,0.00072536094,0.02055033,0.002202974,0.00007029053,0.00017040696,0.0007940219,0.12445071,0.80135155,0.03880627,0.0054478757,0.001137045],"about_ca_topic_score_codex":0.00081507565,"about_ca_topic_score_gemma":0.0000037048824,"teacher_disagreement_score":0.46240562,"about_ca_system_score_codex":0.00033725082,"about_ca_system_score_gemma":0.00023496484,"threshold_uncertainty_score":0.5505009},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98145825,0.000024588508,0.00028704279,0.0044457344,0.0028734473,0.00010868868,0.0000023090954,0.000020276057,0.010779691],"genre_scores_gemma":[0.9994026,0.000013476623,0.000071239185,0.000048576545,0.00026429544,0.0000057625725,0.0000012428808,0.0000046500218,0.00018819183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987115,0.000020183452,0.00025378304,0.00020457484,0.00067985954,0.00013005889],"domain_scores_gemma":[0.9990703,0.00007966572,0.00011974611,0.00008262625,0.00062637887,0.000021285374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041301132,0.00007482827,0.000130985,0.00006704741,0.00007001052,0.000087677596,0.0010223847,0.000059998172,0.0000048162697],"category_scores_gemma":[0.00007430929,0.00006435417,0.00009996839,0.0003622435,0.0000386771,0.00022151486,0.0004322591,0.0002033356,0.0000015562188],"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.00009552395,0.0002789749,0.011293905,0.000016254446,0.000035010653,0.0000013796645,0.0004271712,0.0015987073,0.089402325,0.89541084,0.0008128915,0.0006270363],"study_design_scores_gemma":[0.004872672,0.0004857195,0.05210719,0.0005412674,0.000025050864,0.000028787292,0.00034426808,0.45240068,0.44994837,0.037181996,0.001493084,0.0005709234],"about_ca_topic_score_codex":0.00010381798,"about_ca_topic_score_gemma":0.000005328767,"teacher_disagreement_score":0.8582288,"about_ca_system_score_codex":0.000102254766,"about_ca_system_score_gemma":0.000060236827,"threshold_uncertainty_score":0.2624287},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49417338,0.00011235063,0.3657448,0.039949957,0.0767971,0.0048640906,0.00036420676,0.0008049646,0.017189158],"genre_scores_gemma":[0.44850054,0.000019901167,0.54324913,0.00045105416,0.0022800935,0.0002197212,0.000023504097,0.00009002596,0.0051660263],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734306,0.000020301457,0.00042276143,0.00060873246,0.0011694754,0.00043565748],"domain_scores_gemma":[0.9979525,0.0002604668,0.0002290147,0.00025173184,0.0011789774,0.00012731134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008462198,0.00022240203,0.0002805255,0.00011918128,0.00025220713,0.00036140808,0.0025121171,0.00012114401,0.0000105220515],"category_scores_gemma":[0.00027804362,0.00019253854,0.0002451869,0.00041163425,0.00006843813,0.00035643255,0.001054053,0.0003059406,0.00003512385],"study_design_candidate":"bench_or_experimental","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.00025674526,0.0028396654,0.0023539788,0.00015672653,0.00074530457,0.000040667433,0.0038019437,0.002613235,0.89074814,0.03795072,0.029892292,0.028600585],"study_design_scores_gemma":[0.0022096802,0.00024126213,0.00047575714,0.00016523898,0.000015100938,0.00003594224,0.000050906267,0.5922694,0.40192062,0.00035603537,0.0020033491,0.0002566628],"about_ca_topic_score_codex":0.000027705255,"about_ca_topic_score_gemma":8.403142e-8,"teacher_disagreement_score":0.58965623,"about_ca_system_score_codex":0.00032438812,"about_ca_system_score_gemma":0.00020685606,"threshold_uncertainty_score":0.7851494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607211,0.00006094783,0.00006347849,0.00984396,0.00398625,0.00014771365,0.0000040583723,0.000059449983,0.02511308],"genre_scores_gemma":[0.9986767,0.000021939004,0.0004973943,0.00016097845,0.00032053457,0.000008595861,4.892313e-7,0.00001058602,0.00030274843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981364,0.000009813361,0.00029413198,0.00038004303,0.00094053877,0.00023906883],"domain_scores_gemma":[0.9985888,0.00018610098,0.00013296549,0.00016831553,0.00084057817,0.00008325322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696518,0.00012816553,0.00014372802,0.000060156566,0.00015815244,0.00035099173,0.0014761805,0.000075601645,0.000019268486],"category_scores_gemma":[0.0002868707,0.00010656945,0.00007788472,0.00028595995,0.000102212325,0.00037509933,0.0009198169,0.00028441445,0.000016315124],"study_design_candidate":"bench_or_experimental","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.000051791623,0.00029927838,0.013054575,0.000040515934,0.000060977833,0.000013847214,0.0014949883,0.0001448425,0.23128559,0.74938047,0.0021490508,0.002024086],"study_design_scores_gemma":[0.00028416963,0.00011025968,0.0053398996,0.00021343057,0.0000063496336,0.000040959912,0.00024459115,0.0043776254,0.93773025,0.046083704,0.0053658294,0.00020293485],"about_ca_topic_score_codex":0.00004877557,"about_ca_topic_score_gemma":6.1177394e-7,"teacher_disagreement_score":0.7064447,"about_ca_system_score_codex":0.00009522521,"about_ca_system_score_gemma":0.00007692717,"threshold_uncertainty_score":0.4345776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890376,0.00000943766,0.000113346614,0.025054766,0.01725043,0.00017518514,0.0000204752,0.000044756023,0.06829401],"genre_scores_gemma":[0.9937088,0.0000073535602,0.00011170227,0.0002073734,0.00040189896,0.0000021326891,0.00000707422,0.000009573964,0.005544086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99557793,0.000030634936,0.0004408309,0.0005270288,0.0032547296,0.00016884993],"domain_scores_gemma":[0.99561936,0.0003716024,0.00021074351,0.00034134643,0.0033970224,0.000059905877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028799854,0.000094320596,0.00013906755,0.00011812411,0.00021991323,0.000737675,0.0023787604,0.00004651096,0.0005031187],"category_scores_gemma":[0.00409972,0.00006558736,0.000093298215,0.0011726107,0.000080535545,0.00024097665,0.0014922392,0.00015646683,0.00026339223],"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.000054397395,0.0003920123,0.035146732,0.00001059005,0.00005636934,0.0000015791462,0.000388756,0.000261613,0.06806765,0.6060587,0.28691188,0.0026497245],"study_design_scores_gemma":[0.0016028988,0.000112333175,0.026141403,0.00011387155,0.000025332529,0.000018592407,0.0010590521,0.0040666023,0.62919235,0.14185943,0.19547246,0.00033568853],"about_ca_topic_score_codex":0.000026874066,"about_ca_topic_score_gemma":0.0000011680537,"teacher_disagreement_score":0.5611247,"about_ca_system_score_codex":0.0001113219,"about_ca_system_score_gemma":0.00008263116,"threshold_uncertainty_score":0.71134174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84631366,0.00006027853,0.0024080095,0.036207844,0.009732349,0.00074082334,0.000037662405,0.00024455602,0.10425484],"genre_scores_gemma":[0.99375075,0.000021847776,0.004071884,0.00015953997,0.000287374,0.000015246191,0.000007673929,0.00001686297,0.0016687982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972014,0.000019700206,0.00023065574,0.000477307,0.0017552758,0.00031567836],"domain_scores_gemma":[0.99851876,0.00008334179,0.000093358685,0.00026404005,0.0009576767,0.00008283236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063134177,0.00015375124,0.00015837155,0.00011951573,0.00018562518,0.0005758066,0.0029569366,0.000047548765,0.000034883346],"category_scores_gemma":[0.00006512793,0.000112936184,0.00009845131,0.0007409717,0.000091234455,0.0007888114,0.0016888925,0.00031360594,0.000018145789],"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.00006686152,0.00026357212,0.0072383024,0.000032270822,0.00009804371,0.00000859277,0.00021553428,0.00006707072,0.018537855,0.971302,0.0015218307,0.0006480826],"study_design_scores_gemma":[0.0036687977,0.00071293744,0.0067969263,0.00037387758,0.000028548146,0.00005308187,0.00035429516,0.026084581,0.8646086,0.07807294,0.018552288,0.00069315394],"about_ca_topic_score_codex":0.000063392305,"about_ca_topic_score_gemma":0.0000011166696,"teacher_disagreement_score":0.893229,"about_ca_system_score_codex":0.00010675211,"about_ca_system_score_gemma":0.00010140173,"threshold_uncertainty_score":0.5552516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875673,0.00005682272,0.002229416,0.0032973508,0.0041017346,0.00023340833,0.000030815772,0.00006848083,0.0024146833],"genre_scores_gemma":[0.9841596,0.000010666896,0.015291545,0.00011509191,0.00027723747,0.000018626433,0.000026396456,0.00001468849,0.000086143074],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973578,0.00006263526,0.0005135167,0.00044573736,0.0013623986,0.000257911],"domain_scores_gemma":[0.9981412,0.0004300699,0.00036017774,0.0002470246,0.0007348646,0.000086612585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007764124,0.00018359661,0.00030210323,0.00014563467,0.00015510002,0.0001995792,0.001587248,0.000111238856,0.0000347065],"category_scores_gemma":[0.0002808362,0.00015006844,0.00016718628,0.00062813214,0.0000739534,0.00015740322,0.00045451254,0.00027291517,0.000007981259],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00041412198,0.0007972889,0.0031729268,0.00010121177,0.00045135157,0.000010055751,0.0032785512,0.051801853,0.74334013,0.19001766,0.0053442474,0.001270637],"study_design_scores_gemma":[0.0024008376,0.00016913953,0.00033084748,0.00022343552,0.000021686856,0.00000815134,0.000116865434,0.46168336,0.5298149,0.0045368294,0.00047091063,0.00022302174],"about_ca_topic_score_codex":0.0001309554,"about_ca_topic_score_gemma":6.2248233e-7,"teacher_disagreement_score":0.40988153,"about_ca_system_score_codex":0.00018285595,"about_ca_system_score_gemma":0.00018470656,"threshold_uncertainty_score":0.6119613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9557149,0.00004738472,0.00102593,0.023714054,0.00207943,0.00018556783,0.000010107192,0.00007071694,0.017151939],"genre_scores_gemma":[0.9949095,0.00001601981,0.0038458663,0.00020499527,0.0002724831,0.000008532653,0.0000026571474,0.000013531398,0.00072638935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771285,0.00004472802,0.00026955895,0.00047134954,0.001174358,0.00032715325],"domain_scores_gemma":[0.9986273,0.00030435415,0.00007570872,0.00017704931,0.0006885774,0.00012698284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431372,0.00015492701,0.00017612643,0.00008789569,0.00021855667,0.00043345802,0.0014994777,0.00009743624,0.000026149371],"category_scores_gemma":[0.00015114075,0.00012523001,0.00009587989,0.0003340617,0.00015726274,0.00034502152,0.0013356768,0.00054961763,0.000012057903],"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.0002083897,0.00028067932,0.013669226,0.00006897059,0.00010085469,0.000013071832,0.0013851416,0.0005335468,0.07735037,0.9025163,0.0013276361,0.002545814],"study_design_scores_gemma":[0.0038884294,0.0008889686,0.009112708,0.0006452761,0.000030061568,0.00028105857,0.00029083737,0.11452981,0.834953,0.02312844,0.011428484,0.00082290685],"about_ca_topic_score_codex":0.000030940355,"about_ca_topic_score_gemma":3.0569197e-7,"teacher_disagreement_score":0.87938786,"about_ca_system_score_codex":0.000087756074,"about_ca_system_score_gemma":0.00014221677,"threshold_uncertainty_score":0.51067317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71137196,0.0000945615,0.0038994302,0.04705405,0.023597177,0.0010120544,0.000025312997,0.00048733482,0.21245812],"genre_scores_gemma":[0.9953901,0.00001762914,0.0016526624,0.00016254891,0.0004624127,0.000019565337,0.000003309964,0.000019357376,0.002272393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971054,0.000057236874,0.00031670404,0.0005236167,0.0016495452,0.00034749295],"domain_scores_gemma":[0.9980793,0.00021836582,0.00012455528,0.00025652463,0.0012150984,0.000106161155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450841,0.00017611663,0.00020953981,0.00009155805,0.00022314627,0.00044430417,0.0025917927,0.00007927311,0.00003656234],"category_scores_gemma":[0.00043026166,0.00013795613,0.00015061011,0.0006274706,0.000108565575,0.0002627013,0.0012476755,0.00058732525,0.000046170826],"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.0000851444,0.0005578538,0.0038756698,0.0000912164,0.000087434935,0.000010024681,0.0005791081,0.00038452778,0.045362007,0.941925,0.0020916772,0.0049503595],"study_design_scores_gemma":[0.0026541608,0.00055664114,0.002902747,0.00045507398,0.000022786828,0.00019281762,0.00016266556,0.1229858,0.8044645,0.04860764,0.0163415,0.00065362174],"about_ca_topic_score_codex":0.000081052254,"about_ca_topic_score_gemma":5.4508416e-7,"teacher_disagreement_score":0.89331734,"about_ca_system_score_codex":0.00016008562,"about_ca_system_score_gemma":0.00018054311,"threshold_uncertainty_score":0.5625688},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9135783,0.00009331731,0.00146429,0.019255336,0.010482975,0.0005164098,0.00002491101,0.00026555645,0.054318905],"genre_scores_gemma":[0.9957753,0.000023294735,0.0032241286,0.00023682887,0.0003365944,0.000011057028,0.000004719605,0.000012004445,0.00037610618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99794096,0.000020137493,0.0002880844,0.0003594581,0.0011910385,0.00020030318],"domain_scores_gemma":[0.9984881,0.00012073701,0.00015559288,0.00026457108,0.00090197846,0.00006900204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044289388,0.00012287244,0.00016040742,0.00006396863,0.00015932534,0.00033733208,0.0022353493,0.000060801354,0.00004808534],"category_scores_gemma":[0.00023418193,0.00009261622,0.00010344609,0.0004691929,0.000040576506,0.000498024,0.0016252376,0.00025711264,0.000019971581],"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.000023434517,0.0002982675,0.0016956324,0.000052736083,0.00006135218,0.0000044855683,0.00031369383,0.000040956143,0.08120106,0.90678316,0.004037677,0.005487527],"study_design_scores_gemma":[0.0019356137,0.00019908755,0.00526637,0.0008579569,0.000016979126,0.000056618584,0.00008797338,0.24941428,0.67703205,0.04922381,0.015516712,0.0003925308],"about_ca_topic_score_codex":0.000023113922,"about_ca_topic_score_gemma":1.2443311e-7,"teacher_disagreement_score":0.8575594,"about_ca_system_score_codex":0.00012262902,"about_ca_system_score_gemma":0.00008619636,"threshold_uncertainty_score":0.4153872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9531508,0.0000041677727,0.00016321935,0.0042370223,0.005476322,0.0002747628,0.000010991528,0.00036852423,0.036314167],"genre_scores_gemma":[0.9985798,0.000013544961,0.00063479843,0.000038230406,0.00040965725,0.00001934599,0.0000038039136,0.000030426583,0.00027037843],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991632,0.0000013889936,0.00016968715,0.0001282988,0.0004103645,0.00012702103],"domain_scores_gemma":[0.9992038,0.000025013327,0.00004711608,0.00009762126,0.0005901247,0.000036325422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817304,0.000095052295,0.000078278026,0.00005022971,0.000105309555,0.000102965634,0.0008040843,0.00008785212,0.00006492867],"category_scores_gemma":[0.000078149424,0.00007821609,0.000040327926,0.0002812863,0.00006274023,0.00014217837,0.00012791758,0.00037899564,0.000020060881],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00000654652,0.0000639831,0.0015712394,0.000022885792,0.000014832582,4.3676476e-8,0.000074512325,0.00003873169,0.83695495,0.15426372,0.0065729306,0.0004156205],"study_design_scores_gemma":[0.00021485098,0.00001974347,0.00088187,0.000025566844,0.000006289762,0.0000043329583,0.000011323498,0.0024750407,0.9769383,0.010999721,0.0083180135,0.000104918276],"about_ca_topic_score_codex":0.000015093475,"about_ca_topic_score_gemma":5.746708e-7,"teacher_disagreement_score":0.143264,"about_ca_system_score_codex":0.00005420352,"about_ca_system_score_gemma":0.000018101022,"threshold_uncertainty_score":0.31895596},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60389614,0.000022321536,0.31476754,0.036239192,0.026331112,0.002964537,0.00011825935,0.00033708022,0.015323823],"genre_scores_gemma":[0.995061,0.000023867555,0.0043918383,0.00010108809,0.00029013152,0.000026783227,0.000014427515,0.000016831964,0.00007405379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803233,0.000021885544,0.0004123918,0.0003592004,0.00090458116,0.00026958183],"domain_scores_gemma":[0.9983595,0.0002854015,0.0001611301,0.00014352589,0.00094202464,0.00010842714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977592,0.00016907498,0.00017429737,0.000110891444,0.00043151155,0.0004648263,0.0011225239,0.0001279557,0.000025482595],"category_scores_gemma":[0.00016547307,0.00014946422,0.000113945796,0.00031737995,0.00017891474,0.00064656255,0.00026931555,0.00039453595,0.0000025767022],"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.000105920626,0.0002168171,0.00096628576,0.000048730843,0.000051529503,5.4313727e-8,0.00062218064,0.0033206828,0.06847598,0.92151535,0.00083240564,0.0038440856],"study_design_scores_gemma":[0.005819885,0.00041321444,0.00081878825,0.0001181415,0.000030951192,0.000024313122,0.00011110513,0.73880225,0.22407348,0.024603147,0.004665529,0.00051921053],"about_ca_topic_score_codex":0.00003165333,"about_ca_topic_score_gemma":0.0000012246279,"teacher_disagreement_score":0.89691216,"about_ca_system_score_codex":0.0001084177,"about_ca_system_score_gemma":0.00009344498,"threshold_uncertainty_score":0.60949737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92425185,0.0000026467787,0.060547404,0.006991976,0.0052031954,0.0017051676,0.00005010439,0.00019646615,0.001051191],"genre_scores_gemma":[0.8406617,6.961605e-7,0.15809296,0.00022031805,0.0007365569,0.00009237273,0.0000068857835,0.00005030927,0.00013819561],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550116,0.000048937083,0.00047336047,0.0009691491,0.0022481813,0.0007592175],"domain_scores_gemma":[0.9957575,0.0012945443,0.00023138517,0.00041904184,0.001937142,0.00036037507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018253515,0.00035099548,0.00033681476,0.000289143,0.0004278605,0.00077370304,0.004309813,0.00013399702,0.0000052630667],"category_scores_gemma":[0.0010471807,0.00027000316,0.00014371789,0.0005371181,0.00016875754,0.00074833987,0.0010434098,0.0009389502,0.000011775251],"study_design_candidate":"bench_or_experimental","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.0017695077,0.001978652,0.008928552,0.00013897104,0.00042242507,0.00003037562,0.01303345,0.068559535,0.8073879,0.08436458,0.00044838013,0.012937687],"study_design_scores_gemma":[0.0016178393,0.0019768346,0.00034033085,0.0001838155,0.000012303285,0.000054562996,0.00019343483,0.7599496,0.23327422,0.0014386396,0.00058519334,0.0003731922],"about_ca_topic_score_codex":0.00024614623,"about_ca_topic_score_gemma":0.000004926989,"teacher_disagreement_score":0.6913901,"about_ca_system_score_codex":0.00028353787,"about_ca_system_score_gemma":0.00014262543,"threshold_uncertainty_score":0.9999752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71785897,0.000021935622,0.11680989,0.03285681,0.08675823,0.0030031702,0.00021225978,0.00063090445,0.041847803],"genre_scores_gemma":[0.9725756,0.0000011558542,0.026401311,0.00012835592,0.0005821101,0.000047065023,0.0000043034456,0.000020371037,0.00023970433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775046,0.0000084499825,0.0003492023,0.00042248078,0.0011462088,0.00032319763],"domain_scores_gemma":[0.9981658,0.00036130936,0.00025884912,0.00025410153,0.0008624509,0.00009750726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009022553,0.00017332383,0.00018780497,0.000099442346,0.00021338378,0.0002514192,0.0029455135,0.00010876626,0.0000068505224],"category_scores_gemma":[0.00062443194,0.00014180166,0.00014308094,0.00028894667,0.000098455006,0.0002328917,0.0003089623,0.0004399486,0.0000066020893],"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.00010661229,0.00028113797,0.004721742,0.000053813543,0.000038036447,0.0000022527222,0.00020522994,0.00043915436,0.063333124,0.9274329,0.0028914034,0.000494607],"study_design_scores_gemma":[0.0039225654,0.0007621753,0.0032412438,0.00033982578,0.00002762509,0.000027622196,0.000041032505,0.52740896,0.38790137,0.0634737,0.012189263,0.0006646437],"about_ca_topic_score_codex":0.000018203527,"about_ca_topic_score_gemma":4.3687615e-7,"teacher_disagreement_score":0.8639592,"about_ca_system_score_codex":0.000091172406,"about_ca_system_score_gemma":0.00013174918,"threshold_uncertainty_score":0.5782504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82271546,0.0000039990596,0.000019201998,0.10555209,0.008973865,0.0011312338,0.00010816075,0.000057524972,0.06143847],"genre_scores_gemma":[0.99767905,0.000008298839,0.00024444377,0.00019575562,0.0007955468,0.000052431304,0.000007787885,0.000010236712,0.0010064717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985341,0.000014352572,0.00022493099,0.0001542439,0.0008357897,0.00023658613],"domain_scores_gemma":[0.9984515,0.00024356334,0.00012836681,0.00006784942,0.001010936,0.000097809374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015081718,0.00008103622,0.00009147561,0.00006414405,0.0010292953,0.00022235172,0.00093966327,0.000110497094,0.000044814995],"category_scores_gemma":[0.0003401247,0.000055506018,0.000083985185,0.0002122408,0.00025306334,0.00013808775,0.000020860278,0.00027436277,0.0000032171292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000063264364,0.000039667626,0.007485502,0.000007895846,0.000022277354,2.5261379e-8,0.0034138039,0.00018872223,0.004299349,0.98287094,0.0014167732,0.00019175628],"study_design_scores_gemma":[0.0046985955,0.0004047378,0.194602,0.00018193759,0.00012388288,0.0000023284633,0.005946116,0.0009734694,0.094388776,0.21226197,0.4855138,0.00090238295],"about_ca_topic_score_codex":0.24712677,"about_ca_topic_score_gemma":0.1039426,"teacher_disagreement_score":0.77060896,"about_ca_system_score_codex":0.0001489864,"about_ca_system_score_gemma":0.00034371967,"threshold_uncertainty_score":0.9124081},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38964295,0.00042999568,0.045876645,0.27234113,0.08671361,0.0035175676,0.000086685235,0.00069840485,0.200693],"genre_scores_gemma":[0.9954756,0.000115253795,0.0011537668,0.00014604631,0.0004933119,0.00003427801,0.0000031767904,0.00001910969,0.0025594374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99650264,0.00006762598,0.0003970138,0.00041499722,0.002286334,0.00033142086],"domain_scores_gemma":[0.99655217,0.0006355685,0.00016463912,0.00037655354,0.0021631352,0.0001079175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718384,0.00015238421,0.00017601163,0.00006301754,0.00045974125,0.0008332106,0.004071773,0.0000648326,0.00006358861],"category_scores_gemma":[0.00079433864,0.000098188735,0.0001454676,0.0005749444,0.0001746349,0.0002094122,0.0016422389,0.00041579088,0.000030250152],"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.00008365243,0.00032475,0.00040575842,0.000022157734,0.00010479882,0.0000027122157,0.00015641797,0.00020749004,0.034502335,0.9575335,0.0052641258,0.0013923312],"study_design_scores_gemma":[0.0034131377,0.00029602714,0.0034487208,0.00016886582,0.000028112834,0.000048762995,0.00011726165,0.34600738,0.5425082,0.055573657,0.04790223,0.00048766282],"about_ca_topic_score_codex":0.000026403297,"about_ca_topic_score_gemma":8.309304e-7,"teacher_disagreement_score":0.90195984,"about_ca_system_score_codex":0.00013931554,"about_ca_system_score_gemma":0.00017048392,"threshold_uncertainty_score":0.80346686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93937045,0.000012369703,0.0005303187,0.01203144,0.007134639,0.00032894724,0.000014890782,0.0001497481,0.040427197],"genre_scores_gemma":[0.997801,0.000004417301,0.0010263573,0.00014063851,0.00046149085,0.000016335629,0.0000032774299,0.000015839161,0.0005306176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771106,0.00003315333,0.00032761804,0.00039003915,0.0012038558,0.00033424306],"domain_scores_gemma":[0.9983813,0.0004433343,0.00015417366,0.000252791,0.00064840936,0.000119986704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012524687,0.00016557587,0.0001815256,0.00011004763,0.00037978234,0.00036724666,0.0031415753,0.00011323111,0.000051598607],"category_scores_gemma":[0.00022084276,0.00013437514,0.00012062662,0.00035542008,0.00022257703,0.00034114032,0.0007482808,0.000986249,0.000043868524],"study_design_candidate":"bench_or_experimental","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.00005858083,0.00016078586,0.017861929,0.000029037337,0.000044863107,0.0000016342212,0.0009768826,0.0002920633,0.16038238,0.8170647,0.0018312393,0.0012958978],"study_design_scores_gemma":[0.004297404,0.0009911504,0.011494157,0.0008603719,0.00004582881,0.00011615581,0.0003483828,0.1119116,0.7538172,0.07672968,0.038150553,0.0012375088],"about_ca_topic_score_codex":0.00020669878,"about_ca_topic_score_gemma":0.000002986018,"teacher_disagreement_score":0.74033505,"about_ca_system_score_codex":0.00009722846,"about_ca_system_score_gemma":0.000116850715,"threshold_uncertainty_score":0.5837881},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6295579,0.000022008731,0.0101687675,0.05414808,0.04869964,0.001721582,0.00004510864,0.0004524848,0.25518444],"genre_scores_gemma":[0.98520416,0.000011965401,0.010414206,0.00012476621,0.00083442434,0.000032901804,0.0000028402142,0.00002846868,0.0033462706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99573165,0.000042390864,0.0004010211,0.0005331306,0.0028970486,0.00039478135],"domain_scores_gemma":[0.99698514,0.00028666572,0.00013770766,0.00034095644,0.0020761278,0.00017343336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017885331,0.00018513466,0.00019640083,0.000273051,0.00025368293,0.00050737197,0.004107234,0.00013153619,0.00019787715],"category_scores_gemma":[0.0007129803,0.00014609896,0.00015370703,0.000826598,0.00027731818,0.0005146113,0.001273367,0.0008635992,0.00007229651],"study_design_candidate":"bench_or_experimental","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.00008639098,0.000622103,0.0023798193,0.00001957999,0.00007475848,0.0000012035101,0.00018368248,0.00013038864,0.25620696,0.7322488,0.0037995484,0.0042467522],"study_design_scores_gemma":[0.0017947983,0.0003330533,0.0025268057,0.000062584535,0.000010480602,0.000049135448,0.00004063727,0.08703454,0.84878737,0.018381858,0.040560387,0.00041835156],"about_ca_topic_score_codex":0.000064695705,"about_ca_topic_score_gemma":0.0000013357989,"teacher_disagreement_score":0.71386695,"about_ca_system_score_codex":0.00017759216,"about_ca_system_score_gemma":0.00017108691,"threshold_uncertainty_score":0.7632331},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90398794,0.00008993305,0.0025507212,0.04380073,0.0049674707,0.00035248089,0.00002066001,0.00016226384,0.04406778],"genre_scores_gemma":[0.9968995,0.000021763482,0.0022806244,0.00012577669,0.00021787059,0.000008724066,0.0000024300664,0.000009942214,0.00043340304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981756,0.000033925848,0.00025326,0.00038567308,0.00090044097,0.00025109653],"domain_scores_gemma":[0.9985204,0.0004919014,0.00007937624,0.00015117292,0.00065293803,0.0001042093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774265,0.00012198017,0.00014073103,0.00008704405,0.00029778082,0.00033789285,0.0010427408,0.000075328484,0.000018352019],"category_scores_gemma":[0.00028483316,0.00010336706,0.00007681359,0.00028439172,0.00011818611,0.0002670125,0.0007298755,0.000545676,0.000013373268],"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.000069775015,0.0002828354,0.008306055,0.00007989167,0.00008706261,0.000009249702,0.00094002835,0.00047768827,0.0980776,0.8879958,0.000930201,0.0027438204],"study_design_scores_gemma":[0.0044747014,0.00058995216,0.031561553,0.0012700767,0.000049191996,0.00038701628,0.00047852995,0.20121568,0.6538935,0.08036116,0.024637751,0.0010809124],"about_ca_topic_score_codex":0.00006950766,"about_ca_topic_score_gemma":6.6032925e-7,"teacher_disagreement_score":0.80763465,"about_ca_system_score_codex":0.000075854005,"about_ca_system_score_gemma":0.0001278429,"threshold_uncertainty_score":0.42151865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393624,0.000021396476,0.0012216803,0.009115241,0.0037804157,0.00022823652,0.000012622133,0.000057805017,0.04620022],"genre_scores_gemma":[0.9973565,0.000018692732,0.0015024907,0.00007368639,0.000284356,0.00000860592,0.0000026008868,0.000013647619,0.00073942903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99719876,0.000039229446,0.00035880913,0.00040219448,0.001719573,0.00028142318],"domain_scores_gemma":[0.9977822,0.00020087439,0.00018844774,0.00022334006,0.001523081,0.00008207005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096039975,0.00015192827,0.00022592321,0.00010937897,0.00014169242,0.00020903625,0.002488573,0.00007007806,0.000035337507],"category_scores_gemma":[0.00025263475,0.00011553195,0.00018253224,0.0005205964,0.00015554857,0.00035095608,0.001233282,0.00045944305,0.000011379206],"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.00007901721,0.00032414068,0.0031106356,0.00003862353,0.00009330449,0.0000027549088,0.000562851,0.0003424672,0.05047425,0.9433842,0.00015905988,0.0014287392],"study_design_scores_gemma":[0.0013518906,0.000304822,0.0013567742,0.00014629462,0.000007899031,0.000025903053,0.0000913185,0.04467165,0.88967866,0.06079402,0.001382222,0.00018853835],"about_ca_topic_score_codex":0.00014471756,"about_ca_topic_score_gemma":7.9893243e-7,"teacher_disagreement_score":0.8825901,"about_ca_system_score_codex":0.00014056728,"about_ca_system_score_gemma":0.00016372588,"threshold_uncertainty_score":0.4711256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8210236,0.00017053775,0.030903818,0.06827525,0.022116415,0.004327509,0.00066187716,0.0008123704,0.05170865],"genre_scores_gemma":[0.9964615,0.000010637888,0.0017370521,0.00018796383,0.00035866283,0.00009836486,0.000037007216,0.000027879096,0.0010809408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970123,0.00006186761,0.00039734444,0.0006084218,0.0014232583,0.00049677066],"domain_scores_gemma":[0.9964644,0.0007223228,0.0001338693,0.0002708069,0.0022630545,0.00014555975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014062726,0.0002132621,0.00025521152,0.00013631416,0.00048554517,0.0005193725,0.0023042276,0.00012039181,0.000029234845],"category_scores_gemma":[0.00039948383,0.00018331321,0.00020150265,0.00059579837,0.00015556747,0.0003681729,0.0008105363,0.00050982827,0.000024398489],"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.00024138529,0.00057856675,0.0036112217,0.0003284703,0.00017280053,0.000010060443,0.0011307982,0.0015699218,0.051490773,0.9309043,0.0090748,0.0008868678],"study_design_scores_gemma":[0.0030236233,0.0007531058,0.0008315371,0.00089790317,0.000039502942,0.00013094158,0.00036129542,0.13514318,0.79328954,0.05929155,0.0055969213,0.0006408847],"about_ca_topic_score_codex":0.00007103901,"about_ca_topic_score_gemma":0.000001156312,"teacher_disagreement_score":0.8716128,"about_ca_system_score_codex":0.0002512959,"about_ca_system_score_gemma":0.00042130472,"threshold_uncertainty_score":0.74752957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8417601,0.0003971348,0.0013608102,0.113345325,0.015083502,0.0006770011,0.000027558124,0.00035217492,0.026996396],"genre_scores_gemma":[0.9926602,0.000014266278,0.006032897,0.00015818661,0.00046173742,0.000021599428,0.000002324299,0.000020597106,0.00062818156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972534,0.00004325203,0.00032424674,0.00048133868,0.0015367813,0.0003609693],"domain_scores_gemma":[0.99785584,0.00027490556,0.00025780857,0.00024662973,0.0012653243,0.00009950885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056724,0.00017865107,0.00020331971,0.000082051745,0.0003030909,0.0005333361,0.0024659939,0.00010046516,0.000027656572],"category_scores_gemma":[0.0002405359,0.00014218637,0.0001309713,0.00053399685,0.0000981185,0.00036500397,0.0011263054,0.0005328333,0.000020497257],"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.00016574198,0.0007562184,0.08306169,0.00037846772,0.00024127985,0.00004084049,0.0027105014,0.0021504376,0.024117393,0.8704406,0.009022506,0.0069143237],"study_design_scores_gemma":[0.003026133,0.00052067207,0.006469116,0.003970208,0.000033660745,0.00012949028,0.0007477506,0.23533902,0.66019213,0.07802203,0.010616652,0.00093314727],"about_ca_topic_score_codex":0.0000312249,"about_ca_topic_score_gemma":7.5101303e-7,"teacher_disagreement_score":0.7924186,"about_ca_system_score_codex":0.00016021055,"about_ca_system_score_gemma":0.0001568443,"threshold_uncertainty_score":0.57981914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.681987,0.0007432102,0.19457203,0.06323588,0.042734973,0.0035180196,0.00013633998,0.0014156122,0.011656932],"genre_scores_gemma":[0.878213,0.000011615232,0.12069067,0.00019311595,0.00030860642,0.00005085956,0.0000028877644,0.000018028497,0.0005112558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811906,0.000013747049,0.00028650073,0.0004383896,0.00087109214,0.00027122415],"domain_scores_gemma":[0.9981049,0.00014121408,0.00016907623,0.0001900065,0.0013300051,0.00006485406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063247146,0.00014847665,0.00016656914,0.00008182345,0.00018680503,0.00035567678,0.0024590453,0.00009590787,0.000008391204],"category_scores_gemma":[0.00047705436,0.000117671516,0.00015213103,0.00034970988,0.00004647326,0.00041020152,0.0010601191,0.00026428123,0.0000041387666],"study_design_candidate":"bench_or_experimental","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.000054300977,0.00025813185,0.00038924298,0.00004426583,0.00004493863,0.0000026282464,0.00032590167,0.00001509571,0.31805444,0.67893165,0.0007772495,0.0011021671],"study_design_scores_gemma":[0.0009568262,0.00012317402,0.00013266454,0.00015867049,0.000008074317,0.00001998043,0.00003411215,0.011408857,0.95670605,0.028913228,0.0013697761,0.00016856607],"about_ca_topic_score_codex":0.000016750066,"about_ca_topic_score_gemma":4.0605158e-7,"teacher_disagreement_score":0.6500184,"about_ca_system_score_codex":0.00021682338,"about_ca_system_score_gemma":0.00011890428,"threshold_uncertainty_score":0.47985053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413309,0.000045107176,0.01248193,0.012284296,0.012766904,0.00031994682,0.000026597676,0.0002517821,0.02049252],"genre_scores_gemma":[0.9966703,0.000008390196,0.00056170474,0.000080735,0.00042278602,0.000008096957,0.000010481616,0.00001507529,0.0022224418],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797875,0.00005044641,0.00027081723,0.0003897532,0.0010586743,0.00025157537],"domain_scores_gemma":[0.9985615,0.00012421695,0.00016455562,0.00013677229,0.0009341737,0.000078756704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044146867,0.0001396239,0.00014490446,0.00007479358,0.0003410881,0.0003116896,0.0010405744,0.000077191275,0.000029356503],"category_scores_gemma":[0.0003610005,0.00011963713,0.000105621046,0.00046014437,0.00005870375,0.00030722452,0.00068129046,0.0005586053,0.000012763296],"study_design_candidate":"bench_or_experimental","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.00018400593,0.0008693194,0.027319724,0.000093391085,0.0003006081,0.000006752479,0.0011041847,0.00335935,0.8139266,0.1318349,0.011411877,0.0095893135],"study_design_scores_gemma":[0.002403593,0.00058475987,0.0017671966,0.00040066225,0.000040845884,0.00009238762,0.00019217735,0.7618452,0.21133554,0.0027573088,0.018098325,0.00048204593],"about_ca_topic_score_codex":0.00012534588,"about_ca_topic_score_gemma":4.551632e-7,"teacher_disagreement_score":0.7584858,"about_ca_system_score_codex":0.00027251244,"about_ca_system_score_gemma":0.000092304595,"threshold_uncertainty_score":0.48786604},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74022245,0.00027470043,0.12068542,0.0692841,0.023809906,0.0017489117,0.0000399001,0.00041199283,0.043522604],"genre_scores_gemma":[0.9878791,0.0000049451237,0.0111643765,0.00028735408,0.00050880335,0.000044253557,0.000002420668,0.000016241795,0.00009249918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979505,0.00003154826,0.00031667599,0.0004191044,0.00096940936,0.00031278704],"domain_scores_gemma":[0.9973721,0.0013578522,0.00014565799,0.00018638658,0.0008580199,0.00008000155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011807741,0.00015361897,0.00021715865,0.00006601141,0.00029800308,0.00037631634,0.001836502,0.00011313328,0.000024354957],"category_scores_gemma":[0.0008935899,0.00012048575,0.00017363495,0.00032329626,0.00008858997,0.00021540267,0.00064965704,0.00042976136,0.0000044502117],"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.00025774128,0.00013361931,0.0026146288,0.000036768535,0.00007252061,0.000002158963,0.0010198222,0.00024650554,0.0075000706,0.9871645,0.00054923753,0.00040240504],"study_design_scores_gemma":[0.002700119,0.0003077671,0.0002823806,0.000772085,0.00002100777,0.00001992499,0.00019798976,0.03211403,0.1793596,0.78223073,0.00172746,0.00026689738],"about_ca_topic_score_codex":0.000006244868,"about_ca_topic_score_gemma":5.340406e-8,"teacher_disagreement_score":0.24765663,"about_ca_system_score_codex":0.00010501411,"about_ca_system_score_gemma":0.00011503557,"threshold_uncertainty_score":0.49132663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95282954,0.000030490604,0.008679268,0.015835153,0.0069339424,0.00042201206,0.00001773065,0.000118452386,0.01513343],"genre_scores_gemma":[0.9966128,0.000017605542,0.002416257,0.00017675376,0.0005225343,0.000018383196,0.000007784513,0.000010563515,0.000217332],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805516,0.000020190873,0.00020176181,0.0004038209,0.0011369524,0.00018211592],"domain_scores_gemma":[0.99832106,0.000053848307,0.0001223884,0.00020171267,0.0012403835,0.000060633316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027754973,0.00012223715,0.00012744845,0.000048010963,0.00019493098,0.00026014773,0.0011641145,0.000058913876,0.000012438899],"category_scores_gemma":[0.000066481916,0.00008329333,0.000060302857,0.0003927167,0.000043067783,0.00053239235,0.0006716879,0.00022034226,0.000008429983],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00013399236,0.0004732624,0.0022447857,0.000014923221,0.00006975929,0.0000039028873,0.00045706035,0.0004298382,0.5536497,0.43645564,0.0044239014,0.0016432011],"study_design_scores_gemma":[0.0008483897,0.00018634171,0.0007670566,0.00008514601,0.000006421759,0.000018653569,0.000022729884,0.04258331,0.9496563,0.0027912573,0.0029037825,0.00013058071],"about_ca_topic_score_codex":0.000051590254,"about_ca_topic_score_gemma":0.0000014901301,"teacher_disagreement_score":0.43366438,"about_ca_system_score_codex":0.0001300206,"about_ca_system_score_gemma":0.00013835022,"threshold_uncertainty_score":0.33966035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96741945,0.000023906605,0.0036039487,0.007799714,0.00403537,0.00029979047,0.000017403563,0.0001517014,0.016648749],"genre_scores_gemma":[0.9949387,0.000005534149,0.004257104,0.00006944064,0.0004334282,0.000021001199,0.000008084364,0.000013476205,0.00025326363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776196,0.000016429296,0.00030005857,0.00042074162,0.0012221308,0.00027866327],"domain_scores_gemma":[0.99822813,0.00025934086,0.0002036998,0.0001445094,0.0010836166,0.00008070072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068486074,0.00015332238,0.00014680864,0.00007598235,0.00035429228,0.00039812163,0.0010762865,0.000085918386,0.000020990687],"category_scores_gemma":[0.00016063826,0.00012295385,0.000083279505,0.0004027155,0.00006220596,0.0004808756,0.00035173082,0.00045227134,0.000005928113],"study_design_candidate":"bench_or_experimental","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.00072472275,0.0008218362,0.07771641,0.00014652753,0.00037713285,0.0000123835725,0.0016703338,0.018767612,0.33875683,0.5561826,0.0017113641,0.0031121993],"study_design_scores_gemma":[0.0034511036,0.00061058893,0.017022826,0.0011210298,0.000035699246,0.00016599118,0.00029315014,0.09465481,0.8713218,0.0068256995,0.0038784912,0.0006187825],"about_ca_topic_score_codex":0.000105971565,"about_ca_topic_score_gemma":0.0000037365014,"teacher_disagreement_score":0.54935694,"about_ca_system_score_codex":0.00019749186,"about_ca_system_score_gemma":0.0002520059,"threshold_uncertainty_score":0.50139123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8616078,0.00006447339,0.0021205891,0.010587361,0.0124450475,0.0012300264,0.00006703187,0.0002494783,0.11162818],"genre_scores_gemma":[0.99582523,0.000024953268,0.002887042,0.00007578567,0.00059007143,0.000089284105,0.000008730012,0.000026972155,0.00047192693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834156,0.000019785033,0.00030758226,0.00026427011,0.0008451737,0.00022160959],"domain_scores_gemma":[0.99873674,0.000044467448,0.000047646707,0.00014135471,0.0009524523,0.000077321754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038141382,0.00015398403,0.00014339635,0.00008776582,0.00018342082,0.00020510357,0.00067651604,0.000096084594,0.00003846665],"category_scores_gemma":[0.000061694845,0.00010813869,0.000115524985,0.0005032268,0.00010120823,0.00017510197,0.00017440158,0.00044047157,0.000025905974],"study_design_candidate":"bench_or_experimental","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.0001838957,0.0004839248,0.0009088602,0.00011007361,0.00019653437,5.257352e-7,0.0012459481,0.0037850682,0.33601412,0.6471147,0.0038660683,0.0060903025],"study_design_scores_gemma":[0.0035743865,0.00021634449,0.0005305423,0.00021420445,0.00004231443,0.00018489662,0.0020483285,0.060872797,0.89348364,0.004601321,0.033815376,0.0004158234],"about_ca_topic_score_codex":0.00003720151,"about_ca_topic_score_gemma":0.000002936708,"teacher_disagreement_score":0.64251333,"about_ca_system_score_codex":0.00022387595,"about_ca_system_score_gemma":0.00006813393,"threshold_uncertainty_score":0.44097677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8934512,0.000092950446,0.002385648,0.021496415,0.009790151,0.00037824264,0.000011305824,0.00023639297,0.072157696],"genre_scores_gemma":[0.9974264,0.0000102902495,0.0013572051,0.00012524155,0.0004495537,0.000011413621,0.0000056065746,0.000019495048,0.00059481035],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971356,0.000026128702,0.00036909684,0.0005177152,0.0015668125,0.0003846832],"domain_scores_gemma":[0.9980959,0.00030006163,0.00020911056,0.00024066019,0.0010355591,0.00011869258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009369602,0.00019486231,0.00020078654,0.0001240452,0.00030633135,0.00042262886,0.0017939912,0.00012479565,0.000050117662],"category_scores_gemma":[0.00015669916,0.00017028727,0.00014642454,0.00055496214,0.00006323739,0.00056740694,0.0005931149,0.0007057494,0.00004567724],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00033681464,0.00083435344,0.016916942,0.00017587369,0.00025628947,0.00003966369,0.0025836546,0.005589378,0.54953873,0.41401482,0.0045918827,0.005121612],"study_design_scores_gemma":[0.0014717594,0.00027770916,0.023398526,0.000550232,0.000018202507,0.00011821108,0.0002587852,0.025216976,0.9172283,0.025181975,0.0057921303,0.000487205],"about_ca_topic_score_codex":0.00016080198,"about_ca_topic_score_gemma":5.921138e-7,"teacher_disagreement_score":0.38883287,"about_ca_system_score_codex":0.00024086975,"about_ca_system_score_gemma":0.00018818739,"threshold_uncertainty_score":0.69441134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64984596,0.000038023976,0.046738576,0.09429593,0.024014207,0.0032138266,0.00013419265,0.0007072215,0.18101208],"genre_scores_gemma":[0.9850185,0.00005845482,0.012068799,0.0001533097,0.0005521617,0.00004187631,0.000012167453,0.000026277441,0.0020684514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776685,0.000032067095,0.00031390905,0.00043462834,0.0011645514,0.0002879945],"domain_scores_gemma":[0.9975977,0.00035813104,0.00010644802,0.00018932372,0.0016486056,0.00009979002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008056221,0.000137722,0.00017128346,0.00011296663,0.00025705923,0.0003772425,0.0013482819,0.000074436386,0.000056322773],"category_scores_gemma":[0.00032165178,0.00012023852,0.00015684614,0.00044214734,0.000079720616,0.00034878895,0.00060473295,0.00025599185,0.000021188727],"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.000094593015,0.00022156446,0.0009006606,0.00005087929,0.00007968206,0.0000018555397,0.00047264935,0.00079764606,0.14230375,0.8479031,0.000999998,0.006173671],"study_design_scores_gemma":[0.0032842082,0.00042555452,0.0030654299,0.0002625778,0.000023963075,0.00006451416,0.00016914362,0.34715816,0.5987872,0.041528087,0.0047384663,0.0004926866],"about_ca_topic_score_codex":0.00006205737,"about_ca_topic_score_gemma":0.0000010164172,"teacher_disagreement_score":0.80637497,"about_ca_system_score_codex":0.00022025766,"about_ca_system_score_gemma":0.00022271328,"threshold_uncertainty_score":0.49031845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9307831,0.00003556671,0.015504844,0.026996061,0.006945164,0.00050613546,0.000007839169,0.00019716557,0.019024156],"genre_scores_gemma":[0.98491925,0.000004970803,0.013858105,0.0003082194,0.0006728857,0.000023154294,0.0000017318624,0.000021540678,0.00019012886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997019,0.000029993822,0.0003813175,0.0006766881,0.0014833937,0.00040964189],"domain_scores_gemma":[0.9983409,0.0001551933,0.00013974728,0.00027353436,0.00092770567,0.00016289997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072461524,0.00020803406,0.0002461525,0.00011811365,0.00027043046,0.0005277336,0.0028040383,0.000065060034,0.0000040300442],"category_scores_gemma":[0.00032102477,0.0001626796,0.00018756538,0.0005790497,0.000063435924,0.00022043359,0.0019368754,0.000555309,0.00001450527],"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.000040155475,0.0006617255,0.00032889665,0.0000695052,0.00007758363,0.0000034915176,0.0008784024,0.012142695,0.09608508,0.88691366,0.0008572493,0.0019415432],"study_design_scores_gemma":[0.0008184362,0.00021991748,0.00028897222,0.000323036,0.000008043909,0.00009339399,0.00005067566,0.771936,0.18488272,0.03726029,0.0038006972,0.00031778842],"about_ca_topic_score_codex":0.000025000694,"about_ca_topic_score_gemma":2.0644084e-7,"teacher_disagreement_score":0.84965336,"about_ca_system_score_codex":0.0001542322,"about_ca_system_score_gemma":0.0001521769,"threshold_uncertainty_score":0.66338813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85805213,0.000029825384,0.001210803,0.023534166,0.0046304436,0.0008753819,0.000014442154,0.00027213705,0.111380644],"genre_scores_gemma":[0.98890895,0.00011815134,0.003901183,0.00007088397,0.00027391742,0.000027495045,0.00000927925,0.00003260696,0.0066575203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587774,0.0001676183,0.0005244936,0.0006147547,0.0023438763,0.00047150347],"domain_scores_gemma":[0.99712735,0.0004825736,0.0001331831,0.0002709916,0.0018448058,0.0001410979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018736204,0.00019174274,0.00028592604,0.00028318117,0.00017585297,0.0004677577,0.002578656,0.00011269673,0.00018823301],"category_scores_gemma":[0.000787807,0.00016475658,0.00012313365,0.0013634893,0.00013420187,0.0003958507,0.0015753331,0.0007574653,0.00009951197],"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.00028238425,0.0011659954,0.01761399,0.00012361098,0.00015414198,0.00006111228,0.0011983672,0.0031588352,0.18080989,0.79123133,0.0013290055,0.0028713183],"study_design_scores_gemma":[0.0034285693,0.00033597488,0.0077760103,0.00033785397,0.000011333111,0.0000585175,0.00007844111,0.67594594,0.2930279,0.015518129,0.002962313,0.00051898754],"about_ca_topic_score_codex":0.00013547849,"about_ca_topic_score_gemma":9.792869e-7,"teacher_disagreement_score":0.7757132,"about_ca_system_score_codex":0.00036525767,"about_ca_system_score_gemma":0.00031493112,"threshold_uncertainty_score":0.67185783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8242232,0.00005224029,0.00950676,0.03837372,0.014314351,0.0008152067,0.00001790234,0.00039369334,0.11230291],"genre_scores_gemma":[0.98980904,0.0000058924993,0.00902759,0.00016543841,0.00026822957,0.000014121536,0.000002107637,0.000017058454,0.0006905338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973555,0.00002822487,0.00024739598,0.00043343526,0.0016404644,0.00029495638],"domain_scores_gemma":[0.99811184,0.00023435365,0.00013641891,0.00024273874,0.0011765067,0.00009810852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005275716,0.00014971009,0.00017922094,0.00008409599,0.00017400394,0.00032240935,0.0022332072,0.000056064535,0.000009908329],"category_scores_gemma":[0.00031109503,0.00010906792,0.000078779005,0.00060489704,0.00008725655,0.0002847438,0.0008335675,0.0004187085,0.000018151935],"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.0001577881,0.00046702585,0.0078313565,0.0000557762,0.00015259818,0.00003981244,0.00095521135,0.0016681972,0.059210565,0.9273682,0.00085057714,0.0012428956],"study_design_scores_gemma":[0.0056410227,0.0013579384,0.014448211,0.0014427692,0.000049228496,0.00061702414,0.00030428157,0.19895896,0.7226543,0.04834952,0.005202069,0.0009747125],"about_ca_topic_score_codex":0.000054974134,"about_ca_topic_score_gemma":3.8092764e-7,"teacher_disagreement_score":0.87901866,"about_ca_system_score_codex":0.00016542332,"about_ca_system_score_gemma":0.0001970842,"threshold_uncertainty_score":0.44476607},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77994514,0.000103496866,0.05448993,0.050804928,0.04423541,0.0052232887,0.00020502473,0.0009513615,0.0640414],"genre_scores_gemma":[0.9951836,0.000025834106,0.0029618267,0.00017237902,0.0005217903,0.000069251255,0.000017533986,0.000021101823,0.0010267241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974472,0.000035636745,0.00036876733,0.00055791216,0.0012629492,0.0003275492],"domain_scores_gemma":[0.9963384,0.00023759405,0.00013334095,0.00023361866,0.0029093132,0.00014769679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350134,0.00015954985,0.00017382063,0.000120643446,0.00032524287,0.0004689043,0.0014623397,0.00010996197,0.00005883486],"category_scores_gemma":[0.00037393105,0.00013766467,0.00015576692,0.0004819791,0.00009784268,0.0006884178,0.00047708905,0.0003640478,0.000009231311],"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.0003480579,0.001090313,0.00067361974,0.00008620465,0.00010049528,6.786332e-7,0.00029915184,0.0004093774,0.22131681,0.7707138,0.00077114406,0.0041903076],"study_design_scores_gemma":[0.0059118997,0.0016321338,0.018729493,0.00019050638,0.000037346712,0.000029429744,0.00022798398,0.3028576,0.540596,0.10985875,0.019178554,0.0007502866],"about_ca_topic_score_codex":0.000047575835,"about_ca_topic_score_gemma":0.0000026789962,"teacher_disagreement_score":0.66085505,"about_ca_system_score_codex":0.00023096002,"about_ca_system_score_gemma":0.0003184361,"threshold_uncertainty_score":0.5613802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90949476,0.00015075572,0.039128028,0.035342835,0.011170851,0.0012555899,0.000054671567,0.000055147095,0.003347357],"genre_scores_gemma":[0.9971589,0.00001821003,0.0022677102,0.000089803296,0.00017277102,0.000033955053,0.0000014823435,0.000006849516,0.00025033994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821144,0.000029475497,0.00028791183,0.00031742145,0.0009761562,0.00017757867],"domain_scores_gemma":[0.9981173,0.00041248757,0.0002131862,0.0003110629,0.00090198277,0.000043971206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435696,0.00010784144,0.0001814789,0.000056795194,0.00023958016,0.00017323598,0.0021859324,0.000042960815,0.00000573118],"category_scores_gemma":[0.00030155783,0.00006147047,0.00015181073,0.00059012615,0.00011329994,0.00014530226,0.00060103816,0.00016135183,6.867308e-7],"study_design_candidate":"bench_or_experimental","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.00016687748,0.00094674085,0.034749296,0.00013194192,0.0013130986,0.0000012737531,0.0029606645,0.0029480194,0.17026162,0.7832794,0.00077828084,0.002462797],"study_design_scores_gemma":[0.0010939023,0.000306445,0.023058182,0.00013273244,0.00021634264,0.000009256559,0.00022420137,0.2917966,0.6644287,0.017765675,0.0007750145,0.00019297558],"about_ca_topic_score_codex":0.00007835432,"about_ca_topic_score_gemma":0.0000025722147,"teacher_disagreement_score":0.7655137,"about_ca_system_score_codex":0.00007887496,"about_ca_system_score_gemma":0.00007352975,"threshold_uncertainty_score":0.40620425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298789,0.0000324062,0.005958208,0.012393395,0.009673551,0.0006845643,0.000008190449,0.00012557267,0.041245226],"genre_scores_gemma":[0.98090464,0.00003590183,0.018223988,0.00016049192,0.00037360325,0.000041765896,0.0000023794294,0.000024871822,0.00023234243],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99634427,0.0000738926,0.0005911122,0.0006559202,0.0018965291,0.00043828186],"domain_scores_gemma":[0.9977181,0.00019412702,0.00019475474,0.0004071331,0.0013798566,0.000106028616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689851,0.00020290975,0.00026391537,0.00024136905,0.00017948258,0.00035728866,0.0034664874,0.00014447873,0.000020903912],"category_scores_gemma":[0.00069371436,0.00018585961,0.00014938493,0.0010901267,0.000096203454,0.00080366863,0.0016649731,0.0004723988,0.000016452803],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00015162393,0.00032118586,0.0055582086,0.00009510909,0.000046362744,0.000006128371,0.0016339689,0.0002534516,0.6469468,0.3418897,0.00043018168,0.002667311],"study_design_scores_gemma":[0.0009897404,0.00012879964,0.003246268,0.00037910306,0.0000045815805,0.000016470805,0.0001308979,0.045077235,0.9337495,0.014632731,0.0014065664,0.00023811887],"about_ca_topic_score_codex":0.00016218764,"about_ca_topic_score_gemma":0.0000020497744,"teacher_disagreement_score":0.32725698,"about_ca_system_score_codex":0.0005705086,"about_ca_system_score_gemma":0.00020037664,"threshold_uncertainty_score":0.75791353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4704867,0.00014968307,0.16615137,0.3295205,0.015114574,0.0029608402,0.00038802173,0.00031860903,0.014909707],"genre_scores_gemma":[0.99421024,0.000060083064,0.004425111,0.00069348805,0.0002613472,0.000051438146,0.00001046128,0.000018941868,0.00026887562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717546,0.000070121,0.000356664,0.00042901278,0.0016632656,0.00030546612],"domain_scores_gemma":[0.99704,0.00049981097,0.00013247116,0.0003010396,0.0019063845,0.00012032228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011511871,0.0001524814,0.0001746396,0.00006222188,0.000442807,0.00054897537,0.0017231015,0.00007829647,0.00003759131],"category_scores_gemma":[0.00076666044,0.000106385356,0.00010125549,0.0006318579,0.0002203613,0.0002438146,0.00062166376,0.00042403163,0.000008218127],"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.0008166078,0.0038882925,0.0010107477,0.00023884983,0.0003250977,0.00003271324,0.006961789,0.0088597415,0.1162601,0.8405146,0.0097261835,0.011365272],"study_design_scores_gemma":[0.0050215973,0.00030293452,0.00039503834,0.00015497943,0.00002291901,0.000031251777,0.00040207553,0.69266057,0.28508395,0.00764525,0.007996113,0.00028330405],"about_ca_topic_score_codex":0.000034531913,"about_ca_topic_score_gemma":0.0000015645472,"teacher_disagreement_score":0.83286935,"about_ca_system_score_codex":0.0001274807,"about_ca_system_score_gemma":0.00019093846,"threshold_uncertainty_score":0.52937824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85634047,0.00054041337,0.010400012,0.028767679,0.07544325,0.002596935,0.00022637048,0.00040265478,0.025282191],"genre_scores_gemma":[0.9532281,0.00026423513,0.04550761,0.0001658842,0.00052984053,0.000084121035,0.0000419578,0.00003368742,0.00014452908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638784,0.00005128188,0.00056659576,0.00095504796,0.0016633357,0.00037590618],"domain_scores_gemma":[0.9977111,0.00023625018,0.00043447988,0.00042542393,0.0010383513,0.00015440227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001081765,0.00035391032,0.0004022031,0.00020080815,0.00024406218,0.00094932783,0.003695951,0.00032637062,0.000016680155],"category_scores_gemma":[0.00043359058,0.0003080135,0.00020865205,0.0003018849,0.00012918908,0.00029980633,0.0060504493,0.0011999295,0.0000056455365],"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.00014962968,0.0028167109,0.019291358,0.0008169729,0.0011469335,0.00007016418,0.006998152,0.0030262736,0.06127611,0.8973351,0.005068517,0.0020040432],"study_design_scores_gemma":[0.009739325,0.0011295032,0.07735433,0.009245012,0.0003151605,0.00045240164,0.0010920509,0.641916,0.13982221,0.1129097,0.0022355965,0.003788735],"about_ca_topic_score_codex":0.00016811218,"about_ca_topic_score_gemma":5.6026306e-7,"teacher_disagreement_score":0.78442544,"about_ca_system_score_codex":0.00034765754,"about_ca_system_score_gemma":0.0002708383,"threshold_uncertainty_score":0.9999372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8607569,0.00003861394,0.008952842,0.019221345,0.020170383,0.00067213614,0.000024047631,0.0002510469,0.08991268],"genre_scores_gemma":[0.9952764,0.00004660187,0.003433792,0.00013261515,0.00038428692,0.000014263652,0.000004500652,0.000014331629,0.00069323886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971731,0.000021830381,0.0003728887,0.0004846597,0.001674236,0.0002733382],"domain_scores_gemma":[0.997814,0.00024174649,0.00015041632,0.00019195481,0.0014946127,0.00010726635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208692,0.0001631744,0.00017526391,0.00025282204,0.00025790813,0.00043153705,0.001316844,0.000101073376,0.00012691494],"category_scores_gemma":[0.000276054,0.00014248145,0.00016997606,0.0012108422,0.00007378295,0.0005518948,0.0005809436,0.00047472116,0.000031659136],"study_design_candidate":"bench_or_experimental","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.00018051096,0.0014422573,0.014097569,0.00008628584,0.00033248364,0.000014167021,0.0010089275,0.004255677,0.21674266,0.7199289,0.0023951046,0.039515447],"study_design_scores_gemma":[0.0029098568,0.00027204337,0.08740695,0.00021594406,0.000022115824,0.00015575468,0.00023295112,0.13690004,0.75179666,0.015695997,0.0037824174,0.00060925866],"about_ca_topic_score_codex":0.00008093036,"about_ca_topic_score_gemma":0.0000015396937,"teacher_disagreement_score":0.70423293,"about_ca_system_score_codex":0.000294732,"about_ca_system_score_gemma":0.0002453123,"threshold_uncertainty_score":0.58102256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7619923,0.000109656175,0.0050308127,0.06607684,0.016236138,0.00067763426,0.000021173533,0.00036422873,0.14949122],"genre_scores_gemma":[0.9862417,0.000016545673,0.011901554,0.00018605261,0.00076166546,0.00001052492,0.0000025055808,0.000018852657,0.00086057425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969089,0.0000445183,0.00035418698,0.0005031929,0.0018239116,0.00036530435],"domain_scores_gemma":[0.9977738,0.0002755331,0.00013276987,0.00027259646,0.0014405575,0.00010473095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013534077,0.00015920671,0.00020422367,0.00009183673,0.00020398096,0.00039439666,0.0028440983,0.000085046064,0.000021428703],"category_scores_gemma":[0.00044940857,0.00013354681,0.00014850526,0.00063522364,0.000099210796,0.00039188494,0.001480518,0.00047920007,0.000039742685],"study_design_candidate":"bench_or_experimental","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.000051868865,0.00022790158,0.007418774,0.000060311853,0.000096009964,0.000019489227,0.0005918851,0.0011243358,0.11766253,0.86889476,0.0009349481,0.0029172034],"study_design_scores_gemma":[0.0016745309,0.00018732424,0.0059904833,0.000580999,0.000015779207,0.00015664948,0.00017005786,0.09403087,0.88316983,0.010590991,0.0029844616,0.00044802285],"about_ca_topic_score_codex":0.000032956345,"about_ca_topic_score_gemma":5.0863314e-8,"teacher_disagreement_score":0.8583037,"about_ca_system_score_codex":0.00021966129,"about_ca_system_score_gemma":0.00017740019,"threshold_uncertainty_score":0.5445881},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560428,0.000019969499,0.002208418,0.022491535,0.0043316972,0.00050494453,0.000020973723,0.0001256839,0.0142539255],"genre_scores_gemma":[0.99179393,0.00000861618,0.007410068,0.00031131448,0.0002454335,0.0000224061,0.000009796829,0.000020525109,0.00017793433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964143,0.00006442237,0.0004624643,0.00059834286,0.001987501,0.00047299403],"domain_scores_gemma":[0.99793136,0.00033338988,0.00014190162,0.00031212764,0.0011553363,0.00012590259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011091233,0.00021195559,0.00028749838,0.00020441748,0.00016683458,0.0003882357,0.0029404198,0.000121018726,0.000021160948],"category_scores_gemma":[0.00024697313,0.00018877967,0.00014671608,0.0009239774,0.00016769572,0.00029485818,0.0009497933,0.0005681875,0.000027995713],"study_design_candidate":"bench_or_experimental","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.00025140066,0.0011165788,0.014386093,0.00007415406,0.000103074206,0.00004267355,0.0011532891,0.009821972,0.37846595,0.59223634,0.0018015385,0.0005469504],"study_design_scores_gemma":[0.004355362,0.0003470737,0.016392516,0.00025632323,0.0000091596075,0.00004565194,0.00012155169,0.27913886,0.69121766,0.005151106,0.0025455006,0.0004192362],"about_ca_topic_score_codex":0.00013603624,"about_ca_topic_score_gemma":0.000002019993,"teacher_disagreement_score":0.58708525,"about_ca_system_score_codex":0.00046107773,"about_ca_system_score_gemma":0.0003670368,"threshold_uncertainty_score":0.76982117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549646,0.000042308464,0.00939329,0.018337099,0.008517249,0.0003893808,0.000030576615,0.00011106911,0.00821445],"genre_scores_gemma":[0.9966197,0.0000078850735,0.0024518662,0.00011910855,0.0001632532,0.000018494979,0.000008416714,0.000006524019,0.0006047488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870056,0.000019778867,0.00021925957,0.00034625948,0.00054762117,0.00016651792],"domain_scores_gemma":[0.9984908,0.00029542894,0.00013186652,0.0001239249,0.00090184395,0.00005613259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070186734,0.00010092311,0.00016379751,0.000107271895,0.00019396124,0.00022699177,0.0007239696,0.000072339084,0.000009479169],"category_scores_gemma":[0.00017659711,0.00008311585,0.00012628654,0.0006328518,0.00004066552,0.0002228329,0.00030604724,0.00018731137,0.0000013652228],"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.00053403294,0.0006136302,0.12580402,0.00013825546,0.0013589368,0.0000024790866,0.001694522,0.0011122881,0.08084424,0.7756904,0.008508721,0.0036985185],"study_design_scores_gemma":[0.0016566905,0.0003649406,0.013253064,0.00013481804,0.00017851555,0.000013291232,0.00010177278,0.4363423,0.5127901,0.030198205,0.004620167,0.00034612275],"about_ca_topic_score_codex":0.00010385029,"about_ca_topic_score_gemma":0.000003481293,"teacher_disagreement_score":0.74549216,"about_ca_system_score_codex":0.00008944239,"about_ca_system_score_gemma":0.000065419124,"threshold_uncertainty_score":0.3389366},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8001244,0.000083885025,0.041966602,0.05592831,0.026329236,0.0012886992,0.000073617266,0.0005055548,0.07369968],"genre_scores_gemma":[0.99719304,0.00002066749,0.0010728101,0.00014502711,0.00026024293,0.000018205146,0.0000103513385,0.000012860052,0.0012667904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976985,0.000031402717,0.000309036,0.00041118203,0.0013344538,0.00021542647],"domain_scores_gemma":[0.9980445,0.00011591888,0.0001395221,0.00014976093,0.001471971,0.000078360834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052096567,0.00013156632,0.00012729352,0.00009804309,0.00026033202,0.00043761238,0.00092786003,0.000078966514,0.00007740251],"category_scores_gemma":[0.0002628646,0.00011590802,0.00010083886,0.0005641627,0.000085392385,0.00048922736,0.0004508355,0.00030303223,0.000015831583],"study_design_candidate":"bench_or_experimental","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.00008143534,0.00037822226,0.005751733,0.000051596533,0.00007290903,0.0000016209021,0.00030055814,0.00037104698,0.43802723,0.5435933,0.003700097,0.0076702847],"study_design_scores_gemma":[0.0014072829,0.00017845335,0.0025775305,0.000100482706,0.000012452666,0.00005539775,0.000087464236,0.08109336,0.90380687,0.005955313,0.004428997,0.0002963791],"about_ca_topic_score_codex":0.00007821547,"about_ca_topic_score_gemma":0.0000019877696,"teacher_disagreement_score":0.53763795,"about_ca_system_score_codex":0.0003109464,"about_ca_system_score_gemma":0.00023824583,"threshold_uncertainty_score":0.4726592},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425089,0.0000066483417,0.0008446715,0.03810106,0.0013949156,0.0008362457,0.0000040230548,0.00004518207,0.016258363],"genre_scores_gemma":[0.9991414,0.000023624098,0.00027907023,0.00041585823,0.000052559542,0.000018919507,0.0000017076603,0.000006862543,0.000059992497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835324,0.000024298084,0.00032296384,0.00024136479,0.0008706212,0.00018748252],"domain_scores_gemma":[0.9996023,0.000051143597,0.000106833824,0.00007607414,0.00009659418,0.0000670197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039885496,0.000091551105,0.00011478732,0.00011751058,0.000041694468,0.0001255676,0.0014769554,0.000052340103,0.000015440897],"category_scores_gemma":[0.0001417564,0.000079378326,0.00004075604,0.000463493,0.000031343905,0.0006879124,0.0005655447,0.00025411198,0.000017249407],"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.000417121,0.0010842837,0.06856143,0.00014166535,0.000047209334,0.000008300257,0.010272409,0.018516576,0.182026,0.71494794,0.0014127797,0.0025642747],"study_design_scores_gemma":[0.004941166,0.00037561773,0.019044701,0.0002510824,0.0000025980578,0.000004275775,0.00019187137,0.78723603,0.17711015,0.0074895117,0.0030469417,0.00030604625],"about_ca_topic_score_codex":0.00004072714,"about_ca_topic_score_gemma":0.0000017777522,"teacher_disagreement_score":0.7687195,"about_ca_system_score_codex":0.00022678262,"about_ca_system_score_gemma":0.000022021179,"threshold_uncertainty_score":0.32369542},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48029265,0.0003120477,0.36498362,0.06386807,0.053976636,0.0056139557,0.000094849325,0.0012643714,0.02959383],"genre_scores_gemma":[0.8391007,0.000014968709,0.1594521,0.00016018386,0.0005632378,0.000061018345,0.0000036375247,0.000027078157,0.0006170421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978748,0.000021559015,0.00038480374,0.00047879445,0.0009132945,0.00032675144],"domain_scores_gemma":[0.99867606,0.00026269766,0.00018154243,0.00019310856,0.00059951004,0.00008709246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009184407,0.00016581424,0.00021523103,0.00016613393,0.00011288703,0.00024656078,0.0019606147,0.000105878455,0.0000040427926],"category_scores_gemma":[0.00047744712,0.00014497539,0.0001394703,0.0005474547,0.000028316033,0.00032500594,0.00080296013,0.00031287098,0.0000036602312],"study_design_candidate":"bench_or_experimental","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.00017115641,0.0010621018,0.028271737,0.0001940625,0.00015102352,0.000026019936,0.0021929052,0.00045004976,0.17369881,0.76034594,0.004564571,0.028871596],"study_design_scores_gemma":[0.0029206767,0.0004075285,0.0044790357,0.0011622043,0.000014489626,0.000047409998,0.00013636262,0.0851998,0.8795759,0.022236949,0.003354076,0.00046554033],"about_ca_topic_score_codex":0.00012515622,"about_ca_topic_score_gemma":0.0000010030448,"teacher_disagreement_score":0.738109,"about_ca_system_score_codex":0.00038741154,"about_ca_system_score_gemma":0.00019821215,"threshold_uncertainty_score":0.5911925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176597,0.000057762438,0.06219974,0.010514124,0.0032067206,0.00035650947,0.0000046175423,0.00010624806,0.005894591],"genre_scores_gemma":[0.99737895,0.000011652447,0.0021574635,0.0001396288,0.00019870535,0.000006226962,0.0000017757176,0.000014408222,0.00009117106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976788,0.000033796176,0.00033734285,0.00045890326,0.0012128244,0.0002782954],"domain_scores_gemma":[0.9986598,0.00011459908,0.00010386706,0.00012873231,0.00088761863,0.00010539202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132744,0.00015326578,0.00017251249,0.00013300832,0.00030097648,0.0005652319,0.0007671046,0.00010371267,0.000012877525],"category_scores_gemma":[0.00013456694,0.00013640942,0.00008000037,0.00033152362,0.00008297025,0.0005740272,0.0008685203,0.00049765385,0.000001874217],"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.000109353045,0.00026144402,0.026818167,0.000106063184,0.00013936941,0.000011348733,0.003009275,0.30711204,0.18375632,0.47672525,0.00013702906,0.0018143518],"study_design_scores_gemma":[0.00072285515,0.000053445125,0.00051528186,0.00030892843,0.000008033023,0.00006367345,0.0001828782,0.95820767,0.034944803,0.0046957866,0.00013560623,0.00016101697],"about_ca_topic_score_codex":0.000037657053,"about_ca_topic_score_gemma":7.366075e-7,"teacher_disagreement_score":0.6510957,"about_ca_system_score_codex":0.00022569743,"about_ca_system_score_gemma":0.00018213084,"threshold_uncertainty_score":0.5562614},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39868966,0.000018709807,0.017577952,0.1676407,0.015075946,0.0011429959,0.00002656539,0.00034628494,0.39948118],"genre_scores_gemma":[0.9917717,0.000013295728,0.0041289576,0.0005979092,0.00023139716,0.000017680291,0.000002458623,0.000012817758,0.0032237864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977755,0.000028179189,0.00030326121,0.00039354054,0.0012701575,0.00022937245],"domain_scores_gemma":[0.99787146,0.00012583399,0.00007273359,0.00020539873,0.0016027243,0.00012187213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986888,0.0001221842,0.00013766233,0.00013102758,0.00014224724,0.0003049316,0.0015307689,0.000064073116,0.00007678892],"category_scores_gemma":[0.00032915553,0.00010476417,0.00011186394,0.0007674368,0.000058147125,0.0002920313,0.000849212,0.00022793043,0.000047044647],"study_design_candidate":"bench_or_experimental","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.0000712356,0.00020137572,0.0023964709,0.000015485632,0.000057759116,0.0000026360156,0.00047435882,0.00056853297,0.16322352,0.8164431,0.005287129,0.011258434],"study_design_scores_gemma":[0.0017153762,0.00020707394,0.0064729275,0.00014531377,0.000009622186,0.00004341481,0.00016775737,0.018254433,0.9293912,0.00554734,0.037724335,0.00032119005],"about_ca_topic_score_codex":0.00006386213,"about_ca_topic_score_gemma":0.000005871404,"teacher_disagreement_score":0.81089574,"about_ca_system_score_codex":0.00024106045,"about_ca_system_score_gemma":0.0001867705,"threshold_uncertainty_score":0.4272159},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69840795,0.00016321239,0.010863622,0.07250266,0.04239754,0.0021245982,0.00003654993,0.000622551,0.17288135],"genre_scores_gemma":[0.99202734,0.00003943393,0.0038503704,0.00039765734,0.0005130231,0.00004758466,0.000003612544,0.000019040726,0.0031019622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99686664,0.000046905854,0.00032452113,0.0005486301,0.0018858258,0.0003274902],"domain_scores_gemma":[0.9981095,0.00017577129,0.000110401845,0.00029023667,0.0012131552,0.00010090254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010158628,0.00016178048,0.00016289439,0.00011035907,0.00020166823,0.00032525187,0.0026323693,0.000068484056,0.000086788416],"category_scores_gemma":[0.00013739454,0.0001373203,0.00017248,0.00070248573,0.00009914714,0.0003282625,0.001816518,0.00035733948,0.000055763456],"study_design_candidate":"bench_or_experimental","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.000082217346,0.0007811883,0.0035635845,0.00004769312,0.00017601618,0.0000088838515,0.00022203088,0.0015306681,0.10452052,0.8784417,0.008176272,0.0024492259],"study_design_scores_gemma":[0.002663662,0.00020760829,0.004836963,0.00020104897,0.00001797913,0.000032984182,0.0000939528,0.070755616,0.87048036,0.008154026,0.042139977,0.00041583838],"about_ca_topic_score_codex":0.000063813044,"about_ca_topic_score_gemma":0.000002162955,"teacher_disagreement_score":0.87028766,"about_ca_system_score_codex":0.00043709954,"about_ca_system_score_gemma":0.00016947773,"threshold_uncertainty_score":0.5599759},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9217496,0.00046017388,0.000005831636,0.0035783702,0.0034281781,0.00011517877,0.0000035116295,0.00006461022,0.07059458],"genre_scores_gemma":[0.99845487,0.00008362522,0.000021264914,0.000034234145,0.00070332823,0.000013909877,0.0000017153478,0.000024395398,0.00066268066],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865013,0.000010526782,0.00025480142,0.0002291506,0.0006300168,0.00022538571],"domain_scores_gemma":[0.9993831,0.00011631664,0.00005996027,0.000115219176,0.00026894748,0.000056481997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004768945,0.00013966694,0.0001614584,0.00003612371,0.00019490617,0.00016790527,0.00050645706,0.00007775625,0.000016285634],"category_scores_gemma":[0.00010117871,0.00009459298,0.00006456606,0.00021477135,0.00006491453,0.00012788642,0.00022142526,0.00031213666,0.0000038199355],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00039849637,0.0004022756,0.09211958,0.0007120917,0.00083185436,0.00004104452,0.011090903,0.070857875,0.4500259,0.33503258,0.036931247,0.0015561464],"study_design_scores_gemma":[0.007299251,0.00084124994,0.031659964,0.0037257827,0.00013505746,0.0004796667,0.005289,0.1954223,0.529384,0.013938615,0.20999525,0.0018298187],"about_ca_topic_score_codex":0.00003801233,"about_ca_topic_score_gemma":7.224675e-7,"teacher_disagreement_score":0.32109398,"about_ca_system_score_codex":0.00007605835,"about_ca_system_score_gemma":0.000023260103,"threshold_uncertainty_score":0.385739},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384663,0.00006959336,0.00042160583,0.026669575,0.003479452,0.00027672978,0.000009461589,0.00008099398,0.030526264],"genre_scores_gemma":[0.9977688,0.000041381874,0.0012442026,0.0001277028,0.0002256524,0.000016722948,0.0000031022396,0.000016778316,0.0005556369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972755,0.00007546355,0.00038562523,0.0005145578,0.001340647,0.00040821382],"domain_scores_gemma":[0.99811304,0.00063882844,0.00010816512,0.00022764124,0.00080755167,0.00010479063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020480976,0.00017150464,0.00020561111,0.00017839235,0.0004119522,0.00033475284,0.0022292102,0.000113448375,0.000033117656],"category_scores_gemma":[0.0005489236,0.00015009909,0.0001262071,0.0008382395,0.00008616076,0.00043620818,0.0011546056,0.00093529484,0.000029584393],"study_design_candidate":"bench_or_experimental","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.0001937408,0.0008751968,0.04020723,0.00011972582,0.00008545436,0.000038779523,0.0049143997,0.0049744355,0.09496,0.8506632,0.0018374817,0.0011304019],"study_design_scores_gemma":[0.0034200985,0.0005321882,0.0044488083,0.002219742,0.000020187219,0.00009961197,0.0014826999,0.08560401,0.8722743,0.021837516,0.0072675664,0.00079331355],"about_ca_topic_score_codex":0.00026260846,"about_ca_topic_score_gemma":0.0000099222425,"teacher_disagreement_score":0.82882565,"about_ca_system_score_codex":0.0002846754,"about_ca_system_score_gemma":0.00021645847,"threshold_uncertainty_score":0.6120863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9421744,0.00005271894,0.0037973758,0.015445127,0.0053830533,0.00079431885,0.00020972536,0.00012715047,0.032016173],"genre_scores_gemma":[0.9953249,0.000054447963,0.0039948737,0.00010716575,0.000072122064,0.00000917795,0.000018356128,0.000009293291,0.0004096628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975949,0.000025252337,0.00044832984,0.00038212823,0.0013303953,0.00021898483],"domain_scores_gemma":[0.9972913,0.00017727267,0.00026835618,0.00020064208,0.0019754283,0.000086975604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813389,0.00013296067,0.00027712033,0.00026002794,0.000106272855,0.0001536602,0.0016147557,0.000067089764,0.000082692815],"category_scores_gemma":[0.00026101928,0.00010955881,0.0002571127,0.0013658175,0.000082581064,0.00026740384,0.00079127745,0.00027122485,0.0000043191394],"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.000057896446,0.0016440836,0.0038527097,0.00004214317,0.00073683535,0.0000044776375,0.0010934258,0.0019858857,0.090213716,0.89959955,0.00014228528,0.0006269934],"study_design_scores_gemma":[0.004285566,0.0004480575,0.082749456,0.0004735594,0.00022508558,0.000012717245,0.0008730922,0.39374715,0.5068745,0.0062399744,0.003503294,0.00056753535],"about_ca_topic_score_codex":0.000055602006,"about_ca_topic_score_gemma":0.0000067645697,"teacher_disagreement_score":0.8933596,"about_ca_system_score_codex":0.00015858463,"about_ca_system_score_gemma":0.00014417742,"threshold_uncertainty_score":0.44676787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922798,0.00014465589,0.032932807,0.051243797,0.016301986,0.0022765181,0.00008089937,0.00061317283,0.20412637],"genre_scores_gemma":[0.9817689,0.000042367108,0.012894836,0.0001544003,0.00054596853,0.00005157295,0.000010337904,0.000037906688,0.004493695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9951669,0.00010805707,0.00043153242,0.0006764635,0.0032128277,0.0004042118],"domain_scores_gemma":[0.9947268,0.00050150626,0.00016392584,0.00032662236,0.004111547,0.0001696233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008355313,0.00021679899,0.00026035449,0.00025312358,0.00034602065,0.0006455289,0.0023535516,0.0000918796,0.00014679556],"category_scores_gemma":[0.0007766058,0.00016531533,0.00011338182,0.0016685949,0.00017124828,0.0005047654,0.0011504415,0.0006461969,0.000035254718],"study_design_candidate":"bench_or_experimental","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.0007023808,0.0014056691,0.006170795,0.00014007677,0.00049788225,0.00006672754,0.0013244515,0.006437938,0.10681913,0.8696534,0.004065186,0.002716364],"study_design_scores_gemma":[0.004485299,0.0008144083,0.005268644,0.00042867704,0.000031077558,0.00025237855,0.00023392196,0.1965841,0.77959526,0.008128526,0.003513094,0.0006646087],"about_ca_topic_score_codex":0.00006371935,"about_ca_topic_score_gemma":0.0000013096458,"teacher_disagreement_score":0.8615249,"about_ca_system_score_codex":0.0003145778,"about_ca_system_score_gemma":0.0005051717,"threshold_uncertainty_score":0.67413634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57009196,0.0003893707,0.10215405,0.0923912,0.15624742,0.0024387497,0.00004398821,0.0009986634,0.07524459],"genre_scores_gemma":[0.9964698,0.000023923223,0.00189201,0.0001500101,0.0008170753,0.000033681627,0.0000016301517,0.000022111079,0.0005897823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969755,0.00004232961,0.00039945275,0.00049778377,0.0017069698,0.0003779836],"domain_scores_gemma":[0.99771446,0.0006756711,0.00024228742,0.0003033494,0.0009767319,0.00008752643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012479096,0.00020343592,0.00021479996,0.00010497333,0.00043003433,0.00048205297,0.002666554,0.00009288414,0.000018682034],"category_scores_gemma":[0.00091576093,0.00014085561,0.00018659655,0.00064202497,0.000091592665,0.00046310097,0.0010609296,0.0004592745,0.000030127749],"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.0001579369,0.00031252066,0.0036114142,0.00007349435,0.0002589922,0.000011361287,0.00077566376,0.0008152434,0.12962839,0.85080445,0.00303944,0.010511111],"study_design_scores_gemma":[0.0017036591,0.00039537845,0.008056848,0.0007479741,0.000114159826,0.0002744428,0.00030371227,0.21764924,0.64555955,0.1171612,0.0073141293,0.00071970734],"about_ca_topic_score_codex":0.000055120887,"about_ca_topic_score_gemma":3.2460912e-7,"teacher_disagreement_score":0.73364323,"about_ca_system_score_codex":0.00028726648,"about_ca_system_score_gemma":0.000091930895,"threshold_uncertainty_score":0.57439256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92995656,0.000012102101,0.035561003,0.015869359,0.0064285393,0.0005519607,0.000015715268,0.00012205883,0.011482721],"genre_scores_gemma":[0.996142,0.000030400115,0.003351015,0.0001194794,0.00018056874,0.000015748714,0.00000879447,0.00001290619,0.00013902984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978961,0.000035739286,0.00032878257,0.00037977909,0.0011138105,0.00024578936],"domain_scores_gemma":[0.9984348,0.00013503873,0.000107844986,0.00013623635,0.0011176364,0.000068444555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005126728,0.00013279857,0.00015009775,0.0001341742,0.00014797639,0.00043232774,0.0008161932,0.000073679024,0.000066915796],"category_scores_gemma":[0.00013311589,0.000109243294,0.00006082259,0.00073441566,0.00010507248,0.00056563516,0.00039195534,0.00030679101,0.000004384432],"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.0007070858,0.0005771788,0.035349842,0.000062147636,0.00010169469,0.000012299183,0.002984782,0.47300494,0.0097019775,0.4718306,0.00022606285,0.0054413658],"study_design_scores_gemma":[0.0034668061,0.000200795,0.0032340754,0.00026216422,0.00000889244,0.00003982292,0.00039027698,0.6394478,0.34939048,0.0026887055,0.0005571894,0.00031297613],"about_ca_topic_score_codex":0.0000872575,"about_ca_topic_score_gemma":0.0000071145914,"teacher_disagreement_score":0.4691419,"about_ca_system_score_codex":0.0002109955,"about_ca_system_score_gemma":0.0002350425,"threshold_uncertainty_score":0.44548124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896816,0.0000086171685,0.0004159002,0.0049770377,0.0019208662,0.0003995861,0.000018523073,0.000036587084,0.0025412627],"genre_scores_gemma":[0.99913955,0.0000021870505,0.00065303565,0.000063138206,0.00005772717,0.000045935863,5.648705e-7,0.000008357522,0.000029521982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975884,0.00004617705,0.00045852026,0.0003594638,0.0013568503,0.0001905979],"domain_scores_gemma":[0.9981289,0.0005591871,0.00026915144,0.00025605396,0.00072892586,0.00005780117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016201203,0.00012128554,0.00020383141,0.0000853092,0.00022769332,0.00006673363,0.0022183293,0.000038942122,0.000034826928],"category_scores_gemma":[0.0008081409,0.00010234698,0.000113841656,0.0003268129,0.00022876252,0.00019140383,0.0012844796,0.00028076576,8.627368e-7],"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.00039997173,0.00073698105,0.037514772,0.00007681951,0.0000328029,6.673131e-7,0.00075515313,0.0005270616,0.031356875,0.927052,0.00018438185,0.0013624856],"study_design_scores_gemma":[0.0005401112,0.00058774935,0.0038267851,0.00004382687,0.000012196312,0.0000057556654,0.00034797058,0.046365958,0.7631292,0.18399605,0.00093064416,0.0002137658],"about_ca_topic_score_codex":0.0001517582,"about_ca_topic_score_gemma":0.0000010498587,"teacher_disagreement_score":0.743056,"about_ca_system_score_codex":0.0002430606,"about_ca_system_score_gemma":0.000119393175,"threshold_uncertainty_score":0.41735888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100468,0.000018359133,0.031378027,0.017427295,0.009933539,0.0011425272,0.00003676797,0.00029738585,0.029719314],"genre_scores_gemma":[0.99499387,4.6384383e-7,0.0039114556,0.00014822386,0.000639988,0.00003272946,0.0000039612173,0.000020854965,0.00024848356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977074,0.000016481144,0.00034227685,0.0004625639,0.0010467593,0.00042446397],"domain_scores_gemma":[0.99825495,0.00054406904,0.00016966555,0.00021521152,0.0006940169,0.00012210158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431917,0.00018101041,0.00018394265,0.00014554399,0.00036470353,0.0003579089,0.0028528385,0.00014749568,0.00001001328],"category_scores_gemma":[0.00024595126,0.00014666199,0.00014963254,0.000287079,0.00016664444,0.0003228045,0.0006439711,0.0007594696,0.0000059630715],"study_design_candidate":"bench_or_experimental","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.00030954194,0.00015498276,0.0048491415,0.00008881344,0.00006351537,0.0000015015668,0.0012537355,0.0010329694,0.28526443,0.6986836,0.0018022934,0.006495479],"study_design_scores_gemma":[0.0027942036,0.00074310595,0.00053643616,0.0003260206,0.000017222827,0.000039202685,0.00028371735,0.236428,0.73216313,0.014766165,0.011410229,0.00049255614],"about_ca_topic_score_codex":0.00010456406,"about_ca_topic_score_gemma":7.6775177e-7,"teacher_disagreement_score":0.6839174,"about_ca_system_score_codex":0.00010048647,"about_ca_system_score_gemma":0.00015481516,"threshold_uncertainty_score":0.5980702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.756433,0.000070154514,0.0004950672,0.014574803,0.01001284,0.0003740815,0.00001778512,0.00015089479,0.21787138],"genre_scores_gemma":[0.99569553,0.00004031737,0.00031572007,0.00015422789,0.000356598,0.000012662814,0.0000025498261,0.000014273682,0.0034080972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997375,0.000039685452,0.00028769576,0.0004718333,0.0014755536,0.00035021082],"domain_scores_gemma":[0.99768144,0.00020167507,0.000102035265,0.00025158544,0.0016458919,0.00011737196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094264984,0.00015851737,0.00018749287,0.00008527629,0.00018735274,0.00039947787,0.002850848,0.00007732123,0.000054310065],"category_scores_gemma":[0.00029357808,0.000121356534,0.00016005487,0.0005634923,0.0001231872,0.00036387538,0.0015807528,0.0003890314,0.00007990487],"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.0000566457,0.00030335228,0.0043761386,0.000030745206,0.00006614088,0.0000052880328,0.000988423,0.000036053327,0.049848963,0.9397916,0.003376845,0.0011197802],"study_design_scores_gemma":[0.0014433716,0.00022769107,0.002568924,0.00012270325,0.000008158295,0.000037181944,0.00012781333,0.0049797604,0.9029542,0.06678495,0.020446768,0.0002984754],"about_ca_topic_score_codex":0.00006579721,"about_ca_topic_score_gemma":0.0000022210018,"teacher_disagreement_score":0.8730067,"about_ca_system_score_codex":0.00022000611,"about_ca_system_score_gemma":0.00022158177,"threshold_uncertainty_score":0.5297633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53858477,0.000040355164,0.0009472008,0.26340804,0.028182093,0.0006447303,0.000032520773,0.0002764259,0.16788386],"genre_scores_gemma":[0.9950186,0.00003489145,0.0014792507,0.0015533518,0.0005324824,0.000011720677,0.000007628581,0.000013586984,0.0013484637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817747,0.000010924679,0.00020773403,0.00033255416,0.0010810766,0.0001902393],"domain_scores_gemma":[0.99898195,0.000057493336,0.000095000396,0.00021384175,0.0005977833,0.000053950436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039250284,0.00010416348,0.00011056084,0.000071553426,0.00009840627,0.00037298922,0.0026231082,0.00003875893,0.000019482448],"category_scores_gemma":[0.00012455977,0.00008312854,0.00009563974,0.00053399557,0.000049919763,0.00054192916,0.0015771973,0.00018449141,0.000022855105],"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.000028567965,0.00027123562,0.0021272488,0.00002078436,0.00008279904,0.000004389153,0.00017718934,0.000015129967,0.04745058,0.9234004,0.024702156,0.001719508],"study_design_scores_gemma":[0.0021138554,0.00019885664,0.003808613,0.00016999633,0.000017266106,0.000017827031,0.00013129195,0.011520932,0.79292005,0.055240586,0.13348578,0.00037493822],"about_ca_topic_score_codex":0.00002581463,"about_ca_topic_score_gemma":5.490347e-7,"teacher_disagreement_score":0.86815983,"about_ca_system_score_codex":0.000094504714,"about_ca_system_score_gemma":0.000025927553,"threshold_uncertainty_score":0.48744312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076962,0.0000036339502,0.00006209597,0.016671196,0.011914886,0.00018503134,0.0000015786571,0.00008869112,0.06337671],"genre_scores_gemma":[0.99819314,0.000004461018,0.0008565673,0.00012715539,0.00033878404,0.000009962327,2.0831064e-7,0.0000064274845,0.00046327172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998478,0.000005741286,0.0001871954,0.0002642986,0.0008758255,0.0001889344],"domain_scores_gemma":[0.99906164,0.000113899085,0.0000994152,0.0002005188,0.00047450126,0.000050010858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046032976,0.00010111383,0.00011002495,0.00005773162,0.00010588364,0.00019503996,0.00343413,0.000075181226,0.000018452623],"category_scores_gemma":[0.00023262326,0.00006996858,0.000087593915,0.0002072005,0.00009515247,0.00030274192,0.0007878243,0.0003595376,0.000026021436],"study_design_candidate":"bench_or_experimental","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.000023266699,0.000098195516,0.004797043,0.0000066008834,0.000016412208,2.5802933e-7,0.00016201852,0.0000030667193,0.19384705,0.79932624,0.0012251866,0.00049466337],"study_design_scores_gemma":[0.00077166554,0.00016896866,0.009658246,0.000038889488,0.0000049449495,0.000015802649,0.000037725487,0.0025387022,0.8968489,0.07573308,0.014010618,0.00017246781],"about_ca_topic_score_codex":0.000064701635,"about_ca_topic_score_gemma":0.0000023969317,"teacher_disagreement_score":0.7235932,"about_ca_system_score_codex":0.000038782426,"about_ca_system_score_gemma":0.000045616234,"threshold_uncertainty_score":0.6381525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4168236,0.000054890897,0.0013661599,0.09052603,0.028838264,0.00067501736,0.000030434623,0.00027600076,0.4614096],"genre_scores_gemma":[0.9938968,0.000029332557,0.001325435,0.00028633233,0.00038858433,0.000011414304,0.0000033088093,0.000009487592,0.0040493063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99828905,0.0000093524195,0.00018286274,0.00031615124,0.0010286992,0.00017388462],"domain_scores_gemma":[0.9990263,0.000052427706,0.00008369796,0.00021136252,0.00058046763,0.000045723715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036218175,0.000093873925,0.00009955173,0.000047438618,0.00009703681,0.0003541802,0.0027411229,0.000035143934,0.000028560113],"category_scores_gemma":[0.00010217837,0.00007329549,0.00008570135,0.0003805428,0.000039321974,0.0005350279,0.0017222866,0.0001675688,0.000033850487],"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.000014619596,0.00018048177,0.0009200377,0.000014666759,0.000042643187,0.000001655274,0.00009771186,0.000011391849,0.030280035,0.961489,0.005721481,0.0012262538],"study_design_scores_gemma":[0.0012755207,0.00014644324,0.0020209644,0.0001166513,0.00001076001,0.000011769723,0.00006582107,0.0072410735,0.84788483,0.057901762,0.083076425,0.00024797954],"about_ca_topic_score_codex":0.000017020928,"about_ca_topic_score_gemma":3.4746662e-7,"teacher_disagreement_score":0.9035873,"about_ca_system_score_codex":0.00007829097,"about_ca_system_score_gemma":0.00004591706,"threshold_uncertainty_score":0.5093734},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96485615,0.000038188195,0.008770013,0.017726474,0.0017705996,0.0016543131,0.0000067214855,0.00031844963,0.0048590885],"genre_scores_gemma":[0.9948918,0.0000117644195,0.0042343964,0.00017846133,0.00016226123,0.00024063086,0.0000022203576,0.000017002536,0.0002614503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975039,0.000029273333,0.0002997163,0.0004992973,0.0013971722,0.00027066335],"domain_scores_gemma":[0.9987585,0.00010515157,0.00011620687,0.0001871057,0.0007190653,0.000113991715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012159324,0.00014789685,0.00015772144,0.00018586587,0.0006193339,0.00031745338,0.0024879645,0.000047860292,0.0000062855966],"category_scores_gemma":[0.000118838005,0.0001368124,0.00006948416,0.00071843097,0.000043720363,0.00023911706,0.0024837945,0.0003629012,0.000007641223],"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.00023988448,0.0012594333,0.0029280595,0.00010330281,0.000104840634,0.0000011976178,0.0036788734,0.04456941,0.046671,0.89391416,0.00047041182,0.0060594366],"study_design_scores_gemma":[0.001567069,0.001823889,0.00048792735,0.00029108408,0.00001966632,0.000054903026,0.00040797837,0.5997191,0.3716436,0.016260074,0.007034997,0.0006897282],"about_ca_topic_score_codex":0.00015636234,"about_ca_topic_score_gemma":0.0000012838782,"teacher_disagreement_score":0.8776541,"about_ca_system_score_codex":0.00028948198,"about_ca_system_score_gemma":0.000073086376,"threshold_uncertainty_score":0.5579048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82292205,0.0010254331,0.009628237,0.1037064,0.008347123,0.0032670866,0.00003685459,0.0003760376,0.050690804],"genre_scores_gemma":[0.9962807,0.00011408051,0.002892153,0.00006294272,0.00022396399,0.00009491174,0.000002052974,0.000022178465,0.00030698604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963713,0.00008587979,0.00025920948,0.0005438263,0.00238391,0.0003558301],"domain_scores_gemma":[0.9987809,0.0002298237,0.00011740819,0.00022986894,0.0005186058,0.00012338057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014960689,0.00016904165,0.00019609698,0.00017290413,0.00039393085,0.00027094022,0.0028615813,0.000042113443,0.00003008093],"category_scores_gemma":[0.00007861282,0.00012688956,0.000060985025,0.00048762432,0.00018152298,0.00033630835,0.0028053648,0.0006445181,0.0000014860201],"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.00048760683,0.00055936316,0.0009175203,0.000054914926,0.00015024288,0.000005333641,0.0016877365,0.12828848,0.00053979456,0.85657203,0.00032331067,0.010413647],"study_design_scores_gemma":[0.0011714192,0.00078941206,0.0009090505,0.000019370455,0.0000067448627,0.000061076724,0.00039559076,0.9921149,0.0026424741,0.00092445395,0.000777774,0.000187721],"about_ca_topic_score_codex":0.000025219759,"about_ca_topic_score_gemma":3.2905945e-7,"teacher_disagreement_score":0.86382645,"about_ca_system_score_codex":0.00017026061,"about_ca_system_score_gemma":0.00007351946,"threshold_uncertainty_score":0.5317578},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9476995,0.000008526912,0.0010111972,0.0050480133,0.008328986,0.0002009918,0.000007035951,0.00009730184,0.037598465],"genre_scores_gemma":[0.99841666,0.0000026251223,0.000568069,0.000029676738,0.00026838228,0.000007921284,0.000001540136,0.000009545138,0.00069555116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984286,0.000014227056,0.000280183,0.00025114263,0.00083612103,0.00018975131],"domain_scores_gemma":[0.9986767,0.0002524731,0.00020857257,0.0001460661,0.0006541627,0.00006200328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007310787,0.000110795234,0.00013621025,0.00010566212,0.00018611999,0.0001153803,0.0017296879,0.00008071832,0.00002786957],"category_scores_gemma":[0.00032162553,0.00008900623,0.00010492277,0.0003033831,0.00009272886,0.00022258903,0.00037430826,0.0006806562,0.000013089871],"study_design_candidate":"bench_or_experimental","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.00007251387,0.00018538695,0.026553242,0.00004090863,0.000051589886,4.86188e-7,0.00047753358,0.0004710871,0.27744082,0.692557,0.0013713691,0.0007780799],"study_design_scores_gemma":[0.0028753327,0.0015586548,0.01450977,0.00056861475,0.000047777456,0.000053703898,0.0002054714,0.07038131,0.8183884,0.059231773,0.031464826,0.00071434444],"about_ca_topic_score_codex":0.000094207746,"about_ca_topic_score_gemma":7.9214885e-7,"teacher_disagreement_score":0.6333252,"about_ca_system_score_codex":0.000037203434,"about_ca_system_score_gemma":0.000074370924,"threshold_uncertainty_score":0.36295685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556564,0.000008324505,0.017749857,0.01340862,0.006483017,0.0016453504,0.00007888642,0.00042916197,0.0045404006],"genre_scores_gemma":[0.99859047,0.0000023799496,0.0007128004,0.000102008955,0.0003390587,0.000063599284,0.000059714366,0.00001888744,0.000111097856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977065,0.00001063015,0.00027667926,0.00043685312,0.0011858217,0.00038356183],"domain_scores_gemma":[0.99873793,0.00024385731,0.00015176319,0.00018091184,0.00060759473,0.00007795587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973107,0.00016905184,0.0001562303,0.00019778288,0.00024640773,0.00048767184,0.0021916397,0.00004565413,0.0000044331746],"category_scores_gemma":[0.000047025347,0.00012875824,0.00010932753,0.0005623553,0.0001314732,0.0005800552,0.00043161167,0.00028444186,0.0000051435413],"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.001085423,0.0005549347,0.006191266,0.00025483096,0.000321313,0.000022590815,0.00039736842,0.055494927,0.011686872,0.9041523,0.008574914,0.011263289],"study_design_scores_gemma":[0.0023414348,0.00051963556,0.0029768988,0.00024280787,0.000014252375,0.000007368831,0.00008394174,0.9485594,0.034233704,0.010118,0.00063952105,0.00026305806],"about_ca_topic_score_codex":0.00002918415,"about_ca_topic_score_gemma":1.9951351e-7,"teacher_disagreement_score":0.89403427,"about_ca_system_score_codex":0.00008235452,"about_ca_system_score_gemma":0.000049075,"threshold_uncertainty_score":0.5250609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808162,0.000013088492,0.00043557023,0.0024341582,0.003696258,0.0004975485,0.000024416862,0.00022010479,0.011862691],"genre_scores_gemma":[0.99626946,0.000030820305,0.002482131,0.000051235533,0.00037149395,0.00004347051,0.0000057299776,0.00005451014,0.00069113134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977455,0.000036732716,0.00040761146,0.00034766996,0.0010695427,0.00039294414],"domain_scores_gemma":[0.99899125,0.00029035204,0.000043980395,0.000117293275,0.00038857266,0.00016852227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016191152,0.00019394982,0.00026975712,0.00044692468,0.00011914669,0.00014739792,0.0007111633,0.000099952435,0.00004361844],"category_scores_gemma":[0.0004503546,0.00018880796,0.0000600788,0.00050067925,0.000063776795,0.00013323469,0.00053781917,0.0004433323,0.00010102608],"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.0006754184,0.0003049567,0.17762432,0.00032110183,0.000252469,0.000005367095,0.0049973032,0.6537867,0.11665661,0.027728137,0.014161415,0.0034862102],"study_design_scores_gemma":[0.0025538537,0.0002513354,0.14282367,0.000625716,0.00002332984,0.00001261971,0.0004622067,0.74243855,0.10091705,0.0027665528,0.0064260704,0.0006990339],"about_ca_topic_score_codex":0.0002595226,"about_ca_topic_score_gemma":0.000018338786,"teacher_disagreement_score":0.08865187,"about_ca_system_score_codex":0.0004842031,"about_ca_system_score_gemma":0.000036077916,"threshold_uncertainty_score":0.7699365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.952247,0.0000041678322,0.0008524384,0.017320467,0.008822244,0.00066453463,0.000005703003,0.00034619292,0.019737255],"genre_scores_gemma":[0.9985637,0.000019793522,0.000798316,0.000063932675,0.00012792076,0.00003371671,0.0000030575263,0.000012371011,0.00037718177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9975938,0.000009142041,0.00031400318,0.00034619743,0.0014781404,0.00025867482],"domain_scores_gemma":[0.9990498,0.0000838586,0.00016477666,0.00015499962,0.00047126075,0.00007533441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821374,0.00013335214,0.00012348278,0.00017692611,0.00018689937,0.00033827085,0.0017483934,0.00007152949,0.000028641578],"category_scores_gemma":[0.000043620497,0.0001089512,0.00012022222,0.00061199197,0.000063621286,0.00034419482,0.0006657167,0.0002608848,0.00006898605],"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.00006622708,0.00030461722,0.013030159,0.000035619756,0.00010077972,0.0000037253965,0.0013264912,0.0007722148,0.038001996,0.93355554,0.00086614426,0.01193646],"study_design_scores_gemma":[0.01022915,0.0011848216,0.5862338,0.00084608706,0.000052285035,0.000113992784,0.0025654598,0.06128956,0.14911263,0.11760716,0.06884276,0.0019223216],"about_ca_topic_score_codex":0.000025743035,"about_ca_topic_score_gemma":0.000002974761,"teacher_disagreement_score":0.8159484,"about_ca_system_score_codex":0.0002695111,"about_ca_system_score_gemma":0.000062496,"threshold_uncertainty_score":0.4442901},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940274,0.000004797079,0.004327564,0.019283382,0.010751104,0.00073172053,0.000008700551,0.0003514629,0.02426726],"genre_scores_gemma":[0.9985353,0.000046978403,0.00092336396,0.000089190646,0.0001144091,0.000019677413,0.00000449995,0.00000978316,0.000256807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983983,0.000010681781,0.0002811257,0.000280984,0.000843622,0.00018530159],"domain_scores_gemma":[0.99920535,0.00008901521,0.00011447795,0.00012436416,0.00042316673,0.000043636715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005446163,0.00010195848,0.00010837308,0.00024511266,0.00010980553,0.00016587593,0.0010996812,0.000072474686,0.000029918405],"category_scores_gemma":[0.00015705448,0.00008593895,0.00006475049,0.0011276089,0.000055816567,0.00042606116,0.00041809506,0.00018976568,0.0000207725],"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.00014985017,0.00022486194,0.03657438,0.000027958553,0.0000264704,0.000002162182,0.0011653338,0.15616956,0.02898722,0.77055115,0.0022312468,0.003889795],"study_design_scores_gemma":[0.0019419558,0.00015365412,0.022726905,0.00017988532,0.0000028714774,0.0000075270295,0.0001298701,0.91944844,0.041129813,0.013030094,0.0009998517,0.00024914974],"about_ca_topic_score_codex":0.00004306623,"about_ca_topic_score_gemma":0.0000023659877,"teacher_disagreement_score":0.76327884,"about_ca_system_score_codex":0.00017031221,"about_ca_system_score_gemma":0.000061008046,"threshold_uncertainty_score":0.35044888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97867966,0.000009695414,4.70751e-8,0.00495071,0.0024249533,0.0005416551,0.00006962184,0.00008753557,0.013236108],"genre_scores_gemma":[0.9986625,0.00003431252,0.00000970699,0.00009279518,0.00047722508,0.000027928814,0.00004071213,0.000030354387,0.00062446523],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99672693,0.000017614797,0.0004440333,0.00038540812,0.0020550804,0.00037093117],"domain_scores_gemma":[0.99868554,0.0002231923,0.00011233686,0.00018774356,0.00065100874,0.00014015097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009668554,0.0001738691,0.00028677963,0.00026811473,0.000079817655,0.000086305394,0.0009546535,0.00008157674,0.00011802916],"category_scores_gemma":[0.0005185754,0.00013376752,0.00014594449,0.00071198103,0.00013301201,0.00013305857,0.0005706464,0.00049637177,0.00013842875],"study_design_candidate":"observational","study_design_consensus":"observational","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.0018900682,0.00057670154,0.87441754,0.0003200388,0.00020925874,0.0000438452,0.0007730086,0.0002586111,0.069352224,0.04481,0.0066313897,0.00071733503],"study_design_scores_gemma":[0.0029184562,0.00024077184,0.96708286,0.00035261424,0.000016597101,0.000013533109,0.00022745568,0.0012428521,0.024438744,0.0019731105,0.0013204111,0.00017258649],"about_ca_topic_score_codex":0.0002375279,"about_ca_topic_score_gemma":0.0000054156712,"teacher_disagreement_score":0.09266535,"about_ca_system_score_codex":0.00039579734,"about_ca_system_score_gemma":0.0001258313,"threshold_uncertainty_score":0.5454881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9055866,0.00013187036,0.000057579684,0.0033768986,0.022729471,0.0004249734,0.00006888917,0.00010878541,0.06751495],"genre_scores_gemma":[0.9963921,0.000025089777,0.00019306291,0.00008176236,0.002149206,0.000042343727,0.0000017197176,0.0000310869,0.0010836612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99133676,0.000045010474,0.0016313724,0.00087700714,0.005749918,0.0003599204],"domain_scores_gemma":[0.992626,0.004466649,0.00037163415,0.00038056888,0.0020040364,0.00015112807],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0059534623,0.00025156097,0.0003716145,0.00052218005,0.00037572507,0.002055231,0.0028743392,0.00010215856,0.0001569717],"category_scores_gemma":[0.0082169315,0.00016211321,0.00037481496,0.0011405805,0.00012236318,0.0009691101,0.0010359323,0.00057584385,0.00023055112],"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.0012323329,0.00026863033,0.0004537748,0.000027483467,0.00015174378,0.000022335626,0.0025934095,0.0007051207,0.123308,0.8040628,0.035086654,0.03208775],"study_design_scores_gemma":[0.0050239293,0.000927154,0.008933839,0.0036133497,0.00004380403,0.00016688944,0.0033061095,0.060085837,0.22056444,0.2916263,0.40447518,0.0012331718],"about_ca_topic_score_codex":0.00013492495,"about_ca_topic_score_gemma":0.0000040122663,"teacher_disagreement_score":0.51243645,"about_ca_system_score_codex":0.00023316029,"about_ca_system_score_gemma":0.00014236252,"threshold_uncertainty_score":0.99898076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39467764,0.000350182,0.5264731,0.013578836,0.039630044,0.0017171405,0.00011713846,0.001195755,0.022260139],"genre_scores_gemma":[0.99359906,0.000012502917,0.005099484,0.00011485471,0.00055955735,0.000026681031,0.000006505858,0.000038333023,0.0005430069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588495,0.000029249419,0.00049969135,0.0007718748,0.002201827,0.0006124077],"domain_scores_gemma":[0.9985055,0.0003051259,0.00011945566,0.00028805571,0.000603971,0.00017790284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015343999,0.0002899629,0.00028046066,0.00023225383,0.0002594048,0.0006686439,0.0032351045,0.00017243228,0.000022458635],"category_scores_gemma":[0.0000900791,0.00023284538,0.0002088417,0.0006211995,0.00013593643,0.0006902194,0.0012047545,0.0009631105,0.000101253296],"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.00084186235,0.004703726,0.0149316415,0.0011210674,0.0011881969,0.00036753554,0.02764535,0.07411933,0.30310592,0.5377501,0.014226965,0.019998275],"study_design_scores_gemma":[0.0015566661,0.00034936258,0.007018922,0.0008255695,0.000016683345,0.00007830678,0.00020394393,0.9192928,0.06184926,0.0063084452,0.0020719029,0.00042811464],"about_ca_topic_score_codex":0.000108771834,"about_ca_topic_score_gemma":3.7654493e-7,"teacher_disagreement_score":0.8451735,"about_ca_system_score_codex":0.0004467871,"about_ca_system_score_gemma":0.00017673349,"threshold_uncertainty_score":0.94951594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9005185,0.00012338482,0.0060006543,0.05022695,0.0044713127,0.0010589923,0.000060266837,0.00031963337,0.03722031],"genre_scores_gemma":[0.99852204,0.000019638985,0.00052849005,0.00010989552,0.0001321046,0.000014611551,0.000006973989,0.000010804279,0.0006554599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980546,0.000029122744,0.00028309127,0.0004585463,0.000935554,0.00023908545],"domain_scores_gemma":[0.9992533,0.00023684568,0.00005521118,0.00015443233,0.00024075576,0.000059469647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014606052,0.0001343729,0.00020454127,0.00052160025,0.000078491525,0.0009609741,0.0016383342,0.000058361955,0.000019464556],"category_scores_gemma":[0.000062537314,0.00010646297,0.0000994059,0.00123801,0.000117863274,0.00056806434,0.00076525676,0.00029501945,0.000016110878],"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.00010575218,0.00028771829,0.0123271635,0.0001264465,0.0005025893,0.000011638362,0.0005293522,0.00024210988,0.043377496,0.9334217,0.0011404238,0.0079276245],"study_design_scores_gemma":[0.0015216009,0.00026824203,0.0068528755,0.00038953166,0.00009022355,0.0000036964075,0.00005280073,0.8601962,0.11176824,0.007698028,0.010783504,0.00037509992],"about_ca_topic_score_codex":0.00019831798,"about_ca_topic_score_gemma":0.0000019753502,"teacher_disagreement_score":0.9257237,"about_ca_system_score_codex":0.00013817239,"about_ca_system_score_gemma":0.000058289097,"threshold_uncertainty_score":0.92666954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886566,0.000005637105,0.0028198645,0.0023937812,0.0016035655,0.000884964,0.0000066217626,0.00025752615,0.0033714534],"genre_scores_gemma":[0.99894434,0.0000026142034,0.00033804352,0.000113674774,0.0003522838,0.000078431985,0.0000010485475,0.00002188053,0.00014768934],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974208,0.000033391334,0.0002512663,0.0005569965,0.0014840083,0.0002535596],"domain_scores_gemma":[0.99870497,0.00010519558,0.00007427233,0.00021129125,0.00082852185,0.000075769174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751022,0.00020385311,0.00015676086,0.00022978743,0.00023598954,0.00070273806,0.0011249401,0.00005876621,0.000009254935],"category_scores_gemma":[0.00002758459,0.00013055243,0.00006317125,0.00065626536,0.00018108512,0.00065178325,0.00027955082,0.0005098734,0.000009308196],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0015529884,0.003461323,0.005092089,0.00025826902,0.0009231752,0.0029987525,0.013665587,0.00084172,0.7523086,0.17328025,0.0018438784,0.043773364],"study_design_scores_gemma":[0.00095609087,0.004713382,0.00009270433,0.00019669239,0.000020171325,0.0026634636,0.00050811336,0.029586025,0.96011466,0.0007641828,0.00011842439,0.00026606623],"about_ca_topic_score_codex":0.0004193538,"about_ca_topic_score_gemma":0.000008054132,"teacher_disagreement_score":0.20780608,"about_ca_system_score_codex":0.00029734566,"about_ca_system_score_gemma":0.00013789239,"threshold_uncertainty_score":0.67765194},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5319032,0.0041583907,0.16766064,0.15929376,0.035208013,0.003987844,0.0006352536,0.000510897,0.096642],"genre_scores_gemma":[0.9992609,0.000047829362,0.000027676186,0.000029811354,0.0004109939,0.00010566773,0.000002773065,0.000013571985,0.00010078719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912804,0.0000015279136,0.00032855355,0.00025158975,0.00015844351,0.00013181297],"domain_scores_gemma":[0.9995068,0.00011910681,0.000101654856,0.00007397452,0.0001656625,0.000032818767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237888,0.000090259986,0.000116691044,0.00006787459,0.00026680372,0.00027445145,0.0004026391,0.00005526257,0.0000037282896],"category_scores_gemma":[0.00007401057,0.00006688668,0.00006534984,0.00024908574,0.00008593863,0.00022071971,0.000080451806,0.00016587485,0.000033116754],"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.000036057354,0.00002648489,0.000021091786,0.00005582055,0.000027140297,7.8751874e-8,0.00041894417,0.00004452889,0.00063392456,0.99822384,0.00016471495,0.00034737476],"study_design_scores_gemma":[0.00046346828,0.00016832381,0.00038929345,0.000252312,0.00001617029,0.000010960038,0.00047843618,0.040741898,0.0023316343,0.94830626,0.0066560064,0.00018525062],"about_ca_topic_score_codex":0.00008637584,"about_ca_topic_score_gemma":0.0000012675795,"teacher_disagreement_score":0.46735767,"about_ca_system_score_codex":0.00014655446,"about_ca_system_score_gemma":0.000020097003,"threshold_uncertainty_score":0.27275595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681872,0.00006476485,0.00008876414,0.0068644434,0.005863398,0.00034310648,0.000014094985,0.0001782601,0.018395972],"genre_scores_gemma":[0.99915123,0.00002818992,0.00017466336,0.000050254133,0.00026913398,0.000018450593,7.5571467e-7,0.000035510835,0.0002717998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985868,0.000018650418,0.00028351284,0.00015096442,0.0008107046,0.00014937246],"domain_scores_gemma":[0.9991907,0.00027923987,0.000046191584,0.00010636011,0.0003478981,0.000029641331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793578,0.00012491182,0.00012659321,0.000080557686,0.00005413591,0.00010014536,0.0007952173,0.00006429776,0.00002837334],"category_scores_gemma":[0.00038026462,0.00007568076,0.00009614417,0.0002554714,0.000091916474,0.00007971117,0.0001458191,0.00033957677,0.000012406904],"study_design_candidate":"bench_or_experimental","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.00009722838,0.00009620262,0.0002907607,0.00028861215,0.00022360866,4.3790055e-7,0.000767942,0.02400205,0.23768844,0.73012704,0.006102399,0.00031528878],"study_design_scores_gemma":[0.0002405105,0.00011897702,0.0000676871,0.0005674478,0.000021185973,0.0000030659971,0.00007529378,0.18084444,0.80796725,0.0072889454,0.0026807382,0.00012448942],"about_ca_topic_score_codex":0.0000152546545,"about_ca_topic_score_gemma":1.1373297e-7,"teacher_disagreement_score":0.7228381,"about_ca_system_score_codex":0.00014610671,"about_ca_system_score_gemma":0.000026889655,"threshold_uncertainty_score":0.30861717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3425655,0.00017109538,0.6158391,0.00728519,0.02395051,0.0037503943,0.00012132047,0.0011264627,0.0051904013],"genre_scores_gemma":[0.94342715,0.0000023390305,0.05554388,0.00003724538,0.00043012062,0.000096412274,0.000009214162,0.000044004664,0.00040964887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710125,0.000013770102,0.00042334784,0.00064469635,0.0013560198,0.00046088902],"domain_scores_gemma":[0.99828243,0.00045626095,0.00018279778,0.00019782079,0.000763457,0.00011723596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940915,0.0002764962,0.00026122446,0.00017302614,0.00020931482,0.0007545582,0.0019729761,0.000110894194,0.000004063919],"category_scores_gemma":[0.00023349235,0.00019890117,0.0001544113,0.00041055778,0.00011112746,0.00027394647,0.00049065845,0.0005483614,0.000019810073],"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.0020350139,0.0039113313,0.00200641,0.0013642409,0.0014310059,0.00015193014,0.009068777,0.27710018,0.10053451,0.5707645,0.008278945,0.023353187],"study_design_scores_gemma":[0.0015876584,0.00073869876,0.00077457493,0.0010764094,0.00003078638,0.000049324237,0.0000635547,0.9642878,0.028121172,0.0008410758,0.0020778482,0.00035109153],"about_ca_topic_score_codex":0.000024986324,"about_ca_topic_score_gemma":6.665765e-8,"teacher_disagreement_score":0.6871876,"about_ca_system_score_codex":0.00030363124,"about_ca_system_score_gemma":0.00018143641,"threshold_uncertainty_score":0.8110954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93241596,0.00007471317,0.009659056,0.04210728,0.011629212,0.0006884275,0.000008641307,0.00018978358,0.0032269375],"genre_scores_gemma":[0.9964589,0.000023709474,0.0016732486,0.00002722951,0.00048427822,0.0001248181,0.000006167111,0.000012798329,0.0011888914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.000019633297,0.00026677042,0.00040942762,0.0006961767,0.0002380173],"domain_scores_gemma":[0.999068,0.00016670243,0.000058477937,0.000100311016,0.0005665971,0.000039892457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999062,0.00011764964,0.0001105472,0.0002593025,0.000205741,0.0003205949,0.0011125224,0.000078019984,0.000007929191],"category_scores_gemma":[0.00014557196,0.0000970691,0.000089001885,0.0006372766,0.00005242437,0.00045427898,0.000353423,0.00036268905,0.00001175149],"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.000011491076,0.00022047038,0.0070781065,0.00004099464,0.000046871355,5.70742e-7,0.0005027474,0.0013894408,0.058883063,0.9279874,0.0022241035,0.0016147573],"study_design_scores_gemma":[0.0008496748,0.00048846984,0.00067715824,0.00034289618,0.000010967268,0.0000126993755,0.0005888821,0.7068974,0.22986463,0.046337742,0.013630469,0.00029904972],"about_ca_topic_score_codex":0.00010031896,"about_ca_topic_score_gemma":0.0000028298941,"teacher_disagreement_score":0.8816496,"about_ca_system_score_codex":0.00039406738,"about_ca_system_score_gemma":0.0001669581,"threshold_uncertainty_score":0.39583632},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.808658,0.00029757025,0.008492615,0.020599056,0.042553097,0.0013176731,0.00014194743,0.0007104344,0.11722959],"genre_scores_gemma":[0.9950998,0.00004238779,0.0012949075,0.000125094,0.0009129993,0.00004526531,0.0000037047632,0.000025206677,0.0024506222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99682957,0.000017596434,0.00037401295,0.00058022275,0.001884194,0.00031438706],"domain_scores_gemma":[0.9987372,0.00031495828,0.000090783986,0.00024715855,0.00050523045,0.000104664396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081237574,0.00020815381,0.0001864175,0.0002028301,0.00019964195,0.00032990144,0.0016339781,0.00008305678,0.0000656748],"category_scores_gemma":[0.00010994614,0.00015266381,0.00018070725,0.00041915916,0.00011512967,0.00074024557,0.0006309137,0.0005389023,0.00012441943],"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.00016829534,0.00018325949,0.000074286036,0.000070743816,0.000060790484,0.0000067452547,0.00022873706,0.00037366612,0.040125854,0.95402974,0.0027573286,0.0019205834],"study_design_scores_gemma":[0.0033408103,0.0018354653,0.0067190337,0.003489668,0.00003029251,0.00021389873,0.0002667075,0.040852826,0.62321335,0.2222272,0.09647371,0.0013370418],"about_ca_topic_score_codex":0.00014571458,"about_ca_topic_score_gemma":0.0000013187852,"teacher_disagreement_score":0.7318025,"about_ca_system_score_codex":0.00029251628,"about_ca_system_score_gemma":0.00013579005,"threshold_uncertainty_score":0.62254494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83129734,0.00008110607,0.058002487,0.018784245,0.0330272,0.0023975363,0.000038361435,0.0025102915,0.053861447],"genre_scores_gemma":[0.99792,0.000020878888,0.000846447,0.000080039885,0.0006285018,0.000039689166,0.0000028926895,0.000017894314,0.00044368545],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781555,0.000023082179,0.0002810749,0.00042715447,0.0012073559,0.00024577125],"domain_scores_gemma":[0.9989913,0.000084041734,0.00006787214,0.00013368989,0.0006625023,0.000060566585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084120524,0.0001575449,0.00013262122,0.00031759526,0.00021065734,0.00067760085,0.0015122063,0.000104522136,0.000035317178],"category_scores_gemma":[0.000052920306,0.00012622685,0.00013170896,0.0007825542,0.00006684712,0.0009321103,0.00055647135,0.00041955372,0.000044764918],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0001324902,0.00021470171,0.00027898245,0.00014475502,0.000089520334,0.0000022542754,0.00094980974,0.000021744368,0.8096572,0.173686,0.0050709634,0.009751558],"study_design_scores_gemma":[0.00023978142,0.00027572742,0.00015276061,0.00012701235,0.0000070265305,0.000026624426,0.000033828783,0.030393677,0.9525929,0.014011075,0.0020048954,0.00013465702],"about_ca_topic_score_codex":0.00019699473,"about_ca_topic_score_gemma":0.0000010325074,"teacher_disagreement_score":0.16662264,"about_ca_system_score_codex":0.00036554027,"about_ca_system_score_gemma":0.00007098386,"threshold_uncertainty_score":0.65341204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9283686,0.000025958578,0.023792207,0.014094519,0.002894666,0.0012636923,0.00009498021,0.00012426279,0.029341115],"genre_scores_gemma":[0.99604875,0.0000255121,0.0031187742,0.000029507748,0.00005101284,0.000026805694,0.000013601844,0.0000124997705,0.0006735218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99622375,0.00004089162,0.0005560501,0.00052318105,0.0022863215,0.0003698215],"domain_scores_gemma":[0.9961376,0.00029245496,0.00023280135,0.0003672456,0.0028719876,0.000097884935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587849,0.00019984679,0.00029519366,0.00021773922,0.00017433804,0.00023349913,0.0032561342,0.00010886207,0.0000333455],"category_scores_gemma":[0.00035324463,0.00014952931,0.00013300795,0.0012257429,0.00031089646,0.00041415857,0.0009914273,0.00049946527,0.000007202113],"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.0008377849,0.0010821498,0.0054825996,0.00021052094,0.0002447651,0.0000021983963,0.0001987936,0.0031640928,0.023904536,0.9623443,0.00065290375,0.0018753709],"study_design_scores_gemma":[0.005014711,0.0010654114,0.09413222,0.0006143382,0.00004956683,0.000018437142,0.00014798179,0.40674055,0.47401914,0.016739266,0.00091128016,0.0005471112],"about_ca_topic_score_codex":0.00014901847,"about_ca_topic_score_gemma":0.0000014446371,"teacher_disagreement_score":0.94560504,"about_ca_system_score_codex":0.00040077968,"about_ca_system_score_gemma":0.0003534517,"threshold_uncertainty_score":0.60976285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.563085,0.000054732216,0.11445266,0.09787976,0.024413226,0.0030446826,0.000010345589,0.00075158203,0.19630799],"genre_scores_gemma":[0.99099916,0.0000044680705,0.0076703606,0.00016003214,0.00018406726,0.000049242946,0.000001280605,0.000010564202,0.0009208007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979847,0.000015592297,0.000283224,0.00037072974,0.001114891,0.00023083428],"domain_scores_gemma":[0.9986541,0.000103853214,0.00016491518,0.00018052311,0.0008534035,0.00004318489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278274,0.00014502127,0.00014871222,0.00014883606,0.00018497217,0.00031265308,0.002262259,0.00006016359,0.000002347942],"category_scores_gemma":[0.000121580546,0.00010342405,0.00005862788,0.0006047085,0.000079823585,0.00064321427,0.0006304975,0.00025813127,0.000008182022],"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.0001600769,0.00031492542,0.008564089,0.000063578416,0.00012593876,0.0000018529062,0.0006977543,0.002241402,0.025407478,0.959027,0.0014141601,0.0019817313],"study_design_scores_gemma":[0.0043298723,0.0011059744,0.0056728255,0.001982793,0.000043659984,0.000022939828,0.00030927928,0.19317675,0.70651335,0.083358854,0.0028831803,0.00060056493],"about_ca_topic_score_codex":0.000053859454,"about_ca_topic_score_gemma":5.3616054e-7,"teacher_disagreement_score":0.87566817,"about_ca_system_score_codex":0.00018543021,"about_ca_system_score_gemma":0.00012443967,"threshold_uncertainty_score":0.42175102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6934779,0.0001404066,0.02647291,0.16106825,0.008240982,0.0040335823,0.00013917664,0.00019018327,0.10623661],"genre_scores_gemma":[0.99762833,0.000081575505,0.0008259116,0.0002289241,0.000064006534,0.000043363812,0.000004323396,0.000008149507,0.0011154203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826163,0.0000254414,0.00033058942,0.0002743987,0.00089054316,0.00021740151],"domain_scores_gemma":[0.997924,0.00024700628,0.000100175945,0.0001337902,0.0015422989,0.0000527483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016503136,0.00010753599,0.00016434967,0.00023175923,0.00016773287,0.00016634645,0.0012881577,0.00007333733,0.000011468497],"category_scores_gemma":[0.00018750913,0.00008844775,0.000081929495,0.00031251047,0.00009407525,0.00035817322,0.0007073364,0.00016026743,8.7973643e-7],"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.00010017792,0.00015616589,0.0018692156,0.00011102896,0.00004823319,6.1306004e-8,0.00048464228,0.000050487975,0.012726319,0.98239547,0.0010298796,0.0010283444],"study_design_scores_gemma":[0.006848825,0.0010905954,0.0032680933,0.0007294063,0.000038032507,0.0000041722406,0.00060801493,0.25944215,0.5649211,0.1509672,0.011694538,0.0003878898],"about_ca_topic_score_codex":0.000019976984,"about_ca_topic_score_gemma":4.4869049e-7,"teacher_disagreement_score":0.83142823,"about_ca_system_score_codex":0.000094696894,"about_ca_system_score_gemma":0.00015545558,"threshold_uncertainty_score":0.36067945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95120406,0.0000067439178,0.000013790507,0.0085830735,0.0028007377,0.000434886,0.000012366141,0.000015914302,0.036928397],"genre_scores_gemma":[0.9989461,0.000009546667,0.00002411337,0.00014056114,0.00017704365,0.000028013636,7.093753e-7,0.000010441382,0.0006634964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99590683,0.000110936315,0.0008129052,0.0004224833,0.0025368682,0.00020996922],"domain_scores_gemma":[0.995607,0.0021173127,0.00037657912,0.00020043208,0.001660548,0.00003813272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038430593,0.00016562168,0.0002696085,0.0005875568,0.0001822029,0.0002871649,0.0019131099,0.000109261346,0.0002698705],"category_scores_gemma":[0.0039721606,0.000091645685,0.000293346,0.0017103638,0.000117393436,0.0003283869,0.0003733284,0.00040054467,0.000022961874],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0019347629,0.0007551651,0.0621121,0.000010043786,0.00010101091,3.6499986e-7,0.0003889275,0.0015784319,0.5062868,0.41317153,0.009990297,0.00367055],"study_design_scores_gemma":[0.002506319,0.0007921162,0.33597186,0.00068417506,0.000016602895,0.000007012652,0.00035800136,0.017496854,0.3621885,0.27763698,0.002085348,0.00025624374],"about_ca_topic_score_codex":0.00059748115,"about_ca_topic_score_gemma":0.00001175519,"teacher_disagreement_score":0.27385977,"about_ca_system_score_codex":0.0005726335,"about_ca_system_score_gemma":0.000116302304,"threshold_uncertainty_score":0.47553343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4273735,0.000031619285,0.0007500893,0.07379475,0.016181266,0.00033522432,0.0000023661737,0.00013569568,0.4813955],"genre_scores_gemma":[0.9936139,0.0000042354823,0.00042547734,0.0006725299,0.00014025958,0.000012618039,2.1954011e-7,0.000003937694,0.0051268353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875385,0.0000081148455,0.00020274972,0.0002500412,0.000616774,0.00016846672],"domain_scores_gemma":[0.9992228,0.00011458932,0.000072321396,0.00016923988,0.00039605415,0.000024984436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034058563,0.00009492325,0.0001229442,0.000093543276,0.00009781684,0.00018077675,0.0029247652,0.000056461784,0.000025167656],"category_scores_gemma":[0.00012063379,0.000066459164,0.00009315427,0.0002719175,0.00006861336,0.00022538012,0.0008715975,0.00017239293,0.000044180153],"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.00003937469,0.00010642381,0.008183116,0.000016333113,0.00004350406,2.9458874e-7,0.00011886088,0.0000061507553,0.016697682,0.9323246,0.041764934,0.00069871923],"study_design_scores_gemma":[0.0017959669,0.00019347842,0.017055655,0.00028289127,0.000015260799,0.0000058857854,0.00010409984,0.0044782264,0.6991652,0.2173311,0.059315022,0.0002571862],"about_ca_topic_score_codex":0.000066081506,"about_ca_topic_score_gemma":7.6340405e-7,"teacher_disagreement_score":0.7149935,"about_ca_system_score_codex":0.000101151534,"about_ca_system_score_gemma":0.00004930054,"threshold_uncertainty_score":0.543499},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8181875,0.000011370406,0.0000069296952,0.00647643,0.0032128757,0.00024993,0.00006783549,0.000099774436,0.17168741],"genre_scores_gemma":[0.9989058,0.00001759186,0.00008346642,0.00012307713,0.00015029946,0.000024059904,0.00002137032,0.000019431944,0.0006549217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988864,0.0000037109885,0.00027087497,0.00016530004,0.00048440346,0.0001893281],"domain_scores_gemma":[0.9989352,0.000019246185,0.00003166541,0.000092163486,0.00083315506,0.00008857353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018853655,0.00010142044,0.000102060476,0.00009128636,0.0000855338,0.000068238944,0.00039802789,0.000074755815,0.000117902004],"category_scores_gemma":[0.000037712907,0.00009199503,0.00007593858,0.00043840814,0.00003800779,0.00010719557,0.000023559625,0.00024644806,0.000016167358],"study_design_candidate":"bench_or_experimental","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.000032941636,0.00015175418,0.008707807,0.00008390784,0.00015650102,0.0000028823458,0.00083774584,0.0017512513,0.3050706,0.67517555,0.007454754,0.00057429506],"study_design_scores_gemma":[0.0017334695,0.000089688285,0.02680685,0.00020919903,0.000041400537,0.000020225858,0.00037251812,0.0020503816,0.8330877,0.012380793,0.12277134,0.00043644558],"about_ca_topic_score_codex":0.0017557301,"about_ca_topic_score_gemma":0.0010346003,"teacher_disagreement_score":0.66279477,"about_ca_system_score_codex":0.00024877366,"about_ca_system_score_gemma":0.00013120992,"threshold_uncertainty_score":0.37514484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304629,0.0001580817,0.00025462825,0.071597286,0.011410374,0.00063076755,0.000008228554,0.00014002685,0.08533772],"genre_scores_gemma":[0.9983911,0.000039127037,0.0006181739,0.00010272679,0.00021294464,0.000020460637,0.0000013661156,0.000008876187,0.0006052406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981921,0.000027457909,0.00030445092,0.00029967347,0.000927597,0.00024872972],"domain_scores_gemma":[0.99875623,0.0003118506,0.00015473396,0.0001662927,0.0005663285,0.000044589942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424725,0.000110421526,0.000108863715,0.000052336083,0.0002504796,0.00038178984,0.0016232291,0.000068886424,0.0000056136428],"category_scores_gemma":[0.00016782798,0.000075575794,0.000079629855,0.0003981427,0.000047834747,0.00028279744,0.00045653584,0.0004372664,0.000012223954],"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.00011892121,0.0002973662,0.012992877,0.00004081322,0.000048844813,0.000008207521,0.0009896695,0.0006652612,0.04313082,0.9343005,0.003052312,0.004354409],"study_design_scores_gemma":[0.0036032845,0.00061389006,0.022278713,0.0011678834,0.00001815279,0.00012528825,0.00044685343,0.032485407,0.5772693,0.30003658,0.06121606,0.00073857507],"about_ca_topic_score_codex":0.00013224031,"about_ca_topic_score_gemma":0.0000056765634,"teacher_disagreement_score":0.63426393,"about_ca_system_score_codex":0.0001872669,"about_ca_system_score_gemma":0.00014177112,"threshold_uncertainty_score":0.3681608},"labels":[],"label_agreement":null}]}