{"meta":{"query_hash":"43498212310d","filters":{"venue":"Proceedings of the International Conference on Automated Planning and Scheduling"},"cohort_total":93,"direct_labels_cover":0,"predictions_cover":93,"exported":93,"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/43498212310d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+International+Conference+on+Automated+Planning+and+Scheduling"},"results":[{"id":"W112889630","doi":"10.1609/icaps.v21i1.13450","title":"Scheduling an Aircraft Repair Shop","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"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":"Integer programming; Schedule; Scheduling (production processes); Constraint programming; Computer science; Benders' decomposition; Job shop scheduling; Mathematical optimization; Heuristic; Operations research; Context (archaeology); Engineering; Stochastic programming; Mathematics; Algorithm","score_opus":0.04964498439739254,"score_gpt":0.2694260334571725,"score_spread":0.21978104905977994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112889630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0863083,0.0002995177,0.90597135,0.00027396836,0.00006374316,0.00026234452,0.00040644963,0.0004696541,0.0059446497],"genre_scores_gemma":[0.5539167,0.00048066923,0.4370298,0.00012138604,0.00006841549,0.00025803538,0.0008879992,0.00013695154,0.007100116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994522,0.00019804308,0.00002804983,0.00011143527,0.000116813346,0.00009358177],"domain_scores_gemma":[0.9993262,0.00035946807,0.00008518263,0.00007300426,0.000085395244,0.000070675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585656,0.0007525363,0.0009018682,0.00040529916,0.00060113624,0.0008644637,0.0008188998,0.0006770055,0.0047074542],"category_scores_gemma":[0.0017114418,0.00048784062,0.0008635075,0.00050026603,0.0005522807,0.0008498346,0.00057129964,0.0007222415,0.00042510216],"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.00022294911,0.00012923687,0.0007332821,0.00029402014,0.000060910337,0.00031137068,0.00021497112,0.880384,0.014340977,0.03922534,0.0022350238,0.061847873],"study_design_scores_gemma":[0.00007063853,0.00025419312,0.00042354004,0.00001997756,0.000027022523,0.00012081596,0.00009870411,0.96451133,0.0043782294,0.02400228,0.0060743424,0.00001891055],"about_ca_topic_score_codex":0.0024267281,"about_ca_topic_score_gemma":0.002054024,"teacher_disagreement_score":0.0047074542,"about_ca_system_score_codex":0.00056380616,"about_ca_system_score_gemma":0.0012775523,"threshold_uncertainty_score":0.015748024},"labels":[],"label_agreement":null},{"id":"W1487826456","doi":"10.1609/icaps.v23i1.13563","title":"Using Alternative Suboptimality Bounds in Heuristic Search","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Bounded function; Mathematical optimization; Heuristic; Upper and lower bounds; Computer science; Mathematics; Construct (python library); Constant (computer programming); Algorithm; Artificial intelligence","score_opus":0.0787746973012493,"score_gpt":0.32667422913694777,"score_spread":0.24789953183569846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487826456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050395,0.0005375164,0.98718333,0.00036286545,0.000036344638,0.00003809779,0.000018267234,0.00030658703,0.006477527],"genre_scores_gemma":[0.27801087,0.0007804114,0.71698946,0.0004984492,0.00013108844,0.0003219848,0.00010401911,0.0003023393,0.0028614171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98619604,0.0067565246,0.0006463281,0.001546027,0.003928724,0.00092628936],"domain_scores_gemma":[0.95820284,0.031507544,0.0018719948,0.0059425216,0.0019290916,0.00054608274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109941885,0.0017806913,0.0014734511,0.0027696958,0.0011682966,0.004804524,0.0029839368,0.0023224808,0.0039753104],"category_scores_gemma":[0.052302316,0.0010557878,0.0015943949,0.0027833285,0.005928267,0.005976907,0.005113819,0.0040856376,0.0009451142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094105264,0.00007043851,0.0005408894,0.00018315177,0.00006832052,0.00006850346,0.00029675785,0.3373528,0.00133873,0.5999086,0.0017007994,0.05837694],"study_design_scores_gemma":[0.000025616782,0.000054732427,0.00008004806,0.000081230275,0.000027587177,0.000045400357,0.00003564691,0.7569099,0.0015967863,0.23774233,0.003379568,0.000021172367],"about_ca_topic_score_codex":0.002209857,"about_ca_topic_score_gemma":0.002984209,"teacher_disagreement_score":0.0109941885,"about_ca_system_score_codex":0.0034618406,"about_ca_system_score_gemma":0.0033840612,"threshold_uncertainty_score":0.058143497},"labels":[],"label_agreement":null},{"id":"W1537738406","doi":"10.1609/icaps.v20i1.13426","title":"Computer-Aided Algorithm Design: Automated Tuning, Configuration, Selection, and Beyond","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":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 British Columbia","funders":"","keywords":"Computer science; Structuring; Intuition; Integer programming; Scheduling (production processes); Selection (genetic algorithm); Mathematical optimization; Algorithm; Machine learning; Mathematics","score_opus":0.029888213250378406,"score_gpt":0.2744444472290716,"score_spread":0.24455623397869317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537738406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014195428,0.0014400221,0.9891487,0.0005553636,0.000065032844,0.000096936,0.00003052345,0.0005759677,0.0066678664],"genre_scores_gemma":[0.07825123,0.001962036,0.9152148,0.0004093364,0.00011421181,0.0004970476,0.00015754874,0.00036729002,0.0030264927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351984,0.003308921,0.00031793717,0.0008045656,0.00184575,0.00020310792],"domain_scores_gemma":[0.99002737,0.0069133234,0.00045655965,0.0015313417,0.00096740737,0.00010397762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007545406,0.0014674957,0.0014327528,0.00160475,0.0007836445,0.004029675,0.0022483296,0.0022287916,0.006780009],"category_scores_gemma":[0.019729288,0.0011261936,0.0011338211,0.0019453955,0.0033783412,0.0037021667,0.002443032,0.0027559444,0.002213039],"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.00013477031,0.00008442796,0.00088158034,0.0009591251,0.00011786115,0.00009621785,0.0002924145,0.22792684,0.003921322,0.32921323,0.0071761236,0.42919612],"study_design_scores_gemma":[0.00009527652,0.00015680303,0.00026260893,0.00043288164,0.000054958593,0.0001814792,0.00009207783,0.60389584,0.0051322323,0.32681075,0.06282744,0.00005767658],"about_ca_topic_score_codex":0.0015348968,"about_ca_topic_score_gemma":0.0011806632,"teacher_disagreement_score":0.007545406,"about_ca_system_score_codex":0.0015319276,"about_ca_system_score_gemma":0.0025302542,"threshold_uncertainty_score":0.039904416},"labels":[],"label_agreement":null},{"id":"W155860189","doi":"10.1609/icaps.v22i1.13537","title":"Optimally Relaxing Partial-Order Plans with MaxSAT","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"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":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Order (exchange); Minification; Operations research; Artificial intelligence; Mathematics","score_opus":0.03352342834652276,"score_gpt":0.2690857539899184,"score_spread":0.23556232564339563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155860189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05597319,0.00027677894,0.9313916,0.0004117765,0.000048545073,0.0002572022,0.00039136436,0.0010782585,0.010171366],"genre_scores_gemma":[0.33131444,0.00031840205,0.6636029,0.00020293912,0.000031773576,0.00032137983,0.00077479845,0.00027078038,0.0031626683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.00032288692,0.00003899422,0.00011354152,0.00022724108,0.00009841787],"domain_scores_gemma":[0.9987979,0.00083100406,0.00012774329,0.00013175029,0.000075296346,0.00003627652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641136,0.0009359845,0.0004485148,0.00046420374,0.0003622772,0.0007996019,0.0008204146,0.0005944116,0.002563164],"category_scores_gemma":[0.003305599,0.0005526214,0.00089164695,0.0007733038,0.00082010316,0.0016043633,0.0013711205,0.0016331482,0.00035145084],"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.00021505432,0.00013421124,0.0005339132,0.00026403312,0.00005072729,0.00022905688,0.00021882205,0.8303056,0.007221732,0.061441246,0.0029812818,0.09640435],"study_design_scores_gemma":[0.000078709396,0.00016015225,0.00021656782,0.000048946684,0.00003513907,0.000088039786,0.00014974114,0.8891972,0.009013674,0.09411996,0.0068704644,0.000021486067],"about_ca_topic_score_codex":0.0022754755,"about_ca_topic_score_gemma":0.004856212,"teacher_disagreement_score":0.002563164,"about_ca_system_score_codex":0.00076337956,"about_ca_system_score_gemma":0.0013000347,"threshold_uncertainty_score":0.008574665},"labels":[],"label_agreement":null},{"id":"W1585557683","doi":"10.1609/icaps.v22i1.13505","title":"Planning Modulo Theories: Extending the Planning Paradigm","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Planner; Computer science; Modular design; Heuristic; Scope (computer science); Syntax; Answer set programming; Automated planning and scheduling; Programming language; Theoretical computer science; Artificial intelligence; Set (abstract data type); Mathematics; Discrete mathematics","score_opus":0.04438401684249059,"score_gpt":0.3012732997910121,"score_spread":0.2568892829485215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585557683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005624422,0.0003241931,0.9794496,0.0013613666,0.00006913669,0.00017686588,0.00019355425,0.001300693,0.011500062],"genre_scores_gemma":[0.0766876,0.00069338287,0.91839015,0.00040182658,0.000090183166,0.00029531372,0.00036151166,0.0002862344,0.0027937738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996935,0.0012980187,0.00023601374,0.000489794,0.000772983,0.00026815676],"domain_scores_gemma":[0.99671304,0.0019414052,0.00020610186,0.000742619,0.0002480469,0.00014875927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004153052,0.0009590453,0.00060327194,0.0017411247,0.0011742858,0.002921735,0.0033741198,0.0014372962,0.004769116],"category_scores_gemma":[0.0057981987,0.0010259374,0.0029393157,0.00208985,0.004745184,0.007987451,0.0047850856,0.004665032,0.0010653203],"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.00009905682,0.00008297324,0.000504402,0.00040091207,0.000040649582,0.0002896349,0.0008492329,0.05474275,0.0027205322,0.8096435,0.0039116805,0.12671459],"study_design_scores_gemma":[0.000071514376,0.00008838405,0.00012711037,0.0001222356,0.000054843218,0.00021384301,0.00019326109,0.2048312,0.0036761893,0.73768955,0.05290132,0.000030478626],"about_ca_topic_score_codex":0.006215814,"about_ca_topic_score_gemma":0.00921071,"teacher_disagreement_score":0.006215814,"about_ca_system_score_codex":0.0019036343,"about_ca_system_score_gemma":0.0039486033,"threshold_uncertainty_score":0.021963716},"labels":[],"label_agreement":null},{"id":"W1797158199","doi":"10.1609/icaps.v19i1.13364","title":"Improving Planning Performance Using Low-Conflict Relaxed Plans","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"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; Australian Government","keywords":"Satisficing; Computer science; Heuristic; Plan (archaeology); Executable; Exploit; Mathematical optimization; Heuristics; Domain (mathematical analysis); State (computer science); Relaxation (psychology); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.042858574521779845,"score_gpt":0.2841194638274261,"score_spread":0.24126088930564624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797158199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15385537,0.00089860696,0.82219243,0.00047991244,0.00008097449,0.00028844495,0.00039576337,0.0105864415,0.0112221],"genre_scores_gemma":[0.48071343,0.00027624785,0.51590586,0.00012515718,0.000020836726,0.0001354222,0.0008177463,0.00036611938,0.0016390379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.0006228842,0.000093573384,0.00023769116,0.00040540658,0.00018671437],"domain_scores_gemma":[0.99592364,0.002774665,0.00025727038,0.0006417413,0.00028049428,0.00012212765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021995625,0.0011258916,0.00075759174,0.0009463536,0.00056491967,0.0010491442,0.001765862,0.000753158,0.0032779162],"category_scores_gemma":[0.008250393,0.00063857983,0.00077854324,0.0008227034,0.0007335718,0.0019717417,0.0013674769,0.0014940746,0.0006788798],"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.00085536914,0.0002869258,0.0020077794,0.0003189357,0.000099254794,0.00022253794,0.00029346137,0.7165137,0.013933584,0.010280957,0.005414045,0.24977344],"study_design_scores_gemma":[0.00010752743,0.0001730804,0.00036056837,0.000021679385,0.00003689058,0.000061460814,0.000058651127,0.98290956,0.00836414,0.0060419906,0.0018413363,0.000023113838],"about_ca_topic_score_codex":0.005602723,"about_ca_topic_score_gemma":0.008511561,"teacher_disagreement_score":0.005602723,"about_ca_system_score_codex":0.000868883,"about_ca_system_score_gemma":0.001884703,"threshold_uncertainty_score":0.011632502},"labels":[],"label_agreement":null},{"id":"W1872977731","doi":"10.1609/icaps.v23i1.13579","title":"Linear Fitted-Q Iteration with Multiple Reward Functions","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Triangulation; Computer science; Mathematical optimization; Function (biology); Markov decision process; Construct (python library); Field (mathematics); Bellman equation; Reduction (mathematics); Algorithm; Mathematics; Artificial intelligence; Statistics; Markov process; Geometry","score_opus":0.21884345960269017,"score_gpt":0.37506491524088736,"score_spread":0.1562214556381972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872977731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015630437,0.000033369775,0.99732614,0.00006302762,0.000014718094,0.000037406928,0.000015515767,0.00017185145,0.0007748767],"genre_scores_gemma":[0.18306142,0.00007511047,0.8121565,0.00016269783,0.00003293215,0.0004429504,0.00013074398,0.0002331215,0.003704538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998329,0.00076435064,0.00010896075,0.0002498881,0.0003408526,0.00020687687],"domain_scores_gemma":[0.99340147,0.005022779,0.00032077052,0.00031776231,0.00071528985,0.00022189815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004440727,0.0011418561,0.0015152299,0.0007608965,0.00066876475,0.0012117085,0.0023256605,0.0019635968,0.009488648],"category_scores_gemma":[0.017181152,0.00089689705,0.0011646476,0.0007782021,0.0016259792,0.0017185353,0.002245581,0.0024959035,0.0016180135],"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.00013772,0.0000653892,0.0005372522,0.00010896314,0.000036713896,0.000095132025,0.00013269739,0.89665025,0.0006357373,0.0472204,0.0011220335,0.053257704],"study_design_scores_gemma":[0.000017162865,0.0000229478,0.000023940393,0.000011601485,0.0000035241496,0.000010755017,0.000008213703,0.9865328,0.000267103,0.012571175,0.0005248712,0.0000057555435],"about_ca_topic_score_codex":0.008154825,"about_ca_topic_score_gemma":0.0075619603,"teacher_disagreement_score":0.009488648,"about_ca_system_score_codex":0.0019434921,"about_ca_system_score_gemma":0.0033383903,"threshold_uncertainty_score":0.031742692},"labels":[],"label_agreement":null},{"id":"W1886156573","doi":"10.1609/icaps.v23i1.13552","title":"Hybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Scheduling (production processes); Mathematical optimization; Dynamic priority scheduling; Sequence (biology); Distributed computing; Mathematics; Quality of service; Computer network","score_opus":0.019560836295905833,"score_gpt":0.24645218792809634,"score_spread":0.2268913516321905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886156573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018326433,0.0004812971,0.9765341,0.0005224015,0.00011293604,0.00006739333,0.00011537522,0.00022026099,0.0036197132],"genre_scores_gemma":[0.76140153,0.0018637284,0.22548872,0.0004271484,0.00041917193,0.0005139283,0.0002818255,0.0001478826,0.00945615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826247,0.00069563213,0.0000702723,0.00029907096,0.00043863535,0.00023383879],"domain_scores_gemma":[0.9964529,0.002478414,0.00036338545,0.00028018182,0.00027868547,0.00014646654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027742325,0.0015324652,0.0010761572,0.0013317264,0.000981501,0.0023709093,0.002545278,0.0018056048,0.0026379896],"category_scores_gemma":[0.00540243,0.00081983086,0.0012671099,0.0016107047,0.0017662327,0.0029524402,0.0013519375,0.0018563634,0.00046068055],"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.0000343511,0.00005383041,0.00030950093,0.000037136233,0.00002878629,0.00006317086,0.00007354201,0.8859415,0.0007792842,0.10751023,0.0007209143,0.004447755],"study_design_scores_gemma":[0.000008189552,0.000013798175,0.00005944822,0.0000030239307,0.0000066044568,0.000011341585,0.000012158558,0.9749783,0.00008517563,0.024228984,0.0005856182,0.000007319871],"about_ca_topic_score_codex":0.00925968,"about_ca_topic_score_gemma":0.006229915,"teacher_disagreement_score":0.00925968,"about_ca_system_score_codex":0.0030332608,"about_ca_system_score_gemma":0.0025990028,"threshold_uncertainty_score":0.022008002},"labels":[],"label_agreement":null},{"id":"W189498254","doi":"10.1609/icaps.v19i1.13365","title":"Minimal Sufficient Explanations for Factored Markov Decision Processes","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Task (project management); Markov decision process; Computer science; Set (abstract data type); Template; Domain (mathematical analysis); Probabilistic logic; Selection (genetic algorithm); Markov chain; Markov process; Markov model; Machine learning; Artificial intelligence; Programming language; Mathematics; Engineering","score_opus":0.04320861166281764,"score_gpt":0.3100428253267046,"score_spread":0.26683421366388693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189498254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023713725,0.00019038138,0.97004557,0.00085674564,0.000040656912,0.0002357099,0.0011784596,0.0013417602,0.002396938],"genre_scores_gemma":[0.42088416,0.00029869768,0.57330936,0.00030822377,0.000073246505,0.0008751899,0.002628358,0.00025960934,0.0013631706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534506,0.0018267543,0.0005656442,0.00076219183,0.0011518163,0.00034855574],"domain_scores_gemma":[0.96893054,0.025795193,0.0016157704,0.0015908605,0.001607188,0.0004604401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039563263,0.0014786744,0.0010229776,0.0016392781,0.00096122664,0.0017447792,0.001647864,0.0022222372,0.00713283],"category_scores_gemma":[0.03379838,0.001092509,0.0022322438,0.00076054304,0.0017774819,0.003109493,0.0025203342,0.002817871,0.000639118],"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.00037960956,0.0002029835,0.0033968745,0.00097584364,0.00020239646,0.0012753705,0.001447881,0.3859012,0.0036900023,0.528806,0.0065621627,0.06715961],"study_design_scores_gemma":[0.00013231946,0.00007307995,0.00032031225,0.00013780636,0.000058347883,0.00010953382,0.00010747447,0.5657699,0.0024153832,0.42630965,0.004524836,0.00004139426],"about_ca_topic_score_codex":0.0029057472,"about_ca_topic_score_gemma":0.0053374837,"teacher_disagreement_score":0.00713283,"about_ca_system_score_codex":0.001609738,"about_ca_system_score_gemma":0.0026780993,"threshold_uncertainty_score":0.023861706},"labels":[],"label_agreement":null},{"id":"W2097114036","doi":"10.1609/icaps.v24i1.13681","title":"A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"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; Heuristics; Planner; Randomness; Heuristic; Satisficing; Benchmark (surveying); Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.06480995116400483,"score_gpt":0.33580014182964607,"score_spread":0.27099019066564123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097114036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5030714,0.0033251587,0.4363013,0.0015043311,0.00016773859,0.0006767296,0.0006835528,0.0072375014,0.047032315],"genre_scores_gemma":[0.8605182,0.00055300276,0.13562861,0.00019740837,0.000033540495,0.0002236015,0.00041474833,0.00027520352,0.0021556923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969897,0.0012247268,0.00014803988,0.00031476843,0.0009854921,0.00033711994],"domain_scores_gemma":[0.9846713,0.011225175,0.0005986528,0.0024209097,0.0007459228,0.00033803534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033628724,0.0011540635,0.0010876004,0.0014864383,0.00053812534,0.0010299481,0.0026749263,0.0014739906,0.0029651823],"category_scores_gemma":[0.018498627,0.00059592683,0.0007664556,0.0015474904,0.0015335572,0.0042504114,0.002342789,0.0015212985,0.00042680552],"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.0016085646,0.00046854845,0.0018247253,0.0004356511,0.00013366231,0.00009234523,0.0003720906,0.7436613,0.003927126,0.015242367,0.0021279638,0.23010571],"study_design_scores_gemma":[0.0003612052,0.0011842232,0.002261213,0.000097641874,0.00015082984,0.00015593028,0.00023584253,0.96339643,0.007841714,0.016402518,0.007857966,0.00005455698],"about_ca_topic_score_codex":0.007814169,"about_ca_topic_score_gemma":0.011635176,"teacher_disagreement_score":0.007814169,"about_ca_system_score_codex":0.0020271596,"about_ca_system_score_gemma":0.0023995931,"threshold_uncertainty_score":0.017784834},"labels":[],"label_agreement":null},{"id":"W2098960454","doi":"10.1609/icaps.v20i1.13402","title":"Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"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 Alberta","keywords":"Satisficing; Plan (archaeology); Computer science; Graph; Metric (unit); Competition (biology); Action plan; Mathematical optimization; Operations research; Operations management; Artificial intelligence; Mathematics; Theoretical computer science; Engineering; Economics","score_opus":0.09831838808852035,"score_gpt":0.3290259229691195,"score_spread":0.23070753488059914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098960454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016885733,0.0006912109,0.9697435,0.0005694771,0.00009401388,0.0005615557,0.00022257445,0.0052627656,0.005969142],"genre_scores_gemma":[0.10285099,0.00024570734,0.89200723,0.00020320999,0.00005996911,0.00053396175,0.0005829459,0.0005069602,0.0030089896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965823,0.00094720133,0.0001543148,0.0005298707,0.0014656612,0.00032063967],"domain_scores_gemma":[0.9941421,0.0037300931,0.00052146276,0.000743248,0.000701087,0.0001619411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026625253,0.0017633833,0.001462876,0.0027863518,0.0010134672,0.0010257722,0.0029096124,0.0017544607,0.0050588963],"category_scores_gemma":[0.008801645,0.00073873193,0.0015056052,0.001881755,0.0021228006,0.0021832294,0.0023123468,0.00308878,0.0009732442],"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.0007667701,0.0007540172,0.0021524902,0.00040459057,0.00011924898,0.00011252055,0.00036741555,0.25543275,0.00573889,0.02716993,0.011022483,0.69595885],"study_design_scores_gemma":[0.00035721215,0.00051158544,0.0014663056,0.00005620741,0.00011018855,0.00019573407,0.00013144835,0.95117205,0.0109062325,0.021224486,0.013810911,0.000057673224],"about_ca_topic_score_codex":0.013156897,"about_ca_topic_score_gemma":0.019745529,"teacher_disagreement_score":0.013156897,"about_ca_system_score_codex":0.0018263167,"about_ca_system_score_gemma":0.0038607419,"threshold_uncertainty_score":0.026160598},"labels":[],"label_agreement":null},{"id":"W2113267394","doi":"10.1609/icaps.v20i1.13400","title":"Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian Networks","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; Bayesian network; Probabilistic logic; Duration (music); Chaining; Action (physics); Dynamic Bayesian network; State (computer science); Artificial intelligence; Distributed computing; Algorithm","score_opus":0.07556528448785273,"score_gpt":0.3406418268058319,"score_spread":0.26507654231797917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113267394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05525865,0.00018876632,0.94069976,0.00036997095,0.000014878835,0.00016917725,0.00022636693,0.0005941202,0.0024782787],"genre_scores_gemma":[0.7347317,0.00028105275,0.2621022,0.00010893955,0.000028057406,0.00046268746,0.000551353,0.00010927367,0.0016247443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980286,0.00075324613,0.00009853987,0.00039839666,0.00050914084,0.00021212875],"domain_scores_gemma":[0.992386,0.006231478,0.00049960695,0.00028083843,0.00040414822,0.00019803255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031096793,0.00079335325,0.0009315871,0.0013614058,0.00072688505,0.001320487,0.0016747613,0.0010923903,0.002237031],"category_scores_gemma":[0.012122487,0.00108613,0.0013273206,0.0010372689,0.0013699522,0.0030528854,0.0015773636,0.0015909047,0.00025849542],"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.00016988735,0.000059397677,0.0014213577,0.00005883447,0.00006209206,0.00018015284,0.00022788964,0.94138896,0.0009853666,0.02993507,0.00048142526,0.02502944],"study_design_scores_gemma":[0.000021004564,0.00002041558,0.00017551168,0.000009870777,0.000017353184,0.00002131626,0.000023894492,0.97667515,0.0004725473,0.022142256,0.00040949593,0.000011180853],"about_ca_topic_score_codex":0.016949845,"about_ca_topic_score_gemma":0.024731006,"teacher_disagreement_score":0.016949845,"about_ca_system_score_codex":0.0020393364,"about_ca_system_score_gemma":0.002949156,"threshold_uncertainty_score":0.033702374},"labels":[],"label_agreement":null},{"id":"W2171440583","doi":"10.1609/icaps.v20i1.13423","title":"Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"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.06394127200578725,"score_gpt":0.3128285928497654,"score_spread":0.24888732084397813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171440583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026821487,0.000289467,0.9652892,0.0002450074,0.00006264326,0.00019830295,0.000038900307,0.0019682134,0.0050868536],"genre_scores_gemma":[0.44573274,0.00016127499,0.55100113,0.00027899243,0.00005052751,0.00054610264,0.000111668676,0.0005056694,0.0016118835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780923,0.0009827878,0.00016464682,0.0004767709,0.00037785145,0.0001887424],"domain_scores_gemma":[0.99344915,0.0031917316,0.00051908765,0.002155022,0.00046193434,0.00022300224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033687635,0.0014829618,0.0018468896,0.0009278676,0.00090612104,0.0017463879,0.0030161822,0.0018180626,0.0040664864],"category_scores_gemma":[0.019594638,0.0010196029,0.0009258915,0.0013054785,0.001798553,0.0038318262,0.0027736523,0.003310641,0.0012072386],"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.00048312356,0.00043971138,0.0025336253,0.00029287196,0.00019414227,0.00019213773,0.00033305385,0.73931944,0.015147383,0.03807653,0.0034674373,0.19952062],"study_design_scores_gemma":[0.00012829024,0.00017711923,0.00025429245,0.00003159092,0.00003636755,0.000079543344,0.000050385857,0.9568755,0.005095391,0.034365963,0.0028680975,0.000037463666],"about_ca_topic_score_codex":0.0017556043,"about_ca_topic_score_gemma":0.0025257706,"teacher_disagreement_score":0.0040664864,"about_ca_system_score_codex":0.00079006585,"about_ca_system_score_gemma":0.0018978664,"threshold_uncertainty_score":0.017815948},"labels":[],"label_agreement":null},{"id":"W2177060007","doi":"10.1609/icaps.v21i1.13467","title":"Closing the Gap: Improved Bounds on Optimal POMDP Solutions","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology; University of Waterloo","funders":"","keywords":"Upper and lower bounds; Sawtooth wave; Benchmark (surveying); Partially observable Markov decision process; Mathematical optimization; Bellman equation; Function (biology); Interpolation (computer graphics); Computer science; Grid; Linear programming; Mathematics; Markov decision process; Markov process; Artificial intelligence","score_opus":0.11260743891545368,"score_gpt":0.30147540917280535,"score_spread":0.1888679702573517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177060007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014042606,0.001251603,0.9737225,0.00060793664,0.00012912869,0.00008317846,0.00023467324,0.0008081527,0.00912012],"genre_scores_gemma":[0.45404533,0.001729639,0.5380231,0.00053872255,0.00020898234,0.0005931359,0.0006994277,0.000750541,0.0034112243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484444,0.0014693796,0.00025791058,0.00073463697,0.0020697708,0.000623869],"domain_scores_gemma":[0.98378515,0.012635459,0.0007268854,0.0015244492,0.0010208387,0.00030718505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006392614,0.0025299124,0.0023678006,0.002145246,0.0010541485,0.0035089166,0.002879291,0.002346559,0.007614249],"category_scores_gemma":[0.032973014,0.0015874532,0.0019756265,0.0021858998,0.0026656014,0.0070765126,0.0048034503,0.0061255298,0.00090796524],"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.00015132762,0.000055456137,0.00030975466,0.00018308306,0.00003564066,0.000056685225,0.00014958771,0.8976502,0.00069089147,0.06732286,0.001785608,0.03160899],"study_design_scores_gemma":[0.000020088155,0.000034403754,0.000056008033,0.00006820095,0.00001164463,0.0000095942805,0.00002224099,0.9470762,0.00048191668,0.051063206,0.0011482851,0.000008235039],"about_ca_topic_score_codex":0.005978278,"about_ca_topic_score_gemma":0.0060312664,"teacher_disagreement_score":0.007614249,"about_ca_system_score_codex":0.003056564,"about_ca_system_score_gemma":0.0033632051,"threshold_uncertainty_score":0.033807755},"labels":[],"label_agreement":null},{"id":"W2211274022","doi":"10.1609/icaps.v24i1.13640","title":"The Complexity of Partial-Order Plan Viability Problems","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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 Toronto; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Heuristics; Plan (archaeology); Order (exchange); Computer science; Task (project management); Management science; Mathematical optimization; Mathematics; Engineering; Economics; Systems engineering","score_opus":0.06234092099937335,"score_gpt":0.28064504394064843,"score_spread":0.21830412294127507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211274022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37319908,0.0022514665,0.5830362,0.012414061,0.00011185227,0.00048330525,0.0028210406,0.00094869826,0.024734246],"genre_scores_gemma":[0.8553382,0.0014004885,0.13643615,0.0003336743,0.00017519911,0.0005416355,0.0021655175,0.0002454021,0.00336377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951864,0.0018661317,0.00034087288,0.0007343794,0.0014128007,0.000459502],"domain_scores_gemma":[0.9451975,0.048894342,0.0023262885,0.0015534281,0.0012683959,0.0007600116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003873118,0.00075672916,0.0016958453,0.00136133,0.001494813,0.005203041,0.0023141527,0.001955424,0.004918922],"category_scores_gemma":[0.04464605,0.00080406945,0.001701844,0.0022233329,0.0027353559,0.008098107,0.0032433432,0.0034945053,0.00041332733],"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.0003078293,0.00017602884,0.005158874,0.0004947956,0.00013829225,0.00033824172,0.00080119283,0.69360757,0.0011153008,0.23821725,0.004785282,0.054859277],"study_design_scores_gemma":[0.00006225641,0.00003976127,0.001012692,0.0000523259,0.000039642764,0.00013552337,0.0003062967,0.5306145,0.0006392163,0.46498746,0.0020832662,0.0000270368],"about_ca_topic_score_codex":0.0060125603,"about_ca_topic_score_gemma":0.0049905716,"teacher_disagreement_score":0.0060125603,"about_ca_system_score_codex":0.002776731,"about_ca_system_score_gemma":0.0026003083,"threshold_uncertainty_score":0.020483315},"labels":[],"label_agreement":null},{"id":"W2219185070","doi":"10.1609/icaps.v23i1.13575","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Job shop scheduling; Benchmark (surveying); Concurrent constraint logic programming; Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Stochastic programming; Schedule","score_opus":0.03285429607784356,"score_gpt":0.27679911591896517,"score_spread":0.2439448198411216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219185070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002250926,0.00080940494,0.9877971,0.00042313922,0.00011870678,0.00008761775,0.00019495304,0.00008841003,0.008229698],"genre_scores_gemma":[0.13508789,0.0032338055,0.8536031,0.00035311386,0.00031483293,0.00042104896,0.0005699314,0.00017223122,0.006244024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976509,0.0008255531,0.00011323444,0.00037257184,0.0008235871,0.00021419702],"domain_scores_gemma":[0.9983235,0.0010849267,0.00010330109,0.00009524596,0.00030078576,0.000092280956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616974,0.0012588461,0.0012055048,0.0011737847,0.0008366139,0.0021931336,0.0021179374,0.001172894,0.005016978],"category_scores_gemma":[0.0042518303,0.00072202436,0.001400655,0.002662523,0.0012387666,0.0016446623,0.0013297322,0.0026734637,0.00059921824],"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.000040781844,0.00006989008,0.00013185586,0.00023001137,0.0000486808,0.0001282611,0.000054753342,0.7579917,0.00091166276,0.1786128,0.0042302883,0.057549298],"study_design_scores_gemma":[0.000026797592,0.000039752682,0.00007651292,0.00004571454,0.000024734467,0.0000724718,0.00002733014,0.84987503,0.0006900735,0.13813955,0.010958174,0.000023837454],"about_ca_topic_score_codex":0.008762138,"about_ca_topic_score_gemma":0.007806894,"teacher_disagreement_score":0.008762138,"about_ca_system_score_codex":0.0015557203,"about_ca_system_score_gemma":0.004163837,"threshold_uncertainty_score":0.017422318},"labels":[],"label_agreement":null},{"id":"W2220822187","doi":"10.1609/icaps.v22i1.13524","title":"Long-Run Stability in Dynamic Scheduling","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University; University of Toronto","funders":"","keywords":"Polling; Computer science; Queueing theory; Dynamic priority scheduling; Scheduling (production processes); Mathematical optimization; Stability (learning theory); Flow shop scheduling; Schedule; Distributed computing; Mathematics; Computer network","score_opus":0.029926027054536772,"score_gpt":0.27560620595054924,"score_spread":0.24568017889601246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220822187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06906547,0.0005483905,0.92393124,0.00041516573,0.000048326547,0.000038906015,0.000064664244,0.0002632853,0.005624603],"genre_scores_gemma":[0.9607028,0.00036986126,0.035828345,0.00008399255,0.00007078752,0.00016810793,0.00009978766,0.000113809365,0.002562527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894327,0.0003815819,0.000040978088,0.00023417351,0.00026511963,0.00013498348],"domain_scores_gemma":[0.99281925,0.0049760547,0.0007752088,0.0003872218,0.0008036908,0.00023847377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025158296,0.00050199946,0.0005522054,0.00072584534,0.0007343489,0.0012542678,0.0006933797,0.0005778251,0.0018403743],"category_scores_gemma":[0.013265521,0.00030263158,0.0004385248,0.0004959312,0.0014466605,0.0015489137,0.0011502786,0.0012040696,0.00030473355],"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.0001485227,0.00005327242,0.0022957546,0.00008983435,0.00007068711,0.00014954488,0.00025107045,0.7601593,0.005575514,0.21163757,0.00097100605,0.018598005],"study_design_scores_gemma":[0.000006851381,0.000033652515,0.00034817783,0.000009352928,0.0000080088375,0.000022590106,0.00003191457,0.9208071,0.0008444197,0.07729708,0.00058064103,0.000010343589],"about_ca_topic_score_codex":0.0019368477,"about_ca_topic_score_gemma":0.0010767151,"teacher_disagreement_score":0.0025158296,"about_ca_system_score_codex":0.001188425,"about_ca_system_score_gemma":0.0013246785,"threshold_uncertainty_score":0.013305128},"labels":[],"label_agreement":null},{"id":"W2274199420","doi":"10.1609/icaps.v22i1.13515","title":"Resource-Constrained Planning: A Monte Carlo Random Walk Approach","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"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; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Planner; Suite; Computer science; Resource (disambiguation); Monte Carlo method; Feature (linguistics); Random walk; Operations research; Function (biology); Mathematical optimization; Artificial intelligence; Engineering; Mathematics","score_opus":0.04241536260847029,"score_gpt":0.2743744785948414,"score_spread":0.2319591159863711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274199420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017825821,0.00040826752,0.9757774,0.00042316783,0.000045663415,0.000101506484,0.00012722675,0.00060606864,0.004684848],"genre_scores_gemma":[0.4462222,0.00058261637,0.5474324,0.00027374644,0.00008436299,0.0004956057,0.0003427788,0.00033069632,0.004235612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989543,0.00054311496,0.000038245882,0.00012088037,0.00025532866,0.00008814511],"domain_scores_gemma":[0.9933809,0.0056120846,0.00025695417,0.0002832427,0.00030428657,0.0001624889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023645712,0.0008323594,0.0011382716,0.0012378608,0.0005719259,0.0011455155,0.0017026683,0.0016602791,0.004541897],"category_scores_gemma":[0.00867091,0.00073594024,0.000878337,0.0013438207,0.0012123008,0.0013529666,0.0008840755,0.0015979003,0.00043518108],"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.000023350754,0.000020308393,0.000191829,0.000025454656,0.000017053273,0.000021786518,0.000017493896,0.97936434,0.00018828921,0.01322503,0.00038362385,0.0065213656],"study_design_scores_gemma":[0.0000060420775,0.000004767695,0.000023146946,0.000003290225,0.0000021824953,0.0000032548467,0.0000021952412,0.9951416,0.00005360113,0.004563469,0.00019372403,0.0000026311686],"about_ca_topic_score_codex":0.0110496385,"about_ca_topic_score_gemma":0.0150992535,"teacher_disagreement_score":0.0110496385,"about_ca_system_score_codex":0.0013939044,"about_ca_system_score_gemma":0.0017614077,"threshold_uncertainty_score":0.02197063},"labels":[],"label_agreement":null},{"id":"W2294988606","doi":"10.1609/icaps.v25i1.13709","title":"Moving Target Search with Subgoal Graphs","year":2015,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); Abstraction; Robotics; Spacetime; Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Robot","score_opus":0.057875168532856985,"score_gpt":0.2929854708873217,"score_spread":0.2351103023544647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294988606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061535005,0.00012994952,0.9306793,0.00016904413,0.000022542119,0.00012747908,0.00027240312,0.0031547693,0.0039096065],"genre_scores_gemma":[0.36030656,0.00019165064,0.6342805,0.000113902934,0.000011226045,0.00017209168,0.0012693553,0.00033421186,0.0033204325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.00005743903,0.000012662184,0.00007229079,0.000074636,0.000041199364],"domain_scores_gemma":[0.99956554,0.00018037825,0.000051375253,0.0000822391,0.00007935314,0.00004113592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031443767,0.00068511674,0.0005363605,0.00060126255,0.0004421723,0.00046964193,0.0009533846,0.00043676826,0.0032681809],"category_scores_gemma":[0.0010510734,0.00029078036,0.0005563219,0.0006612905,0.00038329253,0.0014342448,0.0012376027,0.0006698897,0.0005908239],"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.00038534965,0.00019060126,0.0018169832,0.00027468483,0.00006670619,0.00022820653,0.0003684795,0.5801115,0.023123622,0.030937623,0.00793774,0.35455847],"study_design_scores_gemma":[0.000033931912,0.000091819886,0.00045186927,0.000010327649,0.000016195136,0.000057420035,0.00005688626,0.96905524,0.005933612,0.019570397,0.004713434,0.000008843138],"about_ca_topic_score_codex":0.007309958,"about_ca_topic_score_gemma":0.0077425647,"teacher_disagreement_score":0.007309958,"about_ca_system_score_codex":0.00061598537,"about_ca_system_score_gemma":0.0011202348,"threshold_uncertainty_score":0.014534771},"labels":[],"label_agreement":null},{"id":"W233883780","doi":"10.1609/icaps.v21i1.13468","title":"Distributed Control of Situated Assistance in Large Domains with Many Tasks","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Situated; Partially observable Markov decision process; Computer science; Task (project management); Scalability; Affordance; Domain (mathematical analysis); Set (abstract data type); Process (computing); Population; Markov decision process; Artificial intelligence; Human–computer interaction; Controller (irrigation); Control (management); Machine learning; Distributed computing; Markov process; Markov chain; Markov model; Engineering; Mathematics","score_opus":0.029838982046658497,"score_gpt":0.25990372975629306,"score_spread":0.23006474770963456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W233883780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08842686,0.00018797014,0.90696764,0.00035028154,0.00006718203,0.00009802449,0.000042549593,0.00059238175,0.0032670766],"genre_scores_gemma":[0.9604593,0.000065005515,0.03770987,0.00005132174,0.000024312063,0.00014329031,0.000040346218,0.000027654414,0.001478948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.00016808613,0.00003442586,0.0002618368,0.00013293308,0.0001401942],"domain_scores_gemma":[0.997658,0.0014361431,0.00027679888,0.00019165617,0.0002222553,0.00021517373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014618336,0.0009725096,0.0013142732,0.00032980196,0.000943075,0.0011679033,0.0017224378,0.0010051822,0.0020824783],"category_scores_gemma":[0.004090379,0.0006910619,0.0006270625,0.00037149698,0.0019072444,0.0012316715,0.0028448326,0.0017031204,0.00025039152],"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.000079160156,0.00004435632,0.00028308952,0.0000321525,0.000019978017,0.00008403161,0.000073248615,0.9864071,0.0012787175,0.0030088532,0.00017778318,0.008511489],"study_design_scores_gemma":[0.00002788714,0.000026342801,0.00007781457,0.0000020453895,0.0000036919607,0.0000075585826,0.000013993772,0.9963407,0.00022431264,0.0031194817,0.00015269114,0.0000033603633],"about_ca_topic_score_codex":0.010991991,"about_ca_topic_score_gemma":0.0087357825,"teacher_disagreement_score":0.010991991,"about_ca_system_score_codex":0.0011744457,"about_ca_system_score_gemma":0.0016772465,"threshold_uncertainty_score":0.02185601},"labels":[],"label_agreement":null},{"id":"W2394636111","doi":"10.1609/icaps.v22i1.13502","title":"Planning Via Random Walk-Driven Local Search","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"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; Local search (optimization); Computer science; Node (physics); Plan (archaeology); Mathematical optimization; Random search; Search algorithm; Quality (philosophy); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Engineering; Statistics; Geography","score_opus":0.04381493788673569,"score_gpt":0.29650923569130333,"score_spread":0.25269429780456765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394636111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007671111,0.00025409568,0.9863994,0.00011160123,0.000017546716,0.0001034562,0.00008963213,0.0014407928,0.003912298],"genre_scores_gemma":[0.38856396,0.00047520731,0.6043546,0.00017731925,0.0000300414,0.00073412654,0.00050137565,0.00040199704,0.0047613163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990758,0.0003629871,0.00004191487,0.00016308673,0.00028214627,0.00007404904],"domain_scores_gemma":[0.9988871,0.00069822086,0.00009236943,0.000133914,0.00013767362,0.000050690884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088216,0.0008275983,0.0009581754,0.0010125706,0.00042276087,0.00082869676,0.0013450262,0.00091118313,0.003679554],"category_scores_gemma":[0.0035613126,0.00065335183,0.0007838678,0.0009534959,0.0010618096,0.0011471863,0.0016108227,0.0010682421,0.0009658318],"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.00008156343,0.00004268964,0.00023762253,0.000124874,0.00004775535,0.00010172614,0.00007643193,0.9159289,0.0021638235,0.02589362,0.0022627453,0.053038243],"study_design_scores_gemma":[0.00003600911,0.000039694845,0.000037214893,0.000009330504,0.000008691075,0.00002539109,0.000008553509,0.9832791,0.0007823154,0.014349367,0.001414721,0.000009663811],"about_ca_topic_score_codex":0.003072469,"about_ca_topic_score_gemma":0.00482454,"teacher_disagreement_score":0.003679554,"about_ca_system_score_codex":0.0008431997,"about_ca_system_score_gemma":0.0013085203,"threshold_uncertainty_score":0.012309313},"labels":[],"label_agreement":null},{"id":"W2401205034","doi":"10.1609/icaps.v25i1.13685","title":"Improving the Design and Discovery of Dynamic Treatment Strategies Using Recent Results in Sequential Decision-Making","year":2015,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","cited_by":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":"McGill University","funders":"","keywords":"Computer science; Neurostimulation; Machine learning; Artificial intelligence; Data science; Management science; Psychology; Engineering","score_opus":0.3698951900488029,"score_gpt":0.44219970744945514,"score_spread":0.07230451740065225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401205034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010647084,0.0015973336,0.9849931,0.0009780236,0.00007488009,0.00012189677,0.00011530976,0.00014300841,0.0013294121],"genre_scores_gemma":[0.3380965,0.003276897,0.6550274,0.0006373262,0.00037644638,0.00068972836,0.0006312518,0.00013310739,0.001131437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98716474,0.007857523,0.00087234686,0.0019553644,0.001729308,0.00042078728],"domain_scores_gemma":[0.8903149,0.1010349,0.002960845,0.0021760396,0.0026586289,0.00085475756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022765346,0.002946346,0.004559703,0.0027536901,0.0008674523,0.0027382297,0.002774598,0.0021896053,0.0038008308],"category_scores_gemma":[0.07727733,0.0019943358,0.0030245334,0.0028906146,0.0030883276,0.003277777,0.0023702483,0.0044848705,0.0004771561],"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.0002785565,0.0002966405,0.0024654556,0.0006239813,0.00038005266,0.00007074502,0.00019290241,0.86906254,0.00049683644,0.049181994,0.0011319625,0.07581831],"study_design_scores_gemma":[0.00009671272,0.0001314365,0.00021232072,0.00006138589,0.00004656241,0.000014991641,0.000015226854,0.92103875,0.00036313423,0.0772556,0.00074709894,0.000016806454],"about_ca_topic_score_codex":0.00727666,"about_ca_topic_score_gemma":0.0062569324,"teacher_disagreement_score":0.022765346,"about_ca_system_score_codex":0.0025872495,"about_ca_system_score_gemma":0.005121321,"threshold_uncertainty_score":0.12039614},"labels":[],"label_agreement":null},{"id":"W2401554262","doi":"10.1609/icaps.v25i1.13704","title":"Understanding and Improving Local Exploration for GBFS","year":2015,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Maxima and minima; Satisficing; Local search (optimization); Heuristic; Mathematics; Mathematical optimization; Algorithm; Computer science; Artificial intelligence","score_opus":0.20482249081506348,"score_gpt":0.30985478916159825,"score_spread":0.10503229834653477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401554262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048739754,0.0013897852,0.93777466,0.00063026027,0.000055301214,0.000077362005,0.000102557715,0.0024493844,0.008781046],"genre_scores_gemma":[0.5245824,0.0008099619,0.469947,0.0001946266,0.000051136707,0.0001948818,0.00026653928,0.00056652783,0.003386987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897575,0.0003378669,0.0000391291,0.00017739015,0.0003168791,0.00015297893],"domain_scores_gemma":[0.9980848,0.0012595488,0.00010734571,0.00031297962,0.00016896098,0.00006639679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442849,0.0010225816,0.00093280437,0.00080568204,0.0007409803,0.0012296237,0.0012213687,0.00082614465,0.0041300985],"category_scores_gemma":[0.0063271737,0.00052143,0.0008412444,0.0009652117,0.0016543674,0.0027214058,0.002338866,0.0017688535,0.0005874912],"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.00014553971,0.00007011519,0.0012674421,0.00024908065,0.0000331196,0.00009539312,0.00032565044,0.78412306,0.0037460178,0.046952646,0.003652246,0.1593396],"study_design_scores_gemma":[0.00002575382,0.00005231834,0.00024706376,0.000033434277,0.00001704961,0.000039381943,0.00008306389,0.94611335,0.0024844396,0.04720271,0.003687413,0.000013990135],"about_ca_topic_score_codex":0.007950091,"about_ca_topic_score_gemma":0.009831643,"teacher_disagreement_score":0.007950091,"about_ca_system_score_codex":0.0012535278,"about_ca_system_score_gemma":0.0022163675,"threshold_uncertainty_score":0.015807629},"labels":[],"label_agreement":null},{"id":"W2408280519","doi":"10.1609/icaps.v22i1.13512","title":"Predicting Optimal Solution Cost with Bidirectional Stratified Sampling","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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; University of Regina","keywords":"Mathematical optimization; Path (computing); Focus (optics); Heuristic; Sampling (signal processing); State space; Limit (mathematics); Space (punctuation); Computer science; Total cost; State (computer science); Infinity; Mathematics; Algorithm; Statistics; Economics","score_opus":0.05816263018726656,"score_gpt":0.2944029400724816,"score_spread":0.23624030988521502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408280519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305301,0.0003216432,0.6902965,0.00023541125,0.000026463415,0.0001267532,0.00030675242,0.0010517098,0.0023337775],"genre_scores_gemma":[0.8352076,0.00009487817,0.16326623,0.0000504912,0.000011670808,0.00020037648,0.0005259819,0.00008791867,0.0005548666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879634,0.00053068966,0.000063775464,0.00017992551,0.00031383126,0.00011530329],"domain_scores_gemma":[0.98893625,0.0077297706,0.00076701876,0.0012646056,0.0011041678,0.00019825262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028484548,0.0007211771,0.00096560916,0.0012690658,0.000466506,0.0009800578,0.0010416514,0.0011533321,0.001467052],"category_scores_gemma":[0.020610947,0.00068782654,0.00061201595,0.0009413927,0.0007800166,0.0017058866,0.00092802977,0.0010539498,0.00039704784],"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.00027294952,0.00009023877,0.0093633905,0.000047565594,0.000053758788,0.000042713957,0.00006872189,0.9357862,0.0014375002,0.008657491,0.000810427,0.043369092],"study_design_scores_gemma":[0.0000074604523,0.000013941735,0.00041224627,0.000002800777,0.00000405436,0.000004212118,0.0000075279772,0.9951637,0.0003991661,0.0038948255,0.00008652564,0.0000034451064],"about_ca_topic_score_codex":0.014148109,"about_ca_topic_score_gemma":0.014035522,"teacher_disagreement_score":0.014148109,"about_ca_system_score_codex":0.0013641858,"about_ca_system_score_gemma":0.0020144351,"threshold_uncertainty_score":0.028131545},"labels":[],"label_agreement":null},{"id":"W256918177","doi":"10.1609/icaps.v24i1.13682","title":"Non-Deterministic Planning With Conditional Effects","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"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":"Planner; Soundness; Determinism; Computer science; Variety (cybernetics); Completeness (order theory); Key (lock); Extension (predicate logic); Core (optical fiber); Artificial intelligence; Programming language; Mathematics; Computer security","score_opus":0.018108935209690247,"score_gpt":0.2621770235230653,"score_spread":0.24406808831337506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256918177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02261206,0.00016657473,0.96591604,0.00023849217,0.000054663422,0.000112129324,0.0002252965,0.0020707848,0.008603849],"genre_scores_gemma":[0.53387076,0.00030101562,0.4599418,0.00015908941,0.000028268201,0.0002545932,0.00048641846,0.0003338347,0.004624189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985279,0.0005446956,0.00011191152,0.0002025258,0.00045815922,0.00015481436],"domain_scores_gemma":[0.9957241,0.0029610859,0.00021363843,0.0006640499,0.0003291357,0.000107914864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019197535,0.0006749591,0.00041011657,0.0004437355,0.00051247695,0.0008959041,0.0010330697,0.0006127952,0.003477259],"category_scores_gemma":[0.006046241,0.00047726274,0.00095651223,0.0003826405,0.0015828611,0.0016243607,0.0019490358,0.0013142526,0.00035473012],"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.0002904212,0.00011281533,0.0015000199,0.00046653394,0.0000734326,0.00070837646,0.0004530819,0.54501104,0.0093802,0.33858734,0.0029625543,0.10045413],"study_design_scores_gemma":[0.000047137626,0.000079592515,0.0003519729,0.000056555113,0.000046992645,0.00012412443,0.000054319473,0.7768881,0.010231959,0.20061773,0.011468155,0.000033349384],"about_ca_topic_score_codex":0.0046989406,"about_ca_topic_score_gemma":0.00980872,"teacher_disagreement_score":0.0046989406,"about_ca_system_score_codex":0.00078238756,"about_ca_system_score_gemma":0.0019991058,"threshold_uncertainty_score":0.011632562},"labels":[],"label_agreement":null},{"id":"W2574020264","doi":"10.1609/icaps.v26i1.13773","title":"From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"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":"Probabilistic logic; Leverage (statistics); Exploit; Planner; Computer science; Class (philosophy); Mathematical optimization; Artificial intelligence; Mathematics; Computer security","score_opus":0.06966296944873947,"score_gpt":0.29929599307677135,"score_spread":0.2296330236280319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574020264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07132992,0.0005822197,0.9168584,0.00060919,0.00008665494,0.0001366765,0.00035159403,0.004186802,0.0058585405],"genre_scores_gemma":[0.63516146,0.00032042,0.36119154,0.00026332444,0.000041517596,0.0002140501,0.0006990144,0.0005322398,0.0015763991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.00047545566,0.00009295596,0.00026581518,0.00045375735,0.00017803488],"domain_scores_gemma":[0.9914072,0.0064476905,0.00048123096,0.0010006967,0.00039146905,0.00027168426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025235934,0.001188087,0.001162251,0.0007379776,0.0005500137,0.00125192,0.001708522,0.0013742239,0.003292712],"category_scores_gemma":[0.016662017,0.00078639213,0.00089701754,0.00078559294,0.0017626818,0.0025569082,0.0024887412,0.0022912463,0.0003828112],"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.0001272948,0.000052160533,0.0005820984,0.00011271607,0.00002773471,0.00006497955,0.00005898827,0.9412,0.00084730046,0.016757721,0.001332331,0.03883663],"study_design_scores_gemma":[0.000019092266,0.000044021668,0.0000678951,0.000011333486,0.0000074271484,0.000019384863,0.000012514042,0.97567403,0.0007402183,0.022824084,0.00057346217,0.0000065574736],"about_ca_topic_score_codex":0.005841655,"about_ca_topic_score_gemma":0.008769387,"teacher_disagreement_score":0.005841655,"about_ca_system_score_codex":0.0012042612,"about_ca_system_score_gemma":0.0030505774,"threshold_uncertainty_score":0.013346136},"labels":[],"label_agreement":null},{"id":"W2577088067","doi":"10.1609/icaps.v26i1.13780","title":"Scheduling Ocean Color Observations for a GEO-Stationary Satellite","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Goddard Space Flight Center; Ministry of Education, India; Langley Research Center; Ames Research Center; National Aeronautics and Space Administration","keywords":"Remote sensing; Computer science; Radiometer; Satellite; Environmental science; Meteorology; Cloud cover; Scheduling (production processes); Real-time computing; Ocean color; Cloud computing; Geology; Geography; Aerospace engineering; Engineering; Mathematical optimization; Mathematics","score_opus":0.057705320826238644,"score_gpt":0.29025124259599255,"score_spread":0.23254592176975392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577088067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76031786,0.00016140842,0.21994708,0.0006845542,0.00009995149,0.00059941,0.0008505873,0.0011145893,0.016224582],"genre_scores_gemma":[0.93580174,0.00008817642,0.06147754,0.000051147435,0.000012729771,0.0001299756,0.00042518892,0.00006380827,0.0019498357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.00006792565,0.000007591016,0.000041352112,0.00003944582,0.00007184334],"domain_scores_gemma":[0.9992623,0.00032821397,0.000115367424,0.00004415521,0.00012232606,0.00012775687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623843,0.00052898814,0.00033396418,0.00028914295,0.00051202846,0.0006938467,0.00048376192,0.00044188366,0.0032262912],"category_scores_gemma":[0.0015900333,0.00031884166,0.0003353354,0.00045242193,0.00031863077,0.00044265858,0.0002914398,0.0005082207,0.00024365414],"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.00040914258,0.00020319496,0.002706583,0.000076630175,0.000030028566,0.000092688315,0.00008376383,0.952453,0.008851047,0.0020738577,0.0022286922,0.030791368],"study_design_scores_gemma":[0.000050554587,0.00023051702,0.0015682476,0.000004093627,0.000012737932,0.00000964532,0.00010733213,0.9923535,0.0033169754,0.0009810493,0.0013567756,0.000008650405],"about_ca_topic_score_codex":0.028884921,"about_ca_topic_score_gemma":0.034858003,"teacher_disagreement_score":0.028884921,"about_ca_system_score_codex":0.0014335725,"about_ca_system_score_gemma":0.002713691,"threshold_uncertainty_score":0.057433605},"labels":[],"label_agreement":null},{"id":"W2578999369","doi":"10.1609/icaps.v26i1.13752","title":"Efficient Representation of Pattern Databases Using Acyclic Random Hypergraphs","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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 Regina","funders":"","keywords":"Heuristic; Computer science; Representation (politics); Abstraction; Benchmark (surveying); Database; Domain (mathematical analysis); Theoretical computer science; Table (database); Algorithm; Data mining; Mathematics; Artificial intelligence","score_opus":0.06536379554403488,"score_gpt":0.3140520566603513,"score_spread":0.24868826111631642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578999369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021339217,0.00019510624,0.9735059,0.00020253546,0.000019075873,0.0001565546,0.00066232425,0.0023183355,0.0016009809],"genre_scores_gemma":[0.2022601,0.00035743773,0.7915065,0.000117932745,0.000017882456,0.00043141423,0.00297111,0.00031427463,0.002023243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876153,0.00041738508,0.0001163382,0.00024071537,0.00037930673,0.000084774845],"domain_scores_gemma":[0.99701536,0.0011825375,0.00023003838,0.0011370325,0.00036523107,0.00006989702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008969274,0.0005359741,0.0007254204,0.0018006612,0.00047208922,0.0017087497,0.0017371161,0.00069162395,0.0023953905],"category_scores_gemma":[0.006067924,0.00047163587,0.00076817954,0.0030888035,0.000515153,0.0028679522,0.0013123051,0.0010330097,0.00060408266],"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.000263312,0.0001558911,0.0019944748,0.00033079932,0.000084230545,0.0003874095,0.00041059166,0.4092803,0.011128614,0.11422587,0.009314467,0.4524241],"study_design_scores_gemma":[0.000030810283,0.000048081147,0.00026352037,0.000025803125,0.000021422265,0.00016174224,0.000094467294,0.92081714,0.00630741,0.065969765,0.006239705,0.000020071322],"about_ca_topic_score_codex":0.0031803832,"about_ca_topic_score_gemma":0.0039277473,"teacher_disagreement_score":0.0031803832,"about_ca_system_score_codex":0.00091052573,"about_ca_system_score_gemma":0.0014134665,"threshold_uncertainty_score":0.008013368},"labels":[],"label_agreement":null},{"id":"W269605412","doi":"10.1609/icaps.v22i1.13520","title":"Improved Non-Deterministic Planning by Exploiting State Relevance","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"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":"Relevance (law); Planner; Probabilistic logic; State (computer science); Computer science; Observable; Work (physics); Theoretical computer science; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Engineering; Political science; Law","score_opus":0.03166301535650045,"score_gpt":0.28407529041399643,"score_spread":0.25241227505749597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W269605412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020520639,0.000316249,0.9745594,0.00026728134,0.0000467357,0.00008130843,0.000097382894,0.0010845453,0.0030263977],"genre_scores_gemma":[0.5839281,0.0003673375,0.41239595,0.00016616912,0.000056596455,0.00020265284,0.000378553,0.00024904034,0.0022556593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981536,0.0006408492,0.00010937998,0.00036661385,0.00055718573,0.00017234508],"domain_scores_gemma":[0.99485344,0.0035771725,0.00034083458,0.0008356371,0.0002853883,0.00010753369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018559359,0.0007442396,0.0008835496,0.0007503147,0.0005419132,0.0010341633,0.0015708812,0.0009190558,0.002443073],"category_scores_gemma":[0.009938689,0.0006617996,0.0010199099,0.00093182194,0.0012727125,0.003295652,0.0022731642,0.0018606005,0.00047352404],"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.00016618724,0.00011212333,0.0006001446,0.00016029709,0.00004141318,0.0001463254,0.00018653579,0.8662734,0.0028334393,0.040705375,0.0013240178,0.08745073],"study_design_scores_gemma":[0.000017326625,0.00004432094,0.00012004029,0.000011299129,0.000012521412,0.000020115154,0.000011964491,0.96006256,0.0014440902,0.037164412,0.0010784131,0.0000129838645],"about_ca_topic_score_codex":0.0043821535,"about_ca_topic_score_gemma":0.007597966,"teacher_disagreement_score":0.0043821535,"about_ca_system_score_codex":0.0011286348,"about_ca_system_score_gemma":0.0020783206,"threshold_uncertainty_score":0.009815276},"labels":[],"label_agreement":null},{"id":"W2756655043","doi":"10.1609/icaps.v27i1.13807","title":"Boosting Search Guidance in Problems with Semantic Attachments","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Planner; Exploit; Computer science; Heuristic; Estimator; Boosting (machine learning); Leverage (statistics); Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.05653941684740136,"score_gpt":0.3161860120499285,"score_spread":0.25964659520252714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756655043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05920121,0.0007054519,0.9281924,0.00089361024,0.00008747844,0.00011521393,0.00013466249,0.0015046232,0.009165411],"genre_scores_gemma":[0.6478961,0.00042432593,0.3455304,0.000427861,0.0001489444,0.00022656134,0.0004911911,0.00029024374,0.004564441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987851,0.0004390092,0.000057619753,0.00019881991,0.0003670843,0.0001523982],"domain_scores_gemma":[0.9965203,0.0023351707,0.0002185465,0.00037738946,0.0003646854,0.00018383305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025775123,0.0012860647,0.0015723035,0.0011051281,0.0008745935,0.0013626666,0.0017079366,0.0021761348,0.0040817903],"category_scores_gemma":[0.012154559,0.00066437485,0.0007722876,0.0009849966,0.0018553071,0.0028438845,0.0029815445,0.002312591,0.00074456766],"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.00026525612,0.0001659704,0.0015133923,0.00026637278,0.000044893175,0.0001371273,0.0004044216,0.72626424,0.002397601,0.1342463,0.0056148083,0.12867966],"study_design_scores_gemma":[0.00003140588,0.000052970827,0.00012943054,0.000021168951,0.000011712242,0.000022231974,0.000032358435,0.9321992,0.0005117735,0.065249,0.0017320465,0.0000066734283],"about_ca_topic_score_codex":0.0034974709,"about_ca_topic_score_gemma":0.0049620685,"teacher_disagreement_score":0.0040817903,"about_ca_system_score_codex":0.0012827666,"about_ca_system_score_gemma":0.001735792,"threshold_uncertainty_score":0.013654947},"labels":[],"label_agreement":null},{"id":"W2756715505","doi":"10.1609/icaps.v27i1.13829","title":"An Investigation of Phase Transitions in Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"Advanced Exploration Systems; Ames Research Center; National Aeronautics and Space Administration","keywords":"Parameterized complexity; Scheduling (production processes); Computer science; Phase transition; Distributed computing; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Physics","score_opus":0.04681897896836605,"score_gpt":0.29776735699557605,"score_spread":0.25094837802721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756715505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.555189,0.003176458,0.40519738,0.004183295,0.0001642448,0.00041898145,0.00088901544,0.0007140981,0.03006755],"genre_scores_gemma":[0.90535015,0.00088515336,0.090390496,0.00046867479,0.00009232329,0.00023962643,0.0006609002,0.000152072,0.0017607139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983253,0.000764848,0.000059834332,0.00024783026,0.0003733317,0.00022888488],"domain_scores_gemma":[0.97264737,0.024023745,0.0014259446,0.0007643348,0.0006783816,0.00046016515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027139438,0.00075669313,0.00073527923,0.0011270237,0.00088614086,0.0016365087,0.0013466104,0.0010098289,0.004189672],"category_scores_gemma":[0.023963017,0.0005561559,0.0012926155,0.0014024503,0.0015370747,0.003110964,0.0011898266,0.002818277,0.00024038994],"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.00059001974,0.001002433,0.0074093337,0.00078160636,0.0001553188,0.0003389454,0.0009293395,0.51459897,0.0065649096,0.41894633,0.006141941,0.04254092],"study_design_scores_gemma":[0.0000884479,0.00021836584,0.0010555369,0.0001011873,0.00003263444,0.00013014708,0.00029994795,0.70225435,0.002910928,0.2887047,0.0041842475,0.000019433928],"about_ca_topic_score_codex":0.0014328067,"about_ca_topic_score_gemma":0.0010701949,"teacher_disagreement_score":0.004189672,"about_ca_system_score_codex":0.0013414104,"about_ca_system_score_gemma":0.0014608956,"threshold_uncertainty_score":0.014352918},"labels":[],"label_agreement":null},{"id":"W2758646404","doi":"10.1609/icaps.v27i1.13824","title":"Online Repositioning in Bike Sharing Systems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Bike sharing; Computer science; Benchmark (surveying); Heuristic; Routing (electronic design automation); Greedy algorithm; Set (abstract data type); Matching (statistics); Operations research; Mathematical optimization; Transport engineering; Computer network; Engineering; Artificial intelligence","score_opus":0.06569628425107436,"score_gpt":0.3493977974602436,"score_spread":0.2837015132091692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758646404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2651885,0.0010680862,0.72338504,0.00059630675,0.000116456,0.00023201249,0.0006472453,0.0018771578,0.0068891877],"genre_scores_gemma":[0.93032503,0.00022332599,0.06637369,0.00007274449,0.000023261602,0.00006618846,0.0005719078,0.00010032194,0.0022434508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990017,0.00031007873,0.000056982164,0.0002787606,0.0001430586,0.00020958859],"domain_scores_gemma":[0.9988925,0.0005084095,0.00013917481,0.00021186881,0.00011141557,0.00013655073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080042,0.0011132763,0.0014602774,0.00047009453,0.0009864056,0.0011949285,0.0018415063,0.0012489323,0.0037520183],"category_scores_gemma":[0.0026063863,0.00072669215,0.0006516839,0.0010700949,0.0006880547,0.0023485401,0.0014825941,0.0012842751,0.0005138495],"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.0001655914,0.00009547933,0.00088334194,0.000085825784,0.000030835672,0.000110714245,0.00008960715,0.9577885,0.0017966446,0.0031847032,0.0011691,0.03459953],"study_design_scores_gemma":[0.000009851007,0.000033628345,0.00021501636,0.0000037898549,0.0000066695497,0.000027024433,0.00004858737,0.9960892,0.00046959816,0.0024723522,0.0006195232,0.000004702686],"about_ca_topic_score_codex":0.012135994,"about_ca_topic_score_gemma":0.012047523,"teacher_disagreement_score":0.012135994,"about_ca_system_score_codex":0.00095829036,"about_ca_system_score_gemma":0.0015507643,"threshold_uncertainty_score":0.024130702},"labels":[],"label_agreement":null},{"id":"W2759637265","doi":"10.1609/icaps.v27i1.13804","title":"The Two-Edged Nature of Diverse Action Costs","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"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":"Action (physics); Diversity (politics); Unit (ring theory); Computer science; Risk analysis (engineering); Feature (linguistics); Cost–benefit analysis; Distribution (mathematics); Search cost; Domain (mathematical analysis); Operations research; Total cost; Microeconomics; Economics; Business; Mathematics; Political science; Law","score_opus":0.04822625836150071,"score_gpt":0.3319589236488111,"score_spread":0.28373266528731034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759637265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5262442,0.0011784285,0.4342291,0.0016272677,0.000104280836,0.00019412472,0.0005721668,0.0004938703,0.035356548],"genre_scores_gemma":[0.93427205,0.000259693,0.06253087,0.00022039651,0.000027888282,0.00015932077,0.00022237732,0.00010659671,0.002200887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773896,0.00076274946,0.0001254487,0.00047142318,0.0006377917,0.00026361147],"domain_scores_gemma":[0.9801577,0.014916121,0.0012093886,0.002239476,0.00070634426,0.00077102263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019833795,0.0007460791,0.0010159648,0.0009453191,0.0010185189,0.0020971678,0.0017219073,0.0016722908,0.007903937],"category_scores_gemma":[0.01946603,0.00053436396,0.00075765676,0.0010855611,0.0015973975,0.0044523473,0.0022204078,0.0020512207,0.0006863696],"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.0015517529,0.001024747,0.011984312,0.00078693853,0.00033947034,0.0008844354,0.00042650526,0.49037868,0.021373885,0.23813589,0.0052725417,0.22784084],"study_design_scores_gemma":[0.00018490113,0.0008404657,0.0085683325,0.00006507508,0.000114372284,0.0007926464,0.00027367406,0.47390175,0.0067469557,0.5019615,0.0064739063,0.00007645076],"about_ca_topic_score_codex":0.0008624044,"about_ca_topic_score_gemma":0.0012959167,"teacher_disagreement_score":0.007903937,"about_ca_system_score_codex":0.00090055825,"about_ca_system_score_gemma":0.00089437654,"threshold_uncertainty_score":0.026441276},"labels":[],"label_agreement":null},{"id":"W2759836588","doi":"10.1609/icaps.v27i1.13825","title":"Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Node (physics); Heuristics; Mathematical optimization; Class (philosophy); Bidirectional search; Heuristic; Incremental heuristic search; Search algorithm; Beam search; Computer science; Front (military); Focus (optics); Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.08026908485261397,"score_gpt":0.3518153585259207,"score_spread":0.27154627367330675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759836588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067150205,0.00031239114,0.9214025,0.00044936707,0.000036249392,0.00027526307,0.00035854627,0.0005222415,0.009493172],"genre_scores_gemma":[0.70213336,0.00062933983,0.29065144,0.00036967776,0.000075745425,0.0013123682,0.0012348475,0.0005125473,0.003080723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934633,0.002586976,0.0004416539,0.000915424,0.0014279718,0.0011647033],"domain_scores_gemma":[0.9449419,0.04430097,0.0029226693,0.0025462066,0.004114402,0.0011738274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007322401,0.0010523525,0.0015770317,0.0020277451,0.0011302965,0.0021152385,0.0017752209,0.0018743086,0.0080358675],"category_scores_gemma":[0.056638807,0.0012596467,0.0014873509,0.0014254649,0.0031974807,0.0070692427,0.002877188,0.003371411,0.0012259217],"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.00074581406,0.000317787,0.003839673,0.0007417638,0.00011417432,0.000597496,0.00073883036,0.48297176,0.012991902,0.45387676,0.0032232981,0.039840646],"study_design_scores_gemma":[0.00013430376,0.00026442335,0.0007572588,0.00025087383,0.00007097919,0.0001973821,0.00047053065,0.74065197,0.01144164,0.24174811,0.0039460203,0.000066512766],"about_ca_topic_score_codex":0.0019230007,"about_ca_topic_score_gemma":0.002226893,"teacher_disagreement_score":0.0080358675,"about_ca_system_score_codex":0.00092273834,"about_ca_system_score_gemma":0.0029805806,"threshold_uncertainty_score":0.03872502},"labels":[],"label_agreement":null},{"id":"W2760276144","doi":"10.1609/icaps.v27i1.13803","title":"Analytic Decision Analysis via Symbolic Dynamic Programming for Parameterized Hybrid MDPs","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":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":"Parameterized complexity; Mathematical optimization; Computer science; Leverage (statistics); Discretization; Nonlinear programming; Convex optimization; Dynamic programming; Scalability; Piecewise; Optimization problem; Nonlinear system; Mathematics; Regular polygon; Algorithm; Artificial intelligence","score_opus":0.03706048564634457,"score_gpt":0.3302437727257557,"score_spread":0.29318328707941116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760276144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004916124,0.00022101733,0.99078196,0.0003016314,0.000018386248,0.00004386415,0.000079145684,0.00012831429,0.003509509],"genre_scores_gemma":[0.6025982,0.0010339406,0.3896455,0.00023133984,0.00009071044,0.0008320038,0.0003867902,0.00025654575,0.004924953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988096,0.0005609846,0.000057364457,0.00015003045,0.00030861262,0.000113368114],"domain_scores_gemma":[0.99365175,0.0053240787,0.00037856918,0.00017773775,0.00033530034,0.000132539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026924505,0.001603412,0.0015408281,0.0011081863,0.00068882265,0.0023016504,0.0012492315,0.0014173749,0.00381734],"category_scores_gemma":[0.010073344,0.00086273643,0.0013837893,0.0010973169,0.002366537,0.0015457725,0.0024328944,0.002495963,0.00029469936],"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.000008898623,0.000007870507,0.000119726756,0.000037010403,0.000012896955,0.000028226386,0.00002879675,0.9524428,0.00011176387,0.04380076,0.00018654556,0.0032146627],"study_design_scores_gemma":[0.000003284943,0.0000027805502,0.0000101631995,0.0000058104665,0.0000019688946,0.0000025811023,0.000005491369,0.97706085,0.00004551621,0.022649815,0.00020988597,0.0000018461968],"about_ca_topic_score_codex":0.009015997,"about_ca_topic_score_gemma":0.0073889312,"teacher_disagreement_score":0.009015997,"about_ca_system_score_codex":0.0031495672,"about_ca_system_score_gemma":0.0032323461,"threshold_uncertainty_score":0.022851825},"labels":[],"label_agreement":null},{"id":"W2789610989","doi":"10.1609/icaps.v28i1.13920","title":"Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"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; Advanced Exploration Systems; National Aeronautics and Space Administration","keywords":"Computer science; Satisficing; Task (project management); Time horizon; Constraint (computer-aided design); Class (philosophy); Constraint programming; Quantum; Baseline (sea); Mathematical optimization; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Routing (electronic design automation)","score_opus":0.08699356612568282,"score_gpt":0.3177409570303168,"score_spread":0.23074739090463398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789610989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09343936,0.002526367,0.883769,0.0016409795,0.00020732758,0.0002456944,0.0002743074,0.0020166808,0.015880222],"genre_scores_gemma":[0.46560863,0.0009391895,0.5297212,0.00041770228,0.00007802027,0.00023924756,0.00036884073,0.0005928011,0.00203432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971252,0.0013643324,0.00013651872,0.00043447464,0.00067249325,0.00026690963],"domain_scores_gemma":[0.9852705,0.011815659,0.00043637835,0.0013273,0.0008173722,0.0003328006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014354,0.001117979,0.0007923367,0.0010710092,0.0006854163,0.0019972012,0.0018236797,0.0011189667,0.0031678365],"category_scores_gemma":[0.019111661,0.0005931284,0.00096324127,0.0021480566,0.0014566934,0.0032303021,0.0018865786,0.0031278415,0.00030636982],"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.00028965445,0.00018551077,0.0015401752,0.00038517086,0.000111212925,0.00007195822,0.00020963224,0.80845124,0.0020926143,0.03643868,0.0021849643,0.14803922],"study_design_scores_gemma":[0.000033268465,0.00009891077,0.00027781245,0.000031423,0.00003614138,0.000024852661,0.000078923316,0.97153676,0.001647159,0.023350775,0.0028669063,0.000016998547],"about_ca_topic_score_codex":0.015272856,"about_ca_topic_score_gemma":0.02539518,"teacher_disagreement_score":0.015272856,"about_ca_system_score_codex":0.0018641354,"about_ca_system_score_gemma":0.0041817874,"threshold_uncertainty_score":0.03036791},"labels":[],"label_agreement":null},{"id":"W2809867153","doi":"10.1609/icaps.v28i1.13885","title":"MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Merge (version control); Heuristics; Computer science; Algorithm; Parallel computing","score_opus":0.04241745071625335,"score_gpt":0.3183386825914925,"score_spread":0.27592123187523915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809867153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004142925,0.00029984917,0.9804968,0.00017044596,0.000063501284,0.00016678269,0.00034653716,0.011653757,0.002659405],"genre_scores_gemma":[0.04740334,0.00016239539,0.94537777,0.00023992563,0.00004076307,0.00028077234,0.0010807847,0.0021448634,0.003269441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858934,0.0003266295,0.00012580228,0.00024030554,0.0005648136,0.00015299504],"domain_scores_gemma":[0.9978957,0.00095394964,0.00017231879,0.00058710575,0.00027229468,0.00011851387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019228644,0.001201109,0.0011483249,0.002145255,0.00091176503,0.0012998341,0.002763351,0.0012182577,0.009785345],"category_scores_gemma":[0.0064840103,0.00097574224,0.0019627952,0.001702776,0.0011268948,0.0033376666,0.0041919323,0.0022507452,0.0027088507],"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.0005978957,0.00018160329,0.0016450948,0.00092747837,0.00018715244,0.00026329726,0.00054389285,0.06501036,0.0141289625,0.037405048,0.043618847,0.8354904],"study_design_scores_gemma":[0.00041079408,0.0002491174,0.00076793734,0.00013949533,0.00013899946,0.00035552384,0.0002739718,0.8135482,0.022153411,0.07758121,0.08426635,0.00011495494],"about_ca_topic_score_codex":0.0023352094,"about_ca_topic_score_gemma":0.005862273,"teacher_disagreement_score":0.009785345,"about_ca_system_score_codex":0.0007958653,"about_ca_system_score_gemma":0.0023849178,"threshold_uncertainty_score":0.03273529},"labels":[],"label_agreement":null},{"id":"W2810026609","doi":"10.1609/icaps.v28i1.13919","title":"Compiling Optimal Numeric Planning to Mixed Integer Linear Programming","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Mathematical optimization; Linear programming; Computer science; Encoding (memory); Heuristic; Integer (computer science); Dependency (UML); Simple (philosophy); State (computer science); Class (philosophy); Branch and price; Action (physics); Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.06534018288188553,"score_gpt":0.34910988811430615,"score_spread":0.2837697052324206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810026609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006162268,0.00015609096,0.98601425,0.00015547086,0.000058995505,0.000075873046,0.000078844794,0.0015146605,0.00578351],"genre_scores_gemma":[0.18232319,0.0003664947,0.8144006,0.00013090011,0.00005191793,0.00032172538,0.00030344358,0.0005027882,0.0015988935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988967,0.00041886602,0.00007338995,0.0001643552,0.00033170125,0.00011489172],"domain_scores_gemma":[0.9981129,0.0012919204,0.00017024338,0.00023410251,0.00015474766,0.00003601683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011325506,0.0011145597,0.0006301993,0.00067394157,0.00041258294,0.0012208045,0.0007833642,0.0005822318,0.003995216],"category_scores_gemma":[0.0050749956,0.00069558405,0.0008033917,0.00075027643,0.0009879072,0.0010409154,0.0012817846,0.0016162421,0.0007904793],"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.000067782916,0.00006516718,0.00034956288,0.0002654563,0.000028092383,0.00012826323,0.000083478,0.859787,0.002580907,0.049934015,0.0024953939,0.08421494],"study_design_scores_gemma":[0.000016137927,0.000035877314,0.00005057824,0.00004742427,0.000012530197,0.000034790966,0.000026011125,0.96430224,0.0029828574,0.027863538,0.004620312,0.000007604922],"about_ca_topic_score_codex":0.0016659907,"about_ca_topic_score_gemma":0.0024974619,"teacher_disagreement_score":0.003995216,"about_ca_system_score_codex":0.00071444217,"about_ca_system_score_gemma":0.0017249195,"threshold_uncertainty_score":0.013365328},"labels":[],"label_agreement":null},{"id":"W2810178509","doi":"10.1609/icaps.v28i1.13908","title":"Finite LTL Synthesis as Planning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"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":"Computer science; Linear temporal logic; Leverage (statistics); Automaton; Program synthesis; Finite-state machine; Theoretical computer science; Bottleneck; Transformation (genetics); Exploit; Algorithm; Artificial intelligence","score_opus":0.06458275588763768,"score_gpt":0.33623961333948554,"score_spread":0.27165685745184787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810178509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002350124,0.00044621044,0.9841988,0.0004583433,0.00010007831,0.00015130363,0.00019026331,0.0011664291,0.010938436],"genre_scores_gemma":[0.16307835,0.0013692906,0.82496905,0.00060674094,0.000120516546,0.0008537422,0.0010262023,0.0008548939,0.0071212226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724966,0.0009769473,0.0002185951,0.0003908275,0.0009791102,0.00018486526],"domain_scores_gemma":[0.99463487,0.0036439034,0.0002979759,0.00082174287,0.0004999962,0.00010148868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024950777,0.0010578961,0.0005316161,0.0007879096,0.00068614754,0.0025683492,0.0015736776,0.0011141878,0.0057981927],"category_scores_gemma":[0.008872671,0.0005287741,0.0014169457,0.0009959798,0.0029667825,0.0023184526,0.001862954,0.002312405,0.0014461868],"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.00006967931,0.00007630766,0.00036455176,0.0005999936,0.000046547906,0.00035060055,0.00041204505,0.23420374,0.006205636,0.67386,0.0044273213,0.07938354],"study_design_scores_gemma":[0.000054948734,0.000059847538,0.00008295104,0.00021915926,0.00005003039,0.00011221231,0.00009560599,0.38306868,0.010686052,0.5647489,0.040790714,0.000030945088],"about_ca_topic_score_codex":0.0033999665,"about_ca_topic_score_gemma":0.0046465653,"teacher_disagreement_score":0.0057981927,"about_ca_system_score_codex":0.0023568347,"about_ca_system_score_gemma":0.0031536538,"threshold_uncertainty_score":0.019396901},"labels":[],"label_agreement":null},{"id":"W2910547178","doi":"10.1609/icaps.v29i1.3505","title":"Robust and Adaptive Planning under Model Uncertainty","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Robustness (evolution); Computation; Mathematical optimization; Computer science; Adversary; Monte Carlo method; Tree (set theory); Decision tree; Monte Carlo tree search; Bayesian probability; Artificial intelligence; Algorithm; Mathematics","score_opus":0.2897143656682048,"score_gpt":0.4215858200438864,"score_spread":0.1318714543756816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910547178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016926346,0.0002465859,0.9803098,0.00038306933,0.000018721244,0.000040629504,0.0000468272,0.00028371124,0.0017443015],"genre_scores_gemma":[0.79371476,0.00030996156,0.20392357,0.00021380566,0.000050386996,0.0001788701,0.0001437947,0.00011302432,0.0013517059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752635,0.0011766846,0.00009014459,0.00046879015,0.00050527946,0.00023272741],"domain_scores_gemma":[0.99229187,0.0061224164,0.0006181364,0.0004836604,0.00030974846,0.00017404601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037799107,0.0010193994,0.0013112088,0.0006441492,0.00060471543,0.0015408259,0.0015288418,0.0014758426,0.001630049],"category_scores_gemma":[0.015412479,0.00089016097,0.00086706923,0.00072609476,0.0021302213,0.0020743161,0.0019636343,0.00240529,0.00024261513],"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.000038616457,0.000012582888,0.00027542422,0.000021197842,0.00002409443,0.000025556072,0.000030178448,0.9756209,0.00021708618,0.014992732,0.00024717656,0.008494418],"study_design_scores_gemma":[0.0000067960036,0.000014128822,0.00004932036,0.000006470633,0.0000040722334,0.000009727318,0.0000061241694,0.97691786,0.00017462374,0.022632165,0.00017404565,0.000004662316],"about_ca_topic_score_codex":0.006579984,"about_ca_topic_score_gemma":0.004842952,"teacher_disagreement_score":0.006579984,"about_ca_system_score_codex":0.0015454429,"about_ca_system_score_gemma":0.0024748459,"threshold_uncertainty_score":0.019990385},"labels":[],"label_agreement":null},{"id":"W2964574649","doi":"10.1609/icaps.v29i1.3460","title":"Towards a Unified View of AI Planning and Reactive Synthesis","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"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; Microsoft Research","keywords":"Plan (archaeology); Linear temporal logic; Computer science; Temporal logic; Automated planning and scheduling; Artificial intelligence; Theoretical computer science; Geography","score_opus":0.04851122598432915,"score_gpt":0.32375637927044454,"score_spread":0.2752451532861154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964574649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030216638,0.00299658,0.9643375,0.004068834,0.00015997518,0.00006827632,0.00008321626,0.00021944375,0.025044426],"genre_scores_gemma":[0.20943391,0.0060836347,0.76980746,0.0018324651,0.0010729859,0.00078481,0.00031093034,0.0003066419,0.010367256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945287,0.0023986865,0.00034636498,0.00090608356,0.0014783341,0.00034177775],"domain_scores_gemma":[0.99293315,0.0041769105,0.00055961433,0.0011957798,0.0007643734,0.00037009348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005768453,0.0016940733,0.0016353211,0.0033659902,0.0015411027,0.008917711,0.0037378785,0.003251961,0.004414028],"category_scores_gemma":[0.0073303003,0.0015272406,0.0026489848,0.0022353618,0.012458281,0.0149525,0.0049407133,0.00982749,0.001074792],"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.0000122169995,0.000014830127,0.000044147335,0.00005656199,0.000009029529,0.000023745079,0.00016992344,0.006540883,0.00024594116,0.9880471,0.0003269222,0.004508582],"study_design_scores_gemma":[0.000016840082,0.000021823174,0.00008108146,0.00005817399,0.000014490403,0.000026000223,0.000116146155,0.039285015,0.00033985003,0.94762844,0.012394696,0.000017472146],"about_ca_topic_score_codex":0.004792717,"about_ca_topic_score_gemma":0.003666099,"teacher_disagreement_score":0.008917711,"about_ca_system_score_codex":0.0048911856,"about_ca_system_score_gemma":0.0034099,"threshold_uncertainty_score":0.03548819},"labels":[],"label_agreement":null},{"id":"W2964981248","doi":"10.1609/icaps.v29i1.3462","title":"Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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":"The Scarborough Hospital; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Heuristic; Computer science; Task (project management); Relaxation (psychology); Algorithm; State (computer science); Computation; Theoretical computer science; Binary number; Mathematical optimization; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.04687297143215736,"score_gpt":0.3066115264322689,"score_spread":0.25973855500011156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964981248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01101389,0.00023764672,0.98365027,0.00017827014,0.00006340085,0.00014693975,0.00023288824,0.00061931595,0.0038573355],"genre_scores_gemma":[0.14688867,0.00028819643,0.8496986,0.00013860122,0.000021806583,0.00031200433,0.0006038446,0.00021067173,0.0018375817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983621,0.0006654042,0.00009453437,0.00024319485,0.00045527166,0.00017953606],"domain_scores_gemma":[0.9965012,0.0023112635,0.00024659286,0.00045664387,0.00034270983,0.00014157855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019560605,0.0011933305,0.0010559506,0.0013789914,0.00063170743,0.001700189,0.0016690961,0.0010029242,0.006045937],"category_scores_gemma":[0.0066906894,0.0009230606,0.00156787,0.0011456901,0.0014630883,0.001848544,0.0014643464,0.0021611596,0.00085119205],"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.00029044005,0.0001497475,0.0005970396,0.00040515242,0.000055457385,0.00012730256,0.0002038097,0.8046074,0.003751592,0.07860102,0.003231095,0.10797998],"study_design_scores_gemma":[0.00008095855,0.0001692906,0.000119034165,0.00008819166,0.000035618858,0.00005425036,0.000056404988,0.93972886,0.0029564744,0.050534308,0.0061499747,0.000026638088],"about_ca_topic_score_codex":0.0045321006,"about_ca_topic_score_gemma":0.006569703,"teacher_disagreement_score":0.006045937,"about_ca_system_score_codex":0.0013076338,"about_ca_system_score_gemma":0.002861761,"threshold_uncertainty_score":0.020225704},"labels":[],"label_agreement":null},{"id":"W2965569070","doi":"10.1609/icaps.v29i1.3529","title":"Learning Interpretable Models Expressed in Linear Temporal Logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"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; Microsoft Research","keywords":"Artificial intelligence; Computer science; Linear temporal logic; Oracle; Classifier (UML); Machine learning; Relevance (law); Set (abstract data type); Feature learning; Temporal logic; Theoretical computer science","score_opus":0.034693092630761306,"score_gpt":0.2746181787677578,"score_spread":0.23992508613699648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965569070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026291145,0.0000822114,0.970918,0.00038650288,0.000014920465,0.000056595287,0.00034523875,0.0007417713,0.0011636605],"genre_scores_gemma":[0.58489734,0.00022131715,0.41125095,0.00024886892,0.000037570542,0.00028029986,0.0012616743,0.00012364975,0.0016783688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981962,0.0006266865,0.00012093525,0.0004306948,0.00048669,0.00013886548],"domain_scores_gemma":[0.9915495,0.0062584793,0.00084129674,0.0006781178,0.0005512209,0.00012141916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766897,0.0008472868,0.00058271835,0.0008982187,0.00034065158,0.0016157735,0.0016747835,0.0008416541,0.0022217182],"category_scores_gemma":[0.013231933,0.00043631732,0.0012004909,0.00088530243,0.0017164497,0.0025922712,0.000995047,0.0017451239,0.0003488501],"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.00023332256,0.00021154778,0.0036808539,0.00026603058,0.000099753284,0.00034180575,0.0006390561,0.78947794,0.0053739785,0.12987256,0.0012948953,0.06850826],"study_design_scores_gemma":[0.000014822806,0.00003526843,0.000108332526,0.000016098447,0.000013410383,0.00002446526,0.000027211207,0.9253917,0.0015357892,0.072313085,0.0005124592,0.000007384541],"about_ca_topic_score_codex":0.0056621684,"about_ca_topic_score_gemma":0.009398586,"teacher_disagreement_score":0.0056621684,"about_ca_system_score_codex":0.0017667683,"about_ca_system_score_gemma":0.0018441246,"threshold_uncertainty_score":0.012818873},"labels":[],"label_agreement":null},{"id":"W2965668794","doi":"10.1609/icaps.v29i1.3548","title":"A Logical Semantics for PDDL+","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":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":"Toronto Metropolitan University; York University","funders":"","keywords":"Computer science; Semantics (computer science); Rotation formalisms in three dimensions; Situation calculus; Operational semantics; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.05743131545813914,"score_gpt":0.3053202317283896,"score_spread":0.24788891627025048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965668794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016845259,0.00019910152,0.98622406,0.0008959316,0.00016000391,0.00015742928,0.00042783187,0.0011755413,0.009075526],"genre_scores_gemma":[0.1309327,0.00066642184,0.85675323,0.0012874106,0.00023132222,0.00087301596,0.0014224105,0.00051392027,0.0073195547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597305,0.0011487517,0.00069994456,0.0007496809,0.0010490342,0.00037956523],"domain_scores_gemma":[0.99598086,0.0015512345,0.0003239731,0.0007165995,0.0011195383,0.00030774536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004483387,0.0010440532,0.0006299288,0.0015573706,0.0019527763,0.0059948293,0.0028873482,0.0015281339,0.006647779],"category_scores_gemma":[0.0053655426,0.0009509153,0.002212282,0.0013546397,0.0042993533,0.0063732835,0.005564719,0.0040898523,0.0020460112],"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.00003175963,0.000029686747,0.000118396674,0.00013885737,0.000012856146,0.00014944606,0.00037028242,0.0044492916,0.0009618805,0.9729355,0.002708427,0.018093633],"study_design_scores_gemma":[0.000103021455,0.000062873194,0.00009527827,0.00012182581,0.00004525301,0.00036223698,0.00026457265,0.043118764,0.005526738,0.768903,0.18133382,0.00006263142],"about_ca_topic_score_codex":0.0048214,"about_ca_topic_score_gemma":0.0034890883,"teacher_disagreement_score":0.006647779,"about_ca_system_score_codex":0.0026800463,"about_ca_system_score_gemma":0.003981729,"threshold_uncertainty_score":0.023710728},"labels":[],"label_agreement":null},{"id":"W2966291835","doi":"10.1609/icaps.v29i1.3474","title":"A Multi-Label A* Algorithm for Multi-Agent Pathfinding","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Pathfinding; Computer science; Computation; Pickup; Set (abstract data type); Heuristic; Sequence (biology); Mathematical optimization; Path (computing); Job shop scheduling; Algorithm; Theoretical computer science; Artificial intelligence; Shortest path problem; Mathematics; Schedule; Graph","score_opus":0.08975077837246882,"score_gpt":0.3315500664996794,"score_spread":0.24179928812721058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966291835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042322264,0.00016145463,0.990651,0.00023459004,0.00008073983,0.00011253521,0.00008908569,0.0015700591,0.0028683657],"genre_scores_gemma":[0.0755665,0.00012067142,0.9194245,0.00019865342,0.000036447593,0.00032191016,0.0003023596,0.00021890152,0.0038100285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991793,0.00023453396,0.000047549005,0.00023698444,0.00019774617,0.00010385896],"domain_scores_gemma":[0.9990181,0.00040094205,0.00012007757,0.00015641171,0.00018815034,0.000116399824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007754535,0.0010541967,0.0009599312,0.0012276617,0.0015535214,0.0011883554,0.002266566,0.0018452273,0.007421783],"category_scores_gemma":[0.0022163242,0.0005518098,0.0009750744,0.0013128058,0.00072623795,0.0015884452,0.0019659307,0.0020358048,0.002395174],"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.00032544162,0.00044695998,0.00080149045,0.00026633337,0.000085991465,0.00013874198,0.00013975374,0.3624319,0.006304887,0.032222323,0.019857956,0.57697827],"study_design_scores_gemma":[0.000077420926,0.00011360273,0.00011021134,0.000017899894,0.000015505238,0.000077744546,0.000035057958,0.9757204,0.0019506478,0.014009602,0.0078522395,0.00001955084],"about_ca_topic_score_codex":0.0052617807,"about_ca_topic_score_gemma":0.006389877,"teacher_disagreement_score":0.007421783,"about_ca_system_score_codex":0.001189804,"about_ca_system_score_gemma":0.003017764,"threshold_uncertainty_score":0.024828374},"labels":[],"label_agreement":null},{"id":"W2966466466","doi":"10.1609/icaps.v29i1.3504","title":"Learning Scheduling Models from Event Data","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Scheduling (production processes); Solver; Petri net; Job shop scheduling; Constraint programming; Schedule; Artificial intelligence; Distributed computing; Programming language; Mathematical optimization; Engineering; Operations management","score_opus":0.06287514748996063,"score_gpt":0.2836487717362305,"score_spread":0.22077362424626984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966466466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09270708,0.00031015553,0.8982129,0.0011797622,0.00008174234,0.0002470633,0.0029444874,0.002519602,0.0017972463],"genre_scores_gemma":[0.5721614,0.00043195425,0.4168536,0.00027572992,0.000086358756,0.0005598704,0.007889194,0.00020084798,0.0015410905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889624,0.00036815085,0.0000798636,0.00035370755,0.00021985681,0.00008220661],"domain_scores_gemma":[0.99037945,0.00775809,0.00050663255,0.00055192155,0.0006125863,0.00019125301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023033964,0.0014164384,0.00069779664,0.0012887868,0.0003796067,0.0013751568,0.0020274615,0.0011363232,0.0018252131],"category_scores_gemma":[0.011503729,0.00094071846,0.001211487,0.0012943094,0.0006853944,0.0019166688,0.000924446,0.0024419995,0.00039318576],"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.000055135853,0.00010405848,0.0018676259,0.00006348356,0.00003314004,0.00005524881,0.00004196399,0.9717225,0.0002899298,0.0030113363,0.0011184642,0.021637212],"study_design_scores_gemma":[0.000009274301,0.0000096606755,0.00010752577,0.0000040992095,0.000003932698,0.000005128921,0.000012371165,0.9945857,0.00022700228,0.0047308495,0.0003021885,0.0000023417595],"about_ca_topic_score_codex":0.010743552,"about_ca_topic_score_gemma":0.018503169,"teacher_disagreement_score":0.010743552,"about_ca_system_score_codex":0.0016652627,"about_ca_system_score_gemma":0.0024053312,"threshold_uncertainty_score":0.021362066},"labels":[],"label_agreement":null},{"id":"W2966682271","doi":"10.1609/icaps.v29i1.3490","title":"Error-Tolerant Anytime Approach to Plan Recognition Using a Particle Filter","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":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é du Québec à Montréal","funders":"AGE-WELL","keywords":"Computer science; Plan (archaeology); Extension (predicate logic); Particle filter; Filter (signal processing); Artificial intelligence; Tree (set theory); Machine learning; Kalman filter; Programming language; Computer vision; Mathematics","score_opus":0.10255879337915103,"score_gpt":0.2977517847957307,"score_spread":0.1951929914165797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966682271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015851599,0.000033717282,0.99691844,0.000033514196,0.000020165156,0.000021244487,0.000024009145,0.00093969353,0.0004239944],"genre_scores_gemma":[0.19609539,0.00012886524,0.8000702,0.00016226569,0.00004759256,0.0001530266,0.00023852536,0.00031495665,0.0027892105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990656,0.00013639973,0.00006374133,0.00028398013,0.00034507897,0.000105278275],"domain_scores_gemma":[0.99861026,0.0007187432,0.00012469682,0.0002755663,0.0002045278,0.00006619681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008309326,0.0010870234,0.0013409122,0.000776516,0.00067056937,0.0015461921,0.002027691,0.001130711,0.003660344],"category_scores_gemma":[0.0024877682,0.000626279,0.0012762328,0.0007077492,0.00084310694,0.0014469589,0.0012508114,0.0019482123,0.0008351205],"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.00023241215,0.0001319419,0.0008224322,0.00014041243,0.00011321863,0.00021283409,0.00018839697,0.68017894,0.014597347,0.03254317,0.0028645734,0.26797438],"study_design_scores_gemma":[0.000008369571,0.000016560596,0.00006910832,0.0000030758877,0.000009009655,0.000013090407,0.0000056844215,0.9918968,0.002063653,0.005184076,0.00072402216,0.000006656481],"about_ca_topic_score_codex":0.016121099,"about_ca_topic_score_gemma":0.014437759,"teacher_disagreement_score":0.016121099,"about_ca_system_score_codex":0.0012372249,"about_ca_system_score_gemma":0.0023813897,"threshold_uncertainty_score":0.032054484},"labels":[],"label_agreement":null},{"id":"W2966782683","doi":"10.1609/icaps.v29i1.3496","title":"Lagrangian Decomposition for Optimal Cost Partitioning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":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":"Polytechnique Montréal","funders":"European Commission","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristics; Solver; Computation; Computer science; Context (archaeology); Heuristic; Lagrange multiplier; Decomposition; Mathematics; Algorithm","score_opus":0.046115230530977894,"score_gpt":0.323265699325086,"score_spread":0.2771504687941081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966782683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005638027,0.00025631182,0.98444736,0.00020047645,0.000039999697,0.000054254357,0.00010552233,0.00012713368,0.009130887],"genre_scores_gemma":[0.22965296,0.00058852084,0.76112163,0.00022986093,0.000083462364,0.00042605645,0.00045200292,0.0004427701,0.0070026848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991204,0.00032991395,0.000029705086,0.00012892525,0.00024105323,0.00015001919],"domain_scores_gemma":[0.99852425,0.00094934035,0.00011679942,0.00011407375,0.00023101467,0.00006458463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014703611,0.0012131279,0.0010819352,0.0009414272,0.0006073759,0.0014956639,0.0008570685,0.00087893725,0.007492567],"category_scores_gemma":[0.0050420044,0.0005963868,0.0011572377,0.00090654194,0.0012605541,0.0016250762,0.0013063654,0.0023760803,0.0010608672],"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.000051148978,0.00003637987,0.00025165846,0.000174827,0.000025526986,0.000051422383,0.00007089139,0.7616774,0.001458252,0.20249312,0.0038767227,0.029832661],"study_design_scores_gemma":[0.000012828163,0.000017190143,0.00007538675,0.000028256392,0.000007383165,0.000013265473,0.000014537794,0.9024886,0.00047183313,0.09471925,0.0021440457,0.0000075103258],"about_ca_topic_score_codex":0.004208554,"about_ca_topic_score_gemma":0.0037390597,"teacher_disagreement_score":0.007492567,"about_ca_system_score_codex":0.0022151456,"about_ca_system_score_gemma":0.0022473626,"threshold_uncertainty_score":0.025065124},"labels":[],"label_agreement":null},{"id":"W3022772269","doi":"10.1609/icaps.v23i1.13578","title":"Temporal-Difference Search in Computer Go","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Artificial Intelligence in Games","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":"Monte Carlo tree search; Computer science; Monte Carlo method; Search algorithm; Reinforcement learning; Beam search; Tree (set theory); Binary search algorithm; Artificial intelligence; Temporal difference learning; Search tree; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.06008416597085555,"score_gpt":0.31047455053372397,"score_spread":0.25039038456286844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022772269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10161143,0.00037766888,0.8806758,0.0004435065,0.000071985385,0.00009078708,0.00008598417,0.0015722523,0.015070515],"genre_scores_gemma":[0.7355997,0.00015144939,0.2595221,0.00017660038,0.000019373712,0.00022574376,0.00010805717,0.00016546635,0.0040316046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941444,0.0002584828,0.000025030837,0.00010248275,0.000111818124,0.000087766464],"domain_scores_gemma":[0.99777824,0.0017536904,0.00009701131,0.00011842672,0.00016075265,0.00009193768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014306831,0.00046912383,0.0008035164,0.00058780285,0.0005176599,0.0006831484,0.0012720404,0.00094756664,0.005210878],"category_scores_gemma":[0.005902319,0.00035382158,0.0004533354,0.0006542348,0.001334561,0.0015073244,0.0012101802,0.0010708541,0.0004509842],"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.00013207919,0.00004792016,0.0004641891,0.000042549753,0.000015762595,0.000042860785,0.000056138048,0.9341494,0.0004484367,0.039955515,0.0006888099,0.023956282],"study_design_scores_gemma":[0.000019102547,0.000015963804,0.000038381975,0.0000029298642,0.0000021834096,0.000005492081,0.0000065518816,0.9853873,0.000169387,0.013922663,0.0004275345,0.0000026488688],"about_ca_topic_score_codex":0.012461472,"about_ca_topic_score_gemma":0.009759002,"teacher_disagreement_score":0.012461472,"about_ca_system_score_codex":0.001512937,"about_ca_system_score_gemma":0.0016333028,"threshold_uncertainty_score":0.02477789},"labels":[],"label_agreement":null},{"id":"W3037289440","doi":"10.1609/icaps.v30i1.6672","title":"Predicting the Effectiveness of Bidirectional Heuristic Search","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Incremental heuristic search; Beam search; Heuristic; Bidirectional search; Computer science; Best-first search; Set (abstract data type); Search algorithm; Iterative deepening depth-first search; Artificial intelligence; Consistent heuristic; Space (punctuation); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.04473747509593059,"score_gpt":0.28533179241940027,"score_spread":0.24059431732346967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037289440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9228208,0.0019343058,0.06087211,0.00083445024,0.000061239574,0.00011434699,0.00020994898,0.00024148992,0.012911345],"genre_scores_gemma":[0.9838389,0.00030954008,0.015195118,0.00006456505,0.00002087347,0.00004124966,0.00016926606,0.000041759424,0.00031865825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959533,0.002172887,0.0003408403,0.00042216555,0.0006926417,0.00041812632],"domain_scores_gemma":[0.92380553,0.06431035,0.0035104754,0.003659166,0.0035876764,0.001126778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011643898,0.0004920479,0.0007109189,0.0019889572,0.00056536216,0.0019069305,0.0007899687,0.0013268137,0.001968775],"category_scores_gemma":[0.07752342,0.00029252906,0.00038060427,0.001819853,0.00082823815,0.0040686536,0.0012361282,0.0012035914,0.00051740784],"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.0020644732,0.0007194016,0.08426953,0.0005415516,0.0003186733,0.00014258253,0.00036515173,0.61612993,0.0047821836,0.025569735,0.0022467615,0.26284996],"study_design_scores_gemma":[0.00007329182,0.0007967327,0.0076827374,0.00008298163,0.00007790401,0.00007855315,0.000343835,0.95894444,0.0027968204,0.02785059,0.0012442771,0.00002780918],"about_ca_topic_score_codex":0.0030697903,"about_ca_topic_score_gemma":0.00405214,"teacher_disagreement_score":0.011643898,"about_ca_system_score_codex":0.0009927393,"about_ca_system_score_gemma":0.0011946509,"threshold_uncertainty_score":0.061579585},"labels":[],"label_agreement":null},{"id":"W3037357983","doi":"10.1609/icaps.v30i1.6642","title":"Probabilistic Robust Multi-Agent Path Finding","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"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":"Probabilistic logic; Path (computing); Set (abstract data type); Computer science; Task (project management); Mathematical optimization; Algorithm; Robustness (evolution); Mathematics; Artificial intelligence; Engineering","score_opus":0.11003610080036016,"score_gpt":0.2997737098215403,"score_spread":0.18973760902118011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037357983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009355963,0.00017581035,0.9887977,0.0001232768,0.000018067822,0.00004879564,0.000048186375,0.00048775144,0.00094444986],"genre_scores_gemma":[0.5698254,0.00026307252,0.42783025,0.00009935939,0.00003163722,0.00017317238,0.00023449477,0.00015907276,0.0013834783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977335,0.0005827224,0.00013584826,0.0006535474,0.0007005067,0.00019380097],"domain_scores_gemma":[0.994352,0.0033801787,0.00082844676,0.0007072294,0.00058907125,0.00014302997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002519101,0.0011331787,0.0015170664,0.0009298858,0.00083178544,0.0011050812,0.0023171734,0.0014106439,0.00181761],"category_scores_gemma":[0.011570871,0.0006965545,0.0009789333,0.0010319296,0.001326712,0.002177102,0.0019978352,0.0011973873,0.00040122966],"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.00012310839,0.00002475355,0.0005535466,0.00010871129,0.000055910063,0.000089788016,0.000054325614,0.94834346,0.0028454151,0.012328729,0.0007236297,0.034748584],"study_design_scores_gemma":[0.000014389793,0.000036694604,0.00009108083,0.000006482729,0.000010293725,0.00004188665,0.000014102765,0.9886629,0.0014848877,0.009003654,0.0006236476,0.000010038292],"about_ca_topic_score_codex":0.0035122877,"about_ca_topic_score_gemma":0.0029511377,"teacher_disagreement_score":0.0035122877,"about_ca_system_score_codex":0.0010491333,"about_ca_system_score_gemma":0.0019861034,"threshold_uncertainty_score":0.013322413},"labels":[],"label_agreement":null},{"id":"W3037476194","doi":"10.1609/icaps.v30i1.6750","title":"Symbolic Plans as High-Level Instructions for Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"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; Agencia Nacional de Investigación y Desarrollo","keywords":"Reinforcement learning; Computer science; Maximization; Task (project management); State (computer science); Action (physics); Artificial intelligence; Machine learning; Mathematical optimization; Programming language; Mathematics","score_opus":0.06793028415246624,"score_gpt":0.2946574244530109,"score_spread":0.22672714030054467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037476194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052887355,0.000078589524,0.9906295,0.00016310209,0.000023125052,0.00007829276,0.00014442192,0.0011600162,0.0024341128],"genre_scores_gemma":[0.32125375,0.0002858556,0.67351407,0.00013645689,0.000034655215,0.00073300884,0.000551039,0.0003549987,0.0031362632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992112,0.00031612845,0.00005373417,0.00010008198,0.00025568777,0.00006314241],"domain_scores_gemma":[0.9979942,0.0013510664,0.0001562772,0.00024699362,0.00017275491,0.000078727826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009220642,0.0009569907,0.0005375133,0.00060971855,0.00040790992,0.0014802931,0.0014559459,0.001081959,0.0067497194],"category_scores_gemma":[0.005684379,0.0005982025,0.00067706226,0.000517505,0.0017944752,0.0016403134,0.0013229751,0.0021238574,0.001077303],"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.00009262133,0.000074097064,0.0004924997,0.00017636367,0.0000248787,0.00014599382,0.00025756037,0.75723565,0.0035798112,0.17657292,0.0022208618,0.059126742],"study_design_scores_gemma":[0.000022698267,0.000021427357,0.00003591673,0.000025573141,0.0000067927976,0.000012233066,0.000018364322,0.91994303,0.001454306,0.075977094,0.00247506,0.0000075468433],"about_ca_topic_score_codex":0.0034269711,"about_ca_topic_score_gemma":0.0065199225,"teacher_disagreement_score":0.0067497194,"about_ca_system_score_codex":0.0013063207,"about_ca_system_score_gemma":0.0019198176,"threshold_uncertainty_score":0.022580087},"labels":[],"label_agreement":null},{"id":"W3038024331","doi":"10.1609/icaps.v30i1.6661","title":"New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"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); Symmetry (geometry); Context (archaeology); Rotational symmetry; Computer science; Symmetry breaking; Class (philosophy); Local symmetry; Theoretical computer science; Algorithm; Theoretical physics; Mathematics; Artificial intelligence; Physics; Geometry; Quantum mechanics","score_opus":0.09075200892442147,"score_gpt":0.32523314933394004,"score_spread":0.23448114040951856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038024331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003232186,0.00014437898,0.9944899,0.00015654459,0.000045178196,0.00010474075,0.00005017758,0.0005988915,0.0011779953],"genre_scores_gemma":[0.07862236,0.00016623367,0.91970265,0.00015716715,0.00006196966,0.0001568922,0.00019558799,0.00023942968,0.0006976732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946701,0.0011898722,0.00045292993,0.00097108743,0.0022969695,0.000418977],"domain_scores_gemma":[0.99040926,0.0042023514,0.0012227803,0.0029489696,0.0009630592,0.00025356092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036357278,0.0016026672,0.0012039577,0.0022231224,0.0016448568,0.0021274714,0.005007133,0.0018420683,0.0040743225],"category_scores_gemma":[0.015263801,0.0011124675,0.002897566,0.002326881,0.0023627675,0.006254588,0.0050415425,0.0057846736,0.00096957316],"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.000315312,0.0004777876,0.0027027368,0.0009077336,0.00030137942,0.00078585825,0.000999699,0.19292822,0.032591328,0.24276967,0.008241176,0.5169791],"study_design_scores_gemma":[0.00011408725,0.00015557397,0.0004543735,0.00010764051,0.000103436534,0.0005833098,0.0002122971,0.77199584,0.019394916,0.19299439,0.013802428,0.0000817677],"about_ca_topic_score_codex":0.0025649618,"about_ca_topic_score_gemma":0.0032049592,"teacher_disagreement_score":0.005007133,"about_ca_system_score_codex":0.0011973493,"about_ca_system_score_gemma":0.0024319259,"threshold_uncertainty_score":0.019227803},"labels":[],"label_agreement":null},{"id":"W3131156720","doi":"10.1609/icaps.v31i1.15972","title":"Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Wireless Networks and Protocols","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 Toronto","funders":"","keywords":"Computer science; Fairness measure; Distributed computing; Scheduling (production processes); Information exchange; Queueing theory; Maximum throughput scheduling; Computer network; Throughput; Dynamic priority scheduling; Round-robin scheduling; Mathematical optimization; Wireless; Quality of service","score_opus":0.06390188017009031,"score_gpt":0.31187907324612674,"score_spread":0.24797719307603644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131156720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003482458,0.0006024604,0.9934509,0.00021929397,0.00016894621,0.00014265132,0.000026447071,0.00018279675,0.0017241077],"genre_scores_gemma":[0.619772,0.0014377807,0.3718599,0.00023733485,0.00049461605,0.0007338187,0.00014813052,0.00013144067,0.0051849606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651176,0.0013072834,0.00021802502,0.0005495956,0.0010658742,0.00034757762],"domain_scores_gemma":[0.99604994,0.0023624708,0.00030856664,0.00035998016,0.00068313984,0.00023586897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006391339,0.0013525216,0.002016052,0.0011701945,0.0025554686,0.0024872383,0.0034742663,0.0017443491,0.002631066],"category_scores_gemma":[0.010885331,0.0005138676,0.000829375,0.0016409938,0.002037822,0.0028054737,0.0019922024,0.0020088311,0.0004919408],"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.00017380484,0.0000969651,0.00038896207,0.00018593196,0.00005815274,0.00015820583,0.0002202999,0.76242614,0.0019650983,0.1859661,0.0023601686,0.04600024],"study_design_scores_gemma":[0.000030296054,0.000026320084,0.000040004023,0.000008571978,0.0000098182845,0.000015102221,0.0000150859105,0.96123695,0.00032176726,0.03651963,0.0017657734,0.000010703544],"about_ca_topic_score_codex":0.007865684,"about_ca_topic_score_gemma":0.005722222,"teacher_disagreement_score":0.007865684,"about_ca_system_score_codex":0.0044862074,"about_ca_system_score_gemma":0.0049658064,"threshold_uncertainty_score":0.03380102},"labels":[],"label_agreement":null},{"id":"W31312056","doi":"10.1609/icaps.v19i1.13387","title":"Computing Robust Plans in Continuous Domains","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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":"Robustness (evolution); Computer science; Random variable; Gaussian; State variable; Mathematical optimization; Mathematics; Statistics","score_opus":0.031302243109750494,"score_gpt":0.2745356781969923,"score_spread":0.24323343508724182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31312056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065679386,0.00024864683,0.93067217,0.00021601122,0.000017252565,0.00008971429,0.00026851156,0.0013939054,0.00141445],"genre_scores_gemma":[0.6404954,0.00022080982,0.35751984,0.00006865563,0.000031202955,0.0001848623,0.00061810226,0.00018527936,0.0006758243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745196,0.00082854944,0.00017771362,0.0005379027,0.0007586465,0.00024515242],"domain_scores_gemma":[0.9908728,0.0070655514,0.0007275667,0.0006813575,0.00044144978,0.00021145128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00311046,0.0010784735,0.0012020579,0.0016875836,0.0005908709,0.0014351864,0.0012611384,0.0011824961,0.0017787098],"category_scores_gemma":[0.015606333,0.0009821174,0.00167673,0.0010212628,0.0025580563,0.0026210733,0.0022639344,0.0015048776,0.00027885815],"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.00011572477,0.000024951427,0.00060755614,0.00008786538,0.00005558034,0.00010835791,0.00009205623,0.957187,0.0014174313,0.020572243,0.00028729395,0.019443952],"study_design_scores_gemma":[0.00001655076,0.000030684947,0.0001223015,0.000009662991,0.0000136394965,0.000016304177,0.000022363216,0.9559943,0.0011982736,0.04234312,0.00022421867,0.000008629692],"about_ca_topic_score_codex":0.005849578,"about_ca_topic_score_gemma":0.0043362635,"teacher_disagreement_score":0.005849578,"about_ca_system_score_codex":0.0018393586,"about_ca_system_score_gemma":0.0020502948,"threshold_uncertainty_score":0.016449869},"labels":[],"label_agreement":null},{"id":"W3173855118","doi":"10.1609/icaps.v31i1.15978","title":"Iterative-deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":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":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Heuristics; Iterative deepening depth-first search; Heuristic; Incremental heuristic search; Beam search; Bidirectional search; Search algorithm; Node (physics); Exploit; Algorithm; Artificial intelligence","score_opus":0.04752449624311907,"score_gpt":0.308609240293454,"score_spread":0.26108474405033494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173855118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039525144,0.0003331674,0.9542213,0.00010462054,0.00003658355,0.00010232935,0.0000730142,0.0011556635,0.004448116],"genre_scores_gemma":[0.45484173,0.00018081984,0.54018766,0.0001752399,0.00002362073,0.0003499197,0.00026916357,0.00024448504,0.0037272852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927276,0.0002375053,0.00004775888,0.00010750136,0.00018991293,0.00014458469],"domain_scores_gemma":[0.9981893,0.00093613437,0.00016462096,0.0003257062,0.00029703783,0.00008730422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013471358,0.00090863684,0.0011652524,0.00083171285,0.00045416504,0.0010268795,0.002052001,0.0011652979,0.0030947016],"category_scores_gemma":[0.004657945,0.00066377106,0.0008181409,0.0009407909,0.0006978236,0.0014903268,0.0022355183,0.0011807532,0.0006196139],"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.00030928617,0.0001939419,0.0014626653,0.0001980878,0.00007136998,0.00008572847,0.0002218,0.72118646,0.0058673546,0.022521015,0.0018949906,0.24598734],"study_design_scores_gemma":[0.000038285845,0.00006478089,0.0000748796,0.00001298339,0.000013083897,0.000020782687,0.0000239184,0.99066824,0.0014788958,0.006581652,0.0010149467,0.000007734953],"about_ca_topic_score_codex":0.005499488,"about_ca_topic_score_gemma":0.0058345315,"teacher_disagreement_score":0.005499488,"about_ca_system_score_codex":0.0007112656,"about_ca_system_score_gemma":0.002192613,"threshold_uncertainty_score":0.010934949},"labels":[],"label_agreement":null},{"id":"W3175465930","doi":"10.1609/icaps.v31i1.15961","title":"Jump Point Search with Temporal Obstacles","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":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":"Australian Research Council; Monash University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Jump; Point (geometry); Computer science; Variety (cybernetics); Grid; Path (computing); Motion planning; Space (punctuation); Order (exchange); Artificial intelligence; Robotics; Mathematical optimization; Algorithm; Robot; Mathematics; Geometry","score_opus":0.04692968483102595,"score_gpt":0.2901247606502225,"score_spread":0.24319507581919658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175465930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12664722,0.0004357078,0.8617276,0.0005344505,0.00013819792,0.000074481046,0.00019933646,0.0014798044,0.008763159],"genre_scores_gemma":[0.7671423,0.00012429475,0.22800212,0.00022926737,0.000038116636,0.00013049887,0.0003491334,0.00015756264,0.0038267265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997024,0.00007983223,0.0000142643585,0.00006324344,0.000080559395,0.000059680027],"domain_scores_gemma":[0.9992435,0.00046985585,0.00005801256,0.00008193443,0.00008082285,0.00006585154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000588726,0.00048823043,0.00072125957,0.00042190656,0.00044699386,0.0006321607,0.0010035803,0.0012751095,0.0035154682],"category_scores_gemma":[0.0026719004,0.0002573718,0.00045495492,0.00058724964,0.0007252092,0.0012453544,0.0015686025,0.0010084133,0.00042392334],"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.00042115877,0.00011219065,0.0010712119,0.000100454134,0.00005110054,0.00017794725,0.00010912234,0.8807702,0.0024247176,0.048216723,0.0031167131,0.063428424],"study_design_scores_gemma":[0.000039505023,0.000051115745,0.00007915527,0.0000054040365,0.000007299343,0.000023759152,0.000015512096,0.9811655,0.00061960425,0.017284846,0.0007025898,0.0000056939148],"about_ca_topic_score_codex":0.003661885,"about_ca_topic_score_gemma":0.003492759,"teacher_disagreement_score":0.003661885,"about_ca_system_score_codex":0.00048809274,"about_ca_system_score_gemma":0.00097385823,"threshold_uncertainty_score":0.011760473},"labels":[],"label_agreement":null},{"id":"W3175635045","doi":"10.1609/icaps.v31i1.15967","title":"A Competitive Analysis of Online Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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":"Competitive analysis; Online algorithm; Computer science; Controllability; Path (computing); Set (abstract data type); Bounded function; Plan (archaeology); Asymptotically optimal algorithm; Mathematical optimization; Bounded rationality; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Applied mathematics","score_opus":0.07027185868418233,"score_gpt":0.33327608150466753,"score_spread":0.2630042228204852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175635045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094758615,0.0012328794,0.87220675,0.0016819094,0.00013330596,0.0002801135,0.00041448502,0.00050601625,0.02878599],"genre_scores_gemma":[0.83818537,0.0008327143,0.15380332,0.00037138985,0.00025480098,0.0003563573,0.00037829595,0.00026218343,0.0055555124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958527,0.0012910673,0.00013347958,0.0008221744,0.0011611631,0.0007395182],"domain_scores_gemma":[0.97146565,0.02194344,0.0019511279,0.001844431,0.0016418586,0.0011535597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034584422,0.001688105,0.001836283,0.0013617877,0.001620413,0.0031684283,0.004348559,0.0019979437,0.0072544003],"category_scores_gemma":[0.027364645,0.0007489135,0.0012120942,0.0019374782,0.0023712385,0.006189651,0.002268574,0.0027432917,0.00092222594],"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.0006125075,0.00048672344,0.0028721439,0.00048362685,0.00015897366,0.00025317044,0.0003451309,0.7357164,0.0058977962,0.18306696,0.0054922965,0.06461427],"study_design_scores_gemma":[0.00003399568,0.00009810154,0.00022310876,0.000010364351,0.000020572774,0.00008633125,0.000041341205,0.9593786,0.00077029684,0.038003013,0.0013205148,0.000013764621],"about_ca_topic_score_codex":0.0055920617,"about_ca_topic_score_gemma":0.00311143,"teacher_disagreement_score":0.0072544003,"about_ca_system_score_codex":0.003370658,"about_ca_system_score_gemma":0.002855525,"threshold_uncertainty_score":0.024455965},"labels":[],"label_agreement":null},{"id":"W3176143362","doi":"10.1609/icaps.v31i1.15984","title":"Conflict-Based Increasing Cost Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"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; Lockheed Martin; University of Alberta; National Science Foundation","keywords":"Symmetry breaking; Symmetry (geometry); Computer science; ICTS; Tree (set theory); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Combinatorics; Physics; Geometry; Information and Communications Technology; World Wide Web","score_opus":0.18426027921152138,"score_gpt":0.4146299869876681,"score_spread":0.23036970777614674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176143362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051874615,0.00042649696,0.9352917,0.00028205512,0.000056046545,0.00016628024,0.00012506086,0.0006154904,0.011162213],"genre_scores_gemma":[0.45124322,0.00024729015,0.5445513,0.00015798189,0.000024684306,0.00024961538,0.00035312874,0.000121619705,0.003051153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876887,0.0004039593,0.00007733314,0.00017430416,0.0004360092,0.00013942391],"domain_scores_gemma":[0.9971474,0.0017596724,0.000231262,0.00030968952,0.0004381882,0.00011381329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001462009,0.00064725266,0.0008656993,0.0011996633,0.0005838992,0.0008029087,0.0023559032,0.0009636207,0.0044479063],"category_scores_gemma":[0.006321534,0.000324876,0.00064575113,0.0016475038,0.00064936554,0.0015476134,0.0015107149,0.0011408699,0.00043110517],"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.00031696897,0.0002574166,0.0021596912,0.00024064184,0.000087783206,0.0001595572,0.00019869924,0.55131197,0.0056563006,0.10477664,0.005501365,0.32933295],"study_design_scores_gemma":[0.00005441466,0.00009398102,0.00020379547,0.000012069593,0.00002301161,0.000095008436,0.000025167432,0.9749963,0.0018357498,0.01992788,0.0027213844,0.000011250291],"about_ca_topic_score_codex":0.0031382455,"about_ca_topic_score_gemma":0.0027618993,"teacher_disagreement_score":0.0044479063,"about_ca_system_score_codex":0.00084075355,"about_ca_system_score_gemma":0.0015291476,"threshold_uncertainty_score":0.0148797035},"labels":[],"label_agreement":null},{"id":"W3177062893","doi":"10.1609/icaps.v31i1.15964","title":"LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Operator (biology); Simple (philosophy); State (computer science); Mathematical optimization; Computer science; Consistent heuristic; Algorithm; Mathematics; Null-move heuristic; Constant (computer programming); Incremental heuristic search; Search algorithm; Beam search","score_opus":0.0314566558341207,"score_gpt":0.29300295957440925,"score_spread":0.26154630374028853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177062893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031176183,0.00035802374,0.9517906,0.0003345891,0.00008015077,0.00021221614,0.00029185592,0.00092552986,0.014830936],"genre_scores_gemma":[0.2751556,0.00016661936,0.7211844,0.00017446377,0.000033173823,0.00031117268,0.00044987162,0.00017301564,0.0023517103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998776,0.00051351247,0.000071750976,0.0001706941,0.00033041416,0.00013751189],"domain_scores_gemma":[0.9972325,0.0019756304,0.00024612393,0.00025027824,0.00017881276,0.00011676742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016270764,0.0009740963,0.0007617449,0.0010612983,0.0005475946,0.0010674355,0.0013997209,0.0010410417,0.005993613],"category_scores_gemma":[0.005903268,0.00046317678,0.00071768946,0.0013756577,0.0016635109,0.0015795437,0.0010934414,0.0018355893,0.00053877564],"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.0002070332,0.00012157246,0.00040548277,0.00024811522,0.000021994738,0.00012216228,0.000092235714,0.8449719,0.002602716,0.07299747,0.0023847735,0.075824544],"study_design_scores_gemma":[0.000049566013,0.000081259546,0.00013213999,0.000043368516,0.000009928606,0.000040187588,0.000031603005,0.9290458,0.0018434213,0.06647202,0.0022368946,0.000013744599],"about_ca_topic_score_codex":0.002855798,"about_ca_topic_score_gemma":0.004125028,"teacher_disagreement_score":0.005993613,"about_ca_system_score_codex":0.0017348008,"about_ca_system_score_gemma":0.0019057383,"threshold_uncertainty_score":0.020050585},"labels":[],"label_agreement":null},{"id":"W3198376353","doi":"10.1609/icaps.v31i1.15994","title":"Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"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; National Science Foundation; Deutsche Bahn; University of Southern California; Simon Fraser University","keywords":"Scalability; Computer science; Train; Distributed computing; Deadlock; Simulated annealing; Software; Motion planning; Plan (archaeology); Graph; Mathematical optimization; Operations research; Engineering; Robot; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics","score_opus":0.02591758923968751,"score_gpt":0.2511828116355023,"score_spread":0.2252652223958148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198376353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35243246,0.0034032324,0.5272508,0.020953646,0.0012028512,0.00034566884,0.002713159,0.029803189,0.061894894],"genre_scores_gemma":[0.7863993,0.0007655119,0.1974925,0.0008783239,0.000098768236,0.00017953246,0.00317603,0.0010647263,0.009945199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993285,0.00018797077,0.000016310723,0.00010208727,0.00021706957,0.00014804058],"domain_scores_gemma":[0.99886876,0.0005318839,0.000038116847,0.00011292356,0.00025005874,0.00019829629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019409013,0.00074099307,0.00050268683,0.00030886236,0.00066973746,0.0008423843,0.0010294336,0.0010133224,0.0045277653],"category_scores_gemma":[0.0028615259,0.00030731913,0.0005348106,0.00043867592,0.0009819303,0.0012271327,0.0013939581,0.001798405,0.00069125684],"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.00053083827,0.00016646128,0.0015931916,0.00016648209,0.00007894595,0.00034740675,0.00024923633,0.7299665,0.005965115,0.025474636,0.066604964,0.16885616],"study_design_scores_gemma":[0.00014144227,0.00014542641,0.00067528797,0.000023957346,0.00001805891,0.000047781974,0.00015874022,0.95279175,0.0027988777,0.015736382,0.027441764,0.000020528225],"about_ca_topic_score_codex":0.02024444,"about_ca_topic_score_gemma":0.025430799,"teacher_disagreement_score":0.02024444,"about_ca_system_score_codex":0.0013695719,"about_ca_system_score_gemma":0.0025143954,"threshold_uncertainty_score":0.040253222},"labels":[],"label_agreement":null},{"id":"W4312250476","doi":"10.1609/icaps.v32i1.19798","title":"Multi-Agent Path Finding with Temporal Jump Point Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Monash University; National Science Foundation; Northeast Normal University; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Pathfinding; Jump; Path (computing); Computer science; Point (geometry); Grid; Planner; Mathematical optimization; Work (physics); Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Shortest path problem; Physics","score_opus":0.06576627797060018,"score_gpt":0.3031903675507545,"score_spread":0.23742408958015432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312250476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017077582,0.00012287212,0.9781099,0.000082750565,0.000040163366,0.00006780021,0.000063347485,0.0012871849,0.0031484226],"genre_scores_gemma":[0.39389512,0.00011709612,0.6028639,0.000063135616,0.000019356241,0.00013130449,0.0002423284,0.00011950793,0.0025482627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996151,0.00009731066,0.000022600014,0.000073808056,0.00014406072,0.00004711761],"domain_scores_gemma":[0.9995091,0.00020815746,0.000042992484,0.000083978026,0.000101337224,0.000054502627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051145314,0.00046104428,0.00057473936,0.00057716435,0.00049673195,0.0006193323,0.00092907954,0.00057098037,0.0027293828],"category_scores_gemma":[0.0015148815,0.00024342984,0.00037580795,0.00086223555,0.0006610873,0.000992225,0.0012411671,0.000929713,0.00042469247],"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.0003809164,0.00013968875,0.001239255,0.00015688429,0.000050541952,0.0001615793,0.0001265263,0.7086121,0.009121652,0.046575475,0.0033174243,0.23011792],"study_design_scores_gemma":[0.000029014842,0.00005310652,0.00008585736,0.0000035911758,0.0000068555105,0.00002292889,0.000012113193,0.9901888,0.0021630884,0.0057472377,0.0016818988,0.00000554804],"about_ca_topic_score_codex":0.0065660165,"about_ca_topic_score_gemma":0.008282413,"teacher_disagreement_score":0.0065660165,"about_ca_system_score_codex":0.0005634865,"about_ca_system_score_gemma":0.0017046584,"threshold_uncertainty_score":0.013055623},"labels":[],"label_agreement":null},{"id":"W4312258528","doi":"10.1609/icaps.v23i1.13543","title":"Better Time Constrained Search via Randomization and Postprocessing","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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":"Satisficing; Computer science; Bounding overwatch; Set (abstract data type); Mathematical optimization; Beam search; Metric (unit); Heuristic; Quality (philosophy); Iterative deepening depth-first search; Ranking (information retrieval); Hypersphere; Incremental heuristic search; Search algorithm; Algorithm; Machine learning; Artificial intelligence; Mathematics","score_opus":0.018479973602937416,"score_gpt":0.2526648700279775,"score_spread":0.2341848964250401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312258528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025081862,0.00020906165,0.9670838,0.00021983145,0.000035610625,0.000113478985,0.00008799755,0.00299454,0.0041737873],"genre_scores_gemma":[0.36392066,0.00014906602,0.6311264,0.00026351959,0.00003607384,0.0003255901,0.0004789294,0.00070318347,0.0029964347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976909,0.00091710495,0.000120709985,0.00049684796,0.00054504804,0.00022936636],"domain_scores_gemma":[0.996838,0.0015354272,0.00029662662,0.0009953107,0.0002547676,0.00007994149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017,0.0010748539,0.0010889181,0.000650025,0.00047926276,0.0013505239,0.0020135639,0.0008357617,0.005822388],"category_scores_gemma":[0.0052409917,0.000593416,0.0012586778,0.0008369664,0.0013984931,0.0025784478,0.0018874813,0.0020575086,0.0010186795],"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.00072815997,0.00040718753,0.0009605874,0.00020081388,0.00007167687,0.0001543825,0.00023755875,0.6842359,0.022278799,0.07624624,0.0041692206,0.21030946],"study_design_scores_gemma":[0.00009818198,0.00019786661,0.00018203832,0.000016988408,0.00002190358,0.000033621523,0.000024828554,0.96186626,0.009386942,0.024969801,0.0031764915,0.000025040667],"about_ca_topic_score_codex":0.0023290098,"about_ca_topic_score_gemma":0.0036556912,"teacher_disagreement_score":0.005822388,"about_ca_system_score_codex":0.00091658393,"about_ca_system_score_gemma":0.0020119117,"threshold_uncertainty_score":0.019477844},"labels":[],"label_agreement":null},{"id":"W4312463518","doi":"10.1609/icaps.v21i1.13440","title":"Organizing Committee","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Flexible and Reconfigurable Manufacturing Systems","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 Toronto","funders":"","keywords":"Library science; Political science; Operations research; Computer science; Engineering management; Engineering","score_opus":0.0491570292906451,"score_gpt":0.23961464653735925,"score_spread":0.19045761724671414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312463518","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033435307,0.020836437,0.014584338,0.12476739,0.36737207,0.007889054,0.026578069,0.003176919,0.4314522],"genre_scores_gemma":[0.007268454,0.010025568,0.005587343,0.01227939,0.046992455,0.0037001085,0.015673835,0.0010216945,0.8974513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964142,0.0004521119,0.00030766174,0.000556461,0.0015913041,0.00067820284],"domain_scores_gemma":[0.97141933,0.0008780084,0.0010968226,0.0009886821,0.017617442,0.007999708],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0077279327,0.0014292886,0.001144567,0.0046007833,0.0035477525,0.0078196945,0.0028482324,0.0033870554,0.286634],"category_scores_gemma":[0.010052426,0.0006885405,0.0010611584,0.0028211356,0.0006520384,0.0027736588,0.0026404231,0.003288469,0.25258207],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003274678,0.000020377216,0.0001418306,0.00016168025,0.000004372863,0.000034719058,0.000030128502,0.000054829812,0.00027793564,0.0009125105,0.9730574,0.025271416],"study_design_scores_gemma":[0.000009072356,0.00001536317,0.00052389025,0.00012121234,0.0000047005,0.00003256014,0.00007496403,0.000054769585,0.0001305994,0.0004194935,0.9986064,0.0000068997592],"about_ca_topic_score_codex":0.0053730146,"about_ca_topic_score_gemma":0.007980328,"teacher_disagreement_score":0.71336603,"about_ca_system_score_codex":0.0032670065,"about_ca_system_score_gemma":0.011080334,"threshold_uncertainty_score":0.95888627},"labels":[],"label_agreement":null},{"id":"W4312465291","doi":"10.1609/icaps.v32i1.19862","title":"Resolving Misconceptions about the Plans of Agents via Theory of Mind","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Plan (archaeology); Set (abstract data type); Appeal; Computer science; Epistemology; Psychology; Management science; Political science; Engineering","score_opus":0.05234666380518317,"score_gpt":0.29057457838984685,"score_spread":0.2382279145846637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312465291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029121669,0.0007900838,0.9539829,0.005510661,0.00012014873,0.00013975096,0.00011139751,0.0012162665,0.009007095],"genre_scores_gemma":[0.55657065,0.000913972,0.43865988,0.0009643061,0.00009715365,0.0002592603,0.00037903505,0.00019312948,0.001962657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.986667,0.0075784824,0.0007382967,0.0014132358,0.0030283893,0.00057461084],"domain_scores_gemma":[0.944313,0.043164734,0.003753456,0.005301006,0.0027287905,0.0007389535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017520234,0.0015206207,0.0009355431,0.0033603993,0.0027670497,0.010621279,0.004292131,0.0033030845,0.0034867346],"category_scores_gemma":[0.05836134,0.0016125629,0.0025941767,0.0019204628,0.009990457,0.017317606,0.0066116555,0.0071588326,0.0006042456],"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.0005193709,0.0002473567,0.0066990433,0.0010871018,0.0005141608,0.0015836912,0.02189883,0.101134606,0.005576297,0.6710749,0.006125025,0.18353951],"study_design_scores_gemma":[0.00008191403,0.000080415586,0.0006132699,0.0002832261,0.00016255367,0.00030851326,0.0026367987,0.20863445,0.0034508808,0.7685893,0.015053951,0.00010474655],"about_ca_topic_score_codex":0.010245226,"about_ca_topic_score_gemma":0.0101496475,"teacher_disagreement_score":0.017520234,"about_ca_system_score_codex":0.005012096,"about_ca_system_score_gemma":0.0066184616,"threshold_uncertainty_score":0.09265697},"labels":[],"label_agreement":null},{"id":"W4312511734","doi":"10.1609/icaps.v24i1.13613","title":"Program Committee","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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 des Saarlandes; University of Toronto; King's College London; Universität Basel; Arizona State University; Carnegie Mellon University; University of Denver","keywords":"Political science; Computer science; Library science; Operations research; Engineering management; Engineering","score_opus":0.023630246233099225,"score_gpt":0.26931329406788673,"score_spread":0.2456830478347875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312511734","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030198195,0.011289854,0.025991868,0.11726206,0.13839766,0.017662542,0.047658704,0.006212527,0.632505],"genre_scores_gemma":[0.0061332975,0.00849046,0.011560196,0.013640538,0.020212347,0.009789463,0.026284162,0.0017278951,0.9021617],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959441,0.0005906566,0.00027597492,0.0005322179,0.0019988355,0.00065825426],"domain_scores_gemma":[0.9372849,0.0023286405,0.001925344,0.0020749927,0.043119673,0.013266365],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009008293,0.0012421925,0.0011805716,0.00386499,0.0030386294,0.00622836,0.002920191,0.0027496468,0.53399295],"category_scores_gemma":[0.020893218,0.00085231365,0.0010352619,0.0032480282,0.00055453327,0.003026206,0.002832263,0.003647463,0.39343813],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034267105,0.00004086314,0.00012205788,0.00017542826,0.0000035918722,0.000011283616,0.000017492246,0.000057114976,0.0001598397,0.0009730727,0.96434826,0.034056656],"study_design_scores_gemma":[0.000031354353,0.00004351705,0.0006642561,0.00024385295,0.0000072162757,0.00003179743,0.000066025255,0.0001320162,0.00028011523,0.0010542574,0.99743587,0.000009749988],"about_ca_topic_score_codex":0.0036440026,"about_ca_topic_score_gemma":0.0058522797,"teacher_disagreement_score":0.46600705,"about_ca_system_score_codex":0.002708597,"about_ca_system_score_gemma":0.016248541,"threshold_uncertainty_score":0.66470253},"labels":[],"label_agreement":null},{"id":"W4312577582","doi":"10.1609/icaps.v32i1.19826","title":"Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"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; University of Toronto; Fujitsu","keywords":"Computer science; Quadratic unconstrained binary optimization; Scheduling (production processes); Constraint programming; Integer programming; Job shop scheduling; Mathematical optimization; Theoretical computer science; Algorithm; Quantum; Quantum computer; Mathematics; Operating system; Schedule","score_opus":0.033205397598888214,"score_gpt":0.2629384316561554,"score_spread":0.22973303405726717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312577582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04978616,0.00050398416,0.93896383,0.00060560805,0.0001336345,0.00024016478,0.00016529,0.0009321182,0.008669208],"genre_scores_gemma":[0.38716385,0.00025093125,0.60789174,0.00033092898,0.00005208163,0.0004327986,0.00029870894,0.00020245553,0.0033765673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.0003029448,0.000032043292,0.00014196368,0.00013775137,0.00011326452],"domain_scores_gemma":[0.9978174,0.0015008646,0.00019553125,0.0001846492,0.00017575799,0.00012567674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015671932,0.00073423516,0.0011133527,0.00035221825,0.00066533795,0.0010212264,0.0016676029,0.0010223084,0.0050349385],"category_scores_gemma":[0.003625816,0.00063838845,0.0007748304,0.00061170605,0.0007564058,0.0010383491,0.0010630352,0.0012548323,0.0005898153],"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.00018764162,0.00015885211,0.00060692045,0.00022771534,0.00004787926,0.00005528356,0.00006497727,0.945084,0.0019021105,0.014810219,0.0022797391,0.034574594],"study_design_scores_gemma":[0.00002442753,0.00003156169,0.00006407229,0.0000066267908,0.000004132695,0.000005689977,0.000014080279,0.99559516,0.00030018468,0.003186352,0.00076468766,0.0000030882663],"about_ca_topic_score_codex":0.007285293,"about_ca_topic_score_gemma":0.009796454,"teacher_disagreement_score":0.007285293,"about_ca_system_score_codex":0.0009478209,"about_ca_system_score_gemma":0.0022404075,"threshold_uncertainty_score":0.016843617},"labels":[],"label_agreement":null},{"id":"W4312605127","doi":"10.1609/icaps.v32i1.19803","title":"LM-Cut Heuristics for Optimal Linear Numeric Planning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Simple (philosophy); Computer science; Mathematics","score_opus":0.04559055700428573,"score_gpt":0.2994431930214112,"score_spread":0.2538526360171255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312605127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011494394,0.0007912388,0.9779563,0.00020952249,0.000042291158,0.00014765839,0.00028849428,0.0011412653,0.007928815],"genre_scores_gemma":[0.2617546,0.00054151815,0.73231894,0.00029115842,0.000054401648,0.0006152841,0.0011268322,0.00037908665,0.0029181198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894446,0.00047418365,0.000053139305,0.00014272227,0.00026546605,0.00012011752],"domain_scores_gemma":[0.9972314,0.002191594,0.00015569008,0.0001658095,0.00017842808,0.00007699703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014156374,0.0011363291,0.0009412447,0.0013617333,0.00049069925,0.0010888962,0.0012681959,0.0011474147,0.007387501],"category_scores_gemma":[0.0061031855,0.00057473936,0.0008698894,0.0014035358,0.0010755991,0.001311062,0.0012237272,0.0017770564,0.0007572972],"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.00015563014,0.000071970564,0.0004383633,0.0002669404,0.000031238254,0.000110299996,0.000079208105,0.8676476,0.0014876939,0.032922253,0.0041961293,0.09259265],"study_design_scores_gemma":[0.000042126714,0.000052368327,0.000117233336,0.000058473546,0.00001582712,0.000035637113,0.000025926973,0.95740956,0.0008538751,0.039037433,0.0023421897,0.000009389052],"about_ca_topic_score_codex":0.0039505633,"about_ca_topic_score_gemma":0.006342037,"teacher_disagreement_score":0.007387501,"about_ca_system_score_codex":0.0018357787,"about_ca_system_score_gemma":0.0018828713,"threshold_uncertainty_score":0.024713635},"labels":[],"label_agreement":null},{"id":"W4312621041","doi":"10.1609/icaps.v32i1.19805","title":"Beam Search: Faster and Monotonic","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Beam search; Satisficing; Beam (structure); Computation; Monotonic function; Heuristic; Mathematical optimization; Beam diameter; Computer science; Search algorithm; Mathematics; Algorithm; Physics; Optics; Artificial intelligence; Mathematical analysis","score_opus":0.060167967661227346,"score_gpt":0.3081002708569113,"score_spread":0.24793230319568393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312621041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071392874,0.0020033456,0.97728866,0.0006966484,0.0002186824,0.00016059575,0.00019602508,0.0020097045,0.0102870185],"genre_scores_gemma":[0.08035788,0.0013663244,0.90547675,0.0014617211,0.00027911318,0.00061975594,0.0005560587,0.001487266,0.008395161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996172,0.0014009483,0.00017831248,0.0005488764,0.0014106977,0.00028911358],"domain_scores_gemma":[0.9923394,0.0043258443,0.00043635763,0.0014571751,0.0012555671,0.0001856269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005696455,0.0018512585,0.0024029238,0.0021235298,0.0010104072,0.002688888,0.002870779,0.002571339,0.014699503],"category_scores_gemma":[0.018759582,0.0013495126,0.0020273766,0.0026720325,0.001651927,0.005551975,0.003021389,0.004351318,0.0043426603],"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.0005313485,0.00022698147,0.0015341069,0.00056164904,0.00023760973,0.00015072816,0.0003792328,0.30289266,0.008479758,0.16513176,0.031687856,0.48818636],"study_design_scores_gemma":[0.0002552847,0.00015809051,0.00034180313,0.0002321753,0.000073586394,0.00017337795,0.00008852003,0.8610642,0.0035723774,0.1061461,0.027838923,0.000055637323],"about_ca_topic_score_codex":0.007497427,"about_ca_topic_score_gemma":0.0075125364,"teacher_disagreement_score":0.014699503,"about_ca_system_score_codex":0.0015258829,"about_ca_system_score_gemma":0.002946925,"threshold_uncertainty_score":0.049174666},"labels":[],"label_agreement":null},{"id":"W4312891993","doi":"10.1609/icaps.v32i1.19804","title":"Biased Exploration for Satisficing Heuristic Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Incremental heuristic search; Heuristic; Mathematical optimization; Beam search; Best-first search; Node (physics); Computer science; Consistent heuristic; Null-move heuristic; Greedy algorithm; Mathematics; Search algorithm; Algorithm; Artificial intelligence; Engineering","score_opus":0.08200595162074595,"score_gpt":0.30909067228654175,"score_spread":0.2270847206657958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312891993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05285422,0.0012997891,0.93763274,0.0006551179,0.00006464413,0.00016825092,0.00008033729,0.0007685357,0.006476338],"genre_scores_gemma":[0.7504599,0.0005861433,0.24577883,0.0005206353,0.000089758505,0.00055362907,0.00017707878,0.0002622994,0.0015717811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964898,0.001962169,0.00015984627,0.00036912356,0.00073974155,0.00027919962],"domain_scores_gemma":[0.98127085,0.014994818,0.001074716,0.0015361978,0.00079769024,0.00032576686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005488111,0.0010340238,0.001164778,0.0015529793,0.0008072682,0.0013479114,0.0014027368,0.0014021484,0.002915689],"category_scores_gemma":[0.031900946,0.0007376974,0.0010492591,0.0012374971,0.0020780761,0.0026343036,0.0019988613,0.0018785809,0.00044217065],"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.00048937753,0.00014609283,0.0057418756,0.00040548496,0.00017499152,0.00016577807,0.00040996552,0.73794055,0.0039319685,0.13383242,0.0030794193,0.11368208],"study_design_scores_gemma":[0.000069550646,0.000116511204,0.00036597266,0.000069139314,0.000034619323,0.00008857739,0.000045242414,0.9094453,0.0017660722,0.08633508,0.0016441498,0.000019745297],"about_ca_topic_score_codex":0.0017599292,"about_ca_topic_score_gemma":0.0020778081,"teacher_disagreement_score":0.005488111,"about_ca_system_score_codex":0.0017895245,"about_ca_system_score_gemma":0.0024162394,"threshold_uncertainty_score":0.029024243},"labels":[],"label_agreement":null},{"id":"W4312950274","doi":"10.1609/icaps.v21i1.13439","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":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":"Library science; Computer science; Operations research; Presentation (obstetrics); Engineering; Medicine","score_opus":0.061109028357754336,"score_gpt":0.2727059875151443,"score_spread":0.21159695915738996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312950274","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013544301,0.01635029,0.008233387,0.04293891,0.2245679,0.0008672338,0.015274896,0.0021443374,0.6882686],"genre_scores_gemma":[0.006181322,0.011741863,0.0041640364,0.0075878603,0.043941785,0.0004693599,0.016942246,0.0011515989,0.90782],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853027,0.00016923592,0.00011997294,0.00020534397,0.00086333905,0.00011175885],"domain_scores_gemma":[0.9927367,0.0010717072,0.00026371147,0.0006259992,0.0044094804,0.00089245377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019368237,0.00095814123,0.00088577654,0.003669518,0.0019709545,0.00555994,0.0015087985,0.0013843271,0.4611507],"category_scores_gemma":[0.013261084,0.0003108309,0.00066444674,0.0027611665,0.0006011534,0.0035847826,0.0020370192,0.0025147316,0.31895965],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023874876,0.000016458172,0.00007729877,0.00012509373,0.000002365455,0.000033748987,0.00006436713,0.00006501951,0.00013439234,0.0031007775,0.9464273,0.04992927],"study_design_scores_gemma":[0.0000028243746,0.000011203585,0.00018756508,0.00010647095,0.0000014586326,0.000040428047,0.000051986688,0.000024639556,0.000057790283,0.0013222495,0.99818975,0.0000036085255],"about_ca_topic_score_codex":0.0021610672,"about_ca_topic_score_gemma":0.0021735707,"teacher_disagreement_score":0.4611507,"about_ca_system_score_codex":0.0017952167,"about_ca_system_score_gemma":0.0022489394,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4313015941","doi":"10.1609/icaps.v21i1.13441","title":"Program Committee","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Flexible and Reconfigurable Manufacturing Systems","field":"Engineering","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 Toronto","funders":"","keywords":"Library science; Political science; Operations research; Engineering; Management; Engineering management; Computer science; Economics","score_opus":0.05219478832545849,"score_gpt":0.2621214965318074,"score_spread":0.2099267082063489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313015941","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035748638,0.012284107,0.029961841,0.18466932,0.14914276,0.013042295,0.022613559,0.0030662843,0.5816451],"genre_scores_gemma":[0.009615737,0.008073355,0.0122388145,0.0307881,0.024131825,0.008243484,0.01801033,0.0012244808,0.8876738],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99325705,0.0012325256,0.00043716765,0.0009499518,0.0029663285,0.0011570292],"domain_scores_gemma":[0.947755,0.002336409,0.0014171598,0.002594917,0.034470852,0.0114256535],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.014988367,0.0011180291,0.0008995308,0.0031359417,0.0032373602,0.0059577776,0.0033003795,0.0038522552,0.34519497],"category_scores_gemma":[0.026777292,0.00071243074,0.0011018058,0.0019230363,0.0008014808,0.0029366952,0.00394572,0.004446872,0.1947838],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008436742,0.00007222711,0.00029534113,0.000186441,0.000008077031,0.000026810467,0.000044884142,0.00008543619,0.00030464042,0.00432949,0.93429095,0.0602713],"study_design_scores_gemma":[0.000024388975,0.00003557402,0.00052424514,0.00017260703,0.000007611531,0.00003850065,0.000042766813,0.000071826,0.00025071055,0.0012698504,0.9975555,0.00000647948],"about_ca_topic_score_codex":0.0044888747,"about_ca_topic_score_gemma":0.0068078446,"teacher_disagreement_score":0.65480506,"about_ca_system_score_codex":0.003692041,"about_ca_system_score_gemma":0.024312396,"threshold_uncertainty_score":0.9339999},"labels":[],"label_agreement":null},{"id":"W4313193649","doi":"10.1609/icaps.v20i1.13398","title":"Preface","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":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":"Library science; Operations research; Computer science; Scheduling (production processes); Automated planning and scheduling; Engineering; Artificial intelligence; Operations management","score_opus":0.033752758441679936,"score_gpt":0.28103862567382976,"score_spread":0.24728586723214982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313193649","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012358547,0.015517023,0.0073471023,0.04195236,0.25424644,0.00072767603,0.016238611,0.0022396573,0.6604953],"genre_scores_gemma":[0.006337216,0.011910332,0.0037492786,0.0079121925,0.05242668,0.000449136,0.018467028,0.0013203283,0.89742786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985172,0.00016930135,0.00011718777,0.000214127,0.00087381096,0.000108313594],"domain_scores_gemma":[0.9923993,0.0011980821,0.0002616724,0.0006533178,0.0045659435,0.0009217651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019151571,0.00094731664,0.0009233913,0.0038153366,0.00200593,0.005897257,0.0016013042,0.0013382942,0.45630312],"category_scores_gemma":[0.013976067,0.0003125288,0.0006424265,0.0030027393,0.0006156171,0.0037785552,0.0021010232,0.0025760613,0.3227144],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019638917,0.000013963607,0.00007492061,0.000106754946,0.000002107697,0.000027558572,0.00005954701,0.00006127533,0.00010772992,0.0028443723,0.95311725,0.043564893],"study_design_scores_gemma":[0.0000025479783,0.00001007597,0.00018358509,0.000104748084,0.0000014236814,0.00003672339,0.00005173635,0.000024838007,0.00005043648,0.0012123645,0.99831784,0.000003633068],"about_ca_topic_score_codex":0.002458053,"about_ca_topic_score_gemma":0.0023687694,"teacher_disagreement_score":0.45630312,"about_ca_system_score_codex":0.0018923528,"about_ca_system_score_gemma":0.0023473776,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4382866729","doi":"10.1609/icaps.v33i1.27221","title":"Generalizing Action Justification and Causal Links to Policies","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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":"Air Force Office of Scientific Research; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Generalization; Action (physics); Context (archaeology); Computer science; Observable; State (computer science); Causal theory of reference; Management science; Epistemology; Mathematical economics; Theoretical computer science; Artificial intelligence; Mathematics; Economics; Algorithm","score_opus":0.09405748696312577,"score_gpt":0.3372824619862425,"score_spread":0.24322497502311674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011243266,0.00028461416,0.9807258,0.00067309727,0.000054307082,0.00015143144,0.00025680911,0.0015175057,0.0050930833],"genre_scores_gemma":[0.419837,0.00064136885,0.5743864,0.00041991533,0.00013800141,0.00037860722,0.0010212563,0.00051709637,0.0026603462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459285,0.0017983479,0.00037393547,0.0010428855,0.0017272941,0.00046471227],"domain_scores_gemma":[0.9729984,0.019656636,0.0016967885,0.003751382,0.001510819,0.00038601714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118319,0.0012529864,0.00085919735,0.0033357085,0.0010410656,0.0028819428,0.002149668,0.002253964,0.0067983847],"category_scores_gemma":[0.052223623,0.00066840893,0.0014542409,0.0024827218,0.004002414,0.008317603,0.0039883913,0.0034597488,0.0007993235],"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.00009244885,0.00011055217,0.0025463912,0.00032073705,0.00006471554,0.00018015961,0.000590657,0.29031834,0.0010636724,0.5660094,0.0024540725,0.13624893],"study_design_scores_gemma":[0.000028952198,0.00003667598,0.00044524,0.00010087996,0.000027673472,0.000072390605,0.00008917165,0.41641855,0.0019499041,0.5733067,0.0074931146,0.000030879088],"about_ca_topic_score_codex":0.0082110595,"about_ca_topic_score_gemma":0.009257166,"teacher_disagreement_score":0.0082110595,"about_ca_system_score_codex":0.002377685,"about_ca_system_score_gemma":0.0054417853,"threshold_uncertainty_score":0.027068615},"labels":[],"label_agreement":null},{"id":"W4382866757","doi":"10.1609/icaps.v33i1.27218","title":"Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Academy of Sciences and Humanities","keywords":"Satisficing; Pruning; Symmetry (geometry); Symmetry breaking; Heuristic; Homogeneous space; Mathematics; Symmetry group; Rotational symmetry; Mathematical optimization; Computer science; Algorithm; Artificial intelligence; Physics; Geometry","score_opus":0.03892980605732845,"score_gpt":0.29940599164730153,"score_spread":0.2604761855899731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18854861,0.00028475447,0.80009,0.0003161123,0.000040818282,0.00013715737,0.0002392165,0.0012129084,0.009130353],"genre_scores_gemma":[0.75460106,0.00009804885,0.24381441,0.00006053832,0.000010541545,0.00009025544,0.00027631482,0.00011642411,0.0009323491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979996,0.00069107284,0.00011816347,0.00024394495,0.00075505103,0.00019216239],"domain_scores_gemma":[0.9936407,0.00400407,0.0007793259,0.00097016065,0.00046076757,0.00014494659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001841353,0.0004951882,0.0005772323,0.0009620874,0.0007004217,0.0012289246,0.0010901167,0.0006388963,0.0023398285],"category_scores_gemma":[0.012022662,0.00049454806,0.0007204466,0.0008646065,0.0018342425,0.0015385265,0.0012984297,0.0011289153,0.00030385627],"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.0005214587,0.00015050749,0.0047682915,0.0002854122,0.00005703154,0.00030683505,0.0002558127,0.66646,0.010459075,0.14614835,0.0018645778,0.16872266],"study_design_scores_gemma":[0.000028083938,0.00008426673,0.000492972,0.000022919017,0.000012095501,0.00007381625,0.000055768975,0.905581,0.006207759,0.08667267,0.00075612427,0.000012510101],"about_ca_topic_score_codex":0.004145096,"about_ca_topic_score_gemma":0.0027851334,"teacher_disagreement_score":0.004145096,"about_ca_system_score_codex":0.0012845228,"about_ca_system_score_gemma":0.002028661,"threshold_uncertainty_score":0.009738088},"labels":[],"label_agreement":null},{"id":"W4382866769","doi":"10.1609/icaps.v33i1.27238","title":"Exploration Policies for On-the-Fly Controller Synthesis: A Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; International Development Research Centre; Agencia Nacional de Investigación e Innovación","keywords":"Reinforcement learning; Heuristics; Computer science; Heuristic; Task (project management); Set (abstract data type); Controller (irrigation); Supervisory control; Domain (mathematical analysis); Artificial intelligence; Space (punctuation); Control (management); Machine learning; Mathematical optimization; Mathematics; Engineering","score_opus":0.1186295975928637,"score_gpt":0.33159983778870095,"score_spread":0.21297024019583724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008652754,0.000109723434,0.98965454,0.0001081189,0.000011547881,0.000041991814,0.0000136114,0.00026934914,0.0011382691],"genre_scores_gemma":[0.5992487,0.00023468603,0.39746442,0.00015056648,0.000036766847,0.00030609762,0.00006882196,0.00013705587,0.0023528787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00019537212,0.000029959541,0.00011456006,0.000113913586,0.00006481724],"domain_scores_gemma":[0.9985424,0.0009959957,0.0001390133,0.0001427819,0.0001101075,0.000069653266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012151969,0.00077385816,0.0008383172,0.00047031368,0.00032840043,0.00061208307,0.0014541239,0.0008634132,0.0016264011],"category_scores_gemma":[0.003270451,0.0005144645,0.00062773586,0.0002831573,0.0014841415,0.0010586305,0.0011101781,0.0015268662,0.00023696604],"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.000040268817,0.000053620246,0.00026509224,0.000055692937,0.000023239618,0.00004746066,0.00007779877,0.9485207,0.0015071888,0.016493816,0.00031217246,0.03260303],"study_design_scores_gemma":[0.000008812477,0.000016302463,0.00002551992,0.000005245636,0.0000033789493,0.0000058677056,0.0000048499446,0.9927125,0.0003093961,0.0066692857,0.0002362088,0.0000027391973],"about_ca_topic_score_codex":0.003594031,"about_ca_topic_score_gemma":0.0037082727,"teacher_disagreement_score":0.003594031,"about_ca_system_score_codex":0.0010912206,"about_ca_system_score_gemma":0.0014428783,"threshold_uncertainty_score":0.007917464},"labels":[],"label_agreement":null},{"id":"W4382866772","doi":"10.1609/icaps.v33i1.27251","title":"Frontmatter","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":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":"Moonshot Research and Development Program; Office of Naval Research; Office National d'études et de Recherches Aérospatiales; Institute of Software, Chinese Academy of Sciences; U.S. Naval Research Laboratory; Russian Academy of Sciences; Technische Universität Dortmund; Singapore Management University; Universität Konstanz; Libera Università di Bolzano; Università degli Studi di Brescia; Universidade do Porto; Universidad de Granada; Masarykova Univerzita; Universität des Saarlandes; RWTH Aachen University; Danmarks Tekniske Universitet; Universitat Politècnica de València; Ben-Gurion University of the Negev; Universidade Federal do Rio Grande do Sul; Technische Universität Wien; Sapienza Università di Roma; Oregon State University; Queen's University; Linköpings Universitet; University of Alberta; Imperial College London; University of Toronto; University of Southern California; Institució Catalana de Recerca i Estudis Avançats; Arizona State University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; Chinese Academy of Sciences; Sun Yat-sen University; Bar-Ilan University; Universiteit van Amsterdam; Jet Propulsion Laboratory; Monash University; Royal Holloway, University of London; National Aeronautics and Space Administration; Nanyang Technological University; Universität Ulm; National University of Singapore; University of Aberdeen; University of Oxford; Albert-Ludwigs-Universität Freiburg; Centre National de la Recherche Scientifique; King's College London; Invitae; Carnegie Mellon University; Amazon Robotics; Purdue University; Polytechnique Montréal; Institut national de recherche en informatique et en automatique (INRIA); Universite Angers; Colorado State University; KU Leuven; Heriot-Watt University; Simon Fraser University; Università degli Studi di Padova; European Space Agency; Aalborg Universitet; Universidad Carlos III de Madrid; International Science and Technology Center; Università degli Studi di Napoli Federico II; Örebro Universitet; California Institute of Technology; Fondazione Bruno Kessler; Georgia Institute of Technology; Universidad de Oviedo; Universität Basel; Università degli Studi di Trento; University of Science and Technology of China; Microsoft Research; Technische Universiteit Delft; RAND Corporation; České Vysoké Učení Technické v Praze","keywords":"Czech; Computer science; Library science; Scheduling (production processes); Operations research; Political science; Engineering; Operations management","score_opus":0.03892079911777357,"score_gpt":0.2871891253091323,"score_spread":0.24826832619135875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866772","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037811146,0.0014928374,0.0018324567,0.002593832,0.0077109,0.00015040029,0.0059760236,0.0039487863,0.97591656],"genre_scores_gemma":[0.0010505191,0.0007016259,0.00052530004,0.000793912,0.00079452404,0.000038002236,0.002933961,0.00069289375,0.99246925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931157,0.000047827463,0.000046273988,0.00014694083,0.00038289293,0.00006457099],"domain_scores_gemma":[0.9984091,0.0002174433,0.00007995036,0.00028007533,0.0006702626,0.000343162],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00058038067,0.0011185565,0.0011872737,0.002394479,0.0011431124,0.006230193,0.001530117,0.0021252858,0.94376063],"category_scores_gemma":[0.0028794212,0.000412589,0.0007073541,0.0021842946,0.000406745,0.0032952826,0.0027023223,0.0014747053,0.9154581],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003760577,0.000030321182,0.00010943376,0.00016028098,0.000003777642,0.000048290633,0.000027082366,0.00004626705,0.0004632666,0.0022993835,0.8651709,0.1316033],"study_design_scores_gemma":[0.0000051795505,0.000011220665,0.00016717125,0.00004732464,0.000001550397,0.000049059327,0.000016357046,0.00003456772,0.00010759533,0.0005003891,0.9990558,0.0000037181735],"about_ca_topic_score_codex":0.0009390993,"about_ca_topic_score_gemma":0.0017012343,"teacher_disagreement_score":0.056239367,"about_ca_system_score_codex":0.00076178595,"about_ca_system_score_gemma":0.00089139165,"threshold_uncertainty_score":0.08021855},"labels":[],"label_agreement":null},{"id":"W4382866786","doi":"10.1609/icaps.v33i1.27179","title":"Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Planner; Linear temporal logic; Temporal logic; Computer science; Linear logic; Spurious relationship; Overhead (engineering); Compiler; Theoretical computer science; Artificial intelligence; Programming language; Machine learning","score_opus":0.06726799504584709,"score_gpt":0.33030112970346653,"score_spread":0.26303313465761946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09828173,0.0005042379,0.8763705,0.0006611441,0.0000812272,0.00014667722,0.00082259375,0.008242765,0.014889042],"genre_scores_gemma":[0.5365755,0.00034212586,0.45711243,0.00021794462,0.00003414739,0.00014079723,0.0009031076,0.0005510758,0.0041229078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.00041419565,0.000065965854,0.0001861301,0.00026458685,0.0001707886],"domain_scores_gemma":[0.99767154,0.0016448859,0.00019285384,0.00021511223,0.00017421365,0.000101297264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015357528,0.00066680013,0.00038473232,0.0006926001,0.00063421036,0.0013833909,0.0012304116,0.0005895801,0.004231965],"category_scores_gemma":[0.0042437324,0.000476127,0.00086243515,0.00088646304,0.0016060446,0.0027051445,0.0014488595,0.0013115148,0.00053294963],"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.00072067796,0.0003346007,0.0027455764,0.0008678854,0.00012457976,0.00094761734,0.0011580925,0.52986264,0.017515924,0.29851398,0.007122869,0.14008561],"study_design_scores_gemma":[0.0000706498,0.00012869114,0.0003811371,0.00005658132,0.000058018086,0.00014461987,0.00014265542,0.88456917,0.015761668,0.08948602,0.009168973,0.000031852713],"about_ca_topic_score_codex":0.0100706825,"about_ca_topic_score_gemma":0.017403644,"teacher_disagreement_score":0.0100706825,"about_ca_system_score_codex":0.0017322182,"about_ca_system_score_gemma":0.0021699313,"threshold_uncertainty_score":0.02002412},"labels":[],"label_agreement":null},{"id":"W4382866836","doi":"10.1609/icaps.v33i1.27175","title":"W-restrained Bidirectional Bounded-Suboptimal Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":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":"United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Heuristic; Property (philosophy); Search algorithm; Mathematical optimization; Computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Philosophy","score_opus":0.0726040891907504,"score_gpt":0.3367700420719623,"score_spread":0.2641659528812119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016182542,0.0002405251,0.9760188,0.00020261122,0.00003667862,0.00006425179,0.000048251775,0.00045125047,0.006755096],"genre_scores_gemma":[0.53976506,0.00025917366,0.45407856,0.00040767327,0.00003519298,0.0003458532,0.00021426563,0.00028340126,0.0046108398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984863,0.0006934377,0.000087289474,0.0001818452,0.0003558944,0.00019527625],"domain_scores_gemma":[0.99655044,0.0018504949,0.00027438934,0.000765494,0.00041966856,0.00013944964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002174398,0.0007655096,0.001079194,0.00058922876,0.0008491979,0.0011790555,0.001954584,0.001296907,0.0044962172],"category_scores_gemma":[0.012226085,0.0005521596,0.00060876424,0.00093093986,0.0010082335,0.0020145953,0.0026921122,0.0015291957,0.00093495456],"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.00035898105,0.00016213894,0.0017654483,0.00027159613,0.000089683745,0.00017602886,0.00030410243,0.6240079,0.004688633,0.2008854,0.0042993203,0.16299075],"study_design_scores_gemma":[0.000029911858,0.000060445218,0.00008515408,0.000023892064,0.000012820421,0.00004613351,0.000043602173,0.9423435,0.0010304352,0.05420468,0.0021099881,0.000009487731],"about_ca_topic_score_codex":0.0028146945,"about_ca_topic_score_gemma":0.0038549295,"teacher_disagreement_score":0.0044962172,"about_ca_system_score_codex":0.0007029501,"about_ca_system_score_gemma":0.0022804856,"threshold_uncertainty_score":0.015041351},"labels":[],"label_agreement":null},{"id":"W4382866847","doi":"10.1609/icaps.v33i1.27201","title":"Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"Solver; Travelling salesman problem; Mathematical optimization; Heuristic; Domain (mathematical analysis); Computer science; Constraint programming; Dynamic programming; Constraint satisfaction problem; Mathematics; Stochastic programming; Artificial intelligence","score_opus":0.029136682222907113,"score_gpt":0.28917392073227355,"score_spread":0.26003723850936644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014729698,0.00037321492,0.9770608,0.0002053335,0.000051569343,0.00012855227,0.00009847745,0.00086319784,0.0064892247],"genre_scores_gemma":[0.19568548,0.00041360065,0.8009113,0.00021827922,0.000041740444,0.00041107333,0.0003065316,0.00024147233,0.0017704562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988134,0.00049588515,0.000069639274,0.00020919506,0.00026669484,0.00014518072],"domain_scores_gemma":[0.9975304,0.0015501884,0.0002462475,0.000383011,0.00019592236,0.00009419295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016930753,0.0014295003,0.0010749154,0.00072417886,0.00047615715,0.0016564984,0.0020388975,0.001343936,0.0043782922],"category_scores_gemma":[0.0047125733,0.00067101594,0.0012110318,0.001250765,0.00095375656,0.0017522307,0.0015998983,0.0018678735,0.0006449193],"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.000118288306,0.00019079635,0.00056820473,0.00023849792,0.000101544,0.0000648316,0.000066576016,0.8768296,0.0015352936,0.028583627,0.002703385,0.08899946],"study_design_scores_gemma":[0.000058244168,0.000046652287,0.000054212956,0.000016794871,0.000015569318,0.000019356346,0.00002353663,0.9881982,0.00083632657,0.008728747,0.0019955572,0.000006764252],"about_ca_topic_score_codex":0.0040898346,"about_ca_topic_score_gemma":0.005839742,"teacher_disagreement_score":0.0043782922,"about_ca_system_score_codex":0.0010030967,"about_ca_system_score_gemma":0.0025375844,"threshold_uncertainty_score":0.014646828},"labels":[],"label_agreement":null},{"id":"W4382866853","doi":"10.1609/icaps.v33i1.27200","title":"Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"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":"Constraint programming; Computer science; Solver; Integer programming; State space; Formalism (music); Mathematical optimization; Domain (mathematical analysis); Dynamic programming; Combinatorial optimization; Theoretical computer science; Mathematics; Algorithm; Stochastic programming; Programming language","score_opus":0.03391730746902807,"score_gpt":0.29794611231564133,"score_spread":0.2640288048466133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018688439,0.0001784203,0.99344146,0.00021191128,0.000024062796,0.00006367478,0.00015778065,0.00045083743,0.0036030295],"genre_scores_gemma":[0.096622646,0.0005954393,0.89854795,0.0002676193,0.000041802694,0.0005321818,0.00061666296,0.0003774933,0.0023982502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984188,0.0006553555,0.00009692716,0.00028928192,0.00041115505,0.00012854203],"domain_scores_gemma":[0.99803394,0.0012640856,0.00015731476,0.0003280263,0.00015360127,0.00006304751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205433,0.0014515056,0.001017125,0.0011108593,0.00056668743,0.002470883,0.002483446,0.0016405665,0.005158152],"category_scores_gemma":[0.005359576,0.0008745698,0.0019787278,0.002169215,0.0016323328,0.0027993054,0.0026518207,0.003344464,0.0008165455],"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.00004270742,0.00007913866,0.00038066306,0.0003003265,0.00006349826,0.0000602521,0.000091380476,0.68251806,0.0012067799,0.24387191,0.004359737,0.067025535],"study_design_scores_gemma":[0.000017127813,0.000014539832,0.00002865391,0.000027970484,0.000008497509,0.000020662352,0.000017700333,0.91540515,0.0007321766,0.078058705,0.005659976,0.000008793625],"about_ca_topic_score_codex":0.005077083,"about_ca_topic_score_gemma":0.0074245795,"teacher_disagreement_score":0.005158152,"about_ca_system_score_codex":0.0017205226,"about_ca_system_score_gemma":0.003121483,"threshold_uncertainty_score":0.017255723},"labels":[],"label_agreement":null},{"id":"W4382866902","doi":"10.1609/icaps.v33i1.27241","title":"Safe MDP Planning by Learning Temporal Patterns of Undesirable Trajectories and Averting Negative Side Effects","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":3,"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":"National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Scalability; Lagrange multiplier; Reinforcement learning; Computation; Categorical variable; Fidelity; Markov process; Function (biology); Mathematical optimization; Action (physics); Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.07393665330678277,"score_gpt":0.35434579308602976,"score_spread":0.280409139779247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05514339,0.00013181553,0.9413401,0.0004820825,0.000019881496,0.0001434165,0.00022626451,0.00075281307,0.00176034],"genre_scores_gemma":[0.71644515,0.00014390751,0.27951157,0.00018256633,0.000023997123,0.00033122048,0.0006416843,0.0001652339,0.002554807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00017152877,0.000028886328,0.00016146986,0.00014700386,0.00006732157],"domain_scores_gemma":[0.99565977,0.003071686,0.0005179391,0.00023533404,0.00033722474,0.00017800031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014809009,0.0010583648,0.00088753726,0.00085496454,0.00047686073,0.00064303196,0.0014372694,0.0008027557,0.0025543214],"category_scores_gemma":[0.006627616,0.0008162098,0.0009066499,0.00060296844,0.0011641468,0.001728199,0.0012370558,0.0019437768,0.0002598986],"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.000043748885,0.00004503709,0.0011420863,0.000042274554,0.00001999008,0.000032404245,0.0000340664,0.9737379,0.00030145387,0.0052443314,0.00050731475,0.018849352],"study_design_scores_gemma":[0.000005689044,0.000010869473,0.00005538969,0.0000037434793,0.0000032983894,0.00000384806,0.000004724153,0.99269485,0.00017772702,0.006925871,0.00011196176,0.0000020002233],"about_ca_topic_score_codex":0.010284961,"about_ca_topic_score_gemma":0.017381338,"teacher_disagreement_score":0.010284961,"about_ca_system_score_codex":0.0015249997,"about_ca_system_score_gemma":0.00414006,"threshold_uncertainty_score":0.020450175},"labels":[],"label_agreement":null},{"id":"W4382866947","doi":"10.1609/icaps.v33i1.27203","title":"On Using Action Inheritance and Modularity in PDDL Domain Modelling","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":5,"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":"Social Sciences and Humanities Research Council of Canada; UK Research and Innovation","keywords":"Computer science; Modularity (biology); Inheritance (genetic algorithm); Programming language; Software engineering; Code reuse; Domain (mathematical analysis); Artificial intelligence; Software","score_opus":0.08997274870527693,"score_gpt":0.316578830694882,"score_spread":0.22660608198960508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040488592,0.00007506916,0.9935267,0.00021570109,0.000012794067,0.00004090187,0.000018380337,0.00043839222,0.0016232631],"genre_scores_gemma":[0.122449756,0.00037983397,0.8741717,0.00015329858,0.00002896402,0.00015658607,0.000104387225,0.0004347693,0.002120654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935535,0.0031407,0.000545732,0.0006181029,0.0018024673,0.00033948765],"domain_scores_gemma":[0.9844997,0.009661779,0.0010546008,0.003182287,0.0012184554,0.00038322047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009834048,0.00079158094,0.0004957828,0.0016134083,0.0012570297,0.003056971,0.0020811171,0.0012836913,0.0017489417],"category_scores_gemma":[0.02089409,0.001295628,0.0018615022,0.0013058846,0.005193375,0.0062841554,0.0047113546,0.0032056903,0.0004510455],"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.00010917073,0.00007708191,0.0022598957,0.00028287046,0.000051832336,0.00073014107,0.004424728,0.11449176,0.007028218,0.7659331,0.0013393653,0.10327183],"study_design_scores_gemma":[0.000055997378,0.000112766254,0.0005610424,0.00039126878,0.00010440538,0.00073367456,0.00034088021,0.49437794,0.013412125,0.4397258,0.050054032,0.0001300422],"about_ca_topic_score_codex":0.006516526,"about_ca_topic_score_gemma":0.008975358,"teacher_disagreement_score":0.009834048,"about_ca_system_score_codex":0.0017872893,"about_ca_system_score_gemma":0.002113868,"threshold_uncertainty_score":0.052008033},"labels":[],"label_agreement":null},{"id":"W4382890541","doi":"10.1609/icaps.v33i1.27227","title":"Priority-Based Search for the Virtual Network Embedding Problem","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Software-Defined Networks and 5G","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; University of Southern California; Simon Fraser University; National Science Foundation","keywords":"Embedding; Computer science; Benchmark (surveying); Heuristic; Solver; Context (archaeology); Network virtualization; Path (computing); Theoretical computer science; Mathematical optimization; Mathematics; Virtualization; Artificial intelligence; Computer network; Cloud computing","score_opus":0.051670014530140924,"score_gpt":0.31757142461650856,"score_spread":0.26590141008636764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382890541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05066591,0.00085444236,0.93247557,0.0007525064,0.00016301867,0.00021899291,0.0002492439,0.0006002538,0.014020112],"genre_scores_gemma":[0.4607993,0.00048660804,0.53157395,0.00030285682,0.000076887714,0.00031388443,0.00054245145,0.00021926993,0.0056847427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.0002883027,0.000028936387,0.000120477365,0.00013404712,0.00010582503],"domain_scores_gemma":[0.99831796,0.001289535,0.00008931708,0.00006387381,0.0001451854,0.000094104274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011649089,0.0009698531,0.0009845467,0.00068150356,0.0005027774,0.0009236192,0.0011342949,0.0012363555,0.0053511555],"category_scores_gemma":[0.004357698,0.00050500076,0.0005928563,0.00083473034,0.0006557616,0.0015270276,0.001046452,0.0013339911,0.00042447876],"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.00012912879,0.0001435352,0.00054796186,0.00015886778,0.000040534258,0.00011913215,0.00005167085,0.9164117,0.0009005479,0.0278269,0.004726613,0.04894336],"study_design_scores_gemma":[0.000047739897,0.00003374809,0.000048753307,0.0000075073854,0.0000061956107,0.000025192307,0.00001864358,0.9892948,0.00026849713,0.009203028,0.0010420892,0.0000037255595],"about_ca_topic_score_codex":0.0041941525,"about_ca_topic_score_gemma":0.0059733866,"teacher_disagreement_score":0.0053511555,"about_ca_system_score_codex":0.0007514467,"about_ca_system_score_gemma":0.0023894985,"threshold_uncertainty_score":0.01790142},"labels":[],"label_agreement":null},{"id":"W4391833299","doi":"10.1609/icaps.v34i1.31489","title":"Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings","year":2024,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Lockheed Martin (Canada)","funders":"Office of Naval Research","keywords":"Psychology; Epistemology; Computer science; Artificial intelligence; Philosophy","score_opus":0.09167038274346535,"score_gpt":0.39999145334192976,"score_spread":0.3083210705984644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391833299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007680289,0.00018813452,0.9900559,0.00025594738,0.000011904911,0.000033409746,0.000042926506,0.00014765904,0.0015837455],"genre_scores_gemma":[0.6398667,0.00069078145,0.35485792,0.00020874022,0.00011733567,0.00056851754,0.00032530978,0.0001391506,0.0032256069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977265,0.0011221393,0.00011647861,0.00052219915,0.00034851028,0.00016427762],"domain_scores_gemma":[0.9862438,0.011162358,0.00071287324,0.0011932808,0.00037887413,0.00030877496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004525681,0.0012722906,0.0014823575,0.0010724937,0.0008734942,0.0018313208,0.0019103214,0.0014493025,0.0034281018],"category_scores_gemma":[0.019036727,0.00080718583,0.001709678,0.0010152328,0.0034953142,0.004093577,0.005080435,0.0036216974,0.00039966853],"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.000102785765,0.00007339284,0.00086789747,0.00017268377,0.000087912886,0.00011895043,0.0003501784,0.73311216,0.0006906804,0.23268977,0.0006426464,0.03109095],"study_design_scores_gemma":[0.000011138202,0.00003177527,0.00008126528,0.0000135352,0.000007873426,0.000018473645,0.00002237269,0.82119083,0.00016580425,0.17794266,0.0005056163,0.000008573069],"about_ca_topic_score_codex":0.0035794214,"about_ca_topic_score_gemma":0.004168465,"teacher_disagreement_score":0.004525681,"about_ca_system_score_codex":0.0017664488,"about_ca_system_score_gemma":0.0021397553,"threshold_uncertainty_score":0.023934364},"labels":[],"label_agreement":null},{"id":"W4399157307","doi":"10.1609/icaps.v34i1.31480","title":"JaxPlan and GurobiPlan: Optimization Baselines for Replanning in Discrete and Mixed Discrete-Continuous Probabilistic Domains","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":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":"Probabilistic logic; Solver; Computer science; Discrete optimization; Computation; Mathematical optimization; Discrete time and continuous time; Graph; Theoretical computer science; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.025062564619118047,"score_gpt":0.28507919947442417,"score_spread":0.26001663485530613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399157307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06075573,0.0025229286,0.85907334,0.0013559924,0.00058047613,0.00039464489,0.0025951972,0.012055766,0.060666062],"genre_scores_gemma":[0.36454663,0.00096788275,0.620433,0.00049399905,0.00006161185,0.00068832067,0.0039745113,0.002639771,0.0061942693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824035,0.0006520956,0.00009045774,0.00026841107,0.00052122585,0.00022749597],"domain_scores_gemma":[0.997447,0.0014522852,0.0001540637,0.0004728501,0.000319653,0.00015418879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022777142,0.0017707716,0.0010063847,0.0009158938,0.0007379766,0.0020140277,0.0019669563,0.0010224875,0.010161357],"category_scores_gemma":[0.007339369,0.0007924802,0.0013201872,0.0012352719,0.0012276056,0.0020210529,0.0021922116,0.003475944,0.0013293618],"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.0002996615,0.00013806559,0.0006604031,0.00039296917,0.0000714238,0.00007585171,0.00007443471,0.8802984,0.0011089201,0.040695515,0.010765041,0.06541933],"study_design_scores_gemma":[0.000074058684,0.00012762178,0.00023185633,0.00006132254,0.000021580337,0.000038001814,0.00005784017,0.97006255,0.0015708703,0.017529698,0.010204511,0.000020075991],"about_ca_topic_score_codex":0.0070692454,"about_ca_topic_score_gemma":0.012358704,"teacher_disagreement_score":0.010161357,"about_ca_system_score_codex":0.0015626462,"about_ca_system_score_gemma":0.003726919,"threshold_uncertainty_score":0.033993185},"labels":[],"label_agreement":null},{"id":"W4399175867","doi":"10.1609/icaps.v34i1.31520","title":"Multi-Robot Connected Fermat Spiral Coverage","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workspace; Computer science; Robot; Path (computing); Motion planning; Scalability; Distributed computing; Artificial intelligence; Mathematical optimization; Computer network; Mathematics","score_opus":0.054018082742686706,"score_gpt":0.30943663855518305,"score_spread":0.25541855581249634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399175867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016189964,0.00022144393,0.9774793,0.00015601625,0.00004050358,0.000056630393,0.00014703284,0.0012131089,0.004496009],"genre_scores_gemma":[0.3886976,0.00030798494,0.6048899,0.00017285428,0.000030256479,0.00028989694,0.00063682883,0.0004620239,0.004512626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950063,0.00009256236,0.000023908895,0.000121071804,0.00018109525,0.000080702135],"domain_scores_gemma":[0.9993979,0.00024866266,0.00007817246,0.00012525098,0.00008878575,0.00006134042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931638,0.0009962574,0.0006938474,0.000732473,0.00061218516,0.00081178505,0.0015688742,0.0010005044,0.0051295706],"category_scores_gemma":[0.001877732,0.00048113556,0.00085902546,0.000797061,0.0009646087,0.0011851682,0.001982948,0.0010267602,0.0008321675],"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.00014611635,0.000037862977,0.0006128417,0.0001650996,0.000033422944,0.00019422047,0.00014240839,0.86160094,0.00948996,0.045237035,0.0036851845,0.07865487],"study_design_scores_gemma":[0.000017653441,0.0000699781,0.0001248605,0.00001474276,0.0000074022882,0.00009172238,0.000019556182,0.97147954,0.0025856332,0.021060556,0.004513494,0.000014850044],"about_ca_topic_score_codex":0.0022356214,"about_ca_topic_score_gemma":0.0026361523,"teacher_disagreement_score":0.0051295706,"about_ca_system_score_codex":0.00082585815,"about_ca_system_score_gemma":0.0010798455,"threshold_uncertainty_score":0.017160118},"labels":[],"label_agreement":null},{"id":"W4399177038","doi":"10.1609/icaps.v34i1.31455","title":"Exact Multi-objective Path Finding with Negative Weights","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":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":"State Government of Victoria; Australian Government","keywords":"Mathematical optimization; Shortest path problem; Computer science; Path (computing); Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Task (project management); Pareto optimal; Algorithm; Multi-objective optimization; Mathematics; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.03990089687618361,"score_gpt":0.29810617310350235,"score_spread":0.25820527622731876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399177038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059592575,0.00036806503,0.9317457,0.0002296195,0.000055760196,0.00010481563,0.00016306173,0.00063157885,0.007108771],"genre_scores_gemma":[0.4759185,0.00018241939,0.5193205,0.000106894826,0.000024649926,0.00020165477,0.00029352042,0.00014634692,0.0038055505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961394,0.00010897506,0.000019316843,0.000096522344,0.00010386609,0.00005731776],"domain_scores_gemma":[0.99914026,0.0005291246,0.000092791255,0.00008993174,0.00010091068,0.00004697367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196763,0.001041084,0.00091318693,0.00077900593,0.00052973465,0.0007138385,0.0012557846,0.0012152363,0.003660535],"category_scores_gemma":[0.0022571587,0.0005523697,0.00066036376,0.0011282247,0.00047822617,0.0014290607,0.0010913231,0.0010949585,0.00050511194],"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.00007031662,0.000079847814,0.00045782194,0.00010872918,0.000033787575,0.000079131285,0.000027472042,0.91758734,0.0014365749,0.010509059,0.0015260013,0.06808398],"study_design_scores_gemma":[0.000011331648,0.000030917156,0.00007436989,0.000005895332,0.000004954327,0.000021557342,0.000009089774,0.9929732,0.0003907145,0.0060395068,0.00043471053,0.000003654496],"about_ca_topic_score_codex":0.003591706,"about_ca_topic_score_gemma":0.004376621,"teacher_disagreement_score":0.003660535,"about_ca_system_score_codex":0.00064956694,"about_ca_system_score_gemma":0.0011812155,"threshold_uncertainty_score":0.012245715},"labels":[],"label_agreement":null},{"id":"W4414222950","doi":"10.1609/icaps.v35i1.36109","title":"Parallelizing Multi-objective A* Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Advanced Multi-Objective Optimization 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":"Curse of dimensionality; Graph; Enhanced Data Rates for GSM Evolution; Shortest path problem; Optimization problem; Path (computing); Search algorithm; Key (lock)","score_opus":0.04308071131536093,"score_gpt":0.3321844671879373,"score_spread":0.28910375587257636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414222950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063910104,0.00043620868,0.92119205,0.00027202154,0.00014207819,0.00018862139,0.00010362672,0.0020787462,0.0116764],"genre_scores_gemma":[0.37985003,0.00018920933,0.6159288,0.00015012333,0.00004495465,0.0003081045,0.00025232468,0.00019327282,0.0030831862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937636,0.0001920599,0.00003732544,0.00012361402,0.0001830245,0.000087676955],"domain_scores_gemma":[0.99875414,0.0006633897,0.00010742814,0.00019036567,0.00021398895,0.00007073208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010676149,0.0009978138,0.0010069866,0.0008792066,0.00060833676,0.0008228653,0.0014034176,0.00088070944,0.0034111363],"category_scores_gemma":[0.0027259092,0.00040966805,0.0007847789,0.0011254171,0.0005548804,0.00095921574,0.0015720774,0.0011879286,0.00069355586],"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.00019102244,0.00020140482,0.0005897422,0.00011104995,0.00006818108,0.000081773214,0.00005201204,0.8152531,0.004792115,0.012002715,0.002251023,0.16440584],"study_design_scores_gemma":[0.000028863074,0.000040068706,0.0000731809,0.0000044507583,0.0000054880543,0.000012760887,0.000010531734,0.9947754,0.000760514,0.0034512212,0.0008344257,0.0000031696545],"about_ca_topic_score_codex":0.005534154,"about_ca_topic_score_gemma":0.00498952,"teacher_disagreement_score":0.005534154,"about_ca_system_score_codex":0.0006034767,"about_ca_system_score_gemma":0.0017339975,"threshold_uncertainty_score":0.011411428},"labels":[],"label_agreement":null},{"id":"W4414223321","doi":"10.1609/icaps.v35i1.36134","title":"New Exact Methods for Solving Quadratic Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":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 Toronto","funders":"Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Travelling salesman problem; Integer programming; Generalization; Quadratic programming; Quadratic equation; Branch and bound; Scalability; Integer (computer science); Linear programming","score_opus":0.05569454548912666,"score_gpt":0.38933066774580644,"score_spread":0.33363612225667977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414223321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026942028,0.0005003571,0.9911855,0.00013760327,0.00006896359,0.000054524837,0.00007449599,0.00030236781,0.004981969],"genre_scores_gemma":[0.10352704,0.0010389583,0.888534,0.00029114238,0.00011479395,0.00039470042,0.00043915978,0.00034910574,0.0053110444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00019676973,0.000039586346,0.00012484255,0.0003658512,0.00008949569],"domain_scores_gemma":[0.9991572,0.00047355605,0.00008926633,0.000081883605,0.00016539996,0.000032743465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053201,0.0012975285,0.00080503925,0.0008994923,0.00045680424,0.0011004017,0.0017669348,0.0010848271,0.005955251],"category_scores_gemma":[0.0033096154,0.0006099176,0.0010150098,0.0013863537,0.0007007572,0.001675297,0.0011895637,0.0020258327,0.0010811728],"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.000037342674,0.00006336145,0.00028329223,0.00021520887,0.000038072947,0.000053169577,0.000066877095,0.8419381,0.0011300303,0.051310398,0.0040392787,0.10082493],"study_design_scores_gemma":[0.000011913762,0.000017584007,0.000029069031,0.000014617858,0.0000054373886,0.000015306634,0.000011505355,0.9863929,0.00019100851,0.01043304,0.0028732698,0.0000043556856],"about_ca_topic_score_codex":0.006615838,"about_ca_topic_score_gemma":0.006759384,"teacher_disagreement_score":0.006615838,"about_ca_system_score_codex":0.0009864123,"about_ca_system_score_gemma":0.001982281,"threshold_uncertainty_score":0.019922316},"labels":[],"label_agreement":null},{"id":"W49698117","doi":"10.1609/icaps.v24i1.13680","title":"Improved Features for Runtime Prediction of Domain-Independent Planners","year":2014,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Planner; Computer science; Set (abstract data type); Domain (mathematical analysis); Variation (astronomy); Range (aeronautics); Machine learning; Artificial intelligence; Point (geometry); Mathematics; Engineering; Programming language","score_opus":0.0215283963574559,"score_gpt":0.25794355658467766,"score_spread":0.23641516022722175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49698117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3991513,0.0013402493,0.57072973,0.000990059,0.0001262416,0.0001861951,0.005696725,0.016630292,0.005149221],"genre_scores_gemma":[0.8679723,0.00022279097,0.12633671,0.00009503526,0.000049753686,0.00020360314,0.0036397977,0.000599227,0.00088072015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998933,0.0002729354,0.00006767864,0.00034710168,0.00027077008,0.00010852935],"domain_scores_gemma":[0.9904541,0.0063493927,0.0009855285,0.0012788152,0.0007396505,0.00019264736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018263975,0.0013532167,0.00096648815,0.0015631983,0.0003898422,0.001208228,0.0019577548,0.0011494374,0.0016839516],"category_scores_gemma":[0.018322192,0.00076614413,0.0009630779,0.0013443519,0.0006569789,0.0023064788,0.00086981856,0.0023376145,0.000477521],"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.00009232489,0.000051687868,0.003599217,0.000048011985,0.000022261736,0.000024305804,0.000025773259,0.9659165,0.00048519278,0.0010420427,0.0013569334,0.027335662],"study_design_scores_gemma":[0.0000046191644,0.0000126816485,0.00032823576,0.000004058535,0.000005254269,0.00000593884,0.000002235828,0.9981838,0.00032294486,0.00097051536,0.00015639141,0.000003299308],"about_ca_topic_score_codex":0.010090192,"about_ca_topic_score_gemma":0.011779613,"teacher_disagreement_score":0.010090192,"about_ca_system_score_codex":0.0015727782,"about_ca_system_score_gemma":0.0015477343,"threshold_uncertainty_score":0.020062923},"labels":[],"label_agreement":null},{"id":"W85676387","doi":"10.1609/icaps.v19i1.13392","title":"Exploiting N-Gram Analysis to Predict Operator Sequences","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"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":"n-gram; Gram; Computer science; Operator (biology); Planner; Set (abstract data type); Sequence (biology); Core (optical fiber); Artificial intelligence; Word (group theory); Data mining; Mathematics; Language model; Programming language","score_opus":0.03421742483727147,"score_gpt":0.2935455780116302,"score_spread":0.25932815317435876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85676387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12119189,0.0005520509,0.86720574,0.0006118221,0.0000820347,0.00020899007,0.0015812488,0.004930809,0.003635357],"genre_scores_gemma":[0.6108944,0.0003173194,0.3842828,0.00014892864,0.00004161061,0.00018507462,0.0022981612,0.00038987744,0.0014419064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.00024144819,0.00005804911,0.00017178222,0.00019811101,0.00009055179],"domain_scores_gemma":[0.9954389,0.0031405513,0.00047192603,0.00026051744,0.00053020567,0.00015792881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281125,0.0011761279,0.00067562296,0.0025368254,0.000924187,0.0009436718,0.0006112908,0.00084243796,0.0030465429],"category_scores_gemma":[0.0077863396,0.0003955814,0.0009955135,0.0014077439,0.00076530105,0.0017730109,0.00082403683,0.0012638933,0.0012061278],"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.0014405117,0.0005059001,0.031237198,0.00064725487,0.00027644794,0.0013464359,0.0014076228,0.37830174,0.06118236,0.017498104,0.008070191,0.49808618],"study_design_scores_gemma":[0.000018709668,0.00010871501,0.0029513063,0.0000357368,0.000045433313,0.000108667315,0.00016033942,0.95935184,0.008737625,0.026307678,0.0021286542,0.000045385073],"about_ca_topic_score_codex":0.013934925,"about_ca_topic_score_gemma":0.025753919,"teacher_disagreement_score":0.013934925,"about_ca_system_score_codex":0.0008843236,"about_ca_system_score_gemma":0.002084701,"threshold_uncertainty_score":0.027707577},"labels":[],"label_agreement":null},{"id":"W85998123","doi":"10.1609/icaps.v19i1.13355","title":"Incremental Policy Generation for Finite-Horizon DEC-POMDPs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Dynamic programming; Computer science; Scalability; Reachability; Mathematical optimization; State (computer science); State space; Reduction (mathematics); Backup; Horizon; Algorithm; Mathematics","score_opus":0.05613533112334739,"score_gpt":0.31798258634313714,"score_spread":0.26184725521978974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85998123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039699115,0.00027396553,0.9554786,0.00021913878,0.00005236039,0.000090081325,0.00013830481,0.0012788428,0.0027695992],"genre_scores_gemma":[0.7471653,0.00020560618,0.25092876,0.00011312789,0.000017575823,0.00021881527,0.00030885285,0.000114270544,0.0009276991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995235,0.00016684677,0.000028962284,0.0000823141,0.0001228299,0.000075575794],"domain_scores_gemma":[0.9972832,0.0020494794,0.00015516367,0.00022697092,0.00018883172,0.00009638236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015012231,0.0005849361,0.0008204827,0.00044208847,0.00047025792,0.00070936105,0.001140796,0.00064729765,0.0018524624],"category_scores_gemma":[0.0047778855,0.00046045138,0.00046595422,0.00043166298,0.00067823764,0.0011990326,0.0011052081,0.0013301382,0.00024064542],"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.000119383105,0.00005961927,0.0005233021,0.00008821355,0.000020911017,0.00008614371,0.000049023234,0.9473028,0.0009667077,0.01009326,0.000782795,0.0399078],"study_design_scores_gemma":[0.0000108454005,0.000015116728,0.000035130925,0.000004241344,0.000002989667,0.000011822188,0.000008866974,0.9933541,0.00055450184,0.005666673,0.0003329701,0.0000026954533],"about_ca_topic_score_codex":0.0027833725,"about_ca_topic_score_gemma":0.0035378158,"teacher_disagreement_score":0.0027833725,"about_ca_system_score_codex":0.0008007422,"about_ca_system_score_gemma":0.0012970422,"threshold_uncertainty_score":0.007939279},"labels":[],"label_agreement":null}]}