{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":303,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":303,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"2ac23a5c820b","filters":{"topic":"Scheduling and Timetabling Solutions"}},"results":[{"id":"W2014856631","doi":"10.1007/s10951-008-0077-5","title":"A survey of search methodologies and automated system development for examination timetabling","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":378,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick; Queen's University","funders":"","keywords":"Generality; Presentation (obstetrics); Computer science; Benchmark (surveying); Data science; Confusion; Management science; Operations research; Psychology; Engineering","authors":[{"name":"Rong Qu","is_ca":false},{"name":"Edmund Burke","is_ca":false},{"name":"B. McCollum","is_ca":true},{"name":"Liam T. G. Merlot","is_ca":false},{"name":"S. Y. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4968872769107157,"gpt":0.4637269991699302,"spread":0.0331602777407855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004520689,0.001112254,0.001375582,0.005433606,0.0006563845,0.002598951,0.002446686,0.00114959,0.003515444],"category_scores_gemma":[0.01241647,0.001032707,0.001522487,0.008532959,0.0006199335,0.002634384,0.0007617424,0.001078323,0.001086312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001270819,"about_ca_system_score_gemma":0.002649319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004073266,"about_ca_topic_score_gemma":0.005476721,"domain_scores_codex":[0.9958783,0.001328282,0.0005064539,0.0005545205,0.001573079,0.0001593034],"domain_scores_gemma":[0.9910261,0.006330024,0.0004895768,0.0007144323,0.001347998,0.00009190191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007179347,0.000236962,0.002197804,0.003880077,0.0001326443,0.00005577663,0.0001668016,0.02414601,0.003580521,0.02289763,0.004581989,0.9380519],"study_design_scores_gemma":[0.0002372118,0.0009150036,0.008135487,0.004233545,0.0005287926,0.001731644,0.0007799104,0.586015,0.02135005,0.1084231,0.2674381,0.0002122874],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.0140465,0.09095541,0.88054,0.001053446,0.0001175392,0.0003341153,0.0005064251,0.001307268,0.01113932],"genre_scores_gemma":[0.05021497,0.05491693,0.8904464,0.0003629585,0.0001242241,0.0003141764,0.0008042947,0.0002593857,0.002556642],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005433606,"threshold_uncertainty_score":0.02390796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093938881","doi":"10.1016/j.cor.2005.07.028","title":"A survey of local search methods for graph coloring","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":228,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Tabu search; Guided Local Search; Graph coloring; Local search (optimization); Subroutine; Hill climbing; Computer science; Graph; Best-first search; Search algorithm; Population; Algorithm; Theoretical computer science; Mathematics; Beam search","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.6028806549559134,"gpt":0.6204365109072726,"spread":0.01755585595135922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070914,0.001239871,0.002928878,0.002421618,0.0009129029,0.001630213,0.003170908,0.001501568,0.006677181],"category_scores_gemma":[0.005745099,0.0009305226,0.00184644,0.006155722,0.0009280545,0.002532702,0.001516315,0.002123565,0.002380769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346986,"about_ca_system_score_gemma":0.001596284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006291577,"about_ca_topic_score_gemma":0.009137589,"domain_scores_codex":[0.9986072,0.0006444845,0.00007801614,0.0002298123,0.000361431,0.00007911378],"domain_scores_gemma":[0.9973366,0.001778714,0.0001002934,0.0003349404,0.0003813549,0.00006795653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001439058,0.0002743356,0.000848111,0.002117435,0.0002083086,0.00004162698,0.0001830707,0.1959668,0.001711264,0.08294138,0.01999764,0.6955662],"study_design_scores_gemma":[0.0001091774,0.0001544498,0.0004102866,0.0003496629,0.0001141356,0.0001522018,0.00009749334,0.8670048,0.001257006,0.092968,0.03733997,0.00004292443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00286952,0.02430576,0.9658599,0.0004350412,0.0001630872,0.00009992507,0.0001752282,0.0006542733,0.005437287],"genre_scores_gemma":[0.07474811,0.03225576,0.8804623,0.0006318335,0.0006754837,0.0005750795,0.0008242793,0.0008925338,0.008934741],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006677181,"threshold_uncertainty_score":0.02233738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966942146","doi":"10.1007/s10479-014-1614-6","title":"The practice and theory of automated timetabling","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":208,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Operations research; Computer science; Library science; Annals; History; Engineering","authors":[{"name":"Barry McCollum","is_ca":true},{"name":"Edmund Burke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.462131275352027,"gpt":0.5843200294400972,"spread":0.1221887540880702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01312928,0.001242394,0.001738378,0.00433782,0.002179779,0.007864188,0.004175588,0.003358889,0.007985773],"category_scores_gemma":[0.06057146,0.001955479,0.002474829,0.005851827,0.01461262,0.01093587,0.003849647,0.007472849,0.001626591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004947051,"about_ca_system_score_gemma":0.006927939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005493272,"about_ca_topic_score_gemma":0.003843522,"domain_scores_codex":[0.9790033,0.01108838,0.001231656,0.00247382,0.00563375,0.0005691247],"domain_scores_gemma":[0.9113469,0.06732617,0.002690559,0.01453287,0.00349658,0.0006068687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003716079,0.00007925208,0.0004976689,0.0002712822,0.00004141191,0.00003199077,0.0002207891,0.04645443,0.0003279055,0.9004435,0.002972808,0.04862189],"study_design_scores_gemma":[0.00002241178,0.00002254705,0.0001458177,0.00009281658,0.00001167484,0.00004766829,0.00004748947,0.08028925,0.0003146789,0.9095551,0.009431403,0.00001901033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00521932,0.003111251,0.9731299,0.00467619,0.0002618255,0.0000681587,0.0001480496,0.0001965765,0.01318874],"genre_scores_gemma":[0.2431425,0.006548482,0.742624,0.0009413442,0.001298628,0.0004661065,0.0004361277,0.0001875686,0.004355198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01312928,"threshold_uncertainty_score":0.06943512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094070748","doi":"10.1007/s10951-010-0188-7","title":"Scheduling technicians and tasks in a telecommunications company","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Orange","keywords":"Computer science; Scheduling (production processes); Operations research; Technician; Heuristic; Task (project management); Job shop scheduling; Telecommunications; Industrial engineering; Operations management; Artificial intelligence; Computer network; Systems engineering; Engineering","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Fédérico Pasin","is_ca":true},{"name":"Stefan Røpke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08476310417682809,"gpt":0.3892352386411909,"spread":0.3044721344643628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001933021,0.0005615427,0.0006021168,0.0008638481,0.002379549,0.002100539,0.001055393,0.002094338,0.005356953],"category_scores_gemma":[0.003517866,0.0007844084,0.0006136786,0.001254427,0.0006608007,0.0009527653,0.0006901083,0.0009176794,0.0004125969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354709,"about_ca_system_score_gemma":0.00364647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02464773,"about_ca_topic_score_gemma":0.01644026,"domain_scores_codex":[0.9989781,0.0004079409,0.00006180498,0.0001397527,0.0001295978,0.0002827813],"domain_scores_gemma":[0.9974082,0.001593941,0.000222277,0.00008724839,0.0001591923,0.000529141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002055854,0.001082318,0.009964683,0.0001263119,0.0001056159,0.001199668,0.0005296002,0.9138067,0.01057552,0.008878826,0.002611018,0.04906387],"study_design_scores_gemma":[0.0001888511,0.0005840186,0.004601686,0.00001485408,0.00006572835,0.0001415726,0.0007527896,0.9828904,0.002975887,0.00528875,0.002461809,0.00003363216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9220141,0.0002847005,0.06817097,0.0007139528,0.00008433051,0.0003888675,0.0001666698,0.000162472,0.008013981],"genre_scores_gemma":[0.9726002,0.0001410149,0.022782,0.00005889988,0.00004416154,0.00009105087,0.0001365362,0.0000286589,0.004117313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02464773,"threshold_uncertainty_score":0.04900855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024143101","doi":"10.1016/j.cor.2006.05.014","title":"A graph coloring heuristic using partial solutions and a reactive tabu scheme","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Tabu search; Graph coloring; Heuristics; Greedy coloring; List coloring; Computer science; Benchmark (surveying); Mathematics; Heuristic; Fractional coloring; Graph; Algorithm; Combinatorics; Mathematical optimization; Graph power; Line graph","authors":[{"name":"Ivo Blöchliger","is_ca":false},{"name":"Nicolas Zufferey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4308289758627579,"gpt":0.4947675758842449,"spread":0.06393860002148699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713326,0.0007716269,0.00101032,0.001832626,0.001405906,0.001152439,0.003472357,0.001398865,0.006841286],"category_scores_gemma":[0.003236329,0.0007860666,0.0009214165,0.002105733,0.0008725862,0.001332129,0.001097597,0.001020198,0.0007204256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001481892,"about_ca_system_score_gemma":0.002363231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008888016,"about_ca_topic_score_gemma":0.009264984,"domain_scores_codex":[0.9992759,0.000328081,0.00002779425,0.0001065911,0.0001394435,0.0001221938],"domain_scores_gemma":[0.9987208,0.0006001074,0.00008757601,0.0002757017,0.0002211971,0.00009453371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004781032,0.0003649629,0.00046223,0.000162133,0.00007279806,0.00006732759,0.0001398101,0.790867,0.006919388,0.0292116,0.003883569,0.1673711],"study_design_scores_gemma":[0.0001274911,0.000138219,0.0001304629,0.00001323604,0.00003371912,0.00002158151,0.00002720494,0.9920834,0.001525639,0.00471338,0.001164168,0.00002157651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0997325,0.0002727495,0.8824962,0.0003260198,0.0002444876,0.0006243643,0.0002744133,0.002016528,0.01401274],"genre_scores_gemma":[0.3325832,0.0000987513,0.6624371,0.0001482361,0.00004059743,0.0003679309,0.0002882437,0.0002529497,0.003782995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008888016,"threshold_uncertainty_score":0.02288634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601417206","doi":"10.1023/a:1019009928005","title":"A mathematical programming approach for scheduling physicians in the emergency room","year":2000,"lang":"en","type":"review","venue":"Health Care Management Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":161,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Imperial Oil (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Schedule; Operations research; Scheduling (production processes); Workload; Health informatics; Operations management; Medicine; Nursing; Public health; Mathematics; Engineering","authors":[{"name":"Huguette Beaulieu","is_ca":true},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Philippe Michelon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2007146065614402,"gpt":0.4855884864042948,"spread":0.2848738798428546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001753538,0.001516176,0.001643209,0.001995116,0.0004322901,0.001683306,0.00262739,0.001561315,0.002247553],"category_scores_gemma":[0.00321199,0.0006150511,0.0009277111,0.004352868,0.0009253276,0.001594066,0.0007214061,0.002459392,0.001173714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001945714,"about_ca_system_score_gemma":0.003147837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005630167,"about_ca_topic_score_gemma":0.005863779,"domain_scores_codex":[0.999194,0.0002749664,0.00006714951,0.00009749078,0.0003353527,0.00003106774],"domain_scores_gemma":[0.9987646,0.0008772208,0.0001317698,0.00003393092,0.0001657815,0.00002670976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006529852,0.000266913,0.0002531423,0.005959047,0.0001680816,0.00009912816,0.00007691317,0.1179837,0.0009650284,0.1025034,0.01592056,0.7557387],"study_design_scores_gemma":[0.0001982413,0.0004046507,0.001240963,0.005253736,0.0003694965,0.001059601,0.0002562609,0.285356,0.003215417,0.2786582,0.4238207,0.0001668673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.002027036,0.6270266,0.3523411,0.003947576,0.0008023562,0.0001243123,0.0001334706,0.0001889107,0.01340862],"genre_scores_gemma":[0.02922846,0.7602296,0.2037728,0.0011183,0.001090474,0.0003027879,0.0002043609,0.00004476807,0.004008406],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.005630167,"threshold_uncertainty_score":0.01411724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021735068","doi":"10.1016/j.dam.2008.03.022","title":"Variable space search for graph coloring","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Complete coloring; Fractional coloring; Vertex (graph theory); Graph coloring; Combinatorics; Best-first search; Edge coloring; List coloring; Space (punctuation); Local search (optimization); Variable neighborhood search; Graph; Set (abstract data type); Search algorithm; Greedy coloring; Beam search; Discrete mathematics; Algorithm; Computer science; Metaheuristic; Graph power; Line graph","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Matthieu Plumettaz","is_ca":false},{"name":"Nicolas Zufferey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.173262291549744,"gpt":0.3769068393962284,"spread":0.2036445478464845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546674,0.0008330862,0.001763591,0.001620412,0.0008423759,0.00154443,0.001415754,0.00140631,0.006487034],"category_scores_gemma":[0.0073114,0.0006283452,0.001028649,0.002799544,0.001459246,0.002162815,0.00128042,0.002000429,0.0005076134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736787,"about_ca_system_score_gemma":0.002491137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01137438,"about_ca_topic_score_gemma":0.009646769,"domain_scores_codex":[0.9990162,0.0005122176,0.00002720362,0.0001353616,0.0001500136,0.0001589844],"domain_scores_gemma":[0.9957325,0.003601473,0.0001721059,0.0001927638,0.0001696038,0.0001315046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003466944,0.0001994971,0.0007319249,0.0002631071,0.00008125181,0.0000399445,0.0001518894,0.772967,0.0007042496,0.1078022,0.009151567,0.1075606],"study_design_scores_gemma":[0.00005638928,0.0000385949,0.0001087753,0.00001691964,0.00001219525,0.000009465947,0.0000305062,0.8918463,0.0002078114,0.1066255,0.001041031,0.000006558202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09249604,0.001826825,0.8861065,0.001858202,0.0002113238,0.0001930089,0.0006289262,0.0009726152,0.01570661],"genre_scores_gemma":[0.6065672,0.0009999223,0.376693,0.0004152655,0.0002148729,0.0004107584,0.001031537,0.0003235736,0.01334385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01137438,"threshold_uncertainty_score":0.02261633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050784217","doi":"10.1057/palgrave.jors.2602574","title":"A patient assignment algorithm for home care services","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Workload; Integer programming; Tabu search; Linear programming; Computer science; Algorithm; Mathematical optimization; Heuristic; Heuristics; Nurse scheduling problem; Project management; Operations research; Nursing; Mathematics; Medicine; Job shop scheduling; Economics; Schedule","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Nadia Lahrichi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2117213361653014,"gpt":0.4610518676349739,"spread":0.2493305314696725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927434,0.0005553849,0.0009077213,0.0009737877,0.0007567602,0.001056714,0.001324292,0.0009694595,0.01523626],"category_scores_gemma":[0.00154625,0.000372742,0.0004891588,0.001402499,0.0002855618,0.0006979646,0.0008160158,0.000771831,0.001431858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001223124,"about_ca_system_score_gemma":0.001761892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005831001,"about_ca_topic_score_gemma":0.0044426,"domain_scores_codex":[0.9994832,0.0001866712,0.00002495742,0.0001168757,0.00009571887,0.00009256304],"domain_scores_gemma":[0.9995147,0.0002114842,0.00006006878,0.00002960996,0.0001091998,0.00007507351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004396272,0.00049519,0.001730837,0.00017507,0.00006513688,0.0001223151,0.0001387172,0.6287328,0.002326404,0.01224136,0.01383227,0.3397002],"study_design_scores_gemma":[0.0000661815,0.00004539786,0.00022481,0.000006877795,0.000008100175,0.00003696227,0.00002968578,0.9916545,0.0005015939,0.005676989,0.001742708,0.000006067214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05126768,0.0002199325,0.9390618,0.0005347584,0.00009296502,0.0003861854,0.0004856385,0.001897556,0.006053574],"genre_scores_gemma":[0.3255177,0.0001504096,0.6641343,0.0002013501,0.00006171106,0.000429146,0.000934083,0.0001957156,0.008375606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01523626,"threshold_uncertainty_score":0.05097038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035237530","doi":"10.1007/s10601-006-9003-7","title":"A Cost-Regular Based Hybrid Column Generation Approach","year":2006,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Constraint programming; Embedding; Mathematical optimization; Constraint (computer-aided design); Combinatorial optimization; Computation; Benchmark (surveying); Column (typography); Algorithm; Mathematics; Artificial intelligence; Stochastic programming","authors":[{"name":"Sophie Demassey","is_ca":false},{"name":"Gilles Pesant","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2085565399469041,"gpt":0.3669972140349245,"spread":0.1584406740880204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008998698,0.0008008861,0.001321909,0.001517284,0.000527588,0.0009626743,0.001884982,0.0009974398,0.00696132],"category_scores_gemma":[0.00190555,0.0007075806,0.000982058,0.001901144,0.0004087032,0.0009803299,0.0006993315,0.0008824369,0.0006994595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007994153,"about_ca_system_score_gemma":0.001274748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006799911,"about_ca_topic_score_gemma":0.008158528,"domain_scores_codex":[0.9992971,0.0002287771,0.00002964335,0.000103581,0.0002691369,0.00007172327],"domain_scores_gemma":[0.9987168,0.0007130128,0.00008583241,0.0001426526,0.0002932249,0.00004848805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001205314,0.0001502041,0.0002280238,0.0001410603,0.00006411992,0.00008075743,0.00003522353,0.8458958,0.003811407,0.008583693,0.002615359,0.1382739],"study_design_scores_gemma":[0.00001181965,0.00001817764,0.00003787603,0.000003033805,0.00001010141,0.00001077184,0.000003424751,0.9972187,0.0004615025,0.001897556,0.0003226742,0.000004312417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01235004,0.0001584634,0.9836438,0.0001168632,0.00003574589,0.0001022259,0.000130155,0.0006464638,0.002816174],"genre_scores_gemma":[0.2719486,0.00018239,0.7221777,0.0002045205,0.00006245386,0.0003313164,0.0004798455,0.0002675654,0.004345572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00696132,"threshold_uncertainty_score":0.02328789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092998591","doi":"10.1016/j.dam.2006.07.017","title":"An adaptive memory algorithm for the k-coloring problem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Graph coloring; Mathematics; Algorithm; Adaptive memory; Edge coloring; Vertex (graph theory); Greedy coloring; Set (abstract data type); Graph; Computer science; Combinatorics; Line graph; Graph power","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Nicolas Zufferey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1098868155869601,"gpt":0.385019381873026,"spread":0.275132566286066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213065,0.0005834684,0.0008220902,0.0006613677,0.0006259189,0.0008860995,0.002463735,0.00100064,0.004951779],"category_scores_gemma":[0.00256195,0.0003720937,0.0005517724,0.001241606,0.0005129681,0.001547623,0.001430134,0.00117281,0.0006015529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009134959,"about_ca_system_score_gemma":0.001550591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005527361,"about_ca_topic_score_gemma":0.00690986,"domain_scores_codex":[0.9996735,0.00006722712,0.00001732879,0.00008715854,0.000067384,0.00008747498],"domain_scores_gemma":[0.9991713,0.0004277503,0.00007567977,0.0001447139,0.0001174517,0.00006324716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00107109,0.0003685692,0.001143927,0.0002731674,0.00009554142,0.00007830594,0.0001741296,0.3500439,0.01063248,0.04422065,0.01048145,0.5814168],"study_design_scores_gemma":[0.0001614678,0.00009743018,0.0001880552,0.00001373933,0.00002858384,0.0000424977,0.00002785813,0.9702917,0.002241042,0.02517704,0.001716802,0.00001382135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06196149,0.0004891545,0.9290357,0.0003892152,0.0001465402,0.0001204736,0.0001457294,0.001451501,0.006260187],"genre_scores_gemma":[0.4481229,0.0003151287,0.5443547,0.0002443479,0.00008571573,0.0002909248,0.000344502,0.0002008229,0.006040819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005527361,"threshold_uncertainty_score":0.01656532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112255588","doi":"10.1016/j.asoc.2009.08.011","title":"An informed genetic algorithm for the examination timetabling problem","year":2009,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Heuristics; Genetic algorithm; Domain (mathematical analysis); Process (computing); Set (abstract data type); Constraint (computer-aided design); Range (aeronautics); Evolutionary algorithm; Quality (philosophy); Mathematical optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics","authors":[{"name":"Nelishia Pillay","is_ca":false},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06682508495774124,"gpt":0.3649826455882064,"spread":0.2981575606304651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278796,0.000727643,0.0009139834,0.001066121,0.0005341781,0.0009067001,0.001606749,0.002204529,0.003706802],"category_scores_gemma":[0.005260663,0.0005783544,0.0007323686,0.001153716,0.0007220071,0.0008893734,0.001042143,0.001253622,0.0004143242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0011544,"about_ca_system_score_gemma":0.00271926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009560023,"about_ca_topic_score_gemma":0.007669492,"domain_scores_codex":[0.9993981,0.0002421558,0.00001824295,0.00009758782,0.0001782942,0.00006554912],"domain_scores_gemma":[0.998714,0.0008957472,0.00008154383,0.00007085643,0.0001864982,0.00005145068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000076137,0.0000859008,0.0004999249,0.00003573288,0.00003178163,0.00004869539,0.00007163393,0.89332,0.0009242211,0.01069824,0.001291037,0.09291667],"study_design_scores_gemma":[0.00003689488,0.00002795112,0.0001045844,0.000006841523,0.00001068298,0.00001186496,0.0000080597,0.9943795,0.0001841808,0.004716345,0.0005085869,0.000004501837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03388938,0.0002026515,0.959588,0.000366626,0.00006707351,0.000144216,0.00008958068,0.0004206191,0.005231859],"genre_scores_gemma":[0.3014235,0.0001828727,0.692924,0.0002684607,0.00005279768,0.0003753876,0.0002266954,0.0001071831,0.004439151],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009560023,"threshold_uncertainty_score":0.01900876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097428991","doi":"10.1016/j.ejor.2008.07.023","title":"A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Heuristics; Heuristic; Hyper-heuristic; Computer science; Mathematical optimization; Null-move heuristic; Consistent heuristic; Set (abstract data type); Algorithm; Mathematics; Incremental heuristic search; Artificial intelligence; Beam search; Search algorithm","authors":[{"name":"Narushan Pillay","is_ca":false},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5359042032405876,"gpt":0.4791834452571304,"spread":0.05672075798345722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003998003,0.00104755,0.001212181,0.002157003,0.0007763263,0.001707783,0.001188707,0.0008359437,0.004977338],"category_scores_gemma":[0.01414591,0.0006827859,0.000936907,0.002105171,0.0005979905,0.001424665,0.0007119332,0.001028914,0.0003350657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001436409,"about_ca_system_score_gemma":0.001556669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00156545,"about_ca_topic_score_gemma":0.001598779,"domain_scores_codex":[0.9969648,0.001971852,0.0001433541,0.0002066864,0.0004731072,0.00024022],"domain_scores_gemma":[0.9869843,0.01083351,0.0006605908,0.0003728021,0.0009338938,0.0002149551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001554863,0.000604027,0.003013909,0.0005670665,0.0003085936,0.0001485342,0.0001661239,0.8248151,0.003721549,0.01125999,0.001060209,0.15278],"study_design_scores_gemma":[0.00008520934,0.001070595,0.0008400242,0.00004278629,0.0001804828,0.0000624738,0.0001043104,0.9902121,0.001786233,0.004279027,0.001317054,0.00001966789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6266039,0.003528496,0.3290391,0.0004140332,0.0002258472,0.001316692,0.0005127536,0.0004759026,0.0378833],"genre_scores_gemma":[0.8438489,0.0006451131,0.1517287,0.00006840189,0.0000579716,0.0005848384,0.0002587146,0.00009755732,0.002709683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004977338,"threshold_uncertainty_score":0.02114367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114494151","doi":"10.1007/s10916-014-0160-8","title":"The Nurse Scheduling Problem in Real-Life","year":2014,"lang":"en","type":"article","venue":"Journal of Medical Systems","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristics; Scheduling (production processes); Solver; Nurse scheduling problem; Usability; Software; Heuristic; Process (computing); Job shop scheduling; Operations research; Industrial engineering; Operations management; Schedule; Artificial intelligence; Operating system; Flow shop scheduling; Engineering","authors":[{"name":"Antoine Legrain","is_ca":true},{"name":"Hocine Bouarab","is_ca":true},{"name":"Nadia Lahrichi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09017967511885595,"gpt":0.4055672701926766,"spread":0.3153875950738206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003170535,0.0007983114,0.001221659,0.0007270385,0.0007363566,0.001826445,0.001750998,0.002607176,0.004179526],"category_scores_gemma":[0.008671468,0.0007863977,0.0007244304,0.001173057,0.001208976,0.002222097,0.0008638008,0.001324188,0.0003350146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001619054,"about_ca_system_score_gemma":0.002297194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008433058,"about_ca_topic_score_gemma":0.008157201,"domain_scores_codex":[0.9981787,0.0009076977,0.00008654686,0.0003219432,0.0002421814,0.0002630279],"domain_scores_gemma":[0.9942684,0.00441632,0.0004699456,0.0001406219,0.0003358252,0.0003688281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002824547,0.0001831109,0.001449206,0.0002988493,0.0001086926,0.0003604295,0.000110998,0.9514996,0.0007480655,0.02183009,0.004015742,0.01911277],"study_design_scores_gemma":[0.00005519083,0.00006398799,0.0006363148,0.00002435037,0.00002207914,0.0001267862,0.0001172608,0.9758439,0.0002703023,0.02136786,0.001455183,0.00001674606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3059247,0.005253652,0.6655524,0.006616628,0.0009432196,0.000292039,0.001507476,0.0003335527,0.01357627],"genre_scores_gemma":[0.9130213,0.001464797,0.07832123,0.0002816592,0.00036519,0.0001338117,0.0006186683,0.00008600514,0.0057073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008433058,"threshold_uncertainty_score":0.01676792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034555835","doi":"10.1007/s10951-009-0114-z","title":"Implicit shift scheduling with multiple breaks and work stretch duration restrictions","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Duration (music); Work (physics); Scheduling (production processes); Computer science; Constraint (computer-aided design); Mathematical optimization; Flexibility (engineering); Context (archaeology); Mathematics; Statistics; Engineering","authors":[{"name":"Monia Rekik","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0559839752264544,"gpt":0.3383749230511079,"spread":0.2823909478246535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684882,0.0008891073,0.001912393,0.0007130906,0.001049954,0.00179541,0.003915043,0.00126799,0.00631595],"category_scores_gemma":[0.007116717,0.001115565,0.001029029,0.001543499,0.001062289,0.003232042,0.002422772,0.00229464,0.0005734056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000835567,"about_ca_system_score_gemma":0.002349288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002583482,"about_ca_topic_score_gemma":0.003030993,"domain_scores_codex":[0.9982185,0.0005804183,0.00009762018,0.0002803302,0.0003996084,0.0004235444],"domain_scores_gemma":[0.9952773,0.002374447,0.0006160272,0.0009039771,0.0003795067,0.0004487034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002270733,0.0006603844,0.001306211,0.0003834841,0.00009277112,0.0001485411,0.0004240239,0.8061143,0.008945377,0.07527008,0.002176702,0.1022075],"study_design_scores_gemma":[0.0001659212,0.0004532932,0.0005959793,0.00002270539,0.00004342577,0.00004330889,0.00007421218,0.959169,0.001660059,0.03569779,0.002041851,0.00003249023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170405,0.0002999366,0.8205124,0.000325737,0.0001588429,0.000268439,0.0002451265,0.0002984082,0.007486155],"genre_scores_gemma":[0.8657611,0.0001957041,0.1244398,0.00005163122,0.0001303235,0.0002770139,0.000173967,0.00009995991,0.008870411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00631595,"threshold_uncertainty_score":0.02112895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963501528","doi":"10.1016/j.cie.2012.06.015","title":"Integrating workers’ differences into workforce planning","year":2012,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Overtime; Workforce; Interfacing; Production (economics); Workforce planning; Order (exchange); Quality (philosophy); Throughput; Production planning; Operations management; Computer science; Operations research; Engineering; Business; Labour economics; Economics","authors":[{"name":"Mohammed Othman","is_ca":true},{"name":"Nadia Bhuiyan","is_ca":true},{"name":"Gerard J. Gouw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2313521147258888,"gpt":0.3620478958576048,"spread":0.130695781131716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003679732,0.0002645335,0.0003959934,0.0007874449,0.0006095768,0.001409066,0.0008840507,0.0005819516,0.003581715],"category_scores_gemma":[0.01683037,0.0002203699,0.0003488109,0.0009800661,0.0005530738,0.001582806,0.001275668,0.0009714905,0.0002321295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001756689,"about_ca_system_score_gemma":0.001681528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008133836,"about_ca_topic_score_gemma":0.01402989,"domain_scores_codex":[0.9980574,0.000773058,0.000124151,0.0002944946,0.0004881451,0.0002627355],"domain_scores_gemma":[0.9927366,0.004311052,0.0007527471,0.0006690744,0.0009108588,0.0006197001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009246377,0.000857128,0.5440406,0.0002072757,0.0003138407,0.0002573415,0.004782648,0.1235823,0.005657428,0.04983734,0.00173432,0.2678052],"study_design_scores_gemma":[0.0001097218,0.0009131587,0.5689866,0.0001073499,0.000192484,0.0002562128,0.01022129,0.2655923,0.005932264,0.1397773,0.007790274,0.0001210847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9323922,0.0003112304,0.05265407,0.001157623,0.0001221629,0.00006347795,0.0002372609,0.00005895819,0.01300301],"genre_scores_gemma":[0.9923282,0.00002059339,0.007013509,0.00002867591,0.000007814522,0.000009873283,0.00004426713,0.00000623145,0.0005407521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008133836,"threshold_uncertainty_score":0.01946056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134909806","doi":"10.1007/3-540-44629-x_6","title":"Examination Timetables and Tabu Search with Longer-Term Memory","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Tabu search; Computer science; Term (time); Scheduling (production processes); Relaxation (psychology); Algorithm; Mathematical optimization; Mathematics","authors":[{"name":"George M. White","is_ca":true},{"name":"Bill S. Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07418487081622242,"gpt":0.330574517201336,"spread":0.2563896463851135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774636,0.00111749,0.001398091,0.001371115,0.001036728,0.002674421,0.004002804,0.001285748,0.05223218],"category_scores_gemma":[0.008536631,0.0009867154,0.001314729,0.005417652,0.000959117,0.00592696,0.001571051,0.002475791,0.005640392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001506884,"about_ca_system_score_gemma":0.002125219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00868443,"about_ca_topic_score_gemma":0.01087546,"domain_scores_codex":[0.9987054,0.000521808,0.00007868947,0.0002205035,0.0003065928,0.0001670138],"domain_scores_gemma":[0.9965959,0.002198341,0.0001758114,0.0006710455,0.0002540677,0.0001047638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000772569,0.0002574107,0.0005091873,0.0005593593,0.00008629375,0.00009142007,0.0002158739,0.1600746,0.001888421,0.2008454,0.03635309,0.5983464],"study_design_scores_gemma":[0.0002195158,0.0001995159,0.0004981698,0.0001272002,0.00008437936,0.0001323948,0.00011654,0.500859,0.002517215,0.4599751,0.03521133,0.00005959849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01510826,0.004459606,0.9497166,0.0005547897,0.0004822131,0.0001518067,0.0009475104,0.003573625,0.02500557],"genre_scores_gemma":[0.1241037,0.001877201,0.8310269,0.0002260833,0.000279296,0.0004054292,0.002100053,0.001357852,0.03862354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05223218,"threshold_uncertainty_score":0.1747341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104638302","doi":"10.1287/mnsc.1100.1264","title":"Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling","year":2010,"lang":"en","type":"article","venue":"Management Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Integer programming; Solver; Linear programming relaxation; Mathematical optimization; Rule-based machine translation; Scheduling (production processes); Relaxation (psychology); Theoretical computer science; Mathematics; Algorithm; Programming language; Artificial intelligence","authors":[{"name":"Marie-Claude Côté","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1186818841862017,"gpt":0.3978671027925801,"spread":0.2791852186063783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001663133,0.001322135,0.0009151759,0.0006214918,0.0005123165,0.001660798,0.001941721,0.001410933,0.003582266],"category_scores_gemma":[0.004379753,0.0008025431,0.001905151,0.001489785,0.001321209,0.002205301,0.001472243,0.003355995,0.0006478599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561683,"about_ca_system_score_gemma":0.002202415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003239201,"about_ca_topic_score_gemma":0.00497337,"domain_scores_codex":[0.9984634,0.0006574923,0.0000799073,0.0002190925,0.000428116,0.0001520595],"domain_scores_gemma":[0.9979485,0.001529893,0.0001528748,0.0001828143,0.0001325667,0.00005343038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002134119,0.00005877278,0.0001188164,0.00007788632,0.00001449931,0.00005244887,0.00009941605,0.8793978,0.0006004748,0.1028173,0.001062777,0.01567854],"study_design_scores_gemma":[0.00002192259,0.00001956898,0.00003683924,0.00001493795,0.000007484538,0.00001776241,0.00002127931,0.911921,0.000304308,0.08453513,0.003092298,0.000007449055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007909205,0.0002124687,0.9867655,0.0003021674,0.00004272394,0.0001005198,0.0002038098,0.0001975863,0.004266033],"genre_scores_gemma":[0.188999,0.0007408591,0.8028591,0.0002158475,0.0001011965,0.00081771,0.0007923963,0.0002462357,0.005227719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003582266,"threshold_uncertainty_score":0.01198387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111805524","doi":"10.1007/s10601-009-9083-2","title":"Formal languages for integer programming modeling of shift scheduling problems","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Constraint programming; Integer programming; Computer science; Constraint (computer-aided design); Exploit; Mathematical optimization; Theoretical computer science; Scheduling (production processes); Context (archaeology); Programming language; Mathematics; Algorithm; Stochastic programming","authors":[{"name":"Marie-Claude Côté","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1219977689067701,"gpt":0.3955546711748169,"spread":0.2735569022680469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004118864,0.001401204,0.0009867549,0.00113286,0.0009016349,0.004307068,0.00300688,0.001352356,0.004936437],"category_scores_gemma":[0.008660791,0.001107414,0.0025982,0.001545644,0.002159287,0.004837456,0.001856772,0.004676519,0.001227638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002179425,"about_ca_system_score_gemma":0.003592842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004854583,"about_ca_topic_score_gemma":0.006389765,"domain_scores_codex":[0.9967932,0.001486195,0.0003652737,0.0003046895,0.0007180312,0.0003325655],"domain_scores_gemma":[0.9943335,0.003795256,0.0006498917,0.0005547605,0.0005332629,0.0001332449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004410158,0.00008465497,0.0001388441,0.0001806577,0.00002897841,0.00008923935,0.0003408337,0.09137534,0.000974496,0.8874373,0.00207151,0.01723399],"study_design_scores_gemma":[0.00006554051,0.00002507767,0.00003786912,0.0001172608,0.00003874384,0.00005403986,0.0001367077,0.2891312,0.001239725,0.6913625,0.0177635,0.00002791391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002465029,0.0002504,0.9932186,0.0005320198,0.00005172354,0.00007778913,0.0002425898,0.000420578,0.002741296],"genre_scores_gemma":[0.1414586,0.001271112,0.8491073,0.0005013482,0.0002165374,0.0008927666,0.001106326,0.0003934967,0.005052533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004936437,"threshold_uncertainty_score":0.02178288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W175209279","doi":"10.1023/a:1021153305410","title":"A General Approach to the Physician Rostering Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Flexibility (engineering); Theory of computation; Mathematical optimization; Context (archaeology); Genetic algorithm; Constraint (computer-aided design); Constraint programming; Personalization; Operations research; Algorithm; Mathematics; Machine learning; Stochastic programming","authors":[{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Gilles Pesant","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.710463223401453,"gpt":0.5447390887290039,"spread":0.1657241346724491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002447282,0.001953549,0.002121382,0.001875315,0.001182688,0.002998617,0.004332824,0.003429408,0.01142854],"category_scores_gemma":[0.004897452,0.001050515,0.003397665,0.003407457,0.002003625,0.003517519,0.002807282,0.004418307,0.001394862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002546633,"about_ca_system_score_gemma":0.003386555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007503241,"about_ca_topic_score_gemma":0.008217202,"domain_scores_codex":[0.9978941,0.0008291741,0.00009102753,0.0004644904,0.0004965057,0.0002247333],"domain_scores_gemma":[0.998702,0.0007635127,0.00009984352,0.0001217077,0.0002193086,0.00009351047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002842813,0.0001221304,0.0003126821,0.0002845092,0.00008942404,0.0001772351,0.0001378702,0.3561871,0.0006738885,0.6007089,0.01032041,0.03095743],"study_design_scores_gemma":[0.00004106102,0.00004930246,0.0002367216,0.00005271229,0.00004427177,0.0001077024,0.00006571954,0.4958294,0.0001513248,0.4895088,0.01388901,0.00002397806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002795354,0.0006298676,0.9840788,0.001897825,0.0001734121,0.0001103914,0.0002512005,0.00005892846,0.01000438],"genre_scores_gemma":[0.1878331,0.00550773,0.7662327,0.001299097,0.002025074,0.0008051443,0.001024131,0.0002109551,0.03506212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01142854,"threshold_uncertainty_score":0.03823227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974179675","doi":"10.1023/b:anor.0000019101.29692.2c","title":"Using Benders Decomposition to Implicitly Model Tour Scheduling","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Correctness; Scheduling (production processes); Mathematical optimization; Benders' decomposition; Job shop scheduling; Fair-share scheduling; Algorithm; Mathematics; Schedule","authors":[{"name":"Monia Rekik","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.7910546258868351,"gpt":0.6473067551021794,"spread":0.1437478707846557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019197,0.001486105,0.001466623,0.0011186,0.0006087752,0.001696031,0.00199383,0.001484332,0.003553996],"category_scores_gemma":[0.007201308,0.00181857,0.002140438,0.001676921,0.001051626,0.00299739,0.00137529,0.003235948,0.0005734813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001671074,"about_ca_system_score_gemma":0.001974061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01400413,"about_ca_topic_score_gemma":0.01869695,"domain_scores_codex":[0.9987998,0.0006646942,0.00004503003,0.0001450766,0.0002143329,0.0001310696],"domain_scores_gemma":[0.9973767,0.001830237,0.0002626014,0.000243352,0.0001750056,0.0001121237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001877445,0.00002145949,0.0001175843,0.00001719543,0.00001429611,0.00001493469,0.00002872402,0.9644077,0.0001620207,0.03022187,0.0003413765,0.004634068],"study_design_scores_gemma":[0.000003938944,0.000005178879,0.00001821471,0.000003936661,0.000004918771,0.000002889752,0.000004041077,0.9753879,0.00004998983,0.02406233,0.0004541413,0.00000261684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01406415,0.0001338632,0.9822788,0.0001518101,0.00005101606,0.0000385387,0.0001929602,0.0001518647,0.002936896],"genre_scores_gemma":[0.349182,0.0008122239,0.63908,0.0001345226,0.0001529586,0.0004084598,0.001002241,0.0005364964,0.008691081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01400413,"threshold_uncertainty_score":0.02784526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114085960","doi":"10.1007/s10732-009-9106-6","title":"A large neighbourhood search approach to the  multi-activity shift scheduling problem","year":2009,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Neighbourhood (mathematics); Paradigm shift; Mathematical optimization; Theoretical computer science; Mathematics","authors":[{"name":"Claude-Guy Quimper","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1476587390143901,"gpt":0.4031855617987858,"spread":0.2555268227843956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001148027,0.000455365,0.00131745,0.001137689,0.000642364,0.0008025048,0.001416492,0.001440972,0.003817635],"category_scores_gemma":[0.004445146,0.0004541537,0.0007312026,0.001299629,0.0007561853,0.001427377,0.001097861,0.001032172,0.0003477359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000979166,"about_ca_system_score_gemma":0.001120147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006749691,"about_ca_topic_score_gemma":0.007330165,"domain_scores_codex":[0.9994476,0.0003291548,0.00001907603,0.00005422875,0.0001100994,0.00003976248],"domain_scores_gemma":[0.9982606,0.00140983,0.00006821803,0.00005652076,0.0001352676,0.0000696259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007686853,0.00006438048,0.0001850205,0.00007251515,0.00003373133,0.00004844599,0.00006177891,0.940849,0.0005313898,0.02736026,0.001090491,0.0296261],"study_design_scores_gemma":[0.00002630804,0.00002328084,0.0000483764,0.000005191017,0.000006362528,0.000008922785,0.00001054286,0.9885535,0.00006084181,0.01074071,0.0005114922,0.000004472607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02637012,0.0006528378,0.9649851,0.0004595509,0.00009810641,0.00008576077,0.00006584599,0.0001412441,0.007141441],"genre_scores_gemma":[0.5367602,0.0007691348,0.450841,0.0001673564,0.0001685712,0.000368725,0.0002300286,0.0001183556,0.01057664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006749691,"threshold_uncertainty_score":0.01342082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139457845","doi":"10.1287/inte.1040.0097","title":"Improving Volunteer Scheduling for the Edmonton Folk Festival","year":2004,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Alberta","funders":"","keywords":"Crew; Entertainment; Advertising; Scheduling (production processes); Operations management; Business; Operations research; Marketing; Psychology; Engineering; Aeronautics; Art; Visual arts","authors":[{"name":"Lynn Gordon","is_ca":true},{"name":"Erhan Erkut","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08812373420240385,"gpt":0.358632925710732,"spread":0.2705091915083281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451726,0.0004769739,0.0003291166,0.0006753619,0.0006883318,0.0008845069,0.0006910445,0.0002918068,0.00296928],"category_scores_gemma":[0.00476056,0.0002856364,0.0002970755,0.0006294055,0.0001944433,0.0005570634,0.0004502063,0.0003626836,0.0003414944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083626,"about_ca_system_score_gemma":0.00267759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01157171,"about_ca_topic_score_gemma":0.02113464,"domain_scores_codex":[0.9995019,0.0002132964,0.00002845729,0.00009477986,0.00007979689,0.00008162489],"domain_scores_gemma":[0.9979706,0.001124538,0.000179568,0.0001530529,0.0002821459,0.0002900145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001068019,0.0008453055,0.01240786,0.0002823663,0.00004001851,0.0002830056,0.001624109,0.5420561,0.01640485,0.007960731,0.01177274,0.4052549],"study_design_scores_gemma":[0.0002138244,0.0006576171,0.005170418,0.00003136364,0.0000405768,0.00006708012,0.000866314,0.9604133,0.01140588,0.004901003,0.01619331,0.00003923645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7786161,0.0002246559,0.2106593,0.0004327094,0.00007948576,0.000607523,0.000581963,0.001755722,0.007042697],"genre_scores_gemma":[0.7603351,0.0001595896,0.2350232,0.0000391652,0.00002072733,0.0002336647,0.0008095902,0.0002205112,0.003158385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01157171,"threshold_uncertainty_score":0.0230087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3628730","doi":"","title":"Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Initialization; Operator (biology); Mathematical optimization; Heuristic; Computer science; Local search (optimization); Evolutionary algorithm; Genetic algorithm; Variable neighborhood search; Domain (mathematical analysis); Ranking (information retrieval); Variable (mathematics); Algorithm; Mathematics; Metaheuristic; Artificial intelligence","authors":[{"name":"Pascal Côté","is_ca":false},{"name":"Tony Wong","is_ca":false},{"name":"Robert Sabourin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06728663749762294,"gpt":0.3447256053581031,"spread":0.2774389678604802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021632,0.0006192957,0.0008270398,0.0007059789,0.0003560405,0.0006972257,0.001178289,0.001365201,0.002013451],"category_scores_gemma":[0.002045823,0.0003652415,0.0005161869,0.0007358316,0.0004222136,0.0004316762,0.0009183673,0.0006658128,0.0001623859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005039633,"about_ca_system_score_gemma":0.0007541404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004437827,"about_ca_topic_score_gemma":0.003223613,"domain_scores_codex":[0.9996752,0.0001563472,0.00001400913,0.00003783101,0.00007242205,0.00004412213],"domain_scores_gemma":[0.9991147,0.0006322932,0.00005362716,0.00003622213,0.0001067266,0.00005641267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002952677,0.00003947194,0.0001966533,0.00002456698,0.00002378251,0.00003781241,0.00001817298,0.9781678,0.0003789602,0.001871042,0.0002069156,0.01900521],"study_design_scores_gemma":[0.000008734769,0.00002520477,0.00003646213,0.000002233412,0.000003298988,0.00000717704,0.000003553512,0.9992012,0.00007518113,0.0004875649,0.000147756,0.00000160529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09740081,0.0003993427,0.8950484,0.0003355044,0.0000807747,0.0001062594,0.00004789267,0.0002657391,0.006315223],"genre_scores_gemma":[0.6638582,0.0002043762,0.3305228,0.0001155436,0.00004181434,0.0002251881,0.0000791284,0.00006010627,0.004892971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004437827,"threshold_uncertainty_score":0.008823991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058048384","doi":"10.1145/944618.944628","title":"Finding the chromatic number by means of critical graphs","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Chromatic scale; Critical graph; Mathematics; Graph coloring; Graph; Discrete mathematics; Graph factorization; Random graph; Edge coloring; Graph power; Line graph","authors":[{"name":"Francine Herrmann","is_ca":false},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1340056843624997,"gpt":0.413582351479498,"spread":0.2795766671169983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760273,0.0008248742,0.0007032051,0.002407065,0.0009938182,0.0010815,0.001644499,0.0006890919,0.004127093],"category_scores_gemma":[0.002902941,0.0004904984,0.0004850744,0.001383675,0.0009723772,0.00252527,0.0009675933,0.0008413414,0.0005489627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146348,"about_ca_system_score_gemma":0.002248592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004792046,"about_ca_topic_score_gemma":0.006459109,"domain_scores_codex":[0.9995452,0.00007173929,0.00001943786,0.0001580191,0.0001365748,0.00006902628],"domain_scores_gemma":[0.9986662,0.0005700904,0.0001947362,0.0002515554,0.0002329874,0.00008441076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000337243,0.0002215456,0.006740414,0.0004218636,0.00007260832,0.0001891543,0.0003175752,0.4354525,0.02504611,0.1172566,0.006525647,0.4074187],"study_design_scores_gemma":[0.00004844564,0.00007425941,0.0006343363,0.00002548717,0.00002088746,0.0001378766,0.00007183677,0.9115338,0.007884038,0.07522649,0.004311097,0.00003147983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04154461,0.0002140987,0.9540816,0.0001737202,0.00003178423,0.00009922959,0.0001646322,0.0007675224,0.002922695],"genre_scores_gemma":[0.2296766,0.0001992778,0.7673078,0.00005605985,0.00003230718,0.0001365125,0.000571261,0.0001479436,0.001872359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004792046,"threshold_uncertainty_score":0.01380646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004802557","doi":"10.1016/j.disopt.2008.10.004","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Martine Labbé","is_ca":false},{"name":"David Schindl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1211367297478479,"gpt":0.3512656153859113,"spread":0.2301288856380634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003647642,0.003747964,0.003655403,0.002452759,0.001762226,0.006103266,0.004617876,0.003640699,0.01306453],"category_scores_gemma":[0.01569457,0.002483964,0.00397678,0.007210232,0.003035016,0.008708119,0.003229033,0.009220511,0.001752196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005601956,"about_ca_system_score_gemma":0.003122808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008639455,"about_ca_topic_score_gemma":0.006711199,"domain_scores_codex":[0.9971486,0.001087529,0.0001047231,0.000426314,0.0008045509,0.0004283846],"domain_scores_gemma":[0.9897065,0.008032206,0.0004717214,0.0007105263,0.0007570957,0.0003219377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002255582,0.0003394868,0.0003211116,0.0005890022,0.00008453647,0.00005601134,0.0003702871,0.4216376,0.0008932846,0.4698707,0.01992418,0.08568825],"study_design_scores_gemma":[0.0000485553,0.00007137011,0.000139124,0.00008399996,0.00004208701,0.00005117508,0.00007388063,0.6464001,0.0007721653,0.3471898,0.005097951,0.00002989418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009865524,0.001859677,0.9615523,0.001152315,0.0003791424,0.0002236196,0.0004022842,0.0002159786,0.02434907],"genre_scores_gemma":[0.2224928,0.006250053,0.7278253,0.001217121,0.001666828,0.001520837,0.001841347,0.001032607,0.03615311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01306453,"threshold_uncertainty_score":0.04370522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094427046","doi":"10.1287/inte.1070.0337","title":"Spreadsheet Model Helps to Assign Medical Residents at the University of Vermont's College of Medicine","year":2008,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Rotman School of Management, University of Toronto","keywords":"Scope (computer science); Scheduling (production processes); Computer science; Operations research; Software; Engineering management; Software engineering; Operations management; Engineering; Programming language","authors":[{"name":"Антон Овчінніков","is_ca":false},{"name":"Joseph Milner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1120006925111145,"gpt":0.3425552182805954,"spread":0.2305545257694809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974432,0.0008247257,0.0003751565,0.0007406846,0.0007937991,0.001429136,0.0009634362,0.0007579644,0.01524053],"category_scores_gemma":[0.004410036,0.0004318301,0.0005354395,0.0008251467,0.0002416276,0.001504942,0.0004826555,0.001098631,0.002465793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152059,"about_ca_system_score_gemma":0.003837058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01514829,"about_ca_topic_score_gemma":0.02139236,"domain_scores_codex":[0.9993145,0.0002039787,0.00005043371,0.0001376127,0.000225167,0.00006833547],"domain_scores_gemma":[0.9974148,0.001350054,0.0002082235,0.0003037555,0.000590815,0.0001323814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004827969,0.000615424,0.005455634,0.0001816212,0.00005855989,0.0002497901,0.0006190219,0.6930973,0.006850067,0.05116616,0.04386428,0.1973592],"study_design_scores_gemma":[0.00009784043,0.0001406576,0.001085671,0.0000749841,0.00003119617,0.00008140969,0.0001466522,0.9182166,0.005885121,0.01525213,0.05895133,0.00003642454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09116932,0.0001209956,0.8441623,0.002138329,0.0002163144,0.000833957,0.003155485,0.008146941,0.05005632],"genre_scores_gemma":[0.3117234,0.0003291783,0.6494201,0.0004206397,0.00005652092,0.0009379223,0.003252114,0.0009449522,0.03291515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01524053,"threshold_uncertainty_score":0.05098462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2677624263","doi":"10.1007/s12532-019-00172-4","title":"A rotation-based branch-and-price approach for the nurse scheduling problem","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Nurse scheduling problem; Embedding; Scheduling (production processes); Time horizon; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Job shop scheduling; Algorithm; Artificial intelligence; Schedule; Flow shop scheduling","authors":[{"name":"Antoine Legrain","is_ca":true},{"name":"Jérémy Omer","is_ca":false},{"name":"Samuel Rosat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07469503885769585,"gpt":0.3679291525926293,"spread":0.2932341137349334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523275,0.0008938306,0.002050997,0.001131817,0.0008996234,0.001374089,0.002161911,0.001348347,0.01131102],"category_scores_gemma":[0.004306309,0.0007870601,0.001182973,0.002057059,0.0008635367,0.001699814,0.001309147,0.001910805,0.001329516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001615184,"about_ca_system_score_gemma":0.003604387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01607482,"about_ca_topic_score_gemma":0.01172083,"domain_scores_codex":[0.9993024,0.0002804291,0.00002483274,0.00008100332,0.0001893787,0.0001220054],"domain_scores_gemma":[0.9987742,0.0008306128,0.00007377812,0.00007634218,0.0001625632,0.00008242358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001238305,0.0001074783,0.0002272497,0.00008379988,0.00002398422,0.00004020705,0.00003845441,0.8920215,0.0009629243,0.02284783,0.002742036,0.08078065],"study_design_scores_gemma":[0.00001705462,0.00001739144,0.00003431907,0.00000361661,0.000005834367,0.000005814226,0.000005830017,0.9943177,0.0001146004,0.005073975,0.000400671,0.000003163845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008407208,0.0002387749,0.9860029,0.0002938172,0.00008738691,0.0001174819,0.00007729369,0.0002054365,0.004569669],"genre_scores_gemma":[0.2624535,0.0007257344,0.7287619,0.0002019966,0.0002048964,0.0005371405,0.0002940744,0.0002691202,0.006551573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01607482,"threshold_uncertainty_score":0.03783917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012973940","doi":"10.5267/j.ijiec.2010.04.004","title":"Artificial Bee colony for resource constrained project scheduling problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Artificial bee colony algorithm; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Engineering; Mathematics","authors":[{"name":"Reza Akbari","is_ca":false},{"name":"Vahid Zeighami","is_ca":false},{"name":"Koorush Ziarati","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1302607431485231,"gpt":0.3816360218261396,"spread":0.2513752786776166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003534566,0.0005988483,0.0006139866,0.0005496101,0.0003667661,0.000663575,0.0006981339,0.0009256614,0.001712495],"category_scores_gemma":[0.001152298,0.0001880983,0.0004449096,0.001009387,0.0002205569,0.0004563167,0.0003678661,0.0006278648,0.0002768845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004120935,"about_ca_system_score_gemma":0.0007263598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003216987,"about_ca_topic_score_gemma":0.002482337,"domain_scores_codex":[0.9996949,0.0001279729,0.00002050973,0.00003989304,0.0000895983,0.0000270915],"domain_scores_gemma":[0.9996665,0.0001974767,0.00004409008,0.00001844564,0.00005993729,0.00001355962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006148894,0.00007723762,0.0005799565,0.0002468537,0.00004675379,0.0003077087,0.00005817615,0.9129155,0.004863378,0.01094739,0.004802908,0.06509259],"study_design_scores_gemma":[0.00002331686,0.00004133569,0.0002508992,0.00002248154,0.00001472922,0.0001155093,0.00001949864,0.9891533,0.0007806629,0.005025282,0.004545336,0.000007685952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09304655,0.005300656,0.8615853,0.001342143,0.0002327043,0.0004625124,0.000534606,0.0006941711,0.0368014],"genre_scores_gemma":[0.6071541,0.003735277,0.3757858,0.0002413702,0.0000801996,0.0008726795,0.0008158296,0.00007334523,0.01124132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003216987,"threshold_uncertainty_score":0.006396532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2336488339","doi":"","title":"Solving Exam Timetabling Problems with the Flex-Deluge Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Set (abstract data type); Algorithm; File Transfer Protocol; Operations research; Artificial intelligence; Mathematics; Programming language; World Wide Web","authors":[{"name":"Edmund Burke","is_ca":false},{"name":"Yuri Bykov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06896844559053537,"gpt":0.3188556690618179,"spread":0.2498872234712826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377598,0.0008344487,0.0007343902,0.001219941,0.0006198735,0.0008940703,0.001440844,0.0007821487,0.00419633],"category_scores_gemma":[0.005098173,0.0004643792,0.0007611891,0.001201154,0.0008240109,0.001477341,0.00103522,0.001228823,0.00069694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001111988,"about_ca_system_score_gemma":0.001418617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006103107,"about_ca_topic_score_gemma":0.009544192,"domain_scores_codex":[0.9992296,0.0002589746,0.00004350539,0.0001310037,0.0002174027,0.0001196653],"domain_scores_gemma":[0.9980339,0.00121921,0.0001279325,0.0002664636,0.0002595612,0.00009291092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004374381,0.0003140811,0.002502687,0.0003505039,0.00006967173,0.0001569166,0.0002413914,0.5398663,0.004041753,0.04196573,0.01265693,0.3973965],"study_design_scores_gemma":[0.00009099186,0.0001614186,0.0004389578,0.0000228107,0.00001925226,0.0001151413,0.00006576531,0.9617103,0.002547659,0.02753831,0.007266836,0.00002242359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04889509,0.0004375644,0.9427537,0.0003158592,0.00004495967,0.0001995754,0.0002250318,0.00224074,0.004887532],"genre_scores_gemma":[0.2437063,0.0002178965,0.750302,0.0001658197,0.00005228159,0.0002931226,0.0007195688,0.0002275288,0.004315548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006103107,"threshold_uncertainty_score":0.01403809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1577063765","doi":"10.1007/11493853_12","title":"Constraint Programming Based Column Generation for Employee Timetabling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Column generation; Mathematical optimization; Solver; Set cover problem; Constraint (computer-aided design); Set (abstract data type); Integer programming; Cover (algebra); Constraint satisfaction; Linear programming; Integer (computer science); Work (physics); Constraint satisfaction problem; Function (biology); Constraint programming; Algorithm; Mathematics; Stochastic programming; Artificial intelligence","authors":[{"name":"Sophie Demassey","is_ca":true},{"name":"Gilles Pesant","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1225710071208142,"gpt":0.3584828721173177,"spread":0.2359118649965035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088112,0.001048325,0.001200756,0.001294313,0.0007718627,0.001293223,0.002441654,0.001196297,0.01426393],"category_scores_gemma":[0.004184254,0.000966798,0.001486896,0.002638836,0.0005118028,0.001358131,0.001014217,0.002004646,0.001836823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127812,"about_ca_system_score_gemma":0.002061474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01346289,"about_ca_topic_score_gemma":0.01644835,"domain_scores_codex":[0.9989234,0.0003674965,0.00005220312,0.000157624,0.0003668255,0.0001325074],"domain_scores_gemma":[0.9974514,0.001782104,0.0001071718,0.0002446562,0.000349261,0.0000654851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002186894,0.0003402331,0.0004389357,0.0003631916,0.00006898251,0.0001604721,0.0001124527,0.5043539,0.008673092,0.02020849,0.02083195,0.4442296],"study_design_scores_gemma":[0.00003806962,0.0000401998,0.0001125988,0.00001556875,0.00001590901,0.00003214589,0.0000186585,0.9865447,0.002558545,0.008120893,0.002487722,0.00001500864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007803514,0.0001760433,0.9837877,0.0001254645,0.00006175926,0.0003150273,0.0006399049,0.002234806,0.004855806],"genre_scores_gemma":[0.06211607,0.0001338872,0.9325143,0.0001381232,0.0000323753,0.0004491429,0.001239181,0.0003944334,0.002982641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01426393,"threshold_uncertainty_score":0.04771757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125033276","doi":"10.1287/opre.2020.2050","title":"Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Queue; Computer science; Operations research; Operations management; Nursing; Computer network; Medicine; Mathematics; Engineering","authors":[{"name":"Carri W. Chan","is_ca":false},{"name":"Michael Huang","is_ca":false},{"name":"Vahid Sarhangian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1580383485633567,"gpt":0.4928225199909892,"spread":0.3347841714276324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003753789,0.001143747,0.002405527,0.0008953733,0.001516323,0.002550055,0.002807913,0.001902787,0.004155121],"category_scores_gemma":[0.0121867,0.001092881,0.001181771,0.002276308,0.001525667,0.002200024,0.001945725,0.002231144,0.0003081929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002445402,"about_ca_system_score_gemma":0.003115298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01800559,"about_ca_topic_score_gemma":0.01266011,"domain_scores_codex":[0.9982677,0.0007429089,0.00005783438,0.0002765626,0.0002583367,0.0003966328],"domain_scores_gemma":[0.993075,0.005000187,0.0005911804,0.0002143396,0.0005194712,0.0005997187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002123136,0.0001825186,0.0009171013,0.0001160677,0.00004589923,0.0001290368,0.0001868137,0.9553533,0.001022096,0.02198019,0.001622943,0.01823169],"study_design_scores_gemma":[0.00002081432,0.00004559461,0.000184262,0.000005943316,0.0000142776,0.00001380974,0.00005935083,0.9932706,0.0001353924,0.005975304,0.000263959,0.00001072063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.187424,0.001362764,0.8033699,0.00168967,0.0004295687,0.0002004671,0.0002319238,0.0002978301,0.004993801],"genre_scores_gemma":[0.9034153,0.001305996,0.08465283,0.0001971884,0.0004209205,0.0001994194,0.0001851715,0.0001522456,0.009471088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01800559,"threshold_uncertainty_score":0.03580153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2731086824","doi":"","title":"A Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling","year":2008,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Solver; Modular design; Process (computing); Computer science; Heuristic; Property (philosophy); Mathematical optimization; Measure (data warehouse); Programming language; Mathematics; Artificial intelligence; Data mining","authors":[{"name":"Marco Chiarandini","is_ca":false},{"name":"Chris Fawcett","is_ca":true},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1325292087268326,"gpt":0.3443231472179765,"spread":0.2117939384911439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301076,0.001135319,0.0007114754,0.0008276437,0.0004188212,0.001060856,0.001622352,0.001321162,0.01376282],"category_scores_gemma":[0.003289039,0.0005667277,0.001115861,0.001289495,0.0003595261,0.0007793356,0.001086573,0.001195029,0.002273405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008457039,"about_ca_system_score_gemma":0.002815571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00290549,"about_ca_topic_score_gemma":0.005582593,"domain_scores_codex":[0.9994748,0.0001551144,0.00003262017,0.000119999,0.0001263522,0.0000911028],"domain_scores_gemma":[0.9989691,0.000681414,0.00007920353,0.00009029718,0.0001261457,0.00005386567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001923686,0.0002864497,0.0009504176,0.000539036,0.00007466973,0.0001779312,0.000120414,0.7128354,0.004998107,0.042564,0.01398559,0.2232756],"study_design_scores_gemma":[0.0001751336,0.00009720826,0.0001913864,0.00002932403,0.00002742999,0.00008439915,0.00003210058,0.9698724,0.002860534,0.01354417,0.01307157,0.00001421226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01006666,0.0001526979,0.9801767,0.0001744233,0.0000567076,0.0003032245,0.0006971207,0.001902054,0.006470396],"genre_scores_gemma":[0.05663819,0.000114337,0.9378021,0.00009365774,0.00003567182,0.0005458019,0.0008874952,0.0003393149,0.003543358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01376282,"threshold_uncertainty_score":0.04604125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001287969","doi":"10.1145/2001576.2001648","title":"An efficient hierarchical parallel genetic algorithm for graph coloring problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Graph coloring; Computer science; Algorithm; Graph; Parallel computing; Theoretical computer science","authors":[{"name":"Reza Abbasian","is_ca":true},{"name":"Malek Mouhoub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1618702945412034,"gpt":0.3731997507457475,"spread":0.2113294562045441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006640906,0.0008259692,0.000720473,0.0008941329,0.0006876821,0.0005789892,0.001259165,0.0009366156,0.002247585],"category_scores_gemma":[0.001531634,0.0003474354,0.0006775364,0.001199241,0.0005430161,0.0006431926,0.0007783066,0.0008828405,0.0004266357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114804,"about_ca_system_score_gemma":0.002520598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0114007,"about_ca_topic_score_gemma":0.011258,"domain_scores_codex":[0.9994966,0.000128971,0.00001554301,0.0001049285,0.000183466,0.00007056709],"domain_scores_gemma":[0.9996499,0.000163739,0.00003931018,0.00004513007,0.0000776551,0.00002426558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006954966,0.0001347725,0.000698293,0.00005815049,0.0000328649,0.00007202891,0.00005586644,0.8428764,0.003961815,0.01128301,0.002979917,0.1377773],"study_design_scores_gemma":[0.00003169928,0.00002132395,0.00009600478,0.000002730762,0.00000693519,0.00002068571,0.000009144068,0.9946703,0.0005920089,0.003577061,0.0009678942,0.000004107374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02675944,0.0001670544,0.9659091,0.0002630627,0.00005972248,0.0001604137,0.00008629746,0.00115095,0.005444065],"genre_scores_gemma":[0.1901407,0.0001710957,0.8055734,0.000173407,0.00003417517,0.0003051644,0.0003034649,0.0001201744,0.003178383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0114007,"threshold_uncertainty_score":0.02266866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2467648358","doi":"10.1016/j.dam.2016.05.023","title":"Graph multi-coloring for a job scheduling application","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Vertex (graph theory); Graph coloring; Colored; Greedy coloring; List coloring; Complete coloring; Edge coloring; Neighbourhood (mathematics); Integer programming; Graph; Discrete mathematics; Graph power; Algorithm; Line graph","authors":[{"name":"Simon Thevenin","is_ca":false},{"name":"Nicolas Zufferey","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.131738151946533,"gpt":0.3866086343133353,"spread":0.2548704823668023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045084,0.0006600384,0.0006423955,0.0005510196,0.0008323491,0.0009862887,0.001142804,0.000955997,0.005395992],"category_scores_gemma":[0.001383646,0.0002658574,0.000818127,0.001031567,0.0004236583,0.0007295096,0.0006800642,0.00113592,0.0006404848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135065,"about_ca_system_score_gemma":0.001940689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006396408,"about_ca_topic_score_gemma":0.009526768,"domain_scores_codex":[0.9997187,0.0000854538,0.00001046289,0.00006674349,0.00006573794,0.00005282767],"domain_scores_gemma":[0.9995475,0.0002418827,0.00003603106,0.00004557829,0.00007669,0.00005230742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002453671,0.0002793512,0.0009101302,0.0005015864,0.00007077465,0.0004275554,0.00015521,0.7856727,0.01523364,0.1027579,0.009019773,0.08472613],"study_design_scores_gemma":[0.00001820582,0.00004640833,0.000272274,0.00001443477,0.00001877648,0.0000689189,0.00003389825,0.9488451,0.001356266,0.04612369,0.003192,0.000009950122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06384278,0.0005192971,0.9197963,0.001355503,0.0002852709,0.0002613402,0.0004413599,0.0007406868,0.01275745],"genre_scores_gemma":[0.475726,0.0007623575,0.5023074,0.0002947455,0.0001928119,0.0002369906,0.0004747478,0.0002885841,0.01971623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006396408,"threshold_uncertainty_score":0.01805133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083729473","doi":"10.12927/hcq..17157","title":"Full-Time or Part-Time Work in Nursing: Preferences, Tradeoffs and Choices","year":2005,"lang":"en","type":"article","venue":"Healthcare Quarterly","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Software deployment; Work (physics); Nursing; Human capital; Nursing staff; Human resources; Business; Human resource management; Medicine; Knowledge management; Computer science; Management; Economics","authors":[{"name":"Jennifer Blythe","is_ca":true},{"name":"Andrea Baumann","is_ca":false},{"name":"Işık U. Zeytinoglu","is_ca":false},{"name":"Margaret Denton","is_ca":false},{"name":"Ann Higgins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1037009951878198,"gpt":0.3980988546255882,"spread":0.2943978594377685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02035187,0.0002979439,0.0005121644,0.0008800079,0.0008662088,0.004431861,0.0005757715,0.001350314,0.00273164],"category_scores_gemma":[0.03628131,0.0002384342,0.0004810925,0.001371661,0.001787691,0.002669119,0.001201481,0.001427544,0.0004272407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002085748,"about_ca_system_score_gemma":0.001571115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243274,"about_ca_topic_score_gemma":0.004077946,"domain_scores_codex":[0.9842408,0.0130446,0.0003925312,0.0003252834,0.00145728,0.0005393978],"domain_scores_gemma":[0.9685309,0.02641577,0.001446328,0.0004332711,0.000834123,0.002339602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00265683,0.00176716,0.1514238,0.0006779344,0.0004968101,0.0006815959,0.01135055,0.04670106,0.001254157,0.1370035,0.01342406,0.6325626],"study_design_scores_gemma":[0.0003438371,0.002380969,0.136529,0.001033434,0.0002391835,0.001445742,0.04879361,0.1042481,0.000789,0.6773041,0.02651326,0.0003796736],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9081387,0.00976366,0.0264752,0.01875092,0.0001898101,0.0001618426,0.0002020235,0.00002471223,0.03629321],"genre_scores_gemma":[0.9866708,0.002515525,0.008776421,0.0004568257,0.00007981322,0.00008209475,0.00004955829,0.00001050948,0.00135843],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02035187,"threshold_uncertainty_score":0.1076323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123932009","doi":"10.1109/cec.2004.1331099","title":"Hyper-heuristics applied to class and exam timetabling problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto","keywords":"Heuristics; Constructive; Class (philosophy); Computer science; Range (aeronautics); Mathematical optimization; Quality (philosophy); Theoretical computer science; Artificial intelligence; Mathematics; Process (computing); Engineering; Programming language","authors":[{"name":"Peter Ross","is_ca":false},{"name":"Javier G. Marı́n-Blázquez","is_ca":false},{"name":"Emma Hart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1371535838778525,"gpt":0.3678393115819116,"spread":0.2306857277040592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002318091,0.0008689521,0.001007571,0.00160001,0.0008246805,0.001812588,0.001268932,0.001371783,0.003037291],"category_scores_gemma":[0.00891039,0.0006447987,0.001124925,0.00297559,0.001413289,0.001129792,0.001341798,0.002401693,0.0004760083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002061869,"about_ca_system_score_gemma":0.001885588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005209795,"about_ca_topic_score_gemma":0.005296054,"domain_scores_codex":[0.9975758,0.001478367,0.0001145936,0.000227206,0.0004371883,0.0001668703],"domain_scores_gemma":[0.9935621,0.004908212,0.0004398013,0.0004382135,0.0004635757,0.000188149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000139234,0.0001213483,0.001125791,0.0004005959,0.0001109131,0.000156479,0.0001829057,0.7595725,0.003276682,0.1002819,0.003534938,0.1310967],"study_design_scores_gemma":[0.00007941852,0.0001278599,0.000549875,0.00008600827,0.00005174223,0.0001253255,0.00007252548,0.8825708,0.00578833,0.09926307,0.01124302,0.00004208002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0329311,0.00242714,0.9446148,0.0005328993,0.0002084584,0.0003960255,0.0002415597,0.0007250375,0.01792299],"genre_scores_gemma":[0.2874804,0.001847042,0.7046633,0.0003761025,0.0001294345,0.0006716736,0.0003154914,0.0002661226,0.00425053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005209795,"threshold_uncertainty_score":0.01495999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3025824561","doi":"10.3390/computation8020046","title":"Addressing Examination Timetabling Problem Using a Partial Exams Approach in Constructive and Improvement","year":2020,"lang":"en","type":"article","venue":"Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Computer science; Constructive; Scheduling (production processes); Heuristic; Mathematical optimization; Operations research; Process (computing); Quality (philosophy); Machine learning; Artificial intelligence; Mathematics","authors":[{"name":"Ashis Kumar Mandal","is_ca":false},{"name":"Mohd Nizam Mohmad Kahar","is_ca":false},{"name":"Graham Kendall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3593459955887414,"gpt":0.4124942256057006,"spread":0.05314823001695923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003634857,0.001150321,0.001234055,0.002431436,0.0008669097,0.001421409,0.002172077,0.001005316,0.004267973],"category_scores_gemma":[0.008545422,0.0006879551,0.001578658,0.002811098,0.001619521,0.002101288,0.001411949,0.001697906,0.0005617477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001609237,"about_ca_system_score_gemma":0.003652606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006006949,"about_ca_topic_score_gemma":0.009138172,"domain_scores_codex":[0.9975343,0.001218318,0.0001084811,0.0003854143,0.0005388295,0.0002147799],"domain_scores_gemma":[0.994822,0.003393308,0.000398468,0.000573453,0.0006209524,0.0001917979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001567396,0.0004104484,0.002322805,0.0005861526,0.0001003708,0.0001487985,0.0004365175,0.5688959,0.003665705,0.03855666,0.00403938,0.3806806],"study_design_scores_gemma":[0.0000686046,0.0003450021,0.0006665827,0.00006724854,0.00006198961,0.0001180081,0.0001489554,0.9552552,0.003791129,0.03065999,0.00879133,0.00002586991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.021602,0.0006058487,0.9729396,0.0003931853,0.00005073681,0.0002185561,0.00008603815,0.0006549574,0.003449062],"genre_scores_gemma":[0.1545093,0.0004445114,0.8418964,0.000158617,0.00005727309,0.0002764043,0.0003123408,0.0001350112,0.002210137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006006949,"threshold_uncertainty_score":0.01922315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167699778","doi":"10.1007/s10951-010-0179-8","title":"Assigning multiple activities to work shifts","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kronos (Canada); Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Time horizon; Heuristic; Computer science; Integer programming; Operations research; Mathematical optimization; Work (physics); Column generation; Mathematics; Engineering","authors":[{"name":"Quentin Lequy","is_ca":true},{"name":"Mathieu Bouchard","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"B Tachefine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09904310839770022,"gpt":0.3810197728663123,"spread":0.2819766644686121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027223,0.0008675444,0.001096782,0.001215614,0.001632831,0.00188679,0.001896225,0.0010867,0.01176404],"category_scores_gemma":[0.004851375,0.0006933811,0.001111313,0.001579987,0.000529946,0.001462689,0.001502417,0.001563973,0.001188056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127577,"about_ca_system_score_gemma":0.00272872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003117598,"about_ca_topic_score_gemma":0.00470575,"domain_scores_codex":[0.9982886,0.0005776812,0.0001005578,0.000324482,0.0002940542,0.0004146026],"domain_scores_gemma":[0.9978017,0.0006874893,0.0002083804,0.0003559344,0.0003919216,0.0005544989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002719412,0.002553488,0.01074139,0.0005567885,0.0001894076,0.0003392594,0.0006855104,0.4104505,0.02531897,0.01572724,0.003473559,0.5272446],"study_design_scores_gemma":[0.0003845036,0.002678491,0.01356703,0.000104453,0.0002155917,0.0002622207,0.001901306,0.8834075,0.01909868,0.06506466,0.01320118,0.0001143997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5474493,0.0003108757,0.4273682,0.0006065194,0.0005099453,0.002085079,0.0003818498,0.0005776449,0.02071069],"genre_scores_gemma":[0.8646132,0.0001376635,0.1273342,0.00005921473,0.00006736137,0.0003872363,0.0001488476,0.00006860832,0.007183552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01176404,"threshold_uncertainty_score":0.03935468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133424441","doi":"10.1109/scis.2007.367686","title":"Memory Length in Hyper-heuristics: An Empirical Study","year":2007,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Simulated annealing; Heuristic; Flexibility (engineering); Set (abstract data type); Mathematical optimization; Independence (probability theory); Focus (optics); Artificial intelligence; Machine learning; Mathematics","authors":[{"name":"Ruibin Bai","is_ca":false},{"name":"Edmund Burke","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Graham Kendall","is_ca":false},{"name":"Barry McCollum","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2508048272341721,"gpt":0.5014999654509681,"spread":0.250695138216796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01054768,0.0005558449,0.0007347619,0.0022274,0.0007803192,0.001819577,0.001670646,0.001432397,0.001895267],"category_scores_gemma":[0.09996369,0.0004626958,0.0005783309,0.003607025,0.001315062,0.002819231,0.0009477988,0.001396969,0.0002962295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001632826,"about_ca_system_score_gemma":0.0009988182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002605764,"about_ca_topic_score_gemma":0.00259802,"domain_scores_codex":[0.9914022,0.005287404,0.0006898654,0.0006326942,0.001586028,0.0004018337],"domain_scores_gemma":[0.6936505,0.2747918,0.01005291,0.01152369,0.008288409,0.001692767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005321665,0.004466376,0.1507388,0.002833899,0.0008074317,0.0008016278,0.003345725,0.4583207,0.00708287,0.009317441,0.005525156,0.3514383],"study_design_scores_gemma":[0.0006364783,0.008240661,0.1078447,0.0007318761,0.0005604373,0.001452741,0.003548695,0.836015,0.01657717,0.01240831,0.01173795,0.0002460871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9859024,0.002391665,0.008333133,0.0002564616,0.00002042653,0.0001469948,0.0002989187,0.0001738404,0.002476122],"genre_scores_gemma":[0.991452,0.0004881414,0.007114598,0.00004107629,0.00001257914,0.00009694578,0.0003222595,0.0000433391,0.0004290672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01054768,"threshold_uncertainty_score":0.05578214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982221171","doi":"10.1287/inte.1110.0561","title":"A Decision Support System for Scheduling the Canadian Football League","year":2012,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Saskatchewan; Federated Co-operatives (Canada)","funders":"","keywords":"League; Football; Schedule; Operations research; Scheduling (production processes); Computer science; Decision support system; Business; Engineering; Operations management; Advertising; Political science; Artificial intelligence","authors":[{"name":"Kent J. Kostuk","is_ca":true},{"name":"Keith A. Willoughby","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1160641987402657,"gpt":0.3654990332152486,"spread":0.2494348344749829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232485,0.0009332835,0.0005334663,0.001160199,0.001375345,0.001847725,0.001414809,0.0006880937,0.007667957],"category_scores_gemma":[0.007308733,0.0005049769,0.000475381,0.001033422,0.0003331352,0.0009863935,0.0007512702,0.0007391453,0.001012416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00303275,"about_ca_system_score_gemma":0.007003123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.07636254,"about_ca_topic_score_gemma":0.06892751,"domain_scores_codex":[0.9989698,0.0002522684,0.0001212499,0.0002492114,0.0003122478,0.00009531488],"domain_scores_gemma":[0.9964492,0.001987909,0.0002268159,0.0002326076,0.00083827,0.0002652432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001337587,0.0007419984,0.006591667,0.0006767499,0.0001278947,0.0005095368,0.0008525652,0.4609478,0.0211531,0.01731889,0.03729421,0.452448],"study_design_scores_gemma":[0.0001716046,0.00008136387,0.0006612007,0.00002983645,0.00003067954,0.00003536799,0.00009552344,0.9797843,0.004890574,0.002746548,0.01143976,0.00003320906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109567,0.0002597906,0.8278795,0.0008723388,0.0001500413,0.001508077,0.005570805,0.04147498,0.01132779],"genre_scores_gemma":[0.4103984,0.0001533906,0.580438,0.0001690718,0.00003884168,0.0007520373,0.003843275,0.000506403,0.00370061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07636254,"threshold_uncertainty_score":0.1518362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1828541999","doi":"","title":"A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Heuristics; Benchmark (surveying); Computer science; Genetic programming; Mathematical optimization; Genetic algorithm; Set (abstract data type); Artificial intelligence; Machine learning; Mathematics; Programming language","authors":[{"name":"Nelishia Pillay","is_ca":false},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2330621697436535,"gpt":0.366733198773676,"spread":0.1336710290300225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001303609,0.000575266,0.0004479405,0.0009199989,0.0004609006,0.0007393161,0.001135034,0.0007530836,0.001997912],"category_scores_gemma":[0.0036316,0.0004558532,0.0005731693,0.001050512,0.000863354,0.0005857409,0.0005121776,0.0009868128,0.0001830877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001243685,"about_ca_system_score_gemma":0.001970518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006377987,"about_ca_topic_score_gemma":0.006484637,"domain_scores_codex":[0.9995084,0.0002413053,0.00002178706,0.00007752699,0.0001010241,0.00004992479],"domain_scores_gemma":[0.9987854,0.0008614523,0.0001022869,0.00006623715,0.0001433436,0.00004119962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006005849,0.0001007957,0.000911378,0.00008094543,0.00004838351,0.0001110681,0.0001923599,0.9040267,0.003612323,0.01588774,0.0006251548,0.07434312],"study_design_scores_gemma":[0.00003452536,0.00007237926,0.0002442518,0.0000269167,0.0000259952,0.00003536666,0.00005270496,0.9882588,0.001674733,0.007733523,0.001827787,0.0000128534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07127263,0.0002554662,0.9219432,0.0002998661,0.00003561736,0.0002593724,0.00007464783,0.0004056598,0.005453525],"genre_scores_gemma":[0.2669488,0.0002604997,0.7297084,0.0001330009,0.00001401943,0.0004387474,0.0001528899,0.00006711222,0.002276423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006377987,"threshold_uncertainty_score":0.01268172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527340811","doi":"10.1007/s10479-016-2321-2","title":"An integer programming approach to curriculum-based examination timetabling","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Schedule; Computer science; Theory of computation; Curriculum; Set (abstract data type); Integer programming; Integer (computer science); Course (navigation); Operations research; Mathematics education; Programming language; Mathematics; Algorithm; Sociology; Pedagogy","authors":[{"name":"Alejandro Cataldo","is_ca":false},{"name":"Juan‐Carlos Ferrer","is_ca":false},{"name":"Jaime Miranda","is_ca":false},{"name":"P. Rey","is_ca":false},{"name":"Antoine Sauré","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5537578790127029,"gpt":0.568445045148991,"spread":0.01468716613628807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003101205,0.001111925,0.001420118,0.001661198,0.0008640902,0.002373169,0.002355817,0.001307325,0.009038626],"category_scores_gemma":[0.008088854,0.001099319,0.00172565,0.003013509,0.0008475964,0.001871105,0.001347258,0.002652844,0.0006248611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002233625,"about_ca_system_score_gemma":0.004517785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0170205,"about_ca_topic_score_gemma":0.01838429,"domain_scores_codex":[0.9980412,0.0009829468,0.00008331202,0.0002606876,0.0003463131,0.000285524],"domain_scores_gemma":[0.9967988,0.002488215,0.0001775657,0.0001131209,0.0002969914,0.0001253515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006340619,0.0002134401,0.0004236687,0.00009999729,0.00003315706,0.00004040522,0.0001051019,0.8853713,0.0005155054,0.05539616,0.002384065,0.05535383],"study_design_scores_gemma":[0.00001809588,0.00003845342,0.0001340086,0.00001844136,0.00001389523,0.00001008493,0.00004177775,0.9733446,0.0002293461,0.02473303,0.001408186,0.00001010964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006499358,0.0001355764,0.9877846,0.0002683062,0.00005527367,0.0001082331,0.0001446315,0.0001415227,0.00486249],"genre_scores_gemma":[0.1362036,0.000485107,0.8561302,0.0001477526,0.000137251,0.0004280201,0.0004220785,0.0001592377,0.005886703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0170205,"threshold_uncertainty_score":0.03384286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025689931","doi":"10.1007/s10951-013-0338-9","title":"A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Task (project management); Job shop scheduling; Set (abstract data type); Mathematics; Economics","authors":[{"name":"Vincent Boyer","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1176176703911333,"gpt":0.3762298569327138,"spread":0.2586121865415806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575002,0.001137916,0.002450224,0.001516341,0.001159994,0.001679559,0.002104881,0.002557659,0.01058606],"category_scores_gemma":[0.003212596,0.0009736482,0.0009780085,0.002131559,0.000662062,0.001973977,0.001416075,0.002105957,0.001085308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001408789,"about_ca_system_score_gemma":0.003435202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01107365,"about_ca_topic_score_gemma":0.009686693,"domain_scores_codex":[0.9993851,0.0001775764,0.00002779994,0.00008908648,0.0001865527,0.0001338994],"domain_scores_gemma":[0.9985618,0.001011565,0.00006906657,0.00005016105,0.000181847,0.0001256063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000424107,0.0003977568,0.0005255836,0.0001989075,0.00006954021,0.0000867468,0.00008870448,0.7443095,0.002315286,0.01412451,0.007786757,0.2296727],"study_design_scores_gemma":[0.00009406194,0.00006398637,0.00007935167,0.000007854377,0.00001317063,0.00001352928,0.00001363841,0.9941169,0.0001992771,0.004738608,0.0006531519,0.000006422158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02656123,0.0005586134,0.9634442,0.0006208772,0.0001835098,0.0003127924,0.0001966648,0.0008954515,0.007226578],"genre_scores_gemma":[0.2220838,0.0005099044,0.7702034,0.0002020117,0.0001441994,0.0005067028,0.0004956086,0.0002785926,0.005575775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107365,"threshold_uncertainty_score":0.03541386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3203815469","doi":"10.1111/poms.13571","title":"Scheduling of Physicians with Time‐Varying Productivity Levels in Emergency Departments","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Winnipeg","funders":"","keywords":"Overcrowding; Scheduling (production processes); Emergency department; Productivity; Computer science; Cluster analysis; Operations research; Operations management; Medicine; Artificial intelligence; Nursing; Mathematics; Economics","authors":[{"name":"Farzad Zaerpour","is_ca":true},{"name":"Marco Bijvank","is_ca":true},{"name":"Huiyin Ouyang","is_ca":false},{"name":"Zhankun Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0751777675560772,"gpt":0.3478535317128968,"spread":0.2726757641568196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248626,0.0004707481,0.0005135052,0.000456932,0.0005195151,0.0007164516,0.0009188298,0.0007802508,0.0009516792],"category_scores_gemma":[0.007221439,0.0004479405,0.0004423953,0.000592377,0.0004128455,0.0006145671,0.0005918875,0.0006474149,0.0001149873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503865,"about_ca_system_score_gemma":0.001864222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008458503,"about_ca_topic_score_gemma":0.00774052,"domain_scores_codex":[0.9989981,0.0004645123,0.00004311208,0.0001759418,0.0001067728,0.000211534],"domain_scores_gemma":[0.9960015,0.002276698,0.0008898123,0.0001549254,0.0002984338,0.0003786735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003385701,0.0003713737,0.0250252,0.00005855562,0.00008648225,0.0002599494,0.0002428026,0.9365448,0.003483562,0.003732538,0.0008639623,0.02899221],"study_design_scores_gemma":[0.00006916102,0.0001749578,0.006998959,0.000004992051,0.00001841627,0.00004653208,0.0002597337,0.9889237,0.0008837148,0.002351846,0.0002547488,0.00001323974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8756147,0.0001131571,0.1221966,0.0005554562,0.00003239814,0.00009847898,0.000107176,0.00009761537,0.001184381],"genre_scores_gemma":[0.9879252,0.00005270612,0.01150371,0.000034317,0.00001319772,0.00003151662,0.00004998016,0.000006725415,0.0003826431],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008458503,"threshold_uncertainty_score":0.01681852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994932061","doi":"10.1007/s10951-014-0383-z","title":"Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Staffing; Mathematical optimization; Tabu search; Computer science; Job shop scheduling; Scheduling (production processes); Heuristic; Workforce; Construct (python library); Operations research; Schedule; Mathematics; Economics","authors":[{"name":"Sana Dahmen","is_ca":true},{"name":"Monia Rekik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.109235192156957,"gpt":0.3547160647951978,"spread":0.2454808726382408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254775,0.0008620823,0.001387235,0.001805778,0.0006700701,0.001419575,0.001672553,0.001779038,0.002939183],"category_scores_gemma":[0.00187723,0.0008377299,0.001284621,0.001688033,0.0005018885,0.001067847,0.0009473581,0.000731769,0.0002061782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013516,"about_ca_system_score_gemma":0.001806271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007989476,"about_ca_topic_score_gemma":0.007689212,"domain_scores_codex":[0.9994262,0.0002204462,0.00003491007,0.00008152955,0.0001095445,0.0001273888],"domain_scores_gemma":[0.9985076,0.001141384,0.0000889581,0.00006053354,0.0001181048,0.00008350117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001826857,0.0001706539,0.0004783023,0.0001082224,0.00008747409,0.0000531915,0.00003747708,0.9638593,0.001390797,0.002368964,0.0004136331,0.0308493],"study_design_scores_gemma":[0.00004848143,0.00008838429,0.0001112934,0.00000663113,0.00002460927,0.00001084012,0.00001908614,0.9982443,0.0002710387,0.0009621187,0.0002074172,0.000005840227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2557764,0.0009749988,0.7266912,0.0003480162,0.0002007174,0.0004170571,0.000229842,0.0006735098,0.01468822],"genre_scores_gemma":[0.7343761,0.0002937711,0.2619506,0.0001177117,0.0000655769,0.0004487051,0.0001887562,0.00006962865,0.002489131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007989476,"threshold_uncertainty_score":0.01588595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1546422272","doi":"10.1007/978-3-540-45157-0_8","title":"Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Unit (ring theory); Training (meteorology); Mathematical optimization; Operations research; Artificial intelligence; Psychology; Engineering; Mathematics; Mathematics education; Geography","authors":[{"name":"Christine A. White","is_ca":true},{"name":"George M. White","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3609674661402971,"gpt":0.4532695223027544,"spread":0.09230205616245729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001470132,0.0009628458,0.001065388,0.001110737,0.0009529504,0.001237544,0.001284279,0.001124577,0.02343566],"category_scores_gemma":[0.003634258,0.001136317,0.0009719923,0.002279778,0.0003140123,0.0008702861,0.0007790189,0.001163849,0.002880567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001656974,"about_ca_system_score_gemma":0.003729108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009908396,"about_ca_topic_score_gemma":0.01201901,"domain_scores_codex":[0.99919,0.0004448115,0.00002789673,0.00008691872,0.00011369,0.0001367103],"domain_scores_gemma":[0.9984984,0.0009203801,0.0001326119,0.0001129463,0.0001606445,0.0001749744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005971611,0.0002772147,0.0008591815,0.000206818,0.00006820844,0.00006653257,0.0001394382,0.7396639,0.002169386,0.007068604,0.02206496,0.2268186],"study_design_scores_gemma":[0.0001911179,0.0003308961,0.0009504603,0.00002749583,0.00003825056,0.00005670085,0.0001370941,0.9755077,0.002261721,0.0115169,0.008954552,0.00002715143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0826454,0.001584623,0.8720726,0.001307952,0.000506175,0.001125194,0.001384164,0.00350163,0.03587233],"genre_scores_gemma":[0.405837,0.0009289946,0.5715257,0.0003061652,0.000133944,0.0007885796,0.001392604,0.0007347655,0.01835224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02343566,"threshold_uncertainty_score":0.07840008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1479728210","doi":"10.17848/9780880992275.vol1ch8","title":"Hours Constraints","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science","authors":[{"name":"Kevin Lang","is_ca":false},{"name":"Shulamit Kahn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2042955897462564,"gpt":0.3859723565017887,"spread":0.1816767667555324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581964,0.0007245033,0.0005747215,0.0006830303,0.003555409,0.005157291,0.00254566,0.001654167,0.1972943],"category_scores_gemma":[0.007228954,0.0003381328,0.0007090613,0.001137006,0.001557955,0.003048314,0.00462083,0.002206847,0.03166008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003121299,"about_ca_system_score_gemma":0.004471384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01528098,"about_ca_topic_score_gemma":0.01752925,"domain_scores_codex":[0.9973712,0.0004475998,0.0001915401,0.0005243347,0.0007872834,0.0006780308],"domain_scores_gemma":[0.9962438,0.0006805782,0.0003731269,0.0004713121,0.001244909,0.0009862342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000338469,0.0001993233,0.008335158,0.0009026821,0.00005007993,0.0008775041,0.004058788,0.001522448,0.001163947,0.3673814,0.3491132,0.266057],"study_design_scores_gemma":[0.00001608604,0.00004356776,0.003659002,0.0002908294,0.000008185219,0.0003347271,0.001583198,0.0001970688,0.0001881829,0.01686835,0.9767903,0.00002053666],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01424597,0.005893019,0.009994261,0.01227269,0.00379596,0.0002596873,0.003716704,0.0002677483,0.949554],"genre_scores_gemma":[0.3504683,0.007527884,0.008927263,0.01657484,0.002373427,0.0009148974,0.006339688,0.0005339929,0.6063397],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1972943,"threshold_uncertainty_score":0.6600152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073818615","doi":"10.1007/s10489-013-0429-5","title":"A hierarchical parallel genetic approach for the graph coloring problem","year":2013,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Crossover; Operator (biology); Constraint satisfaction problem; Graph coloring; Graph; Genetic algorithm; Mathematical optimization; Local consistency; Theoretical computer science; Mathematics; Artificial intelligence","authors":[{"name":"Reza Abbasian","is_ca":true},{"name":"Malek Mouhoub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1276837091283285,"gpt":0.3495534716594417,"spread":0.2218697625311132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545999,0.0004632661,0.0005218593,0.0008012124,0.0007155447,0.000589486,0.001380976,0.0007688496,0.003268075],"category_scores_gemma":[0.001454012,0.0002954885,0.0006894118,0.00110134,0.0006532385,0.0005683091,0.0007697036,0.0008415198,0.0004115618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071443,"about_ca_system_score_gemma":0.002120321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01270795,"about_ca_topic_score_gemma":0.01633674,"domain_scores_codex":[0.9996837,0.00008882521,0.00001013868,0.00006024147,0.0001090236,0.00004798487],"domain_scores_gemma":[0.9996476,0.0001587978,0.00002633563,0.00004731972,0.00009109804,0.00002893054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003770246,0.000136266,0.0004377891,0.00005944045,0.00002906138,0.00006230648,0.0000702454,0.8657036,0.003720497,0.03065156,0.001623131,0.09746842],"study_design_scores_gemma":[0.00002161686,0.00002650971,0.0001038244,0.000004785732,0.00001211472,0.00001807388,0.00001467987,0.9847705,0.0004476382,0.01346584,0.001109915,0.000004489819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02045814,0.0001235987,0.9709798,0.0002631966,0.00006272781,0.0001070441,0.0000549773,0.0003486012,0.007601958],"genre_scores_gemma":[0.1799039,0.0001992398,0.8146283,0.0001882782,0.00005726997,0.000221482,0.0001590347,0.0001026091,0.004539865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01270795,"threshold_uncertainty_score":0.02526796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124761764","doi":"10.1287/ijoc.1080.0307","title":"A Constraint Programming Approach for Solving a Queueing Design and Control Problem","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Queueing theory; Mathematical optimization; Computer science; Constraint (computer-aided design); Decomposition; Benders' decomposition; Constraint programming; Stochastic programming; Control (management); Variety (cybernetics); Operations research; Service (business); Engineering; Mathematics; Artificial intelligence; Computer network; Economics","authors":[{"name":"Daria Terekhov","is_ca":true},{"name":"J. Christopher Beck","is_ca":true},{"name":"Kenneth N. Brown","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0969777626073913,"gpt":0.3589317360212473,"spread":0.2619539734138561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003675616,0.002278983,0.001647759,0.001169071,0.001118611,0.002624808,0.002453974,0.002268168,0.0061037],"category_scores_gemma":[0.006920054,0.001170495,0.001971954,0.002744145,0.001665614,0.001394192,0.001659889,0.003665004,0.0007247038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002788601,"about_ca_system_score_gemma":0.005580838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0182553,"about_ca_topic_score_gemma":0.01240099,"domain_scores_codex":[0.9975474,0.001032505,0.0001359587,0.000407254,0.0006348635,0.0002419724],"domain_scores_gemma":[0.9950913,0.004020139,0.0002105999,0.000115684,0.0004175485,0.0001446836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004073359,0.00006969836,0.0001353063,0.0001810866,0.00005608924,0.0001005386,0.00006793631,0.9065371,0.0005293828,0.06358296,0.001869336,0.02682984],"study_design_scores_gemma":[0.00003737217,0.00003482493,0.00003528594,0.00002330342,0.00001854926,0.00002159502,0.00001934573,0.9711705,0.0002382057,0.0257529,0.002635559,0.00001260794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001005995,0.0001895113,0.9958994,0.000272018,0.00004016535,0.00009452086,0.00009938024,0.00007409813,0.002324953],"genre_scores_gemma":[0.08156649,0.0009981093,0.9117262,0.00032374,0.0001735564,0.001218341,0.0003810484,0.00008805491,0.003524362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0182553,"threshold_uncertainty_score":0.0362981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165843305","doi":"10.1016/j.cor.2013.09.020","title":"Optimizing the strategic patient mix combining queueing theory and dynamic programming","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Case mix index; Solver; Computer science; Mathematical optimization; Integer programming; Linear programming; Operations research; Dynamic programming; Service (business); Operations management; Medicine; Mathematics; Economics; Business; Marketing","authors":[{"name":"Peter T. Vanberkel","is_ca":true},{"name":"Richard J. Boucherie","is_ca":true},{"name":"Erwin W. Hans","is_ca":true},{"name":"Johann L. Hurink","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1768395519797497,"gpt":0.4410135482310937,"spread":0.264173996251344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00334827,0.001539557,0.0024959,0.001843393,0.0007181831,0.002622376,0.001885574,0.001953501,0.004324257],"category_scores_gemma":[0.007236099,0.001574156,0.001131216,0.002221933,0.0007983423,0.002420625,0.001926407,0.00202036,0.0005778719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003413567,"about_ca_system_score_gemma":0.006574815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009643534,"about_ca_topic_score_gemma":0.007769633,"domain_scores_codex":[0.9977037,0.001141862,0.00007710479,0.0002838249,0.0003536102,0.0004398805],"domain_scores_gemma":[0.9968893,0.002268945,0.0002607963,0.00007692218,0.0002096782,0.0002943419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008028989,0.00008933815,0.000336406,0.00004182366,0.00003431136,0.00001590909,0.00001519417,0.9798749,0.0004278705,0.006575958,0.0006078262,0.01190012],"study_design_scores_gemma":[0.00001817204,0.00003905032,0.000105171,0.000005168816,0.00001303995,0.000009738431,0.00001039062,0.9925947,0.0001531519,0.006869189,0.0001758268,0.00000642692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04742382,0.0006234145,0.9459729,0.001051285,0.00009218606,0.0002276189,0.0001644101,0.0002857988,0.004158475],"genre_scores_gemma":[0.8214025,0.0006494566,0.1723893,0.0003241053,0.0001911753,0.0003465305,0.0002055355,0.0001562963,0.004335181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009643534,"threshold_uncertainty_score":0.02476734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}