{"meta":{"query_hash":"2ac23a5c820b","filters":{"topic":"Scheduling and Timetabling Solutions"},"cohort_total":303,"direct_labels_cover":1,"predictions_cover":303,"exported":303,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2ac23a5c820b","api":"https://metacan.xera.ac/api/v1/cohort?topic=Scheduling+and+Timetabling+Solutions"},"results":[{"id":"W100234480","doi":"","title":"Partitioning a strong tournament into k cycles.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics","score_opus":0.0721396299871602,"score_gpt":0.36684516387593336,"score_spread":0.2947055338887732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100234480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556986,0.0009896924,0.4850236,0.00079078984,0.00030600157,0.0007510926,0.00079919246,0.0007242301,0.05491688],"genre_scores_gemma":[0.8768242,0.00029636887,0.10712376,0.00021377666,0.00007881087,0.00020819099,0.00081630953,0.000115139555,0.014323414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917006,0.0002739505,0.000051338666,0.00018040801,0.00008847133,0.0002357182],"domain_scores_gemma":[0.99865305,0.00055998814,0.00012847241,0.00026742675,0.00011988921,0.0002711864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007608051,0.00055746734,0.0005834272,0.0006114586,0.00087710045,0.001622098,0.001015316,0.000792768,0.010345196],"category_scores_gemma":[0.003193629,0.00025862484,0.0007049456,0.00093114655,0.0005155494,0.0013878497,0.0011104599,0.0005970946,0.00104289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020857237,0.0009015802,0.009692417,0.00087784574,0.00041065246,0.0004569474,0.00031067667,0.3660159,0.027637817,0.19109079,0.027379721,0.37313983],"study_design_scores_gemma":[0.00034663372,0.0010162252,0.0038425524,0.0001017137,0.00019417779,0.00041199394,0.00033261479,0.72767264,0.007907312,0.2367971,0.021320304,0.00005670054],"about_ca_topic_score_codex":0.0014895713,"about_ca_topic_score_gemma":0.0027093207,"teacher_disagreement_score":0.010345196,"about_ca_system_score_codex":0.0007024291,"about_ca_system_score_gemma":0.0009368454,"threshold_uncertainty_score":0.034608126},"labels":[],"label_agreement":null},{"id":"W102118396","doi":"10.5555/1999416.1999426","title":"The arena career modeling environment: a new workforce modeling tool for the Canadian forces","year":2010,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Workforce; Computer science; Modeling and simulation; Conceptual model; Software engineering; Simulation; Database","score_opus":0.2606491128996291,"score_gpt":0.365612934898725,"score_spread":0.10496382199909587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102118396","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140009,0.0005621966,0.82412237,0.0031981685,0.00043107267,0.00081054145,0.029432641,0.028726544,0.09871564],"genre_scores_gemma":[0.07618768,0.0017985788,0.85080284,0.0005185121,0.000092820854,0.0011888323,0.02552396,0.0056393375,0.03824741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.00011678444,0.000043506516,0.00006188331,0.0003908606,0.00011736703],"domain_scores_gemma":[0.9986947,0.00029832122,0.000075467564,0.00015464012,0.0006041676,0.00017260962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018158021,0.0009198499,0.00046206018,0.0016777752,0.001692599,0.0021298057,0.00227464,0.00080008205,0.020488804],"category_scores_gemma":[0.004615194,0.00078517565,0.0010901381,0.002072908,0.0004932694,0.0019012638,0.0018705229,0.00134338,0.0034411866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001816053,0.00018050006,0.008187434,0.0005714843,0.00009245438,0.000302641,0.0016422718,0.32132652,0.0041961703,0.1640019,0.26146242,0.2378546],"study_design_scores_gemma":[0.00007533825,0.000037754126,0.0015740499,0.00022577938,0.000036738682,0.00010812866,0.00030205218,0.27108765,0.0011706111,0.014395358,0.7108552,0.00013138121],"about_ca_topic_score_codex":0.58966154,"about_ca_topic_score_gemma":0.7176273,"teacher_disagreement_score":0.41033846,"about_ca_system_score_codex":0.0057317493,"about_ca_system_score_gemma":0.02133055,"threshold_uncertainty_score":0.82551},"labels":[],"label_agreement":null},{"id":"W104587778","doi":"","title":"A Graph Coloring Model for a Feasibility Problem in Crew Scheduling","year":2005,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Combinatorics; Bidding; Graph coloring; Scheduling (production processes); Mathematics; Computer science; Mathematical optimization; Graph; Economics","score_opus":0.08732337875404918,"score_gpt":0.34717493283679896,"score_spread":0.2598515540827498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104587778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08155005,0.00090342626,0.8676397,0.0033954484,0.00031912146,0.00048014295,0.0022212768,0.00083909894,0.042651698],"genre_scores_gemma":[0.73013467,0.0015486155,0.20657359,0.00076815055,0.000402733,0.00079956953,0.00233085,0.0004655009,0.05697636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983571,0.000682794,0.00005580346,0.00037766073,0.0001996075,0.00032695208],"domain_scores_gemma":[0.99605703,0.0028460727,0.00031689566,0.00019989695,0.00028155302,0.00029850643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022287,0.0014302201,0.0013108316,0.0010989729,0.0011235205,0.0035230669,0.002635138,0.0030617192,0.011850156],"category_scores_gemma":[0.0052713105,0.0010566199,0.0014426633,0.0021486771,0.001747968,0.0029685362,0.0012165403,0.0028823032,0.0013713796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022748912,0.00020016101,0.00052202545,0.00018543442,0.000050839863,0.0002971429,0.00020225525,0.7954707,0.0014088157,0.18297237,0.008552608,0.009910082],"study_design_scores_gemma":[0.00005762975,0.000042710304,0.00014877591,0.000019798837,0.000020832877,0.000053521544,0.000059269856,0.9349052,0.00017097665,0.060969394,0.0035342823,0.000017688086],"about_ca_topic_score_codex":0.03233861,"about_ca_topic_score_gemma":0.029112946,"teacher_disagreement_score":0.03233861,"about_ca_system_score_codex":0.004607811,"about_ca_system_score_gemma":0.0037027574,"threshold_uncertainty_score":0.064300776},"labels":[],"label_agreement":null},{"id":"W130675096","doi":"10.1007/978-3-319-10428-7_61","title":"Scheduling Agents Using Forecast Call Arrivals at Hydro-Québec’s Call Centers","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Hydro-Québec; Computer Research Institute of Montréal; Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Workforce management; Call management; Scheduling (production processes); Operations research; Call control; Data center; Schedule; Workforce; Real-time computing; Operations management; Telecommunications; Operating system; Engineering; Economics","score_opus":0.10939208097300095,"score_gpt":0.34488866477738456,"score_spread":0.2354965838043836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130675096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4973587,0.0012017728,0.42520738,0.0021774122,0.00053443,0.0006519734,0.0017625085,0.0024898865,0.06861595],"genre_scores_gemma":[0.9009216,0.00029659935,0.07638754,0.00011548615,0.00006989575,0.00013259405,0.0006889039,0.0001434258,0.021243937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972373,0.000065525455,0.0000088905335,0.00004507895,0.00005730919,0.00009943228],"domain_scores_gemma":[0.99937207,0.0002634609,0.000049470375,0.0000318856,0.00016421998,0.000119048564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069122127,0.0006962758,0.0005721028,0.00047268928,0.0010725193,0.001538054,0.0011649999,0.00091987354,0.005126092],"category_scores_gemma":[0.0017820988,0.0005085582,0.00037217527,0.0006529304,0.00029604996,0.00062098016,0.00035693083,0.00070250203,0.0006110391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018949005,0.00007943737,0.0019674716,0.00003504371,0.000041899733,0.000057129793,0.0000928957,0.9282992,0.0018137422,0.004936953,0.010312142,0.052174613],"study_design_scores_gemma":[0.000014322044,0.00001550632,0.0005013227,0.000004194798,0.0000066525104,0.0000038257863,0.000038392827,0.99673504,0.00028276863,0.0008768549,0.0015146915,0.0000065192244],"about_ca_topic_score_codex":0.5923433,"about_ca_topic_score_gemma":0.68126947,"teacher_disagreement_score":0.40765673,"about_ca_system_score_codex":0.005374222,"about_ca_system_score_gemma":0.006769113,"threshold_uncertainty_score":0.820115},"labels":[],"label_agreement":null},{"id":"W138029093","doi":"10.1007/978-3-319-10428-7_32","title":"CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Heuristic; Constraint programming; Workload; Constraint (computer-aided design); Integer programming; Quadratic programming; Quadratic equation; Integer (computer science); Constraint satisfaction; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.05879193697667804,"score_gpt":0.3180408946918351,"score_spread":0.25924895771515705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138029093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012249964,0.0026707281,0.9149951,0.0025230437,0.00047415402,0.0001626597,0.0013311555,0.00030311293,0.06529012],"genre_scores_gemma":[0.5790366,0.0064993678,0.2782067,0.0012328469,0.0013174373,0.0013231576,0.002780483,0.0005257353,0.1290777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939096,0.00022219571,0.000020656858,0.00009191887,0.00016922793,0.00010508442],"domain_scores_gemma":[0.999119,0.00048893836,0.000083647574,0.0000426793,0.0001794263,0.00008637899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806418,0.0011196822,0.0009991314,0.0005406376,0.0004740861,0.0016001009,0.0027739622,0.0014158802,0.017506422],"category_scores_gemma":[0.0035602178,0.0005013577,0.0010197972,0.0014661534,0.0005951614,0.0014686197,0.00092168996,0.0030215038,0.00143866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006841038,0.00007411726,0.00020280696,0.00020194077,0.000027602307,0.00004885331,0.00005529869,0.8231825,0.00043623778,0.12544714,0.01753679,0.032718275],"study_design_scores_gemma":[0.000012092612,0.000024690038,0.00013294347,0.000017390988,0.0000096401145,0.00002034516,0.000015981028,0.9566251,0.00005878243,0.03869603,0.0043780007,0.000009042182],"about_ca_topic_score_codex":0.013663402,"about_ca_topic_score_gemma":0.014435547,"teacher_disagreement_score":0.017506422,"about_ca_system_score_codex":0.0022645225,"about_ca_system_score_gemma":0.0022421905,"threshold_uncertainty_score":0.058564782},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.20429558974625636,"score_gpt":0.38597235650178874,"score_spread":0.18167676675553238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479728210","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014245971,0.005893019,0.009994261,0.012272687,0.0037959595,0.0002596873,0.0037167035,0.00026774828,0.949554],"genre_scores_gemma":[0.35046834,0.0075278836,0.008927263,0.01657484,0.0023734267,0.0009148974,0.006339688,0.00053399295,0.6063397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973712,0.00044759983,0.00019154006,0.0005243347,0.00078728335,0.00067803083],"domain_scores_gemma":[0.99624383,0.0006805782,0.00037312688,0.00047131215,0.0012449085,0.0009862342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581964,0.0007245033,0.0005747215,0.0006830303,0.0035554087,0.0051572914,0.0025456597,0.0016541673,0.1972943],"category_scores_gemma":[0.007228954,0.00033813284,0.00070906134,0.0011370064,0.0015579549,0.0030483145,0.0046208296,0.0022068468,0.031660076],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000338469,0.00019932332,0.008335158,0.00090268214,0.000050079925,0.0008775041,0.0040587876,0.0015224476,0.0011639473,0.3673814,0.34911317,0.266057],"study_design_scores_gemma":[0.000016086042,0.00004356776,0.0036590023,0.0002908294,0.000008185219,0.00033472708,0.0015831984,0.00019706879,0.00018818285,0.016868345,0.9767903,0.000020536663],"about_ca_topic_score_codex":0.0152809825,"about_ca_topic_score_gemma":0.017529247,"teacher_disagreement_score":0.1972943,"about_ca_system_score_codex":0.0031212987,"about_ca_system_score_gemma":0.0044713845,"threshold_uncertainty_score":0.66001517},"labels":[],"label_agreement":null},{"id":"W1509951585","doi":"","title":"Workforce Configuration of a Canadian Forces Gematics Division","year":2002,"lang":"en","type":"article","venue":"Defense Technical Information Center (DTIC)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Queueing theory; Computer science; Norm (philosophy); Workforce; Operations research; Workforce planning; Node (physics); Nonlinear system; Mathematical optimization; Distributed computing; Mathematics; Engineering; Computer network; Economics","score_opus":0.14780551322064692,"score_gpt":0.33636265916183117,"score_spread":0.18855714594118425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509951585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87639195,0.00014426,0.082515255,0.0014138313,0.00007303696,0.00026375594,0.000630572,0.00018672996,0.038380586],"genre_scores_gemma":[0.97364265,0.00009310172,0.017556144,0.000085714775,0.0000089525265,0.000038118862,0.0002412184,0.00001593574,0.00831816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999198,0.00013000231,0.000018730412,0.00013756304,0.00017173092,0.0003439107],"domain_scores_gemma":[0.9994522,0.000108002954,0.00007195721,0.000029619969,0.00018277638,0.00015545722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091169553,0.00024921543,0.00016945308,0.00066220434,0.0013349195,0.0012102304,0.0009580407,0.0006606615,0.004597284],"category_scores_gemma":[0.002835311,0.00020178438,0.00017250229,0.0007248641,0.00050741935,0.00072222773,0.0007494368,0.0004807223,0.00034218267],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032582195,0.00015921911,0.023074418,0.00007862668,0.000024170788,0.00068525446,0.0010508292,0.75215256,0.00710418,0.09061631,0.010103977,0.11462453],"study_design_scores_gemma":[0.00004440008,0.0002532753,0.019838601,0.000042819927,0.000021419777,0.00019712972,0.0030362676,0.924803,0.004690458,0.025045173,0.021938087,0.00008940548],"about_ca_topic_score_codex":0.40578908,"about_ca_topic_score_gemma":0.4059531,"teacher_disagreement_score":0.5942109,"about_ca_system_score_codex":0.009052663,"about_ca_system_score_gemma":0.00980852,"threshold_uncertainty_score":0.80685425},"labels":[],"label_agreement":null},{"id":"W1530046160","doi":"10.1007/978-3-642-13025-0_32","title":"Teaching Assignment Problem Solver","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Backtracking; Computer science; Solver; Construct (python library); Mathematical optimization; Extension (predicate logic); Constraint satisfaction problem; Task (project management); Assignment problem; Constraint satisfaction; Selection (genetic algorithm); Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.06385513410186426,"score_gpt":0.3402943713909934,"score_spread":0.2764392372891291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530046160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00489571,0.0011974603,0.6181709,0.0025763505,0.0010940027,0.00026315099,0.001107323,0.0095537715,0.3611413],"genre_scores_gemma":[0.043725546,0.0026190197,0.47057286,0.0013371778,0.00093065784,0.00035675097,0.0038819986,0.0022103135,0.47436565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994242,0.00007637111,0.000021859207,0.00019108271,0.00022919298,0.000057268855],"domain_scores_gemma":[0.9991295,0.0002802726,0.0000357968,0.0001596811,0.0002558993,0.00013872939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050722354,0.0013739726,0.0007644697,0.0009269932,0.0007991559,0.0015985029,0.0019587723,0.00094331,0.18980032],"category_scores_gemma":[0.0019971023,0.00065032084,0.00093586184,0.0015481095,0.0003392253,0.0023676755,0.0019526464,0.0028748522,0.10206565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072024224,0.00036415318,0.00026620735,0.00026600758,0.000016285387,0.00008130402,0.00013142337,0.004688429,0.0054770806,0.051995557,0.21678083,0.7198606],"study_design_scores_gemma":[0.00008990672,0.00013035547,0.00074183196,0.00018157778,0.000034283497,0.00056596944,0.00017475658,0.053537793,0.014179617,0.13624379,0.79409033,0.000029858233],"about_ca_topic_score_codex":0.0009645797,"about_ca_topic_score_gemma":0.0031273672,"teacher_disagreement_score":0.18980032,"about_ca_system_score_codex":0.0010183161,"about_ca_system_score_gemma":0.0018382041,"threshold_uncertainty_score":0.63494533},"labels":[],"label_agreement":null},{"id":"W1541332032","doi":"10.1109/i4ct.2015.7219635","title":"Solving examination timetabling problem using partial exam assignment with great deluge algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Heuristics; Benchmark (surveying); Task (project management); Graph; Algorithm; Process (computing); Mathematical optimization; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics","score_opus":0.25404625236314365,"score_gpt":0.38271929450869385,"score_spread":0.1286730421455502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541332032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09354453,0.0009675276,0.8948865,0.00047548203,0.00014523734,0.0003928086,0.00029557664,0.0022876316,0.0070046447],"genre_scores_gemma":[0.37394145,0.00032954814,0.6199141,0.00020035185,0.00005767212,0.0003493952,0.00085170456,0.00026974743,0.004085948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.00027768788,0.000050093407,0.00016955369,0.00020172227,0.00016566849],"domain_scores_gemma":[0.99850357,0.0006547005,0.0001959757,0.00016656402,0.00034523237,0.00013412519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014980508,0.0010666938,0.00104513,0.0019471137,0.0009245195,0.0009322837,0.0012934869,0.0007643339,0.004594583],"category_scores_gemma":[0.004104361,0.00051545945,0.0011780193,0.0016660898,0.00054960675,0.0010165491,0.00079219183,0.00095902296,0.00048951333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018639426,0.00031193646,0.004518138,0.00037428146,0.00010151306,0.00022382652,0.00031883872,0.62645817,0.0043353564,0.010768631,0.012493444,0.3399095],"study_design_scores_gemma":[0.000047227226,0.0001899585,0.0009241925,0.000033161454,0.000043158227,0.00012461633,0.00015137278,0.9833468,0.0014876127,0.009022978,0.004604864,0.000024061845],"about_ca_topic_score_codex":0.0118468,"about_ca_topic_score_gemma":0.01611902,"teacher_disagreement_score":0.0118468,"about_ca_system_score_codex":0.0011556013,"about_ca_system_score_gemma":0.0026406115,"threshold_uncertainty_score":0.023555696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.3609674661402971,"score_gpt":0.4532695223027544,"score_spread":0.09230205616245729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546422272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0826454,0.0015846234,0.87207264,0.0013079521,0.000506175,0.0011251942,0.0013841637,0.0035016304,0.035872325],"genre_scores_gemma":[0.405837,0.00092899456,0.5715257,0.00030616517,0.00013394404,0.00078857964,0.0013926037,0.0007347655,0.018352242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00044481148,0.000027896727,0.00008691872,0.00011369003,0.00013671027],"domain_scores_gemma":[0.99849844,0.00092038006,0.00013261185,0.000112946305,0.00016064453,0.00017497437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014701316,0.0009628458,0.0010653883,0.0011107366,0.0009529504,0.0012375436,0.0012842788,0.0011245769,0.023435656],"category_scores_gemma":[0.003634258,0.0011363167,0.0009719923,0.0022797782,0.0003140123,0.00087028614,0.0007790189,0.0011638491,0.0028805672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059716107,0.0002772147,0.0008591815,0.00020681803,0.00006820844,0.00006653257,0.00013943824,0.7396639,0.0021693856,0.007068604,0.022064956,0.2268186],"study_design_scores_gemma":[0.0001911179,0.0003308961,0.00095046026,0.000027495831,0.00003825056,0.000056700854,0.0001370941,0.9755077,0.0022617206,0.011516896,0.008954552,0.00002715143],"about_ca_topic_score_codex":0.009908396,"about_ca_topic_score_gemma":0.012019014,"teacher_disagreement_score":0.023435656,"about_ca_system_score_codex":0.0016569739,"about_ca_system_score_gemma":0.003729108,"threshold_uncertainty_score":0.078400075},"labels":[],"label_agreement":null},{"id":"W1550691097","doi":"10.1109/iccsit.2010.5563664","title":"Notice of Retraction: Improving inventory management through automated dynamic promotion scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Notice; Computer science; Scheduling (production processes); Inventory management; Promotion (chess); Operations research; Operations management; Engineering; Political science","score_opus":0.07673058513063866,"score_gpt":0.3924113847870677,"score_spread":0.31568079965642903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550691097","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012554774,0.0085823685,0.039107703,0.0872224,0.79588604,0.0004153874,0.003709045,0.0037712448,0.04875104],"genre_scores_gemma":[0.14470509,0.015575691,0.065253735,0.017973809,0.13157399,0.00043009754,0.010449776,0.0038591216,0.61017865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965192,0.000540952,0.0003787272,0.00031838773,0.0019682972,0.0002744488],"domain_scores_gemma":[0.97861904,0.0063982797,0.00077132654,0.0019318174,0.011232227,0.0010473202],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030044157,0.0015269404,0.0011338681,0.0018674211,0.0018382462,0.0040014656,0.0019504841,0.002629655,0.07901802],"category_scores_gemma":[0.044741727,0.00043168192,0.0012296418,0.002277866,0.0007802842,0.002217952,0.0014614307,0.0035083182,0.026629966],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027864467,0.00006214368,0.00044960546,0.00040974093,0.0000354457,0.0006485761,0.000115607574,0.0010754421,0.0025971315,0.00537106,0.84814245,0.14081417],"study_design_scores_gemma":[0.00014039036,0.00028045542,0.0028270874,0.00032140882,0.00009764404,0.0014845341,0.0002010769,0.010137961,0.006914956,0.0052588154,0.97224253,0.00009312943],"about_ca_topic_score_codex":0.0038461923,"about_ca_topic_score_gemma":0.0043091625,"teacher_disagreement_score":0.99737036,"about_ca_system_score_codex":0.0015818494,"about_ca_system_score_gemma":0.0035895428,"threshold_uncertainty_score":0.26434165},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1225710071208142,"score_gpt":0.3584828721173177,"score_spread":0.23591186499650352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577063765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078035137,0.00017604332,0.98378766,0.00012546453,0.00006175926,0.0003150273,0.0006399049,0.0022348063,0.004855806],"genre_scores_gemma":[0.062116068,0.00013388715,0.93251425,0.00013812321,0.0000323753,0.00044914288,0.001239181,0.0003944334,0.002982641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892336,0.00036749645,0.000052203115,0.00015762396,0.00036682552,0.00013250744],"domain_scores_gemma":[0.99745136,0.0017821037,0.00010717184,0.0002446562,0.00034926104,0.000065485096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881122,0.001048325,0.0012007556,0.0012943125,0.00077186275,0.0012932227,0.0024416535,0.0011962975,0.0142639335],"category_scores_gemma":[0.0041842544,0.00096679805,0.0014868964,0.0026388364,0.0005118028,0.0013581314,0.0010142173,0.0020046465,0.0018368232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002186894,0.0003402331,0.00043893573,0.00036319156,0.00006898251,0.00016047206,0.00011245272,0.50435394,0.008673092,0.020208493,0.020831946,0.4442296],"study_design_scores_gemma":[0.000038069622,0.000040199797,0.00011259881,0.000015568754,0.000015909012,0.000032145887,0.000018658504,0.98654467,0.0025585454,0.008120893,0.002487722,0.000015008635],"about_ca_topic_score_codex":0.013462891,"about_ca_topic_score_gemma":0.016448352,"teacher_disagreement_score":0.0142639335,"about_ca_system_score_codex":0.001127812,"about_ca_system_score_gemma":0.002061474,"threshold_uncertainty_score":0.04771757},"labels":[],"label_agreement":null},{"id":"W1577335838","doi":"","title":"Rostering for a Restaurant","year":2002,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tabu search; Supervisor; Heuristic; Duty; Morning; Operations management; Computer science; Operations research; Mathematical optimization; Mathematics; Engineering; Economics; Management; Medicine; Political science","score_opus":0.14439692922988462,"score_gpt":0.372738868667221,"score_spread":0.22834193943733638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577335838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17671731,0.000523395,0.76677185,0.0007484593,0.0002779025,0.0009483337,0.0016435927,0.004687928,0.047681246],"genre_scores_gemma":[0.26820782,0.00024400571,0.70428944,0.00006654349,0.000027899272,0.00023184819,0.0020168368,0.00033873576,0.024576856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997805,0.0000370928,0.000010585409,0.00007542082,0.000037871996,0.00005846886],"domain_scores_gemma":[0.99983776,0.000035285844,0.000025119269,0.000030099289,0.000032078377,0.00003967131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028745062,0.0008401493,0.00064324006,0.0005105289,0.0012740217,0.00067727076,0.0012295101,0.000765456,0.04230716],"category_scores_gemma":[0.0005457654,0.000429117,0.0010293336,0.0005837089,0.00025847915,0.00064603245,0.000689535,0.0007048388,0.0047555836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061266706,0.0004977885,0.0024545437,0.0006390591,0.00007292638,0.00080546696,0.00039162594,0.5190065,0.017291406,0.035631664,0.0283098,0.39428663],"study_design_scores_gemma":[0.00015638061,0.00056477136,0.0018573818,0.0000657433,0.00007254572,0.00047181034,0.0005732351,0.9185397,0.008673676,0.021622535,0.04734641,0.000055823286],"about_ca_topic_score_codex":0.0068289046,"about_ca_topic_score_gemma":0.012747305,"teacher_disagreement_score":0.04230716,"about_ca_system_score_codex":0.00064617436,"about_ca_system_score_gemma":0.0011502162,"threshold_uncertainty_score":0.14153159},"labels":[],"label_agreement":null},{"id":"W1584124733","doi":"10.1613/jair.3713","title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Canadian Mathematical Society","keywords":"Tournament; Linear programming relaxation; Combinatorics; Mathematics; Linear programming; Schedule; Scheduling (production processes); Mathematical optimization; Modulo; Relaxation (psychology); Computer science; Discrete mathematics","score_opus":0.6328128500768635,"score_gpt":0.5480436522897456,"score_spread":0.08476919778711789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584124733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21872748,0.0004652318,0.75675464,0.0009425604,0.000101484984,0.00025426073,0.00066062703,0.0012118659,0.020881902],"genre_scores_gemma":[0.46599755,0.000279672,0.5260551,0.00031605575,0.00007500696,0.00040672,0.0012548137,0.00034770096,0.005267362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912924,0.00031497405,0.000036241658,0.00020599611,0.00016541869,0.00014818662],"domain_scores_gemma":[0.9975497,0.0016448756,0.00024687164,0.00031598765,0.00014411887,0.00009841888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623983,0.0011176112,0.00081470626,0.00044349063,0.00044264973,0.0009311536,0.0013478282,0.0010018861,0.0050430642],"category_scores_gemma":[0.005434456,0.00048812228,0.0012120652,0.0009203846,0.00063187635,0.0014560693,0.0012675244,0.0017016715,0.0005816724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024361744,0.00017700861,0.0008088305,0.00019927575,0.000042823915,0.00014635814,0.00012244226,0.9222564,0.0034022038,0.019377545,0.004432506,0.04879097],"study_design_scores_gemma":[0.00006488798,0.00010181478,0.00015921751,0.000012062823,0.000011446759,0.000059264075,0.00006472383,0.98171186,0.0010659668,0.014894228,0.0018482583,0.00000619161],"about_ca_topic_score_codex":0.0024663014,"about_ca_topic_score_gemma":0.0029501745,"teacher_disagreement_score":0.0050430642,"about_ca_system_score_codex":0.0009944803,"about_ca_system_score_gemma":0.001142228,"threshold_uncertainty_score":0.016870737},"labels":[],"label_agreement":null},{"id":"W1588707965","doi":"10.1007/978-3-540-72788-0_29","title":"Minimum 2CNF Resolution Refutations in Polynomial Time","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Resolution (logic); Mathematics; Polynomial; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.08836979546489511,"score_gpt":0.3619736445370634,"score_spread":0.2736038490721683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588707965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11422159,0.0029386717,0.73932445,0.003376269,0.00096688914,0.00076453685,0.004285701,0.011245152,0.12287675],"genre_scores_gemma":[0.26692435,0.0008221874,0.6846609,0.00083447865,0.00031693978,0.00037696733,0.006615983,0.0026423126,0.03680589],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996711,0.00066213874,0.00020367523,0.0006315849,0.0011948075,0.00059673894],"domain_scores_gemma":[0.9891158,0.006238542,0.0005716262,0.0026427868,0.0012135337,0.00021765078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016004712,0.0017027038,0.0021171062,0.0024264927,0.0021200932,0.0029076834,0.0037888165,0.0027588354,0.039766025],"category_scores_gemma":[0.011878912,0.0013478423,0.0024255223,0.0041693137,0.0012271268,0.0063953525,0.0024436635,0.0034228975,0.006174956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006750862,0.00063696026,0.0012301875,0.001459959,0.00013985983,0.0002875913,0.00044610834,0.056456544,0.014301541,0.11370589,0.055400398,0.7552598],"study_design_scores_gemma":[0.0004748903,0.00027505375,0.0019580754,0.00033117388,0.0002584232,0.0012916307,0.0004601052,0.24114333,0.038493283,0.6521214,0.06305231,0.00014034532],"about_ca_topic_score_codex":0.0031055978,"about_ca_topic_score_gemma":0.011944997,"teacher_disagreement_score":0.039766025,"about_ca_system_score_codex":0.0017186579,"about_ca_system_score_gemma":0.0023098213,"threshold_uncertainty_score":0.1330306},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.2007146065614402,"score_gpt":0.4855884864042948,"score_spread":0.2848738798428546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601417206","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020270364,0.6270266,0.35234106,0.0039475756,0.0008023562,0.00012431225,0.00013347065,0.00018891074,0.013408623],"genre_scores_gemma":[0.029228458,0.76022965,0.2037728,0.0011183004,0.0010904744,0.00030278787,0.00020436093,0.000044768072,0.004008406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919397,0.00027496638,0.000067149515,0.00009749078,0.00033535273,0.000031067735],"domain_scores_gemma":[0.99876463,0.00087722077,0.00013176979,0.000033930923,0.0001657815,0.000026709758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017535381,0.001516176,0.0016432091,0.001995116,0.00043229014,0.0016833064,0.0026273895,0.001561315,0.0022475533],"category_scores_gemma":[0.0032119895,0.00061505113,0.00092771114,0.0043528676,0.0009253276,0.0015940663,0.0007214061,0.002459392,0.0011737138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006529852,0.00026691298,0.0002531423,0.0059590475,0.00016808162,0.00009912816,0.00007691317,0.11798371,0.0009650284,0.102503374,0.015920555,0.75573874],"study_design_scores_gemma":[0.00019824131,0.0004046507,0.001240963,0.005253736,0.00036949653,0.001059601,0.00025626092,0.28535604,0.0032154166,0.27865815,0.42382067,0.00016686732],"about_ca_topic_score_codex":0.0056301667,"about_ca_topic_score_gemma":0.0058637788,"teacher_disagreement_score":0.0056301667,"about_ca_system_score_codex":0.001945714,"about_ca_system_score_gemma":0.0031478372,"threshold_uncertainty_score":0.014117241},"labels":[],"label_agreement":null},{"id":"W1605222863","doi":"10.1007/3-540-45153-6_30","title":"Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Travelling salesman problem; Computer science; Extension (predicate logic); Genetic algorithm; Graph; Constraint (computer-aided design); Constraint satisfaction problem; Algorithm; Mathematical optimization; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics","score_opus":0.0795154929231639,"score_gpt":0.33581237656569446,"score_spread":0.25629688364253056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605222863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06678326,0.00070036255,0.9192631,0.00020983342,0.00010340461,0.00007019731,0.00005604367,0.0005080607,0.012305703],"genre_scores_gemma":[0.31116143,0.00087371713,0.68038195,0.000084219544,0.00005816274,0.00009955336,0.00017978765,0.00010459283,0.0070565096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998573,0.000038026737,0.0000061805918,0.00002192799,0.000050387764,0.000026144144],"domain_scores_gemma":[0.9998388,0.00007922495,0.000015124082,0.000021227785,0.000036715348,0.000008853083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031404282,0.0004275269,0.00057332363,0.00038720324,0.00026277718,0.00061297073,0.00091224123,0.0008692494,0.0025228085],"category_scores_gemma":[0.00096848235,0.00022603899,0.00062232156,0.000653053,0.00022505126,0.00076851813,0.00043993685,0.00084048277,0.00041080918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008157915,0.00011441765,0.00045929098,0.00016511139,0.000073564384,0.00013983986,0.00007480536,0.75974035,0.011552975,0.026633408,0.0026113382,0.19835328],"study_design_scores_gemma":[0.000023295706,0.000037772224,0.00016185113,0.000011914179,0.000025695757,0.000061707324,0.0000142127155,0.98699677,0.0022295523,0.007867064,0.0025641806,0.000005955263],"about_ca_topic_score_codex":0.0031075294,"about_ca_topic_score_gemma":0.0026493275,"teacher_disagreement_score":0.0031075294,"about_ca_system_score_codex":0.00029041825,"about_ca_system_score_gemma":0.0008479814,"threshold_uncertainty_score":0.0084396005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.710463223401453,"score_gpt":0.5447390887290039,"score_spread":0.16572413467244906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175209279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002795354,0.0006298676,0.98407876,0.0018978247,0.00017341209,0.00011039145,0.00025120054,0.00005892846,0.010004382],"genre_scores_gemma":[0.18783312,0.00550773,0.76623267,0.0012990973,0.0020250736,0.00080514426,0.001024131,0.00021095514,0.03506212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978941,0.00082917407,0.00009102753,0.00046449038,0.0004965057,0.00022473329],"domain_scores_gemma":[0.99870205,0.0007635127,0.00009984352,0.00012170769,0.0002193086,0.00009351047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024472822,0.0019535488,0.0021213817,0.0018753151,0.0011826882,0.0029986168,0.004332824,0.0034294084,0.011428543],"category_scores_gemma":[0.004897452,0.0010505154,0.0033976648,0.0034074571,0.002003625,0.0035175185,0.002807282,0.004418307,0.0013948618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028428127,0.00012213041,0.00031268212,0.00028450924,0.00008942404,0.00017723512,0.00013787021,0.35618708,0.00067388854,0.6007089,0.010320411,0.030957425],"study_design_scores_gemma":[0.000041061023,0.000049302464,0.00023672158,0.000052712287,0.00004427177,0.000107702406,0.00006571954,0.49582937,0.00015132477,0.48950884,0.013889012,0.000023978062],"about_ca_topic_score_codex":0.007503241,"about_ca_topic_score_gemma":0.008217202,"teacher_disagreement_score":0.011428543,"about_ca_system_score_codex":0.0025466331,"about_ca_system_score_gemma":0.0033865548,"threshold_uncertainty_score":0.038232267},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2330621697436535,"score_gpt":0.366733198773676,"score_spread":0.13367102903002248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828541999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071272634,0.00025546618,0.9219432,0.00029986608,0.000035617362,0.0002593724,0.00007464783,0.00040565978,0.005453525],"genre_scores_gemma":[0.26694885,0.00026049968,0.7297084,0.00013300087,0.0000140194325,0.00043874743,0.00015288989,0.00006711222,0.002276423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995084,0.00024130533,0.000021787058,0.00007752699,0.00010102413,0.000049924794],"domain_scores_gemma":[0.99878544,0.00086145225,0.00010228687,0.000066237146,0.00014334361,0.00004119962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013036092,0.00057526596,0.00044794052,0.00091999886,0.00046090063,0.0007393161,0.0011350343,0.0007530836,0.0019979123],"category_scores_gemma":[0.0036315997,0.00045585315,0.0005731693,0.0010505124,0.000863354,0.0005857409,0.0005121776,0.0009868128,0.00018308774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060058486,0.00010079568,0.000911378,0.00008094543,0.000048383514,0.00011106806,0.0001923599,0.9040267,0.0036123232,0.015887737,0.0006251548,0.074343115],"study_design_scores_gemma":[0.00003452536,0.00007237926,0.0002442518,0.0000269167,0.000025995203,0.00003536666,0.000052704963,0.98825884,0.0016747328,0.0077335234,0.001827787,0.000012853399],"about_ca_topic_score_codex":0.0063779866,"about_ca_topic_score_gemma":0.006484637,"teacher_disagreement_score":0.0063779866,"about_ca_system_score_codex":0.0012436848,"about_ca_system_score_gemma":0.0019705184,"threshold_uncertainty_score":0.012681723},"labels":[],"label_agreement":null},{"id":"W1842969976","doi":"","title":"Des vacances d’été à quel prix?","year":2004,"lang":"fr","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hôpital du Sacré-Cœur de Montréal","funders":"","keywords":"Humanities; Schedule; Political science; Management; Philosophy; Economics","score_opus":0.1650127930081769,"score_gpt":0.4152449782361355,"score_spread":0.2502321852279586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842969976","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5926034,0.023485046,0.096832365,0.11804877,0.0046324455,0.00043651342,0.002606328,0.0008424648,0.16051263],"genre_scores_gemma":[0.89804643,0.006526865,0.04251669,0.0036850648,0.0011037728,0.00015082375,0.0010131368,0.00023252975,0.04672469],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982792,0.00065026846,0.000105798565,0.00029671518,0.0003603697,0.00030773302],"domain_scores_gemma":[0.9964,0.0013657494,0.00075778575,0.00022539089,0.00066908257,0.00058191974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025266442,0.0004842946,0.000622224,0.0006355658,0.0020563193,0.0032937308,0.0010525696,0.0012367759,0.017353663],"category_scores_gemma":[0.00923125,0.00022553178,0.00062667,0.001024,0.001222309,0.0024467665,0.00069605384,0.0014387093,0.0017567755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013739467,0.0005663011,0.054772563,0.0015543116,0.0002093204,0.002694025,0.0058813714,0.0142244855,0.0071700453,0.09729111,0.07051866,0.74374384],"study_design_scores_gemma":[0.00015036772,0.0014883068,0.081250936,0.0013599674,0.00010940997,0.0051130094,0.03941039,0.027384846,0.004217145,0.10877305,0.73054373,0.00019885637],"about_ca_topic_score_codex":0.012816731,"about_ca_topic_score_gemma":0.02007264,"teacher_disagreement_score":0.017353663,"about_ca_system_score_codex":0.0016448967,"about_ca_system_score_gemma":0.0024204096,"threshold_uncertainty_score":0.058053732},"labels":[],"label_agreement":null},{"id":"W1857120939","doi":"","title":"Affectation des infirmières aux salles de l'unité d'endoscopie digestive du Centre hospitalier universitaire de Sherbrooke","year":2013,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Political science; Physics; Philosophy","score_opus":0.021361923994094364,"score_gpt":0.27298439192830287,"score_spread":0.2516224679342085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857120939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664239,0.003262578,0.00017182405,0.013021767,0.0005043673,0.000042790176,0.0004898102,0.000055023902,0.016027927],"genre_scores_gemma":[0.9783378,0.0024540639,0.00016921868,0.002399487,0.00015400838,0.00003568112,0.0001673902,0.000029591272,0.016252656],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960978,0.0010720952,0.00018759015,0.0002899018,0.0010311606,0.0013213403],"domain_scores_gemma":[0.9870226,0.0015599354,0.0039870697,0.00024687362,0.0025052256,0.004678209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019732118,0.00043938594,0.0005965093,0.0010893667,0.004061256,0.0027193192,0.00089001347,0.0010609754,0.029245064],"category_scores_gemma":[0.012240041,0.00048022557,0.0007659843,0.0009744787,0.0015397626,0.0011760388,0.0021332796,0.0014139196,0.00317352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049761304,0.00024049722,0.89024407,0.00022712284,0.00008848369,0.0042478233,0.03363466,0.00012304372,0.001468815,0.0006384179,0.030146368,0.03844312],"study_design_scores_gemma":[0.000016041948,0.0002835182,0.93528557,0.00028894388,0.000023232522,0.0013745542,0.042058617,0.0000858899,0.00025077703,0.000092689595,0.020196753,0.00004349543],"about_ca_topic_score_codex":0.12607825,"about_ca_topic_score_gemma":0.17348802,"teacher_disagreement_score":0.12607825,"about_ca_system_score_codex":0.007865193,"about_ca_system_score_gemma":0.0047712694,"threshold_uncertainty_score":0.2506888},"labels":[],"label_agreement":null},{"id":"W1928393880","doi":"10.1109/iscaie.2015.7298333","title":"Solving examination timetabling problem using partial exam assignment with hill climbing search","year":2015,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristics; Hill climbing; Computer science; Benchmark (surveying); Graph; Scheduling (production processes); Heuristic; Travelling salesman problem; Mathematical optimization; Machine learning; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics","score_opus":0.3905390064354905,"score_gpt":0.4180822605973324,"score_spread":0.02754325416184189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928393880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049218718,0.00067368284,0.9403198,0.00020011216,0.00007562658,0.0004256968,0.00033063377,0.0016031867,0.0071525173],"genre_scores_gemma":[0.22897671,0.0004389219,0.76598316,0.00011218855,0.000034651366,0.000341236,0.00086757075,0.00015756286,0.0030879837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955374,0.00015223793,0.000027947817,0.00007971993,0.00012610055,0.000060194132],"domain_scores_gemma":[0.99943584,0.00026517652,0.00008310762,0.00006174008,0.000112614274,0.00004148972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073943834,0.0008906675,0.0009741385,0.0012766845,0.0006367972,0.00068087486,0.001128987,0.0005827692,0.003382214],"category_scores_gemma":[0.0016893343,0.00044311135,0.0009170976,0.0014616924,0.00024968086,0.00070396473,0.00045385907,0.0007167137,0.00048818372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000127386,0.00031719267,0.0026282936,0.0005070509,0.00014243211,0.00021399473,0.0002043229,0.6273835,0.008076817,0.0064476742,0.008732455,0.3452189],"study_design_scores_gemma":[0.000053448333,0.00020926168,0.0015581447,0.0000306669,0.000057691756,0.00012220813,0.00011752002,0.98431975,0.0028897615,0.0044018263,0.00621573,0.0000239923],"about_ca_topic_score_codex":0.014127454,"about_ca_topic_score_gemma":0.020140853,"teacher_disagreement_score":0.014127454,"about_ca_system_score_codex":0.0006143062,"about_ca_system_score_gemma":0.0023958578,"threshold_uncertainty_score":0.028090477},"labels":[],"label_agreement":null},{"id":"W1943064151","doi":"10.3233/idt-2011-0101","title":"A multi-agent system for course timetabling","year":2011,"lang":"en","type":"article","venue":"Intelligent Decision Technologies","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Negotiation; Computer science; Intelligent agent; Key (lock); Course (navigation); Partition (number theory); Multi-agent system; Intelligent decision support system; Order (exchange); Autonomous agent; Decision support system; Operations research; Artificial intelligence; Distributed computing; Engineering; Computer security","score_opus":0.3140246158563806,"score_gpt":0.4170870266593164,"score_spread":0.10306241080293582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943064151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033756137,0.00063402177,0.9499564,0.00061898096,0.0002458563,0.00039101907,0.0001770502,0.002758744,0.011461868],"genre_scores_gemma":[0.4109581,0.00051128987,0.5760834,0.00017518693,0.00010015282,0.000495722,0.00036936707,0.0001045693,0.011202227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995524,0.00014184962,0.000035847934,0.00009282458,0.00013600315,0.000041008283],"domain_scores_gemma":[0.999508,0.00015104601,0.00005913727,0.00006152124,0.0001320584,0.00008822947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965127,0.00037012488,0.00048283313,0.00048466542,0.0012074957,0.0011898432,0.0011011809,0.0008639753,0.0048803687],"category_scores_gemma":[0.0013054152,0.00021521498,0.00040543673,0.00048108603,0.00031170575,0.0010070705,0.000743728,0.00080878544,0.001138218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007049543,0.0008174619,0.0038081552,0.0005827191,0.00020534602,0.00080601155,0.00087015383,0.3666344,0.05883128,0.07833408,0.015237597,0.47316784],"study_design_scores_gemma":[0.00012349877,0.00020127682,0.0007009588,0.00003694949,0.0000655493,0.00013714594,0.00007258574,0.93063664,0.010231257,0.0070702303,0.050676025,0.000047955615],"about_ca_topic_score_codex":0.0041216346,"about_ca_topic_score_gemma":0.0048392443,"teacher_disagreement_score":0.0048803687,"about_ca_system_score_codex":0.0007241726,"about_ca_system_score_gemma":0.0015623873,"threshold_uncertainty_score":0.016326487},"labels":[],"label_agreement":null},{"id":"W1955051096","doi":"10.24908/pceea.v0i0.5849","title":"COURSE SCHEDULING ACCORDING TO STUDENT STRESS","year":2015,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"China Scholarship Council","keywords":"Scheduling (production processes); Stress (linguistics); Mathematics education; Computer science; Psychology; Engineering; Operations management; Linguistics","score_opus":0.05356629890066236,"score_gpt":0.34836267386690517,"score_spread":0.2947963749662428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955051096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94681257,0.00016923499,0.048367467,0.00045886007,0.000041240277,0.00012518703,0.00026920112,0.00012223846,0.0036340763],"genre_scores_gemma":[0.9952597,0.00004368649,0.0037566128,0.000024343963,0.000014126244,0.000038420836,0.00014276503,0.000015402926,0.0007050165],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819213,0.0006382098,0.00010317989,0.0003201918,0.00041993518,0.00032638904],"domain_scores_gemma":[0.98624194,0.0061617573,0.0023307235,0.0006045134,0.0022845382,0.0023766432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025600877,0.0003739881,0.00050262385,0.0009214595,0.00034026144,0.0016131963,0.00055021315,0.000469804,0.0019625],"category_scores_gemma":[0.015827568,0.00020663219,0.00038977584,0.00084218796,0.00041974173,0.0007424286,0.00080943416,0.00060490164,0.00023826418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012053335,0.0006710681,0.46154824,0.00013792115,0.00017355717,0.00028044105,0.0008357952,0.35931316,0.012134737,0.012188561,0.0030815806,0.14842953],"study_design_scores_gemma":[0.00005174378,0.0010199932,0.16837102,0.000024416358,0.000060260147,0.0001426055,0.0009782494,0.8076599,0.0031845986,0.016890146,0.001557168,0.000059954044],"about_ca_topic_score_codex":0.0021899461,"about_ca_topic_score_gemma":0.0021431504,"teacher_disagreement_score":0.0025600877,"about_ca_system_score_codex":0.0011456863,"about_ca_system_score_gemma":0.0009420028,"threshold_uncertainty_score":0.013539255},"labels":[],"label_agreement":null},{"id":"W19625307","doi":"10.1093/humrep/dep263","title":"The U.S. national football league scheduling problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"League; Tournament; Computer science; Football; Scheduling (production processes); Operations research; Distributed computing; Mathematical optimization; Engineering; Mathematics; Political science","score_opus":0.15575351620734262,"score_gpt":0.399049582553404,"score_spread":0.24329606634606138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19625307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5693254,0.008879218,0.29221332,0.014224781,0.0013631242,0.0016317278,0.033416692,0.0019798286,0.076965965],"genre_scores_gemma":[0.77663106,0.0021788839,0.17703047,0.001176079,0.0003883562,0.00076872087,0.014976094,0.0002764085,0.0265739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891174,0.00039645293,0.00006082058,0.00028193375,0.00014264658,0.00020633658],"domain_scores_gemma":[0.9971162,0.0020445322,0.00021799504,0.00010100769,0.00024627507,0.00027399193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015751288,0.0013542217,0.001334068,0.0012463061,0.0010033108,0.0016113137,0.0010741276,0.0016211917,0.012625473],"category_scores_gemma":[0.0046613025,0.0006340245,0.0009704465,0.0016491148,0.0005849007,0.0014380176,0.00094370963,0.0011636097,0.00096850126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006710978,0.000667607,0.0036727702,0.0007685675,0.00021673871,0.00047903004,0.0001495047,0.81369793,0.0010994656,0.018304544,0.06017831,0.10009444],"study_design_scores_gemma":[0.00030139208,0.00027543635,0.0024381382,0.000094344236,0.000086272645,0.00022197246,0.00033663723,0.94848186,0.0009208245,0.03251997,0.01428744,0.000035628454],"about_ca_topic_score_codex":0.036585875,"about_ca_topic_score_gemma":0.040128704,"teacher_disagreement_score":0.036585875,"about_ca_system_score_codex":0.0022397458,"about_ca_system_score_gemma":0.0038231995,"threshold_uncertainty_score":0.0727458},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.23135211472588885,"score_gpt":0.36204789585760483,"score_spread":0.13069578113171598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963501528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93239224,0.0003112304,0.052654065,0.0011576235,0.00012216294,0.00006347795,0.00023726095,0.000058958194,0.013003006],"genre_scores_gemma":[0.9923282,0.000020593394,0.007013509,0.00002867591,0.000007814522,0.000009873283,0.000044267133,0.0000062314502,0.0005407521],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980574,0.00077305804,0.000124151,0.00029449456,0.00048814507,0.00026273547],"domain_scores_gemma":[0.9927366,0.0043110517,0.0007527471,0.0006690744,0.0009108588,0.00061970006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003679732,0.00026453353,0.00039599344,0.00078744494,0.00060957676,0.0014090664,0.0008840507,0.0005819516,0.0035817146],"category_scores_gemma":[0.016830374,0.00022036985,0.00034881086,0.0009800661,0.00055307377,0.001582806,0.0012756682,0.00097149046,0.00023212953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092463766,0.000857128,0.54404056,0.00020727568,0.00031384072,0.0002573415,0.0047826483,0.12358232,0.005657428,0.04983734,0.0017343201,0.26780516],"study_design_scores_gemma":[0.000109721776,0.0009131587,0.5689866,0.000107349886,0.00019248399,0.00025621284,0.01022129,0.26559234,0.005932264,0.13977729,0.0077902735,0.000121084675],"about_ca_topic_score_codex":0.008133836,"about_ca_topic_score_gemma":0.014029894,"teacher_disagreement_score":0.008133836,"about_ca_system_score_codex":0.0017566886,"about_ca_system_score_gemma":0.0016815277,"threshold_uncertainty_score":0.019460559},"labels":[],"label_agreement":null},{"id":"W1966519876","doi":"10.1109/foci.2014.7007805","title":"Test problems and representations for graph evolution","year":2014,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Benchmark (surveying); Adjacency list; Scalability; Theoretical computer science; Computer science; Graph; Representation (politics); Adjacency matrix; Algorithm; Mathematics","score_opus":0.13170870693892922,"score_gpt":0.3906623906985117,"score_spread":0.2589536837595825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966519876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15728217,0.00074147177,0.81298965,0.0026363616,0.00016276911,0.0006555467,0.0012799387,0.0017887449,0.022463346],"genre_scores_gemma":[0.4693086,0.0006511683,0.5195349,0.00043195134,0.00013955626,0.0011141559,0.0031311808,0.000501268,0.0051872637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960098,0.002094442,0.00023595667,0.0005723676,0.0008478993,0.00023951477],"domain_scores_gemma":[0.96917033,0.025451578,0.0013475115,0.0026107484,0.0010017193,0.00041820185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004076717,0.0012888949,0.0008697647,0.0015921458,0.0008404019,0.0023395936,0.0021526415,0.0022206877,0.0046830517],"category_scores_gemma":[0.04181496,0.0005357164,0.0017625558,0.0020033484,0.002520603,0.004917468,0.002216146,0.0029733046,0.00051471096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025561094,0.00043083105,0.0021795447,0.0005171738,0.000067503555,0.0001690802,0.0002544969,0.70053977,0.0025778345,0.19668686,0.0067040836,0.08961716],"study_design_scores_gemma":[0.00008010378,0.0001893468,0.00032962696,0.00006850288,0.00002007729,0.000113348615,0.000121788806,0.792294,0.0025663984,0.20028375,0.0039135157,0.000019480485],"about_ca_topic_score_codex":0.0016142396,"about_ca_topic_score_gemma":0.00111108,"teacher_disagreement_score":0.0046830517,"about_ca_system_score_codex":0.0021139535,"about_ca_system_score_gemma":0.0012791612,"threshold_uncertainty_score":0.021560013},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.46213127535202697,"score_gpt":0.5843200294400972,"score_spread":0.12218875408807023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966942146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00521932,0.0031112514,0.97312987,0.00467619,0.0002618255,0.0000681587,0.00014804956,0.00019657647,0.013188745],"genre_scores_gemma":[0.24314255,0.0065484815,0.742624,0.0009413442,0.0012986283,0.00046610652,0.00043612768,0.00018756864,0.004355198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97900325,0.0110883815,0.0012316564,0.0024738195,0.0056337495,0.0005691247],"domain_scores_gemma":[0.91134685,0.067326166,0.0026905595,0.014532867,0.0034965803,0.0006068687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013129277,0.0012423943,0.0017383776,0.0043378198,0.0021797793,0.007864188,0.0041755885,0.003358889,0.0079857735],"category_scores_gemma":[0.06057146,0.001955479,0.0024748293,0.005851827,0.014612622,0.010935868,0.0038496468,0.0074728495,0.0016265907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037160793,0.00007925208,0.0004976689,0.00027128222,0.000041411913,0.000031990767,0.00022078911,0.046454426,0.00032790547,0.9004435,0.002972808,0.04862189],"study_design_scores_gemma":[0.000022411783,0.000022547054,0.00014581767,0.00009281658,0.000011674835,0.00004766829,0.00004748947,0.08028925,0.00031467888,0.90955514,0.009431403,0.000019010331],"about_ca_topic_score_codex":0.0054932716,"about_ca_topic_score_gemma":0.0038435224,"teacher_disagreement_score":0.013129277,"about_ca_system_score_codex":0.0049470514,"about_ca_system_score_gemma":0.0069279387,"threshold_uncertainty_score":0.06943512},"labels":[],"label_agreement":null},{"id":"W1971938577","doi":"10.1287/moor.2013.0597","title":"An Approximation Algorithm for the Bipartite Traveling Tournament Problem","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; Bipartite graph; Travelling salesman problem; Mathematics; Schedule; Approximation algorithm; Scheduling (production processes); Mathematical optimization; Combinatorics; League; Sequence (biology); Computer science; Graph","score_opus":0.3518717323001682,"score_gpt":0.5090074774307536,"score_spread":0.15713574513058537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971938577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03592926,0.0006044573,0.9411748,0.0012403765,0.00019587761,0.0003459706,0.00075773936,0.0032577969,0.016493691],"genre_scores_gemma":[0.27954185,0.000499461,0.70986885,0.00039608518,0.00014898663,0.0005641536,0.0026237157,0.00044352308,0.00591337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804074,0.00043587797,0.0001031546,0.00048748555,0.00047466822,0.00045805037],"domain_scores_gemma":[0.99808073,0.00095278886,0.00017071392,0.0004219317,0.00021621319,0.00015763045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013648928,0.00167081,0.001447752,0.0009680257,0.0012630546,0.0021656177,0.0026608456,0.0017971395,0.010325068],"category_scores_gemma":[0.0061506946,0.0006519262,0.001499183,0.0023937433,0.00067360187,0.002764468,0.0017460171,0.002189919,0.0023597495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079583004,0.00065601006,0.0017768405,0.00045733093,0.00015148308,0.00023176138,0.00034525906,0.60520047,0.0055193976,0.061316777,0.034880392,0.2886684],"study_design_scores_gemma":[0.00017980378,0.00011549506,0.0002752999,0.00002298093,0.000033282788,0.00015552368,0.00007705643,0.9588092,0.0008230326,0.034232315,0.005259041,0.00001702893],"about_ca_topic_score_codex":0.008182343,"about_ca_topic_score_gemma":0.009087175,"teacher_disagreement_score":0.010325068,"about_ca_system_score_codex":0.0028811123,"about_ca_system_score_gemma":0.0037440243,"threshold_uncertainty_score":0.034540832},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.7910546258868351,"score_gpt":0.6473067551021794,"score_spread":0.14374787078465567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974179675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014064154,0.00013386318,0.9822788,0.00015181015,0.000051016057,0.0000385387,0.00019296016,0.00015186475,0.002936896],"genre_scores_gemma":[0.34918198,0.0008122239,0.63908005,0.00013452256,0.00015295856,0.00040845977,0.0010022413,0.0005364964,0.008691081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987998,0.00066469423,0.00004503003,0.00014507661,0.00021433287,0.00013106955],"domain_scores_gemma":[0.9973767,0.0018302369,0.00026260136,0.00024335203,0.00017500563,0.00011212372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020191965,0.001486105,0.0014666226,0.0011186001,0.00060877524,0.001696031,0.00199383,0.0014843316,0.0035539963],"category_scores_gemma":[0.007201308,0.0018185697,0.0021404384,0.0016769209,0.0010516259,0.0029973895,0.0013752896,0.0032359478,0.0005734813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018774454,0.000021459491,0.00011758432,0.00001719543,0.000014296111,0.0000149346915,0.000028724024,0.9644077,0.00016202066,0.030221866,0.0003413765,0.004634068],"study_design_scores_gemma":[0.0000039389442,0.0000051788793,0.000018214709,0.0000039366605,0.000004918771,0.000002889752,0.000004041077,0.9753879,0.000049989827,0.024062332,0.00045414126,0.0000026168404],"about_ca_topic_score_codex":0.014004128,"about_ca_topic_score_gemma":0.018696949,"teacher_disagreement_score":0.014004128,"about_ca_system_score_codex":0.001671074,"about_ca_system_score_gemma":0.001974061,"threshold_uncertainty_score":0.027845263},"labels":[],"label_agreement":null},{"id":"W1974591931","doi":"10.5539/ies.v5n6p36","title":"Organisational Pressure on Quality-of-worklife of Women in Tertiary Institutions in Lagos State, Nigeria","year":2012,"lang":"en","type":"article","venue":"International Education Studies","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Salary; Government (linguistics); Higher education; Workload; Population; Productivity; Economic growth; Public relations; Sociology; Psychology; Medical education; Political science; Management; Medicine; Economics","score_opus":0.2605636173937204,"score_gpt":0.5162296404073449,"score_spread":0.25566602301362445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974591931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9993667,0.00015598848,0.0000062891963,0.00012200084,0.000004652814,0.0000051828083,0.000026665672,3.5104318e-7,0.00031208753],"genre_scores_gemma":[0.99954814,0.00018726695,0.000015419113,0.000048886224,0.000004751385,0.0000054435227,0.000016584358,3.325336e-7,0.00017309174],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99947804,0.00014946471,0.00005146446,0.00003702158,0.00006655177,0.00021742278],"domain_scores_gemma":[0.99841833,0.0003218357,0.00063497736,0.00002916328,0.00013528205,0.00046034183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061835145,0.00017936474,0.00021396793,0.00063089974,0.0015632847,0.0009910446,0.00024803233,0.00031935945,0.0025426296],"category_scores_gemma":[0.0022728594,0.0002589693,0.00018297658,0.000796938,0.00072137814,0.00044312194,0.0008397404,0.0005144858,0.00017270226],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000584544,0.00012161108,0.9871142,0.000046621913,0.0000074256,0.00023572249,0.00822164,0.000013663005,0.00020764976,0.00007745383,0.00018618716,0.0037095442],"study_design_scores_gemma":[0.000003688971,0.00018897332,0.9646146,0.00007778871,0.0000075283574,0.00018600986,0.03423373,0.000035662873,0.0000492752,0.00004057781,0.0005554153,0.0000067018004],"about_ca_topic_score_codex":0.014726711,"about_ca_topic_score_gemma":0.030100781,"teacher_disagreement_score":0.014726711,"about_ca_system_score_codex":0.0009271871,"about_ca_system_score_gemma":0.001290807,"threshold_uncertainty_score":0.029281974},"labels":[],"label_agreement":null},{"id":"W1976051387","doi":"10.1016/j.disopt.2008.12.004","title":"A Benders approach for computing lower bounds for the mirrored traveling tournament problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tournament; Benchmark (surveying); Benders' decomposition; Mathematical optimization; Mathematics; Tournament selection; Upper and lower bounds; Computer science; Combinatorics","score_opus":0.10718468775808698,"score_gpt":0.382185916378766,"score_spread":0.275001228620679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976051387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012033731,0.0002404625,0.98212343,0.00026596218,0.00007740037,0.00007773844,0.00014688962,0.0005008062,0.004533546],"genre_scores_gemma":[0.18306708,0.0005638121,0.8067288,0.0003179923,0.00024400017,0.00045529532,0.00093598576,0.00044370117,0.0072432887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983834,0.0005903241,0.00008784239,0.00030849656,0.00043005848,0.00019999918],"domain_scores_gemma":[0.9953715,0.0033022014,0.00032406836,0.00041083116,0.0003980809,0.0001932948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035258115,0.002018841,0.0019076539,0.0025772944,0.0009995741,0.0030858712,0.0030249215,0.0021188254,0.012749592],"category_scores_gemma":[0.0140286805,0.0014895678,0.0024042663,0.00271563,0.0013997948,0.0037730539,0.002014805,0.004417202,0.0016811459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031905225,0.0002683692,0.00061681337,0.00019084603,0.00013036444,0.00006248349,0.00012332162,0.7639374,0.0020819795,0.09951786,0.0058643585,0.12688717],"study_design_scores_gemma":[0.00003903243,0.00007009875,0.00010083348,0.000021202935,0.000022848353,0.000012978348,0.000015543688,0.93770146,0.0004940509,0.06062101,0.00088737794,0.000013593438],"about_ca_topic_score_codex":0.004477689,"about_ca_topic_score_gemma":0.0046933666,"teacher_disagreement_score":0.012749592,"about_ca_system_score_codex":0.0019241341,"about_ca_system_score_gemma":0.001995798,"threshold_uncertainty_score":0.042651594},"labels":[],"label_agreement":null},{"id":"W1977506979","doi":"10.1007/s10951-013-0324-2","title":"A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Heuristic; Scheduling (production processes); Time horizon; Schedule; Work (physics); Integer programming; Mathematical optimization; Operations research; Task (project management); Algorithm; Mathematics; Artificial intelligence; Engineering","score_opus":0.12207386276816669,"score_gpt":0.4204414114669095,"score_spread":0.2983675486987428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977506979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084639244,0.0002058382,0.9074316,0.00037847992,0.00012990226,0.0005865518,0.00017541916,0.0005269402,0.0059260316],"genre_scores_gemma":[0.48347837,0.00011406938,0.5126871,0.00015230174,0.000039240083,0.00061597204,0.00025254962,0.00011964063,0.002540738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.00032921377,0.000035988887,0.000121408986,0.00016062081,0.00021595761],"domain_scores_gemma":[0.99824345,0.0012526156,0.00011540774,0.00008681031,0.00015809792,0.00014353852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020286592,0.0010198161,0.0016930802,0.0017264549,0.0009777215,0.0014380867,0.00263781,0.0018299051,0.0061283517],"category_scores_gemma":[0.00319735,0.001300654,0.0012646785,0.0014835064,0.00074200495,0.0016969104,0.0013769685,0.0011464156,0.00050422084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038268822,0.00045453195,0.00032842343,0.00014570588,0.00003985235,0.000071282506,0.00009405837,0.934315,0.0025349448,0.007050652,0.0012161388,0.053366754],"study_design_scores_gemma":[0.00014336724,0.000135675,0.00013914061,0.000010229948,0.000019983932,0.000017493743,0.000026029731,0.99598026,0.000677311,0.0023588836,0.00047641873,0.000015212995],"about_ca_topic_score_codex":0.008013726,"about_ca_topic_score_gemma":0.008335254,"teacher_disagreement_score":0.008013726,"about_ca_system_score_codex":0.0018868822,"about_ca_system_score_gemma":0.0044343863,"threshold_uncertainty_score":0.020501316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11606419874026568,"score_gpt":0.36549903321524857,"score_spread":0.24943483447498288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982221171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110956706,0.00025979063,0.8278795,0.00087233883,0.0001500413,0.0015080773,0.0055708047,0.041474976,0.011327792],"genre_scores_gemma":[0.4103984,0.00015339065,0.58043796,0.00016907183,0.000038841677,0.0007520373,0.003843275,0.00050640304,0.0037006105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989698,0.0002522684,0.000121249854,0.00024921144,0.00031224784,0.000095314885],"domain_scores_gemma":[0.99644923,0.0019879094,0.00022681594,0.00023260764,0.00083827,0.00026524323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023248496,0.00093328353,0.0005334663,0.0011601986,0.0013753454,0.0018477251,0.0014148093,0.0006880937,0.0076679573],"category_scores_gemma":[0.007308733,0.0005049769,0.00047538098,0.0010334216,0.0003331352,0.0009863935,0.00075127016,0.0007391453,0.0010124159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013375868,0.0007419984,0.0065916674,0.00067674986,0.00012789472,0.0005095368,0.0008525652,0.46094784,0.021153104,0.017318886,0.03729421,0.45244795],"study_design_scores_gemma":[0.00017160458,0.00008136387,0.00066120067,0.000029836447,0.000030679545,0.000035367986,0.00009552344,0.97978425,0.004890574,0.002746548,0.011439759,0.000033209057],"about_ca_topic_score_codex":0.076362535,"about_ca_topic_score_gemma":0.06892751,"teacher_disagreement_score":0.076362535,"about_ca_system_score_codex":0.00303275,"about_ca_system_score_gemma":0.007003123,"threshold_uncertainty_score":0.15183616},"labels":[],"label_agreement":null},{"id":"W1984700723","doi":"10.5430/ijba.v2n2p137","title":"Staffing and Scheduling Emergency Rooms in Two Public Hospitals: A Case Study","year":2011,"lang":"en","type":"article","venue":"International Journal of Business Administration","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Staffing; Flexible scheduling; Emergency rooms; Health care; Medical emergency; Working hours; Medicine; Business; Nursing; Public health; Quality (philosophy); Psychology","score_opus":0.21076613576794573,"score_gpt":0.4387478128564436,"score_spread":0.22798167708849787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984700723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99752516,0.000040658626,0.0011475433,0.00013294353,0.000010262068,0.00006215549,0.00010049297,0.000020739579,0.0009600691],"genre_scores_gemma":[0.99557143,0.00011023731,0.002974328,0.00003760901,0.000012502435,0.0000665339,0.00014764303,0.000010401561,0.0010694446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99904674,0.0003726518,0.000039105988,0.00009893443,0.00012821713,0.00031427387],"domain_scores_gemma":[0.99642783,0.0022032154,0.0003937897,0.00013448483,0.0002856767,0.0005550519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011818875,0.0009155814,0.000540859,0.0009094406,0.0013851296,0.0012060209,0.0018782457,0.00243969,0.0027720768],"category_scores_gemma":[0.0028050349,0.00066860643,0.0010272573,0.0011087492,0.0008237723,0.00080018694,0.0009034876,0.0011417592,0.00024563257],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018185489,0.008879696,0.13185167,0.00031999833,0.00022588272,0.014514701,0.002939702,0.81247944,0.004408153,0.0030807606,0.0029623953,0.016519172],"study_design_scores_gemma":[0.00071358366,0.004035862,0.07353443,0.000061992934,0.00014898076,0.0018764071,0.019838495,0.8908478,0.0036491083,0.0010900024,0.0040671006,0.00013625204],"about_ca_topic_score_codex":0.048129685,"about_ca_topic_score_gemma":0.056092788,"teacher_disagreement_score":0.048129685,"about_ca_system_score_codex":0.0037039837,"about_ca_system_score_gemma":0.0016393899,"threshold_uncertainty_score":0.09569907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10923519215695703,"score_gpt":0.3547160647951978,"score_spread":0.24548087263824075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994932061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25577644,0.0009749988,0.7266912,0.00034801624,0.0002007174,0.00041705708,0.00022984201,0.00067350984,0.014688217],"genre_scores_gemma":[0.73437613,0.00029377113,0.26195058,0.00011771174,0.000065576896,0.0004487051,0.00018875621,0.00006962865,0.0024891312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942625,0.00022044619,0.00003491007,0.00008152955,0.00010954451,0.00012738883],"domain_scores_gemma":[0.99850756,0.0011413839,0.0000889581,0.000060533544,0.000118104836,0.00008350117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012547749,0.0008620823,0.0013872352,0.0018057775,0.0006700701,0.0014195747,0.0016725527,0.0017790383,0.0029391828],"category_scores_gemma":[0.0018772295,0.0008377299,0.0012846213,0.0016880328,0.0005018885,0.0010678469,0.00094735814,0.000731769,0.00020617817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018268568,0.00017065392,0.0004783023,0.000108222404,0.000087474094,0.0000531915,0.000037477075,0.96385926,0.0013907965,0.002368964,0.00041363307,0.0308493],"study_design_scores_gemma":[0.000048481426,0.000088384295,0.00011129337,0.00000663113,0.00002460927,0.000010840121,0.000019086136,0.9982443,0.0002710387,0.00096211873,0.0002074172,0.000005840227],"about_ca_topic_score_codex":0.0079894755,"about_ca_topic_score_gemma":0.007689212,"teacher_disagreement_score":0.0079894755,"about_ca_system_score_codex":0.0010135155,"about_ca_system_score_gemma":0.0018062708,"threshold_uncertainty_score":0.01588595},"labels":[],"label_agreement":null},{"id":"W1997034368","doi":"10.1007/s11518-008-5079-5","title":"Course timetabling at a Tunisian University: A case study","year":2008,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristic; Section (typography); Construct (python library); Set (abstract data type); Computer science; Quality (philosophy); Institution; Operations research; Mathematical optimization; Mathematics; Artificial intelligence; Programming language; Sociology","score_opus":0.1144175546695971,"score_gpt":0.3255640746633689,"score_spread":0.2111465199937718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997034368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99410075,0.00013736707,0.0015405155,0.00059566734,0.000024620338,0.0000894557,0.0002214415,0.000048051807,0.0032420778],"genre_scores_gemma":[0.9891312,0.00022852594,0.0035976241,0.00009036821,0.000023071476,0.00005279905,0.0002699837,0.000031024756,0.006575462],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991208,0.00021709834,0.00003080425,0.0001284125,0.00011690554,0.00038594045],"domain_scores_gemma":[0.99693066,0.001275178,0.00028769195,0.00013395555,0.000358774,0.0010137289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010563225,0.0005420036,0.00030726258,0.0009628628,0.005031308,0.0016360498,0.0019458197,0.0030156604,0.0067504672],"category_scores_gemma":[0.0028117318,0.00039431805,0.00056727725,0.001826441,0.00081509096,0.0008256909,0.00088230445,0.0011720904,0.0007523642],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005321235,0.027834093,0.24279,0.001385566,0.00045315508,0.112865075,0.029470365,0.2297194,0.026353117,0.02367735,0.028129937,0.27200073],"study_design_scores_gemma":[0.0015102152,0.0076818783,0.32249498,0.00053266675,0.0004430552,0.02467257,0.16263227,0.30774716,0.034388643,0.010238552,0.12720786,0.00045010587],"about_ca_topic_score_codex":0.07388402,"about_ca_topic_score_gemma":0.12013277,"teacher_disagreement_score":0.07388402,"about_ca_system_score_codex":0.0058138487,"about_ca_system_score_gemma":0.004447396,"threshold_uncertainty_score":0.14690793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Graph coloring; Computer science; Algorithm; Graph; Parallel computing; Theoretical computer science","score_opus":0.16187029454120339,"score_gpt":0.37319975074574746,"score_spread":0.21132945620454407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001287969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026759444,0.00016705444,0.96590906,0.00026306274,0.000059722483,0.0001604137,0.000086297456,0.0011509495,0.005444065],"genre_scores_gemma":[0.1901407,0.00017109569,0.8055734,0.00017340695,0.000034175173,0.00030516437,0.00030346485,0.00012017438,0.0031783832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00012897098,0.00001554301,0.000104928484,0.00018346596,0.00007056709],"domain_scores_gemma":[0.9996499,0.00016373901,0.00003931018,0.000045130073,0.0000776551,0.000024265579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066409056,0.00082596915,0.000720473,0.0008941329,0.00068768207,0.0005789892,0.0012591651,0.00093661563,0.0022475852],"category_scores_gemma":[0.0015316345,0.0003474354,0.00067753636,0.001199241,0.00054301607,0.00064319256,0.0007783066,0.00088284054,0.0004266357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006954966,0.00013477255,0.000698293,0.000058150494,0.000032864904,0.00007202891,0.000055866443,0.8428764,0.003961815,0.011283013,0.0029799175,0.13777728],"study_design_scores_gemma":[0.000031699285,0.00002132395,0.000096004784,0.000002730762,0.0000069351904,0.000020685708,0.000009144068,0.99467033,0.0005920089,0.0035770615,0.00096789416,0.0000041073736],"about_ca_topic_score_codex":0.011400698,"about_ca_topic_score_gemma":0.011258003,"teacher_disagreement_score":0.011400698,"about_ca_system_score_codex":0.001114804,"about_ca_system_score_gemma":0.002520598,"threshold_uncertainty_score":0.02266866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","score_opus":0.1211367297478479,"score_gpt":0.3512656153859113,"score_spread":0.23012888563806339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004802557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009865524,0.0018596769,0.96155226,0.0011523146,0.00037914238,0.00022361959,0.00040228423,0.00021597857,0.02434907],"genre_scores_gemma":[0.22249278,0.0062500527,0.7278253,0.0012171209,0.0016668277,0.0015208368,0.0018413467,0.0010326074,0.03615311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971486,0.001087529,0.00010472313,0.00042631404,0.00080455095,0.0004283846],"domain_scores_gemma":[0.9897065,0.0080322055,0.00047172137,0.0007105263,0.0007570957,0.0003219377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036476415,0.003747964,0.0036554034,0.0024527586,0.0017622262,0.006103266,0.0046178764,0.0036406987,0.013064525],"category_scores_gemma":[0.015694572,0.0024839644,0.0039767795,0.0072102323,0.0030350161,0.008708119,0.0032290325,0.009220511,0.0017521956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022555821,0.0003394868,0.00032111158,0.0005890022,0.00008453647,0.000056011344,0.00037028707,0.42163756,0.0008932846,0.4698707,0.019924179,0.08568825],"study_design_scores_gemma":[0.000048555303,0.00007137011,0.00013912396,0.000083999956,0.000042087006,0.00005117508,0.000073880634,0.6464001,0.00077216525,0.34718975,0.0050979513,0.000029894176],"about_ca_topic_score_codex":0.008639455,"about_ca_topic_score_gemma":0.006711199,"teacher_disagreement_score":0.013064525,"about_ca_system_score_codex":0.0056019556,"about_ca_system_score_gemma":0.0031228082,"threshold_uncertainty_score":0.043705225},"labels":[],"label_agreement":null},{"id":"W2008488464","doi":"10.1016/j.disopt.2007.11.003","title":"Solving mirrored traveling tournament problem benchmark instances with eight teams","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tournament; Benchmark (surveying); Mathematical optimization; Mathematics; Travelling salesman problem; Computer science; Tournament selection; Operations research; Combinatorics","score_opus":0.05474765679449342,"score_gpt":0.31433579169288123,"score_spread":0.25958813489838783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008488464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94633365,0.00035699081,0.034076285,0.00057063566,0.00023606219,0.00031217557,0.0014830609,0.00054874795,0.016082369],"genre_scores_gemma":[0.92848486,0.00010715347,0.06470279,0.000101160265,0.000051463423,0.0002672278,0.0015753072,0.00009676227,0.0046131783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991567,0.00033999435,0.000040969026,0.0001670052,0.000116588635,0.00017872466],"domain_scores_gemma":[0.99694854,0.002132875,0.00021638663,0.00022787797,0.00022871597,0.0002456705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017099598,0.001176909,0.0012760698,0.0009843047,0.000707788,0.0013642769,0.0019491331,0.0018093219,0.0055359337],"category_scores_gemma":[0.0061390433,0.0005263908,0.0008306298,0.0011689878,0.00043696185,0.001128274,0.00071037246,0.0011611754,0.00029322322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011355116,0.0009437566,0.002392687,0.00032578094,0.00018436895,0.00020788332,0.00006394435,0.93506217,0.0016064361,0.006023791,0.008017663,0.044036042],"study_design_scores_gemma":[0.00028531946,0.00041665244,0.0007536644,0.000011976079,0.000031482763,0.000036286478,0.00005638584,0.993453,0.0013223772,0.002674402,0.000949473,0.000009037777],"about_ca_topic_score_codex":0.0066909813,"about_ca_topic_score_gemma":0.0069282963,"teacher_disagreement_score":0.0066909813,"about_ca_system_score_codex":0.0015517665,"about_ca_system_score_gemma":0.0014138886,"threshold_uncertainty_score":0.01851952},"labels":[],"label_agreement":null},{"id":"W2009600143","doi":"10.5539/ass.v7n8p107","title":"Methodology to Minimise the Abandonment of Web Page Navigation Using the Tabu Search Algorithm","year":2011,"lang":"en","type":"article","venue":"Asian Social Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Computer science; Abandonment (legal); Web page; Metaheuristic; Algorithm; Noise (video); Quality (philosophy); Data mining; Artificial intelligence; World Wide Web","score_opus":0.43144970888256673,"score_gpt":0.4766894539130123,"score_spread":0.04523974503044559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009600143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125928465,0.0003918336,0.983868,0.00016128669,0.000047937723,0.00018081469,0.000030959836,0.0003342878,0.0023920473],"genre_scores_gemma":[0.16321714,0.0003415175,0.8333082,0.0001135769,0.000040781913,0.0004923351,0.00009762894,0.00019592799,0.0021928472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851495,0.00075898366,0.000059646445,0.00014257399,0.00039150644,0.00013232601],"domain_scores_gemma":[0.99776196,0.0013836495,0.00026902315,0.00011984359,0.0003914611,0.000074069474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035244932,0.0010006097,0.0014612986,0.001748578,0.0006404158,0.001217379,0.0022260288,0.0014831468,0.0034033128],"category_scores_gemma":[0.007132226,0.0006162238,0.0010393942,0.0015988734,0.00092400605,0.0009877523,0.0009426842,0.001327846,0.00046765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008204501,0.00012143784,0.0007152517,0.00022326552,0.00011060576,0.000045022858,0.00016021436,0.8218677,0.002636284,0.020097945,0.0016309434,0.15230927],"study_design_scores_gemma":[0.000039277158,0.00014319413,0.00019220497,0.000034225064,0.000034986137,0.000036175497,0.000042847765,0.9901578,0.0011288016,0.0062428038,0.0019338842,0.000013715934],"about_ca_topic_score_codex":0.0057532955,"about_ca_topic_score_gemma":0.0044512944,"teacher_disagreement_score":0.0057532955,"about_ca_system_score_codex":0.0014075582,"about_ca_system_score_gemma":0.003547668,"threshold_uncertainty_score":0.018639565},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Artificial bee colony algorithm; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Engineering; Mathematics","score_opus":0.13026074314852312,"score_gpt":0.38163602182613965,"score_spread":0.25137527867761655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012973940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09304655,0.005300656,0.86158526,0.0013421426,0.00023270429,0.00046251243,0.000534606,0.00069417106,0.036801398],"genre_scores_gemma":[0.60715413,0.003735277,0.37578583,0.00024137022,0.0000801996,0.00087267946,0.0008158296,0.00007334523,0.011241318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969494,0.00012797292,0.000020509731,0.00003989304,0.000089598296,0.000027091495],"domain_scores_gemma":[0.99966645,0.0001974767,0.000044090077,0.000018445642,0.000059937287,0.000013559624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035345662,0.0005988483,0.00061398663,0.0005496101,0.0003667661,0.00066357496,0.0006981339,0.00092566136,0.0017124946],"category_scores_gemma":[0.0011522977,0.00018809832,0.0004449096,0.0010093873,0.00022055695,0.00045631675,0.00036786613,0.0006278648,0.0002768845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061488936,0.000077237615,0.0005799565,0.00024685365,0.00004675379,0.00030770872,0.000058176152,0.9129155,0.004863378,0.010947387,0.004802908,0.065092586],"study_design_scores_gemma":[0.000023316856,0.000041335694,0.00025089917,0.000022481543,0.000014729225,0.00011550935,0.000019498635,0.98915327,0.0007806629,0.005025282,0.0045453357,0.000007685952],"about_ca_topic_score_codex":0.0032169872,"about_ca_topic_score_gemma":0.002482337,"teacher_disagreement_score":0.0032169872,"about_ca_system_score_codex":0.00041209353,"about_ca_system_score_gemma":0.00072635984,"threshold_uncertainty_score":0.006396532},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.4968872769107157,"score_gpt":0.4637269991699302,"score_spread":0.033160277740785504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014856631","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014046503,0.09095541,0.88053995,0.0010534456,0.000117539246,0.0003341153,0.0005064251,0.001307268,0.011139317],"genre_scores_gemma":[0.050214972,0.054916933,0.8904464,0.0003629585,0.0001242241,0.0003141764,0.00080429466,0.0002593857,0.0025566416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99587834,0.0013282822,0.00050645386,0.00055452046,0.0015730791,0.00015930335],"domain_scores_gemma":[0.9910261,0.006330024,0.00048957684,0.0007144323,0.0013479982,0.00009190191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004520689,0.0011122545,0.0013755817,0.0054336055,0.00065638445,0.0025989509,0.0024466864,0.0011495901,0.0035154435],"category_scores_gemma":[0.012416474,0.0010327066,0.0015224875,0.008532959,0.0006199335,0.002634384,0.00076174235,0.001078323,0.0010863122],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007179347,0.00023696198,0.0021978044,0.0038800766,0.00013264426,0.00005577663,0.00016680165,0.024146015,0.003580521,0.022897627,0.0045819893,0.93805194],"study_design_scores_gemma":[0.0002372118,0.00091500365,0.008135487,0.004233545,0.0005287926,0.0017316439,0.00077991036,0.586015,0.021350052,0.108423054,0.26743805,0.00021228738],"about_ca_topic_score_codex":0.0040732664,"about_ca_topic_score_gemma":0.005476721,"teacher_disagreement_score":0.0054336055,"about_ca_system_score_codex":0.0012708185,"about_ca_system_score_gemma":0.0026493187,"threshold_uncertainty_score":0.02390796},"labels":[],"label_agreement":null},{"id":"W2015655819","doi":"10.1287/inte.1120.0632","title":"Introduction to the Special Issue on Analytics in Sports, Part II: Sports Scheduling Applications","year":2012,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"League; Football; Scheduling (production processes); Analytics; Sport management; Recreation; Operations research; Computer science; Engineering; Advertising; Data science; Business; Political science; Public relations; Operations management","score_opus":0.05280231666078187,"score_gpt":0.34032686957096836,"score_spread":0.28752455291018647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015655819","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023241467,0.08931754,0.107295625,0.052896366,0.66671205,0.00094955857,0.0036001725,0.003437458,0.073467106],"genre_scores_gemma":[0.0070551746,0.0925229,0.030090109,0.025185144,0.65015876,0.00063785986,0.0060760276,0.002181702,0.18609229],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975425,0.00033717405,0.00033801564,0.00050485274,0.001113263,0.00016423244],"domain_scores_gemma":[0.98852414,0.0048762998,0.0005982341,0.0007439892,0.0040490883,0.0012081101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022438937,0.0020820135,0.002170642,0.004537613,0.0011714692,0.006183738,0.0015086958,0.0027258717,0.058975585],"category_scores_gemma":[0.008777354,0.0009843938,0.0019872834,0.005112097,0.0008950415,0.0053160843,0.0024388153,0.0060920455,0.041488577],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027156675,0.00007921368,0.00023309591,0.00043874656,0.000023255088,0.00007020574,0.000029853121,0.00048367336,0.0006772983,0.0016245503,0.9089737,0.08733919],"study_design_scores_gemma":[0.000011523323,0.00007498667,0.0008863326,0.0002978828,0.00001950617,0.000315436,0.00004811038,0.001296285,0.0002726996,0.004301667,0.99244726,0.000028215525],"about_ca_topic_score_codex":0.00087538053,"about_ca_topic_score_gemma":0.0012387737,"teacher_disagreement_score":0.058975585,"about_ca_system_score_codex":0.0009508581,"about_ca_system_score_gemma":0.0015941246,"threshold_uncertainty_score":0.19729298},"labels":[],"label_agreement":null},{"id":"W2017171373","doi":"10.3138/infor.52.1.1","title":"Election Day Routing of Rapid Response Attorneys","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polling; Presidential election; Heuristic; Computer science; Politics; Routing (electronic design automation); Simulated annealing; Operations research; Public administration; Political science; Public relations; Computer network; Law; Engineering; Algorithm; Artificial intelligence","score_opus":0.17759857679059707,"score_gpt":0.44260514762068814,"score_spread":0.26500657083009105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017171373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68632764,0.0004604765,0.27931914,0.003603377,0.00037345506,0.0006255696,0.00048384824,0.0007593415,0.028047184],"genre_scores_gemma":[0.95784813,0.00006815245,0.033991367,0.00010599893,0.0000329797,0.000077814584,0.00018506774,0.000056913424,0.007633579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823475,0.0008741738,0.00003641901,0.00025051425,0.00016635061,0.00043778127],"domain_scores_gemma":[0.99738425,0.0012713936,0.0002704049,0.00022369646,0.00042024127,0.00043009335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019028797,0.00025825942,0.00061782065,0.0005317529,0.0012397954,0.0015679633,0.0012212313,0.0013309029,0.008877902],"category_scores_gemma":[0.005887833,0.00038638373,0.00036021107,0.00056840875,0.00048539127,0.0008964963,0.0007252483,0.0010881511,0.0005160061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046960355,0.0003765405,0.0041423384,0.000083588835,0.00005506805,0.00017195045,0.00041250107,0.8826428,0.0024438857,0.03828753,0.013553286,0.057360925],"study_design_scores_gemma":[0.00006777332,0.00021246538,0.001184495,0.000011510859,0.00001340081,0.000046847974,0.00052294874,0.97862387,0.0012222668,0.010976279,0.007098249,0.00001982798],"about_ca_topic_score_codex":0.012848146,"about_ca_topic_score_gemma":0.014936551,"teacher_disagreement_score":0.012848146,"about_ca_system_score_codex":0.0017359573,"about_ca_system_score_gemma":0.0027122796,"threshold_uncertainty_score":0.029699564},"labels":[],"label_agreement":null},{"id":"W2017962074","doi":"10.1080/07408170903113789","title":"Can flexibility be constraining?","year":2009,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Flexibility (engineering); Workforce; Robustness (evolution); Operations management; Business; Industrial organization; Computer science; Economics; Operations research; Microeconomics; Engineering; Management; Economic growth; Chemistry","score_opus":0.22849023704179974,"score_gpt":0.42513271523553875,"score_spread":0.196642478193739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017962074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33011442,0.007861624,0.45442483,0.030158957,0.00068460626,0.00012892883,0.0012419099,0.00041827434,0.17496634],"genre_scores_gemma":[0.98553157,0.0012639114,0.008521884,0.000653341,0.00014705115,0.000058750073,0.00010539864,0.000054445936,0.0036636547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970041,0.00112613,0.000117132324,0.000583648,0.00037785326,0.00079113164],"domain_scores_gemma":[0.9822465,0.012749321,0.0020196398,0.001666989,0.00049700786,0.0008204909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038891954,0.00089736545,0.0010060343,0.00076864916,0.00085930043,0.004014186,0.0015437668,0.0028341424,0.012619933],"category_scores_gemma":[0.031066127,0.0007296834,0.0012812915,0.0014078928,0.0038380746,0.007524335,0.0027233555,0.0022907974,0.0007362187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019763254,0.0000458645,0.0023791343,0.00023770705,0.00010299967,0.0005067394,0.00036313845,0.2050459,0.00077368814,0.7538522,0.004034887,0.0324601],"study_design_scores_gemma":[0.000020617983,0.000042368018,0.0008551526,0.00009089363,0.000020598723,0.00017082162,0.00028630003,0.07429209,0.00026073458,0.917445,0.006469193,0.000046286485],"about_ca_topic_score_codex":0.0030983433,"about_ca_topic_score_gemma":0.0022342764,"teacher_disagreement_score":0.012619933,"about_ca_system_score_codex":0.0013255185,"about_ca_system_score_gemma":0.0011799632,"threshold_uncertainty_score":0.04221791},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.17326229154974396,"score_gpt":0.37690683939622843,"score_spread":0.20364454784648447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021735068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09249604,0.0018268251,0.8861065,0.0018582019,0.00021132379,0.00019300888,0.0006289262,0.0009726152,0.01570661],"genre_scores_gemma":[0.6065672,0.0009999223,0.376693,0.00041526553,0.00021487287,0.0004107584,0.0010315372,0.00032357356,0.013343854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901617,0.00051221764,0.00002720362,0.00013536162,0.00015001355,0.00015898443],"domain_scores_gemma":[0.9957325,0.0036014728,0.00017210587,0.00019276376,0.0001696038,0.00013150462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015466742,0.0008330862,0.0017635913,0.0016204116,0.00084237586,0.0015444299,0.0014157541,0.00140631,0.006487034],"category_scores_gemma":[0.0073114005,0.0006283452,0.0010286494,0.0027995436,0.0014592459,0.0021628148,0.0012804199,0.0020004287,0.00050761335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034669437,0.00019949714,0.0007319249,0.00026310713,0.00008125181,0.0000399445,0.00015188944,0.77296704,0.0007042496,0.1078022,0.009151567,0.10756058],"study_design_scores_gemma":[0.00005638928,0.0000385949,0.00010877532,0.000016919643,0.000012195247,0.000009465947,0.000030506197,0.8918463,0.0002078114,0.10662545,0.0010410309,0.000006558202],"about_ca_topic_score_codex":0.011374383,"about_ca_topic_score_gemma":0.009646769,"teacher_disagreement_score":0.011374383,"about_ca_system_score_codex":0.0017367873,"about_ca_system_score_gemma":0.0024911372,"threshold_uncertainty_score":0.022616327},"labels":[],"label_agreement":null},{"id":"W2022719899","doi":"10.1504/ijor.2012.046225","title":"A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem","year":2012,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Crew scheduling; Crew; Computer science; Particle swarm optimization; Mathematical optimization; Scheduling (production processes); Job shop scheduling; Computation; Algorithm; Mathematics; Engineering; Schedule","score_opus":0.2795078096338571,"score_gpt":0.5221592985759994,"score_spread":0.24265148894214233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022719899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01161753,0.0001582131,0.9844413,0.00009136644,0.000062356616,0.00004820002,0.000031945645,0.00036742803,0.0031817236],"genre_scores_gemma":[0.3904576,0.000285905,0.60461575,0.00009998074,0.000050368348,0.00039130828,0.00017358387,0.000100719444,0.0038248342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967,0.00011916904,0.000018038187,0.00005787444,0.000106054846,0.000028935825],"domain_scores_gemma":[0.99953425,0.00026542298,0.000042439337,0.00004403924,0.00009007486,0.000023776225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007566549,0.00065903715,0.00084883673,0.00044601678,0.00045105623,0.0006977145,0.000967574,0.0010240634,0.0014917005],"category_scores_gemma":[0.0014936336,0.0003882502,0.0007482593,0.0005037366,0.00044389497,0.0005834898,0.0006757002,0.0008187114,0.00026369147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035120254,0.000027074151,0.000367405,0.00004021622,0.00003661924,0.000040919404,0.000033249096,0.9673296,0.0015933142,0.0052521643,0.0006526937,0.024591537],"study_design_scores_gemma":[0.000007653879,0.000011637384,0.000037990703,0.000001960635,0.0000033121974,0.0000071954837,0.000001787751,0.9987594,0.0001794791,0.0004400693,0.00054747064,0.0000021416747],"about_ca_topic_score_codex":0.004530814,"about_ca_topic_score_gemma":0.003044843,"teacher_disagreement_score":0.004530814,"about_ca_system_score_codex":0.00039580758,"about_ca_system_score_gemma":0.0007429984,"threshold_uncertainty_score":0.009008884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.43082897586275787,"score_gpt":0.49476757588424486,"score_spread":0.06393860002148699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024143101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0997325,0.0002727495,0.8824962,0.0003260198,0.00024448757,0.0006243643,0.00027441327,0.0020165283,0.014012739],"genre_scores_gemma":[0.33258316,0.000098751305,0.6624371,0.00014823605,0.00004059743,0.0003679309,0.00028824373,0.0002529497,0.0037829946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00032808105,0.00002779425,0.00010659108,0.00013944348,0.00012219376],"domain_scores_gemma":[0.9987208,0.00060010736,0.00008757601,0.00027570172,0.00022119709,0.00009453371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133256,0.00077162695,0.0010103201,0.0018326263,0.0014059064,0.0011524392,0.0034723568,0.0013988647,0.0068412856],"category_scores_gemma":[0.0032363294,0.0007860666,0.0009214165,0.0021057334,0.0008725862,0.0013321285,0.0010975971,0.0010201975,0.0007204256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004781032,0.00036496288,0.00046223003,0.00016213303,0.00007279806,0.000067327586,0.00013981007,0.79086703,0.006919388,0.029211598,0.003883569,0.16737114],"study_design_scores_gemma":[0.00012749113,0.000138219,0.00013046285,0.000013236041,0.00003371912,0.00002158151,0.00002720494,0.99208343,0.0015256392,0.00471338,0.0011641682,0.00002157651],"about_ca_topic_score_codex":0.0088880155,"about_ca_topic_score_gemma":0.009264984,"teacher_disagreement_score":0.0088880155,"about_ca_system_score_codex":0.0014818917,"about_ca_system_score_gemma":0.0023632308,"threshold_uncertainty_score":0.022886336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11761767039113327,"score_gpt":0.3762298569327138,"score_spread":0.2586121865415806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026561227,0.0005586134,0.96344423,0.0006208772,0.00018350978,0.0003127924,0.00019666481,0.00089545146,0.007226578],"genre_scores_gemma":[0.22208378,0.0005099044,0.7702034,0.00020201171,0.00014419938,0.0005067028,0.0004956086,0.00027859263,0.005575775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993851,0.00017757644,0.00002779994,0.000089086476,0.00018655269,0.0001338994],"domain_scores_gemma":[0.9985618,0.001011565,0.00006906657,0.000050161052,0.00018184698,0.00012560628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015750021,0.0011379161,0.0024502245,0.0015163406,0.0011599936,0.0016795588,0.0021048808,0.0025576586,0.01058606],"category_scores_gemma":[0.0032125956,0.00097364816,0.0009780085,0.0021315587,0.000662062,0.001973977,0.0014160749,0.0021059567,0.0010853078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042410704,0.00039775678,0.0005255836,0.0001989075,0.00006954021,0.000086746804,0.00008870448,0.7443095,0.0023152863,0.014124514,0.0077867573,0.2296727],"study_design_scores_gemma":[0.00009406194,0.00006398637,0.000079351674,0.000007854377,0.000013170628,0.000013529278,0.000013638407,0.9941169,0.00019927713,0.004738608,0.0006531519,0.000006422158],"about_ca_topic_score_codex":0.011073649,"about_ca_topic_score_gemma":0.009686693,"teacher_disagreement_score":0.011073649,"about_ca_system_score_codex":0.0014087886,"about_ca_system_score_gemma":0.003435202,"threshold_uncertainty_score":0.03541386},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055983975226454395,"score_gpt":0.3383749230511079,"score_spread":0.2823909478246535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034555835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17040499,0.00029993663,0.8205124,0.00032573697,0.00015884291,0.00026843898,0.00024512655,0.0002984082,0.007486155],"genre_scores_gemma":[0.8657611,0.00019570414,0.12443979,0.000051631218,0.00013032355,0.00027701393,0.00017396695,0.00009995991,0.008870411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982185,0.0005804183,0.00009762018,0.00028033022,0.00039960843,0.0004235444],"domain_scores_gemma":[0.9952773,0.002374447,0.00061602716,0.0009039771,0.0003795067,0.00044870345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026848824,0.0008891073,0.0019123927,0.00071309065,0.0010499536,0.0017954098,0.003915043,0.00126799,0.0063159503],"category_scores_gemma":[0.007116717,0.0011155652,0.0010290287,0.0015434986,0.0010622886,0.003232042,0.002422772,0.00229464,0.00057340565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022707328,0.00066038436,0.0013062113,0.00038348412,0.00009277112,0.00014854108,0.0004240239,0.80611426,0.008945377,0.07527008,0.002176702,0.10220747],"study_design_scores_gemma":[0.00016592118,0.00045329318,0.00059597933,0.000022705386,0.000043425767,0.00004330889,0.00007421218,0.959169,0.0016600585,0.03569779,0.0020418512,0.000032490232],"about_ca_topic_score_codex":0.0025834818,"about_ca_topic_score_gemma":0.003030993,"teacher_disagreement_score":0.0063159503,"about_ca_system_score_codex":0.000835567,"about_ca_system_score_gemma":0.0023492877,"threshold_uncertainty_score":0.021128953},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20855653994690412,"score_gpt":0.3669972140349245,"score_spread":0.1584406740880204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035237530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01235004,0.00015846336,0.98364383,0.00011686316,0.000035745892,0.0001022259,0.000130155,0.0006464638,0.0028161737],"genre_scores_gemma":[0.27194858,0.00018238998,0.72217774,0.0002045205,0.00006245386,0.00033131643,0.00047984553,0.0002675654,0.0043455716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929714,0.00022877712,0.00002964335,0.00010358097,0.00026913686,0.00007172327],"domain_scores_gemma":[0.99871683,0.00071301276,0.000085832406,0.00014265261,0.00029322493,0.000048488055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089986983,0.0008008861,0.0013219089,0.0015172837,0.000527588,0.00096267427,0.001884982,0.0009974398,0.0069613196],"category_scores_gemma":[0.0019055497,0.00070758065,0.000982058,0.0019011444,0.00040870317,0.0009803299,0.0006993315,0.0008824369,0.00069945946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120531375,0.00015020414,0.0002280238,0.00014106026,0.00006411992,0.000080757425,0.000035223526,0.84589577,0.0038114074,0.008583693,0.0026153594,0.13827392],"study_design_scores_gemma":[0.000011819646,0.000018177643,0.000037876034,0.0000030338053,0.0000101014075,0.000010771839,0.0000034247512,0.9972187,0.00046150247,0.0018975559,0.00032267417,0.000004312417],"about_ca_topic_score_codex":0.006799911,"about_ca_topic_score_gemma":0.008158528,"teacher_disagreement_score":0.0069613196,"about_ca_system_score_codex":0.0007994153,"about_ca_system_score_gemma":0.0012747481,"threshold_uncertainty_score":0.023287892},"labels":[],"label_agreement":null},{"id":"W2040214474","doi":"10.1016/s1571-0653(05)80155-6","title":"Finding the chromatic number by means of critical graphs","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Critical graph; Random graph; Graph coloring; Graph; Discrete mathematics; Induced subgraph; Benchmark (surveying); Graph power; Line graph; Vertex (graph theory)","score_opus":0.04836182007686702,"score_gpt":0.384074163802534,"score_spread":0.335712343725667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040214474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37875947,0.00072372565,0.6015636,0.0006178701,0.00010758621,0.00018628345,0.00072743837,0.00063094345,0.016683083],"genre_scores_gemma":[0.8162389,0.0005419162,0.17755944,0.00012374326,0.00008590365,0.00013971278,0.0009539563,0.00022363586,0.0041327956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997801,0.000043209813,0.000006216184,0.000085326225,0.000041193045,0.000043892986],"domain_scores_gemma":[0.9967874,0.0020826994,0.00036503648,0.00018982924,0.0003331848,0.00024179429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043227777,0.00097212155,0.0006626068,0.0041115596,0.0011399253,0.0013107093,0.0012587568,0.00093184144,0.0062843603],"category_scores_gemma":[0.006037301,0.0006731042,0.00050152984,0.0019072046,0.0014914995,0.002426158,0.00081552216,0.0010933705,0.0004213676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079704117,0.00026393606,0.014013825,0.0007918162,0.00014964439,0.00035439525,0.00048310033,0.43634146,0.028285103,0.3278626,0.012672781,0.17798425],"study_design_scores_gemma":[0.00006633243,0.00008915345,0.0024749113,0.00006567478,0.000057462905,0.00013688466,0.0001663166,0.6510197,0.006440514,0.33584115,0.0035984241,0.00004355094],"about_ca_topic_score_codex":0.005494249,"about_ca_topic_score_gemma":0.0060499758,"teacher_disagreement_score":0.0062843603,"about_ca_system_score_codex":0.0013613559,"about_ca_system_score_gemma":0.0010743205,"threshold_uncertainty_score":0.021023273},"labels":[],"label_agreement":null},{"id":"W2043785549","doi":"10.1145/1160633.1160901","title":"An agent based general solution model for the course timetabling problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Generality; Computer science; Modularity (biology); Course (navigation); Flexibility (engineering); Scalability; Constraint (computer-aided design); Mathematical optimization; Distributed computing; Artificial intelligence; Mathematics; Engineering","score_opus":0.15697938250818838,"score_gpt":0.40307989349526147,"score_spread":0.24610051098707308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043785549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041354136,0.000082045495,0.9912305,0.00022071898,0.000026524887,0.00006603975,0.00005908405,0.00015013621,0.004029484],"genre_scores_gemma":[0.14392895,0.00047573872,0.84414107,0.00016687375,0.000054005024,0.00051733694,0.00038539342,0.00009476207,0.010235837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939466,0.0001850464,0.000032136344,0.00014724159,0.00017447244,0.00006652046],"domain_scores_gemma":[0.9996592,0.00013930819,0.00004961179,0.000047240545,0.00007609734,0.000028546956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094668503,0.00063235115,0.00058825297,0.0005116257,0.00063369714,0.0012429736,0.0019776602,0.0013552939,0.0049197436],"category_scores_gemma":[0.0014529271,0.00036317317,0.0010972264,0.0008759275,0.0007682248,0.0019772528,0.0011034928,0.0013231548,0.0007378538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048609276,0.000078371566,0.00036215148,0.00015940769,0.000040302464,0.00015511163,0.000204018,0.60597837,0.003046954,0.34552884,0.0034990315,0.040898755],"study_design_scores_gemma":[0.00003168315,0.000043237847,0.00008880718,0.000015457841,0.000018767421,0.000062380714,0.000033760327,0.9317492,0.0005935223,0.053262748,0.0140876,0.000012890088],"about_ca_topic_score_codex":0.00662326,"about_ca_topic_score_gemma":0.008589886,"teacher_disagreement_score":0.00662326,"about_ca_system_score_codex":0.0012380324,"about_ca_system_score_gemma":0.0021417404,"threshold_uncertainty_score":0.016458154},"labels":[],"label_agreement":null},{"id":"W2050600071","doi":"10.1080/00207160903023565","title":"CsegGraph: a graph colouring instance generator","year":2009,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Block graph; Partition (number theory); Frequency partition of a graph; Graph partition; Graph; Discrete mathematics; Petersen graph; Butterfly graph; Line graph; Graph power; Voltage graph; Pathwidth","score_opus":0.08652782290873272,"score_gpt":0.3839386795999732,"score_spread":0.29741085669124045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050600071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021980707,0.00009933829,0.93862563,0.0002917199,0.00011196398,0.0003907109,0.0017423918,0.031545103,0.005212393],"genre_scores_gemma":[0.20846125,0.000095971285,0.7782673,0.00019154437,0.00004695895,0.00057275215,0.00491831,0.0028725013,0.0045733955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936205,0.00015459006,0.00002661243,0.00017050537,0.00020299366,0.000083330364],"domain_scores_gemma":[0.9986368,0.0005907389,0.00008421803,0.00042958322,0.00017115977,0.00008755076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095057685,0.0008214907,0.0005240319,0.0011089963,0.0003318957,0.0011373531,0.0024051345,0.00089056906,0.011948583],"category_scores_gemma":[0.004474912,0.00051313144,0.0008844563,0.0010408137,0.00046797196,0.0014275672,0.0014914875,0.0013060706,0.002313775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088889024,0.0004970071,0.0038280038,0.00048914074,0.00013424996,0.0004911824,0.00017727513,0.38640735,0.024084669,0.07417276,0.06527809,0.44355133],"study_design_scores_gemma":[0.00009846928,0.00007194383,0.00031682046,0.000011214866,0.000012688344,0.00011274528,0.000019332274,0.9553507,0.00846413,0.02338451,0.012140019,0.000017358845],"about_ca_topic_score_codex":0.0022546323,"about_ca_topic_score_gemma":0.0029807421,"teacher_disagreement_score":0.011948583,"about_ca_system_score_codex":0.0010919616,"about_ca_system_score_gemma":0.0015044357,"threshold_uncertainty_score":0.039972007},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2117213361653014,"score_gpt":0.46105186763497386,"score_spread":0.24933053146967246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050784217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05126768,0.00021993248,0.9390618,0.00053475844,0.00009296502,0.0003861854,0.00048563848,0.0018975565,0.006053574],"genre_scores_gemma":[0.32551768,0.00015040956,0.66413426,0.00020135009,0.00006171106,0.000429146,0.00093408296,0.00019571565,0.008375606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994832,0.0001866712,0.000024957424,0.0001168757,0.00009571887,0.00009256304],"domain_scores_gemma":[0.9995147,0.00021148424,0.000060068778,0.00002960996,0.000109199755,0.00007507351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927434,0.0005553849,0.00090772135,0.00097378774,0.0007567602,0.0010567135,0.0013242919,0.00096945954,0.01523626],"category_scores_gemma":[0.0015462502,0.00037274198,0.00048915885,0.001402499,0.00028556178,0.00069796457,0.00081601576,0.000771831,0.001431858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043962724,0.00049519,0.0017308372,0.00017507002,0.00006513688,0.00012231512,0.00013871717,0.6287328,0.0023264042,0.012241363,0.013832268,0.33970022],"study_design_scores_gemma":[0.0000661815,0.000045397865,0.00022481,0.000006877795,0.000008100175,0.000036962272,0.000029685776,0.9916545,0.00050159387,0.0056769885,0.0017427079,0.0000060672137],"about_ca_topic_score_codex":0.005831001,"about_ca_topic_score_gemma":0.0044425996,"teacher_disagreement_score":0.01523626,"about_ca_system_score_codex":0.0012231237,"about_ca_system_score_gemma":0.0017618915,"threshold_uncertainty_score":0.050970376},"labels":[],"label_agreement":null},{"id":"W2051214760","doi":"10.1007/s10479-007-0222-0","title":"Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Theory of computation; Generalization; Computation; Scheduling (production processes); Constraint (computer-aided design); Mathematics; Set (abstract data type); Flexibility (engineering); Computer science; Mathematical optimization; Mathematical economics; Applied mathematics; Algorithm; Statistics","score_opus":0.6644205714305607,"score_gpt":0.5886680585233595,"score_spread":0.0757525129072012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051214760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08310014,0.0010329552,0.9003958,0.001745947,0.00033106163,0.0001418603,0.00070642104,0.00022579108,0.0123200305],"genre_scores_gemma":[0.88180655,0.0013353085,0.08027159,0.00036003077,0.00033832423,0.00047762942,0.0006654577,0.00015798378,0.034587298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987368,0.00044323932,0.00004742078,0.00022286494,0.00023318322,0.0003165345],"domain_scores_gemma":[0.99790597,0.0011420976,0.00021291396,0.00016018676,0.00032090052,0.00025787664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021429914,0.0013491516,0.0032835025,0.0012139302,0.0012426185,0.0022394187,0.0034838081,0.0030616422,0.0068696635],"category_scores_gemma":[0.0060225767,0.0010438632,0.0015836903,0.00210343,0.0019873676,0.0027198405,0.0021684451,0.0029847594,0.0006809605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008839311,0.00004903643,0.0002542503,0.000067031186,0.00003663085,0.000090920075,0.0000714128,0.8983831,0.00043744914,0.09425252,0.0018018176,0.0044675567],"study_design_scores_gemma":[0.000015455105,0.000017411461,0.00009417674,0.00000496175,0.000008649791,0.000011907468,0.000018394237,0.96229506,0.0000503862,0.03708101,0.0003928217,0.000009683288],"about_ca_topic_score_codex":0.019436566,"about_ca_topic_score_gemma":0.013892453,"teacher_disagreement_score":0.019436566,"about_ca_system_score_codex":0.0026160283,"about_ca_system_score_gemma":0.0033180695,"threshold_uncertainty_score":0.038646877},"labels":[],"label_agreement":null},{"id":"W2054747554","doi":"10.1145/2542050.2542093","title":"Iterated local search in nurse rostering problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Swap (finance); Tabu search; Nurse scheduling problem; Computer science; Iterated function; Iterated local search; Mathematical optimization; Hill climbing; Local search (optimization); Shuffling; Greedy algorithm; Descent (aeronautics); Artificial intelligence; Algorithm; Job shop scheduling; Mathematics; Schedule; Flow shop scheduling","score_opus":0.1148978744502649,"score_gpt":0.3949580150947329,"score_spread":0.280060140644468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054747554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12769762,0.00063715107,0.86485827,0.000521244,0.00005066074,0.00018075111,0.00017535179,0.0008041995,0.0050747124],"genre_scores_gemma":[0.6600243,0.00031668926,0.3349857,0.0001988248,0.000040872426,0.00040589567,0.00043420246,0.00011886407,0.0034747757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993618,0.00029754697,0.000028092536,0.000113005815,0.00010348025,0.000095976044],"domain_scores_gemma":[0.99909234,0.0005762272,0.000093496084,0.000044158824,0.00013048972,0.00006326985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732411,0.0006171674,0.0013562462,0.0005873781,0.00051822985,0.0005652415,0.0015643708,0.00088006473,0.0021887503],"category_scores_gemma":[0.0024471646,0.00037214655,0.0007187784,0.00074841443,0.00048836216,0.0007794448,0.00071861234,0.000672209,0.00027463867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076597935,0.00006214879,0.00068487896,0.00007589147,0.000039144903,0.00008726703,0.00006657617,0.96768236,0.00074160844,0.002485154,0.0013402298,0.026658285],"study_design_scores_gemma":[0.000030562253,0.000052198386,0.00011784421,0.000005166162,0.000010461064,0.000022119437,0.000029342475,0.9970912,0.00028145371,0.0019898864,0.00036542278,0.000004311808],"about_ca_topic_score_codex":0.007131004,"about_ca_topic_score_gemma":0.0059954654,"teacher_disagreement_score":0.007131004,"about_ca_system_score_codex":0.00074013066,"about_ca_system_score_gemma":0.0012884082,"threshold_uncertainty_score":0.014178991},"labels":[],"label_agreement":null},{"id":"W2057126536","doi":"10.1007/s10479-007-0217-x","title":"Towards a practical engineering tool for rostering","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Atomic Energy of Canada Limited; University of Essex","keywords":"Computer science; Constraint programming; Concurrent constraint logic programming; Constraint satisfaction; Backtracking; Mathematical optimization; Constraint satisfaction problem; Constraint logic programming; Scheduling (production processes); Constraint learning; Solver; Artificial intelligence; Algorithm; Mathematics; Programming language; Stochastic programming","score_opus":0.7148603109203584,"score_gpt":0.6397327812247123,"score_spread":0.07512752969564607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057126536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071265304,0.000013045658,0.9968721,0.00009054576,0.000016929494,0.000027931726,0.000026649972,0.00094648293,0.0012937597],"genre_scores_gemma":[0.02059007,0.000058295976,0.9767323,0.000052492585,0.000020838588,0.000093443756,0.00010380941,0.00032008713,0.0020285663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855334,0.000358494,0.000119395874,0.00018415839,0.00069577637,0.00008885831],"domain_scores_gemma":[0.9973726,0.0013218495,0.00012010741,0.0006339068,0.00046638347,0.00008510793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019588256,0.0012877512,0.0008522762,0.001280482,0.00083558063,0.002145826,0.0027325128,0.0014710047,0.019257048],"category_scores_gemma":[0.008818045,0.0009258321,0.0012338784,0.0010349103,0.001157004,0.0026816218,0.003166411,0.002810407,0.004466967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111819565,0.00022631965,0.00061441143,0.00036693274,0.00005320608,0.00031094215,0.0003593293,0.20813768,0.013353785,0.3128735,0.0111813815,0.4524107],"study_design_scores_gemma":[0.000035712692,0.00006583357,0.00010598177,0.00007460234,0.000021445698,0.00019326308,0.00008483418,0.78640395,0.0048872717,0.17244594,0.035656758,0.000024363071],"about_ca_topic_score_codex":0.0012913882,"about_ca_topic_score_gemma":0.0018411707,"teacher_disagreement_score":0.019257048,"about_ca_system_score_codex":0.00049783,"about_ca_system_score_gemma":0.0010682722,"threshold_uncertainty_score":0.06442124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1340056843624997,"score_gpt":0.413582351479498,"score_spread":0.2795766671169983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058048384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041544605,0.00021409872,0.9540816,0.00017372024,0.00003178423,0.00009922959,0.00016463225,0.00076752243,0.0029226954],"genre_scores_gemma":[0.2296766,0.00019927781,0.76730776,0.000056059846,0.000032307184,0.00013651252,0.000571261,0.0001479436,0.0018723588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.00007173929,0.00001943786,0.00015801913,0.00013657482,0.000069026275],"domain_scores_gemma":[0.99866617,0.0005700904,0.00019473617,0.00025155544,0.00023298735,0.000084410756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760273,0.0008248742,0.00070320506,0.0024070651,0.0009938182,0.0010815004,0.0016444988,0.0006890919,0.004127093],"category_scores_gemma":[0.0029029413,0.00049049844,0.00048507442,0.0013836755,0.0009723772,0.0025252698,0.0009675933,0.0008413414,0.00054896274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033724296,0.00022154565,0.0067404136,0.0004218636,0.00007260832,0.00018915434,0.00031757518,0.4354525,0.02504611,0.11725664,0.0065256474,0.4074187],"study_design_scores_gemma":[0.00004844564,0.000074259406,0.00063433626,0.000025487168,0.00002088746,0.00013787657,0.000071836774,0.91153383,0.007884038,0.07522649,0.004311097,0.000031479834],"about_ca_topic_score_codex":0.0047920463,"about_ca_topic_score_gemma":0.006459109,"teacher_disagreement_score":0.0047920463,"about_ca_system_score_codex":0.00146348,"about_ca_system_score_gemma":0.0022485917,"threshold_uncertainty_score":0.013806462},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1276837091283285,"score_gpt":0.34955347165944173,"score_spread":0.22186976253111323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073818615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02045814,0.0001235987,0.9709798,0.0002631966,0.00006272781,0.000107044136,0.0000549773,0.00034860123,0.007601958],"genre_scores_gemma":[0.17990391,0.00019923977,0.8146283,0.00018827824,0.00005726997,0.00022148195,0.0001590347,0.00010260907,0.0045398646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968374,0.00008882521,0.000010138678,0.00006024147,0.000109023626,0.000047984875],"domain_scores_gemma":[0.9996476,0.00015879782,0.00002633563,0.000047319718,0.00009109804,0.00002893054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054599904,0.00046326613,0.0005218593,0.0008012124,0.0007155447,0.00058948604,0.0013809759,0.00076884957,0.0032680752],"category_scores_gemma":[0.0014540124,0.0002954885,0.00068941177,0.0011013398,0.0006532385,0.0005683091,0.0007697036,0.0008415198,0.00041156178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037702455,0.00013626598,0.00043778907,0.000059440452,0.000029061383,0.000062306484,0.0000702454,0.8657036,0.0037204975,0.03065156,0.0016231313,0.09746842],"study_design_scores_gemma":[0.000021616857,0.000026509711,0.00010382437,0.0000047857325,0.000012114723,0.00001807388,0.000014679871,0.9847705,0.00044763822,0.013465838,0.0011099151,0.0000044898193],"about_ca_topic_score_codex":0.012707946,"about_ca_topic_score_gemma":0.01633674,"teacher_disagreement_score":0.012707946,"about_ca_system_score_codex":0.001071443,"about_ca_system_score_gemma":0.0021203212,"threshold_uncertainty_score":0.025267959},"labels":[],"label_agreement":null},{"id":"W2076313470","doi":"10.3138/infor.49.3.221","title":"Scheduling Security Personnel for the Vancouver 2010 Winter Olympic Games","year":2011,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Scheduling (production processes); Computer science; Integer programming; Operations research; Software; Security system; Operations management; Computer security; Engineering; Operating system","score_opus":0.25843865675531097,"score_gpt":0.4185161505677912,"score_spread":0.1600774938124802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076313470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79787236,0.00038377222,0.13847344,0.0014057572,0.00015107116,0.0014198036,0.0015349052,0.0010046618,0.05775424],"genre_scores_gemma":[0.896029,0.0004634776,0.08519849,0.00006848263,0.000021139918,0.00026233727,0.001028324,0.00010937681,0.016819362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996314,0.00009122141,0.0000135933815,0.00004452994,0.000084416475,0.00013490974],"domain_scores_gemma":[0.99963653,0.000095108546,0.000043546737,0.000014742948,0.00007961515,0.0001304667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000848398,0.0005412385,0.0003993747,0.00092654896,0.0014403022,0.0017483674,0.00076665176,0.00061520265,0.0048672785],"category_scores_gemma":[0.0016921689,0.00058006926,0.00031778164,0.00091051095,0.00040663357,0.00043606077,0.00049451884,0.0006671841,0.000544309],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048527858,0.00047072236,0.008114874,0.00015779445,0.000035993606,0.00031911538,0.0006848715,0.8379739,0.0043484103,0.014284508,0.013981767,0.11914269],"study_design_scores_gemma":[0.00013019082,0.00024968915,0.0049336227,0.000032499967,0.000019957184,0.000035077297,0.0014592338,0.97616744,0.0023253954,0.003276212,0.011335873,0.000034786703],"about_ca_topic_score_codex":0.302784,"about_ca_topic_score_gemma":0.4323489,"teacher_disagreement_score":0.69721603,"about_ca_system_score_codex":0.005970955,"about_ca_system_score_gemma":0.011410224,"threshold_uncertainty_score":0.60204315},"labels":[],"label_agreement":null},{"id":"W208029733","doi":"","title":"Examining working time arrangements using time use survey data","year":2000,"lang":"en","type":"preprint","venue":"Econstor (Econstor)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"International Labour Organization","keywords":"Working time; Time-use survey; Computer science; Data science; Work (physics); Engineering","score_opus":0.4100280045173886,"score_gpt":0.3895430514037567,"score_spread":0.020484953113631854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W208029733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913824,0.00037072337,0.0014695844,0.000033152086,0.0000068442173,0.00006634886,0.00482444,0.00000799123,0.0018385957],"genre_scores_gemma":[0.9894996,0.00046788878,0.0023730418,0.000014137306,0.0000075121197,0.00018486529,0.00694749,0.000007687156,0.0004976645],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973985,0.0009865302,0.00033462277,0.00037803376,0.00064551027,0.00025681607],"domain_scores_gemma":[0.9896096,0.0034146248,0.004278272,0.0006513191,0.0016246255,0.00042152178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025364007,0.00023500605,0.00031654345,0.0059759323,0.0006712909,0.0014858872,0.0006985322,0.0002561588,0.0011108599],"category_scores_gemma":[0.012370768,0.00033200489,0.00038139024,0.011050117,0.00031787436,0.0010937237,0.0009436561,0.00033682465,0.00025286834],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035309044,0.000022042817,0.9856285,0.000056953606,0.00007395022,0.00006109479,0.002818506,0.00053079036,0.000115816634,0.00020195158,0.00035293205,0.010102174],"study_design_scores_gemma":[0.0000035047067,0.00004196423,0.98956305,0.000044922446,0.00002352167,0.00006413994,0.0058262455,0.0011006773,0.00011539531,0.00009134913,0.0031127173,0.000012496995],"about_ca_topic_score_codex":0.14981245,"about_ca_topic_score_gemma":0.22064897,"teacher_disagreement_score":0.14981245,"about_ca_system_score_codex":0.0013508481,"about_ca_system_score_gemma":0.001375443,"threshold_uncertainty_score":0.2978809},"labels":[],"label_agreement":null},{"id":"W2080574925","doi":"10.3390/a7030295","title":"Solving the Examination Timetabling Problem in GPUs","year":2014,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Component (thermodynamics); Selection (genetic algorithm); Tournament selection; Greedy algorithm; Population; Genetic algorithm; Evolutionary algorithm; Mathematical optimization; Process (computing); Matrix (chemical analysis); Class (philosophy); Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.07567459497612149,"score_gpt":0.3472196176140333,"score_spread":0.2715450226379118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080574925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3120741,0.00044693524,0.6705245,0.0005454661,0.0001077173,0.00009399751,0.00030480674,0.0019589297,0.013943517],"genre_scores_gemma":[0.58633244,0.00018993508,0.40733042,0.00011552347,0.000021664628,0.00014179834,0.00053016143,0.00017399412,0.0051639853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996433,0.00010440812,0.0000204851,0.00006782928,0.000101436606,0.00006254575],"domain_scores_gemma":[0.99934417,0.000322277,0.00004986502,0.00010176363,0.00014323366,0.000038717688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049403263,0.0003860544,0.00043028974,0.00041183905,0.00046056174,0.00084246247,0.00084745226,0.00062180485,0.0035371785],"category_scores_gemma":[0.002112589,0.00021525071,0.00043204604,0.00091569277,0.00025345973,0.00058384525,0.0005076535,0.0005833324,0.0004770019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023290887,0.0001393274,0.0029718773,0.00009682585,0.000045551773,0.00017038743,0.0001344912,0.73109895,0.00964126,0.009819437,0.005149855,0.24049911],"study_design_scores_gemma":[0.000021693853,0.000039883562,0.0004746132,0.000004863759,0.000006463806,0.000036345406,0.000039672756,0.9909196,0.0021098235,0.0037857546,0.0025571787,0.0000041486724],"about_ca_topic_score_codex":0.0071664043,"about_ca_topic_score_gemma":0.008991179,"teacher_disagreement_score":0.0071664043,"about_ca_system_score_codex":0.0005545571,"about_ca_system_score_gemma":0.00094717764,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2081877096","doi":"10.1057/palgrave.jors.2602070","title":"A methodology to optimize foundation seminar assignments","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Health Quality Council","funders":"","keywords":"Foundation (evidence); Computer science; Liberal arts education; The arts; Heuristic; Mathematics education; Operations research; Psychology; Artificial intelligence; Mathematics; Visual arts; Higher education; History; Art","score_opus":0.6168729675288916,"score_gpt":0.5914161163089076,"score_spread":0.02545685121998409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081877096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021103328,0.00016115233,0.9730811,0.00019260334,0.000040807678,0.00037510495,0.000111152855,0.00046375615,0.0044710035],"genre_scores_gemma":[0.15810512,0.00013497203,0.8386154,0.00007823772,0.000023780258,0.00045471164,0.00026217912,0.000121437355,0.002204043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987405,0.00046532814,0.000061343584,0.00021784016,0.0003476761,0.00016744841],"domain_scores_gemma":[0.9979657,0.0009959447,0.00028894693,0.0001549035,0.0004792912,0.00011524059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024931272,0.0013298937,0.0008973269,0.0021832045,0.00080201135,0.001166044,0.0015450551,0.0010469446,0.0049085673],"category_scores_gemma":[0.0050681233,0.00065027183,0.0009702524,0.0019003493,0.00058959244,0.00081066927,0.00089107285,0.0009560562,0.0005346098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095356525,0.00034790303,0.0016264296,0.00021546526,0.00007105819,0.00011333936,0.00015515593,0.725251,0.005766677,0.015863882,0.00367921,0.24681452],"study_design_scores_gemma":[0.000032452375,0.00010863919,0.00027897515,0.000021049926,0.000018636114,0.00003470096,0.00005057991,0.98865545,0.0017606633,0.0065614274,0.002467439,0.000009922989],"about_ca_topic_score_codex":0.0051715495,"about_ca_topic_score_gemma":0.0047544213,"teacher_disagreement_score":0.0051715495,"about_ca_system_score_codex":0.0017064072,"about_ca_system_score_gemma":0.0034928569,"threshold_uncertainty_score":0.016420782},"labels":[],"label_agreement":null},{"id":"W2082692857","doi":"10.3138/infor.48.3.181","title":"Confection de calendriers de matchs pour le sport universitaire et collégial au Québec","year":2010,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Humanities; Political science; Art","score_opus":0.08396010839412787,"score_gpt":0.40415513963560457,"score_spread":0.3201950312414767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082692857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861188,0.00050862273,0.07695338,0.0015484205,0.00009844049,0.0005458675,0.003656887,0.0012758363,0.029293645],"genre_scores_gemma":[0.94048584,0.00020124613,0.031395897,0.00009819343,0.000009921366,0.00021699176,0.0018042607,0.0001262122,0.025661452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986625,0.00025398462,0.00006449004,0.0002369258,0.00047619437,0.0003059432],"domain_scores_gemma":[0.9967771,0.0010996286,0.00040104619,0.00022210207,0.0010106192,0.0004895221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019792647,0.0005561008,0.00037128915,0.0012064276,0.0018923635,0.0023630217,0.0010982639,0.00066819554,0.0125901345],"category_scores_gemma":[0.005163666,0.00040783023,0.00051908416,0.0012746414,0.0007310117,0.0007844843,0.0008688457,0.0009209464,0.0008747923],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017658458,0.0005200529,0.12251758,0.00039292057,0.0001286426,0.00070540525,0.0025701188,0.62860286,0.015989402,0.017963115,0.0155000985,0.19334394],"study_design_scores_gemma":[0.00015064917,0.0006042036,0.12710641,0.00018212687,0.00009752863,0.00011793213,0.00422207,0.80669475,0.009289334,0.0058342074,0.045558434,0.00014237125],"about_ca_topic_score_codex":0.7291342,"about_ca_topic_score_gemma":0.7807029,"teacher_disagreement_score":0.2708658,"about_ca_system_score_codex":0.010341413,"about_ca_system_score_gemma":0.014374713,"threshold_uncertainty_score":0.54492193},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10370099518781979,"score_gpt":0.39809885462558825,"score_spread":0.29439785943776847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083729473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9081387,0.00976366,0.026475199,0.018750917,0.00018981009,0.00016184256,0.00020202345,0.000024712226,0.03629321],"genre_scores_gemma":[0.9866708,0.002515525,0.008776421,0.0004568257,0.000079813224,0.00008209475,0.000049558294,0.0000105094805,0.0013584304],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98424083,0.0130445985,0.00039253125,0.00032528344,0.00145728,0.0005393978],"domain_scores_gemma":[0.9685309,0.026415773,0.0014463285,0.00043327105,0.000834123,0.0023396024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02035187,0.00029794395,0.0005121644,0.00088000786,0.0008662088,0.004431861,0.0005757715,0.0013503142,0.0027316397],"category_scores_gemma":[0.036281314,0.00023843416,0.00048109246,0.0013716605,0.0017876915,0.002669119,0.0012014809,0.0014275442,0.00042724068],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026568302,0.0017671599,0.15142377,0.0006779344,0.0004968101,0.0006815959,0.011350548,0.046701062,0.0012541573,0.13700351,0.013424057,0.6325626],"study_design_scores_gemma":[0.0003438371,0.0023809688,0.13652903,0.0010334338,0.00023918349,0.0014457422,0.048793606,0.1042481,0.00078899995,0.67730415,0.026513264,0.0003796736],"about_ca_topic_score_codex":0.0012432744,"about_ca_topic_score_gemma":0.0040779463,"teacher_disagreement_score":0.02035187,"about_ca_system_score_codex":0.002085748,"about_ca_system_score_gemma":0.0015711145,"threshold_uncertainty_score":0.10763228},"labels":[],"label_agreement":null},{"id":"W2092058125","doi":"10.1007/s10951-009-0149-1","title":"On a reduction of the interval coloring problem to a series of bandwidth coloring problems","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Complete coloring; Edge coloring; Greedy coloring; Graph coloring; Vertex (graph theory); Interval (graph theory); Discrete mathematics; Integer (computer science); Graph; Brooks' theorem; Computer science; Graph power; Chordal graph; 1-planar graph","score_opus":0.07491560948366902,"score_gpt":0.34364361245898467,"score_spread":0.2687280029753156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092058125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021759693,0.0009123849,0.94093484,0.0014697921,0.0005683488,0.00027540562,0.0003746842,0.00030085136,0.033404116],"genre_scores_gemma":[0.21876408,0.0038714476,0.73914844,0.0010602709,0.0017119022,0.0006272774,0.0019318281,0.00064025965,0.032244563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884486,0.00036828115,0.00004802831,0.00018187112,0.00037896738,0.00017802324],"domain_scores_gemma":[0.9975314,0.0016598374,0.00013283372,0.0002644633,0.0002590715,0.00015235039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014554476,0.0014250578,0.0014265983,0.00144989,0.0012274857,0.002244938,0.0024962125,0.0014556624,0.0076134643],"category_scores_gemma":[0.00648508,0.00063728873,0.0032081874,0.0025732059,0.0013290808,0.0029283254,0.0021736242,0.004784736,0.0009045015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016180341,0.00064660964,0.00057761685,0.0005097825,0.000113029404,0.0002332081,0.00040365593,0.3555772,0.0029410669,0.4538736,0.037694775,0.14726765],"study_design_scores_gemma":[0.00005630541,0.000095507654,0.00031999705,0.000058627702,0.000065938715,0.00015513113,0.00012299487,0.50669444,0.0010304296,0.4774263,0.0139456745,0.00002867028],"about_ca_topic_score_codex":0.006298444,"about_ca_topic_score_gemma":0.005092993,"teacher_disagreement_score":0.0076134643,"about_ca_system_score_codex":0.0013633136,"about_ca_system_score_gemma":0.0020734407,"threshold_uncertainty_score":0.025469542},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10988681558696006,"score_gpt":0.38501938187302603,"score_spread":0.27513256628606597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092998591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061961494,0.00048915454,0.9290357,0.0003892152,0.00014654023,0.00012047357,0.00014572941,0.0014515012,0.0062601874],"genre_scores_gemma":[0.44812286,0.00031512868,0.54435474,0.00024434793,0.00008571573,0.00029092483,0.000344502,0.00020082288,0.006040819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996735,0.00006722712,0.000017328794,0.00008715854,0.000067384,0.00008747498],"domain_scores_gemma":[0.99917126,0.00042775035,0.00007567977,0.00014471388,0.00011745166,0.000063247164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213065,0.00058346835,0.0008220902,0.0006613677,0.00062591885,0.00088609953,0.0024637347,0.0010006402,0.004951779],"category_scores_gemma":[0.0025619501,0.00037209367,0.0005517724,0.0012416064,0.0005129681,0.001547623,0.0014301342,0.0011728102,0.0006015529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010710899,0.0003685692,0.0011439268,0.00027316736,0.00009554142,0.00007830594,0.00017412959,0.35004386,0.010632478,0.044220652,0.010481452,0.5814168],"study_design_scores_gemma":[0.00016146783,0.00009743018,0.0001880552,0.000013739327,0.000028583841,0.000042497697,0.000027858126,0.9702917,0.0022410417,0.025177043,0.001716802,0.000013821346],"about_ca_topic_score_codex":0.0055273613,"about_ca_topic_score_gemma":0.00690986,"teacher_disagreement_score":0.0055273613,"about_ca_system_score_codex":0.0009134959,"about_ca_system_score_gemma":0.0015505909,"threshold_uncertainty_score":0.016565323},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.6028806549559134,"score_gpt":0.6204365109072726,"score_spread":0.017555855951359223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093938881","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00286952,0.02430576,0.9658599,0.00043504123,0.00016308717,0.00009992507,0.00017522817,0.0006542733,0.0054372866],"genre_scores_gemma":[0.07474811,0.03225576,0.8804623,0.0006318335,0.00067548366,0.0005750795,0.00082427927,0.0008925338,0.008934741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986072,0.0006444845,0.000078016135,0.00022981227,0.000361431,0.00007911378],"domain_scores_gemma":[0.99733657,0.0017787144,0.00010029342,0.0003349404,0.00038135494,0.000067956535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709145,0.0012398715,0.0029288782,0.0024216175,0.00091290293,0.0016302125,0.0031709084,0.0015015675,0.0066771805],"category_scores_gemma":[0.005745099,0.0009305226,0.0018464397,0.006155722,0.0009280545,0.0025327022,0.0015163154,0.0021235652,0.002380769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014390584,0.00027433565,0.000848111,0.0021174354,0.00020830863,0.000041626976,0.00018307066,0.19596675,0.0017112637,0.08294138,0.019997636,0.6955662],"study_design_scores_gemma":[0.00010917737,0.00015444976,0.00041028656,0.00034966288,0.00011413562,0.00015220178,0.000097493335,0.8670048,0.0012570062,0.092968,0.037339967,0.00004292443],"about_ca_topic_score_codex":0.006291577,"about_ca_topic_score_gemma":0.009137589,"teacher_disagreement_score":0.0066771805,"about_ca_system_score_codex":0.0013469864,"about_ca_system_score_gemma":0.0015962837,"threshold_uncertainty_score":0.022337377},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08476310417682809,"score_gpt":0.38923523864119086,"score_spread":0.3044721344643628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094070748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9220141,0.00028470045,0.06817097,0.0007139528,0.00008433051,0.00038886745,0.00016666976,0.00016247196,0.008013981],"genre_scores_gemma":[0.9726002,0.00014101494,0.022781998,0.00005889988,0.000044161538,0.00009105087,0.0001365362,0.000028658898,0.0041173133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897814,0.0004079409,0.00006180498,0.00013975268,0.0001295978,0.00028278132],"domain_scores_gemma":[0.9974082,0.0015939408,0.00022227701,0.00008724839,0.00015919226,0.00052914105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019330215,0.0005615427,0.0006021168,0.00086384814,0.0023795494,0.0021005394,0.0010553926,0.0020943377,0.005356953],"category_scores_gemma":[0.0035178664,0.0007844084,0.0006136786,0.0012544265,0.0006608007,0.0009527653,0.0006901083,0.0009176794,0.00041259688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002055854,0.0010823185,0.009964683,0.00012631195,0.00010561592,0.0011996678,0.00052960025,0.91380674,0.010575518,0.008878826,0.0026110183,0.049063865],"study_design_scores_gemma":[0.0001888511,0.00058401865,0.0046016863,0.000014854078,0.00006572835,0.00014157264,0.0007527896,0.9828904,0.0029758872,0.0052887504,0.002461809,0.000033632157],"about_ca_topic_score_codex":0.024647733,"about_ca_topic_score_gemma":0.016440256,"teacher_disagreement_score":0.024647733,"about_ca_system_score_codex":0.0023547087,"about_ca_system_score_gemma":0.00364647,"threshold_uncertainty_score":0.04900855},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11200069251111452,"score_gpt":0.3425552182805954,"score_spread":0.23055452576948085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094427046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09116932,0.00012099562,0.8441623,0.0021383287,0.00021631435,0.00083395705,0.003155485,0.008146941,0.050056316],"genre_scores_gemma":[0.31172344,0.00032917826,0.6494201,0.00042063973,0.000056520923,0.00093792233,0.003252114,0.00094495225,0.03291515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931455,0.00020397874,0.000050433708,0.00013761266,0.00022516695,0.00006833547],"domain_scores_gemma":[0.9974148,0.001350054,0.0002082235,0.0003037555,0.00059081503,0.0001323814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974432,0.0008247257,0.00037515647,0.00074068457,0.00079379906,0.0014291363,0.0009634362,0.0007579644,0.015240526],"category_scores_gemma":[0.004410036,0.0004318301,0.0005354395,0.0008251467,0.00024162757,0.0015049422,0.0004826555,0.0010986306,0.0024657934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004827969,0.00061542395,0.0054556336,0.00018162116,0.000058559886,0.0002497901,0.00061902194,0.6930973,0.0068500666,0.05116616,0.043864284,0.19735922],"study_design_scores_gemma":[0.00009784043,0.00014065756,0.0010856705,0.0000749841,0.000031196167,0.000081409686,0.00014665221,0.9182166,0.005885121,0.015252132,0.05895133,0.00003642454],"about_ca_topic_score_codex":0.0151482895,"about_ca_topic_score_gemma":0.021392358,"teacher_disagreement_score":0.015240526,"about_ca_system_score_codex":0.0015205902,"about_ca_system_score_gemma":0.0038370576,"threshold_uncertainty_score":0.05098462},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.5359042032405876,"score_gpt":0.4791834452571304,"score_spread":0.056720757983457215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097428991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6266039,0.0035284958,0.32903913,0.00041403325,0.00022584718,0.0013166917,0.0005127536,0.0004759026,0.037883297],"genre_scores_gemma":[0.8438489,0.0006451131,0.15172875,0.00006840189,0.0000579716,0.0005848384,0.00025871463,0.00009755732,0.0027096826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696475,0.0019718525,0.0001433541,0.00020668641,0.00047310715,0.00024021999],"domain_scores_gemma":[0.98698425,0.010833507,0.0006605908,0.00037280214,0.0009338938,0.00021495509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039980025,0.0010475502,0.0012121807,0.0021570032,0.0007763263,0.001707783,0.0011887068,0.0008359437,0.0049773385],"category_scores_gemma":[0.014145914,0.0006827859,0.000936907,0.0021051713,0.00059799047,0.001424665,0.00071193324,0.0010289145,0.0003350657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001554863,0.000604027,0.0030139089,0.00056706654,0.00030859362,0.00014853424,0.00016612391,0.8248151,0.0037215492,0.011259985,0.0010602091,0.15278004],"study_design_scores_gemma":[0.00008520934,0.0010705948,0.0008400242,0.000042786294,0.00018048282,0.0000624738,0.000104310406,0.99021214,0.0017862332,0.004279027,0.0013170537,0.000019667892],"about_ca_topic_score_codex":0.0015654498,"about_ca_topic_score_gemma":0.0015987791,"teacher_disagreement_score":0.0049773385,"about_ca_system_score_codex":0.0014364087,"about_ca_system_score_gemma":0.0015566687,"threshold_uncertainty_score":0.021143675},"labels":[],"label_agreement":null},{"id":"W2098032517","doi":"10.7763/ijmlc.2014.v4.412","title":"Multi-Agent Decision-Making Support Model for the Management of Pre-Hospital Emergency Services","year":2014,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Operations research","score_opus":0.03611740005890104,"score_gpt":0.39361364508459806,"score_spread":0.35749624502569705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098032517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06282824,0.00043513929,0.92124456,0.0015786266,0.00015417689,0.000248639,0.00045118982,0.00052184705,0.012537571],"genre_scores_gemma":[0.871606,0.00042495024,0.11838285,0.0001716157,0.00006987258,0.00041779742,0.00033195474,0.00003388601,0.008561152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993923,0.00020942475,0.000041095078,0.00012746752,0.00014637432,0.00008331668],"domain_scores_gemma":[0.999464,0.00022197071,0.00008739837,0.000029080396,0.00012234246,0.00007517975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096634077,0.000629915,0.000580509,0.0004482135,0.0006948115,0.0017034092,0.0015092582,0.0014515967,0.003289596],"category_scores_gemma":[0.001558076,0.00026129393,0.0006594176,0.00045652976,0.00047022002,0.0010156266,0.00088730897,0.0011208252,0.0005850108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101569225,0.00009790704,0.00059635006,0.000067182795,0.000037940696,0.00022397342,0.00012075525,0.9481716,0.0013236467,0.038896702,0.0009156666,0.009446766],"study_design_scores_gemma":[0.000017438655,0.000029792755,0.000099979035,0.000007033206,0.000013580838,0.000017684397,0.000017961873,0.9922609,0.00021615684,0.0059344354,0.0013789056,0.0000061795727],"about_ca_topic_score_codex":0.0059360536,"about_ca_topic_score_gemma":0.005829024,"teacher_disagreement_score":0.0059360536,"about_ca_system_score_codex":0.0013973562,"about_ca_system_score_gemma":0.0019521185,"threshold_uncertainty_score":0.011803031},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11868188418620174,"score_gpt":0.3978671027925801,"score_spread":0.27918521860637835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104638302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007909205,0.00021246875,0.9867655,0.00030216738,0.000042723943,0.000100519836,0.00020380977,0.0001975863,0.004266033],"genre_scores_gemma":[0.188999,0.00074085913,0.80285907,0.00021584753,0.000101196485,0.00081770995,0.00079239625,0.00024623566,0.005227719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984634,0.0006574923,0.000079907295,0.00021909253,0.00042811598,0.00015205954],"domain_scores_gemma":[0.99794847,0.0015298927,0.00015287483,0.00018281426,0.00013256673,0.000053430384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016631333,0.001322135,0.0009151759,0.00062149175,0.0005123165,0.0016607976,0.0019417208,0.0014109334,0.0035822664],"category_scores_gemma":[0.0043797535,0.0008025431,0.0019051506,0.0014897847,0.0013212092,0.0022053006,0.0014722435,0.0033559948,0.00064785994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021341195,0.000058772785,0.000118816366,0.00007788632,0.000014499306,0.000052448868,0.00009941605,0.8793978,0.0006004748,0.10281735,0.0010627767,0.015678544],"study_design_scores_gemma":[0.000021922591,0.000019568979,0.00003683924,0.00001493795,0.0000074845384,0.000017762413,0.000021279313,0.91192096,0.00030430802,0.08453513,0.0030922976,0.000007449055],"about_ca_topic_score_codex":0.0032392007,"about_ca_topic_score_gemma":0.00497337,"teacher_disagreement_score":0.0035822664,"about_ca_system_score_codex":0.0015616831,"about_ca_system_score_gemma":0.0022024151,"threshold_uncertainty_score":0.011983871},"labels":[],"label_agreement":null},{"id":"W2104930613","doi":"10.5539/mas.v6n9p26","title":"The Unconstrained Binary Quadratic Programming for the Sum Coloring Problem","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Quadratic programming; Computer science; Quadratic equation; Graph coloring; Quadratic unconstrained binary optimization; Mathematical optimization; Mathematics; Algorithm; Graph; Theoretical computer science; Arithmetic","score_opus":0.13604380554815218,"score_gpt":0.3805259530287306,"score_spread":0.24448214748057842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104930613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063451813,0.00056785694,0.9830755,0.00047659618,0.00011487463,0.0000823962,0.00015706022,0.00013523024,0.009045306],"genre_scores_gemma":[0.27642873,0.0017070047,0.7045833,0.00047943738,0.00035088378,0.00049924204,0.000777119,0.0002794422,0.014894871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988084,0.00055090536,0.00003024292,0.00019135363,0.0003186526,0.000100490106],"domain_scores_gemma":[0.99909425,0.0006024389,0.00006707868,0.00006081806,0.00012431317,0.000051133615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015766135,0.0011581972,0.0008745881,0.00064557634,0.0006147171,0.0009828742,0.001460708,0.0008798825,0.0057342635],"category_scores_gemma":[0.003909524,0.00034496188,0.0006962771,0.0018930266,0.00084975763,0.0012310792,0.0010470822,0.0020910567,0.00088909554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090166664,0.00015857887,0.00035345252,0.00035105675,0.000040242467,0.000076485005,0.00007032716,0.6886945,0.001452232,0.18775097,0.011325695,0.10963635],"study_design_scores_gemma":[0.00001818649,0.00004572061,0.000126095,0.000021917731,0.000009259264,0.000041135663,0.000016724423,0.9082431,0.00040774536,0.08646648,0.0045935605,0.00000997884],"about_ca_topic_score_codex":0.00417611,"about_ca_topic_score_gemma":0.003962549,"teacher_disagreement_score":0.0057342635,"about_ca_system_score_codex":0.0012334596,"about_ca_system_score_gemma":0.001690117,"threshold_uncertainty_score":0.01918304},"labels":[],"label_agreement":null},{"id":"W2108703290","doi":"","title":"Qualitative Timetabling: An Organizational and Qualitative Approach to Improving University Course Scheduling.","year":2008,"lang":"en","type":"article","venue":"The College Quarterly","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Process (computing); Flexibility (engineering); Computer science; Process management; Operations research; Management science; Management; Operations management; Business; Engineering; Economics","score_opus":0.14253027106593358,"score_gpt":0.39711625825030367,"score_spread":0.2545859871843701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108703290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038741685,0.0005986108,0.90321285,0.018043816,0.0004846045,0.0023722108,0.0007234365,0.00042440474,0.035398394],"genre_scores_gemma":[0.34794196,0.0006208187,0.6331564,0.0022265168,0.000051741652,0.00506242,0.0003402317,0.00018367835,0.010416185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.97898906,0.017811049,0.0003236626,0.0007129693,0.0017281508,0.00043512048],"domain_scores_gemma":[0.9519437,0.03808812,0.002294871,0.0022974175,0.0043278844,0.0010478892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028887186,0.00050483685,0.0003362196,0.0024062581,0.0029175722,0.0032662118,0.002637169,0.0010273531,0.007256856],"category_scores_gemma":[0.05883668,0.00034031368,0.00055457506,0.0030534966,0.0066907024,0.0033036247,0.0035618471,0.0021308672,0.0006525061],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016923643,0.00048085314,0.0034445957,0.0014644753,0.000048034737,0.00017264838,0.15490495,0.011693687,0.0045417743,0.484856,0.033874363,0.3043495],"study_design_scores_gemma":[0.00012389432,0.00033447,0.004060435,0.0012533987,0.000048744176,0.00018458792,0.16818407,0.04712866,0.011973937,0.45836583,0.3081857,0.00015621225],"about_ca_topic_score_codex":0.010567432,"about_ca_topic_score_gemma":0.020351943,"teacher_disagreement_score":0.028887186,"about_ca_system_score_codex":0.012796174,"about_ca_system_score_gemma":0.01652399,"threshold_uncertainty_score":0.15277183},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12199776890677005,"score_gpt":0.3955546711748169,"score_spread":0.27355690226804685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111805524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024650285,0.0002504,0.9932186,0.00053201977,0.00005172354,0.000077789125,0.00024258977,0.00042057797,0.0027412956],"genre_scores_gemma":[0.14145856,0.0012711119,0.8491073,0.00050134823,0.00021653739,0.00089276663,0.0011063261,0.00039349674,0.0050525335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967932,0.0014861949,0.0003652737,0.0003046895,0.0007180312,0.0003325655],"domain_scores_gemma":[0.9943335,0.003795256,0.00064989174,0.00055476045,0.0005332629,0.00013324495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004118864,0.001401204,0.0009867549,0.0011328597,0.00090163486,0.004307068,0.0030068804,0.0013523562,0.0049364367],"category_scores_gemma":[0.008660791,0.0011074144,0.0025981995,0.0015456444,0.0021592868,0.0048374557,0.0018567718,0.004676519,0.0012276378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044101584,0.000084654974,0.00013884415,0.00018065773,0.000028978407,0.00008923935,0.0003408337,0.09137534,0.00097449595,0.88743734,0.00207151,0.017233986],"study_design_scores_gemma":[0.00006554051,0.000025077674,0.00003786912,0.00011726076,0.000038743838,0.00005403986,0.00013670775,0.28913116,0.0012397248,0.6913625,0.017763497,0.000027913911],"about_ca_topic_score_codex":0.004854583,"about_ca_topic_score_gemma":0.0063897646,"teacher_disagreement_score":0.0049364367,"about_ca_system_score_codex":0.0021794245,"about_ca_system_score_gemma":0.0035928425,"threshold_uncertainty_score":0.021782875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06682508495774124,"score_gpt":0.36498264558820637,"score_spread":0.2981575606304651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112255588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033889376,0.0002026515,0.959588,0.00036662602,0.00006707351,0.000144216,0.00008958068,0.00042061906,0.005231859],"genre_scores_gemma":[0.30142352,0.00018287265,0.69292396,0.00026846072,0.000052797677,0.00037538764,0.00022669537,0.000107183136,0.0044391514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.00024215583,0.000018242947,0.00009758782,0.00017829418,0.00006554912],"domain_scores_gemma":[0.99871397,0.0008957472,0.000081543825,0.000070856426,0.00018649819,0.00005145068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012787965,0.00072764297,0.00091398344,0.0010661209,0.0005341781,0.0009067001,0.001606749,0.0022045285,0.003706802],"category_scores_gemma":[0.0052606626,0.0005783544,0.0007323686,0.0011537155,0.0007220071,0.0008893734,0.0010421432,0.0012536215,0.0004143242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076136996,0.0000859008,0.00049992494,0.00003573288,0.00003178163,0.000048695387,0.00007163393,0.89332,0.00092422107,0.010698238,0.0012910366,0.09291667],"study_design_scores_gemma":[0.000036894882,0.000027951119,0.0001045844,0.0000068415234,0.000010682981,0.00001186496,0.0000080597,0.99437946,0.00018418084,0.0047163446,0.0005085869,0.0000045018373],"about_ca_topic_score_codex":0.0095600225,"about_ca_topic_score_gemma":0.0076694917,"teacher_disagreement_score":0.0095600225,"about_ca_system_score_codex":0.0011543998,"about_ca_system_score_gemma":0.0027192596,"threshold_uncertainty_score":0.019008756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1476587390143901,"score_gpt":0.4031855617987858,"score_spread":0.25552682278439565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114085960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026370116,0.0006528378,0.96498513,0.00045955094,0.00009810641,0.000085760774,0.00006584599,0.00014124412,0.007141441],"genre_scores_gemma":[0.5367602,0.0007691348,0.45084095,0.00016735635,0.00016857119,0.00036872498,0.00023002857,0.000118355616,0.01057664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944764,0.0003291548,0.000019076026,0.00005422875,0.000110099434,0.00003976248],"domain_scores_gemma":[0.99826056,0.0014098298,0.00006821803,0.000056520763,0.00013526765,0.0000696259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011480269,0.00045536496,0.0013174496,0.0011376885,0.00064236403,0.00080250483,0.0014164917,0.0014409723,0.0038176351],"category_scores_gemma":[0.004445146,0.00045415375,0.0007312026,0.0012996285,0.00075618527,0.0014273769,0.0010978606,0.001032172,0.00034773594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007686853,0.00006438048,0.00018502054,0.000072515155,0.00003373133,0.000048445992,0.00006177891,0.940849,0.0005313898,0.027360264,0.0010904907,0.0296261],"study_design_scores_gemma":[0.00002630804,0.00002328084,0.0000483764,0.0000051910174,0.0000063625275,0.000008922785,0.000010542859,0.9885535,0.000060841812,0.0107407095,0.0005114922,0.000004472607],"about_ca_topic_score_codex":0.0067496905,"about_ca_topic_score_gemma":0.007330165,"teacher_disagreement_score":0.0067496905,"about_ca_system_score_codex":0.000979166,"about_ca_system_score_gemma":0.0011201467,"threshold_uncertainty_score":0.01342082},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09017967511885595,"score_gpt":0.4055672701926766,"score_spread":0.31538759507382064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114494151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3059247,0.005253652,0.66555244,0.006616628,0.00094321964,0.00029203898,0.0015074763,0.0003335527,0.01357627],"genre_scores_gemma":[0.9130213,0.0014647971,0.078321226,0.00028165925,0.00036518998,0.00013381167,0.00061866833,0.000086005144,0.0057073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981787,0.00090769766,0.00008654686,0.0003219432,0.00024218144,0.00026302788],"domain_scores_gemma":[0.9942684,0.00441632,0.00046994557,0.00014062192,0.00033582517,0.00036882813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031705345,0.00079831143,0.0012216589,0.0007270385,0.0007363566,0.0018264445,0.0017509975,0.0026071763,0.004179526],"category_scores_gemma":[0.008671468,0.0007863977,0.0007244304,0.0011730565,0.0012089763,0.0022220965,0.0008638008,0.0013241884,0.0003350146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028245468,0.00018311094,0.0014492059,0.0002988493,0.00010869263,0.00036042952,0.00011099802,0.9514996,0.0007480655,0.021830088,0.0040157423,0.019112771],"study_design_scores_gemma":[0.000055190827,0.000063987995,0.0006363148,0.00002435037,0.000022079143,0.00012678615,0.00011726083,0.9758439,0.0002703023,0.02136786,0.0014551827,0.000016746064],"about_ca_topic_score_codex":0.008433058,"about_ca_topic_score_gemma":0.008157201,"teacher_disagreement_score":0.008433058,"about_ca_system_score_codex":0.0016190544,"about_ca_system_score_gemma":0.0022971937,"threshold_uncertainty_score":0.016767919},"labels":[],"label_agreement":null},{"id":"W2118867130","doi":"10.1287/inte.1050.0154","title":"Scheduling Employees in Quebec’s Liquor Stores with Integer Programming","year":2005,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Corporation; Scheduling (production processes); Integer programming; Schedule; Operations research; Computer science; Operations management; Business; Database; Engineering; Operating system; Finance","score_opus":0.06282176912898277,"score_gpt":0.35011510874133606,"score_spread":0.28729333961235326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118867130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6833928,0.00094250066,0.24868245,0.0021379802,0.00012144199,0.001066233,0.0029938256,0.0013922469,0.05927049],"genre_scores_gemma":[0.8436883,0.00048205082,0.13874933,0.0002216964,0.000035785757,0.00028663586,0.0017151593,0.00014701867,0.014673986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945813,0.00016634875,0.000020209052,0.00008150309,0.00007336239,0.00020041259],"domain_scores_gemma":[0.9989912,0.00059772516,0.00010016258,0.00003394076,0.00015496953,0.000122040175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227346,0.00084358355,0.0005101422,0.0008499277,0.0009189463,0.0020997259,0.00094385527,0.00068228046,0.0059698],"category_scores_gemma":[0.002042754,0.0005335934,0.00044775612,0.001293134,0.0004836134,0.0006903513,0.00041894842,0.0006837353,0.00048700755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021683463,0.00017762963,0.0025419423,0.000091015434,0.00002064961,0.00010589578,0.00014063538,0.9494023,0.0008523292,0.0043954137,0.0046216827,0.037433695],"study_design_scores_gemma":[0.00004879551,0.000064456406,0.00096750987,0.000012268201,0.000012096468,0.000010660852,0.00016863864,0.99439913,0.00044888424,0.0013553287,0.0025020926,0.00001010398],"about_ca_topic_score_codex":0.44678536,"about_ca_topic_score_gemma":0.53085834,"teacher_disagreement_score":0.55321467,"about_ca_system_score_codex":0.006317192,"about_ca_system_score_gemma":0.008476562,"threshold_uncertainty_score":0.88836956},"labels":[],"label_agreement":null},{"id":"W2120216636","doi":"10.5555/2675983.2676328","title":"A discrete event simulation environment tailored to the needs of military human resources management","year":2013,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Discrete event simulation; Event (particle physics); Computer science; Process (computing); Modeling and simulation; Military personnel; Outcome (game theory); Operations research; Human resources; Action (physics); Systems engineering; Risk analysis (engineering); Engineering; Simulation; Business; Management","score_opus":0.08980733498153716,"score_gpt":0.3632548782465098,"score_spread":0.27344754326497267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120216636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009072099,0.0000529777,0.9737757,0.00026016077,0.00014603944,0.00037063856,0.00068287214,0.00796782,0.0076716803],"genre_scores_gemma":[0.12754376,0.0004276023,0.8558771,0.00022152258,0.000080081554,0.001384812,0.0018300344,0.0015592022,0.01107586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908245,0.00038519944,0.000093449606,0.00011385464,0.0002426322,0.00008233673],"domain_scores_gemma":[0.9971475,0.0019785948,0.000117506555,0.00025971155,0.00027020668,0.0002264795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002205858,0.00075451605,0.000768747,0.0005069695,0.0005060075,0.0016272801,0.001957045,0.0011826346,0.011755719],"category_scores_gemma":[0.004308743,0.0005601598,0.000949024,0.00054106937,0.0006417943,0.0012976057,0.0016816308,0.0020843074,0.0018010109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061693124,0.0006214711,0.002140143,0.0003986508,0.00011956849,0.00038335295,0.0006593996,0.82753056,0.014481538,0.07093506,0.015231475,0.06688176],"study_design_scores_gemma":[0.00021087613,0.00009991004,0.00021863916,0.000033118584,0.000025798388,0.000072289986,0.000037807393,0.94469434,0.0037178248,0.007562899,0.043291703,0.00003474514],"about_ca_topic_score_codex":0.0026264414,"about_ca_topic_score_gemma":0.003298598,"teacher_disagreement_score":0.011755719,"about_ca_system_score_codex":0.0005623539,"about_ca_system_score_gemma":0.0016883992,"threshold_uncertainty_score":0.039326727},"labels":[],"label_agreement":null},{"id":"W2120537531","doi":"10.12927/cjnl.2008.20285","title":"A Case Study: The Initiative to Improve RN Scheduling at Hamilton Health Sciences","year":2008,"lang":"en","type":"article","venue":"Nursing leadership","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Hamilton Health Sciences","funders":"","keywords":"Nurse scheduling problem; Scheduling (production processes); Health care; Nursing; Human resources; Business; Flexible scheduling; Operations management; Medicine; Psychology; Management; Political science; Engineering; Two-level scheduling; Dynamic priority scheduling; Schedule; Economics","score_opus":0.7104307515342955,"score_gpt":0.4681938544732573,"score_spread":0.24223689706103818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120537531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9232456,0.0007429803,0.0180044,0.01274397,0.0002969724,0.001370349,0.0002759505,0.00018765753,0.043132138],"genre_scores_gemma":[0.94662434,0.0008816682,0.03451831,0.0017603623,0.00009932805,0.00038340382,0.00014051679,0.0000659718,0.015526108],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99531615,0.002926701,0.00008769537,0.00021751292,0.00058421865,0.0008677679],"domain_scores_gemma":[0.99590117,0.0016165192,0.00030123122,0.00016527546,0.0005663862,0.0014494343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027560599,0.00042894014,0.00018277187,0.00053768494,0.005492027,0.0011584786,0.002194569,0.002168022,0.0026401407],"category_scores_gemma":[0.005862581,0.0003047667,0.0003046644,0.0010361978,0.0012094007,0.00062216294,0.0013085813,0.0017368037,0.00031389314],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001494607,0.009687626,0.07908643,0.0016862287,0.00011068143,0.14142872,0.18907195,0.038539164,0.010967742,0.043990023,0.1121006,0.37183622],"study_design_scores_gemma":[0.0005835792,0.008038128,0.06496902,0.0006117984,0.00009479103,0.026683504,0.3834912,0.049272902,0.0116304625,0.0072136703,0.44709814,0.0003129007],"about_ca_topic_score_codex":0.10004587,"about_ca_topic_score_gemma":0.2631995,"teacher_disagreement_score":0.10004587,"about_ca_system_score_codex":0.0077581867,"about_ca_system_score_gemma":0.007575804,"threshold_uncertainty_score":0.19892704},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.13715358387785245,"score_gpt":0.36783931158191163,"score_spread":0.23068572770405918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123932009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032931097,0.0024271396,0.94461477,0.00053289934,0.00020845844,0.00039602548,0.00024155971,0.00072503753,0.017922986],"genre_scores_gemma":[0.28748035,0.0018470417,0.7046633,0.00037610254,0.00012943445,0.00067167357,0.00031549143,0.00026612257,0.00425053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975758,0.0014783669,0.00011459358,0.00022720602,0.00043718825,0.00016687029],"domain_scores_gemma":[0.9935621,0.0049082125,0.0004398013,0.0004382135,0.0004635757,0.00018814903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023180908,0.00086895213,0.001007571,0.0016000103,0.0008246805,0.0018125878,0.0012689324,0.0013717826,0.0030372909],"category_scores_gemma":[0.00891039,0.00064479874,0.0011249246,0.00297559,0.001413289,0.0011297916,0.0013417975,0.0024016933,0.00047600834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013923402,0.00012134829,0.0011257915,0.0004005959,0.000110913075,0.00015647904,0.00018290573,0.7595725,0.003276682,0.10028187,0.0035349377,0.1310967],"study_design_scores_gemma":[0.00007941852,0.00012785994,0.00054987497,0.00008600827,0.00005174223,0.00012532546,0.00007252548,0.8825708,0.0057883295,0.09926307,0.01124302,0.00004208002],"about_ca_topic_score_codex":0.005209795,"about_ca_topic_score_gemma":0.005296054,"teacher_disagreement_score":0.005209795,"about_ca_system_score_codex":0.0020618693,"about_ca_system_score_gemma":0.0018855884,"threshold_uncertainty_score":0.014959991},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.0969777626073913,"score_gpt":0.35893173602124734,"score_spread":0.26195397341385607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124761764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010059952,0.00018951131,0.9958994,0.00027201805,0.000040165345,0.00009452086,0.00009938024,0.000074098134,0.0023249525],"genre_scores_gemma":[0.08156649,0.0009981093,0.91172624,0.00032373995,0.00017355643,0.0012183407,0.0003810484,0.00008805491,0.0035243623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754745,0.0010325052,0.00013595873,0.00040725397,0.0006348635,0.00024197242],"domain_scores_gemma":[0.9950913,0.0040201386,0.00021059993,0.000115683964,0.00041754852,0.00014468358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003675616,0.0022789834,0.0016477588,0.0011690714,0.0011186113,0.002624808,0.0024539744,0.002268168,0.0061037],"category_scores_gemma":[0.0069200536,0.001170495,0.0019719538,0.0027441448,0.001665614,0.0013941919,0.0016598895,0.0036650037,0.00072470383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004073359,0.000069698355,0.00013530631,0.00018108661,0.00005608924,0.000100538644,0.00006793631,0.90653706,0.0005293828,0.063582964,0.0018693359,0.026829837],"study_design_scores_gemma":[0.000037372174,0.00003482493,0.000035285942,0.000023303419,0.000018549257,0.000021595017,0.000019345725,0.97117054,0.0002382057,0.0257529,0.002635559,0.000012607944],"about_ca_topic_score_codex":0.018255295,"about_ca_topic_score_gemma":0.012400994,"teacher_disagreement_score":0.018255295,"about_ca_system_score_codex":0.0027886012,"about_ca_system_score_gemma":0.0055808383,"threshold_uncertainty_score":0.036298096},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.25080482723417213,"score_gpt":0.5014999654509681,"score_spread":0.25069513821679595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133424441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859024,0.0023916655,0.008333133,0.00025646162,0.000020426527,0.00014699485,0.00029891872,0.00017384037,0.002476122],"genre_scores_gemma":[0.991452,0.0004881414,0.0071145976,0.00004107629,0.000012579137,0.00009694578,0.00032225953,0.000043339103,0.00042906718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914022,0.005287404,0.0006898654,0.0006326942,0.0015860276,0.00040183368],"domain_scores_gemma":[0.6936505,0.27479178,0.010052909,0.011523695,0.008288409,0.0016927671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010547682,0.00055584486,0.0007347619,0.0022273997,0.0007803192,0.0018195767,0.0016706461,0.0014323968,0.0018952668],"category_scores_gemma":[0.099963695,0.00046269578,0.0005783309,0.0036070254,0.0013150622,0.0028192315,0.0009477988,0.001396969,0.00029622953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005321665,0.004466376,0.1507388,0.0028338993,0.0008074317,0.0008016278,0.0033457254,0.45832074,0.00708287,0.009317441,0.005525156,0.35143825],"study_design_scores_gemma":[0.0006364783,0.008240661,0.107844666,0.00073187606,0.0005604373,0.0014527412,0.0035486948,0.836015,0.016577171,0.012408306,0.011737946,0.00024608706],"about_ca_topic_score_codex":0.0026057642,"about_ca_topic_score_gemma":0.0025980205,"teacher_disagreement_score":0.010547682,"about_ca_system_score_codex":0.0016328264,"about_ca_system_score_gemma":0.0009988182,"threshold_uncertainty_score":0.05578214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07418487081622242,"score_gpt":0.33057451720133596,"score_spread":0.2563896463851135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134909806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015108264,0.004459606,0.94971657,0.0005547897,0.00048221307,0.00015180666,0.00094751036,0.0035736253,0.025005568],"genre_scores_gemma":[0.12410368,0.0018772008,0.83102685,0.0002260833,0.00027929601,0.00040542916,0.0021000528,0.0013578525,0.03862354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.000521808,0.000078689474,0.00022050347,0.0003065928,0.00016701383],"domain_scores_gemma":[0.9965959,0.0021983408,0.00017581141,0.0006710455,0.00025406768,0.000104763756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017746363,0.0011174902,0.001398091,0.0013711145,0.001036728,0.002674421,0.004002804,0.0012857475,0.052232184],"category_scores_gemma":[0.008536631,0.0009867154,0.001314729,0.0054176524,0.000959117,0.00592696,0.001571051,0.0024757911,0.005640392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077256904,0.00025741066,0.00050918735,0.00055935927,0.00008629375,0.00009142007,0.00021587394,0.16007462,0.0018884211,0.20084544,0.03635309,0.59834635],"study_design_scores_gemma":[0.0002195158,0.00019951585,0.0004981698,0.00012720021,0.00008437936,0.00013239475,0.000116540046,0.50085896,0.0025172147,0.4599751,0.03521133,0.000059598493],"about_ca_topic_score_codex":0.00868443,"about_ca_topic_score_gemma":0.010875457,"teacher_disagreement_score":0.052232184,"about_ca_system_score_codex":0.0015068838,"about_ca_system_score_gemma":0.002125219,"threshold_uncertainty_score":0.17473406},"labels":[],"label_agreement":null},{"id":"W2139079860","doi":"10.7202/800611ar","title":"Analyse des effets économiques de la semaine comprimée et des horaires flexibles sur l’entreprise","year":2009,"lang":"en","type":"article","venue":"L Actualité économique","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Economics; Welfare economics; Art","score_opus":0.1401646600965783,"score_gpt":0.3938860386569096,"score_spread":0.2537213785603313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139079860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909185,0.0012865544,0.0041131317,0.00034296158,0.00002985036,0.0000470392,0.00018394562,0.000019709572,0.0030581714],"genre_scores_gemma":[0.9935743,0.0010106576,0.0026934594,0.00006558199,0.00003232373,0.000039968647,0.00017485894,0.000012419126,0.0023963195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992167,0.0004398062,0.00002357601,0.000088936504,0.0001367426,0.000094177674],"domain_scores_gemma":[0.9632553,0.034719992,0.0009536217,0.00037648546,0.00040722577,0.00028742405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002871149,0.0006001802,0.00083341415,0.0005820312,0.0002437501,0.0008470623,0.00052624353,0.00086676073,0.0073291967],"category_scores_gemma":[0.009271241,0.00023072923,0.0009024424,0.0006522127,0.00053539866,0.00091131125,0.00035389056,0.0009323552,0.0004114245],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03491035,0.008093895,0.09331291,0.0022539978,0.0022457808,0.0005394031,0.00056720834,0.5082014,0.06416292,0.014603643,0.0013275505,0.26978096],"study_design_scores_gemma":[0.0024824913,0.052628137,0.41456544,0.00023846785,0.0031030627,0.00037877774,0.0022421805,0.41435674,0.0709919,0.026095774,0.012594229,0.00032284492],"about_ca_topic_score_codex":0.005519928,"about_ca_topic_score_gemma":0.0043556294,"teacher_disagreement_score":0.0073291967,"about_ca_system_score_codex":0.0009162835,"about_ca_system_score_gemma":0.0006607024,"threshold_uncertainty_score":0.024518609},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08812373420240385,"score_gpt":0.35863292571073196,"score_spread":0.2705091915083281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139457845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7786161,0.00022465587,0.21065925,0.00043270944,0.00007948576,0.00060752296,0.00058196305,0.0017557219,0.007042697],"genre_scores_gemma":[0.76033515,0.00015958956,0.23502316,0.0000391652,0.000020727333,0.00023366467,0.00080959016,0.0002205112,0.0031583852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950194,0.00021329637,0.000028457287,0.00009477986,0.00007979689,0.000081624894],"domain_scores_gemma":[0.99797064,0.0011245385,0.00017956804,0.00015305285,0.00028214586,0.00029001455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451726,0.00047697395,0.00032911662,0.0006753619,0.0006883318,0.00088450685,0.0006910445,0.0002918068,0.0029692804],"category_scores_gemma":[0.00476056,0.00028563637,0.00029707546,0.0006294055,0.00019444327,0.0005570634,0.0004502063,0.00036268358,0.0003414944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010680186,0.0008453055,0.012407856,0.00028236632,0.00004001851,0.00028300565,0.001624109,0.5420561,0.016404849,0.007960731,0.011772735,0.40525487],"study_design_scores_gemma":[0.00021382443,0.00065761706,0.005170418,0.00003136364,0.0000405768,0.000067080124,0.00086631405,0.9604133,0.011405879,0.004901003,0.016193308,0.000039236453],"about_ca_topic_score_codex":0.011571712,"about_ca_topic_score_gemma":0.021134641,"teacher_disagreement_score":0.011571712,"about_ca_system_score_codex":0.001083626,"about_ca_system_score_gemma":0.00267759,"threshold_uncertainty_score":0.023008704},"labels":[],"label_agreement":null},{"id":"W2141410486","doi":"10.1007/s10878-006-9019-3","title":"On edge orienting methods for graph coloring","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Digraph; Graph coloring; Edge coloring; Tabu search; Theory of computation; Fractional coloring; Mathematics; Graph; Combinatorics; Computer science; Theoretical computer science; Discrete mathematics; Algorithm; Line graph; Graph power","score_opus":0.07129417282979277,"score_gpt":0.4222655733320862,"score_spread":0.3509714005022934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141410486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003555619,0.0006537732,0.98848104,0.00019319988,0.00013850367,0.00004021441,0.00005701933,0.00026518994,0.0066154567],"genre_scores_gemma":[0.07170103,0.002019744,0.91389877,0.0004247902,0.0003486094,0.00024042888,0.00034260037,0.00083888805,0.010185222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999114,0.00044377602,0.000034122146,0.00012291958,0.00020375253,0.00008147703],"domain_scores_gemma":[0.9964228,0.0025497875,0.00012549272,0.00045254867,0.00031693044,0.00013242292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019135526,0.0015197876,0.0010426169,0.0018029622,0.00083187764,0.0013382407,0.0019462697,0.0010488174,0.009212442],"category_scores_gemma":[0.0077649103,0.00067302206,0.0012666078,0.0025897904,0.0012774185,0.0033373511,0.0021664773,0.0032338134,0.0015976181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019095026,0.00023559114,0.0007154253,0.00033785417,0.00006967409,0.00006217246,0.00023715751,0.16804446,0.003947408,0.35709524,0.014387828,0.45467618],"study_design_scores_gemma":[0.000051229672,0.000050694674,0.00025335932,0.00008011564,0.000038287955,0.00004688424,0.0000646016,0.6100012,0.001215287,0.37270793,0.015469885,0.000020461259],"about_ca_topic_score_codex":0.0035999068,"about_ca_topic_score_gemma":0.0046940665,"teacher_disagreement_score":0.009212442,"about_ca_system_score_codex":0.00088576524,"about_ca_system_score_gemma":0.000860589,"threshold_uncertainty_score":0.030818641},"labels":[],"label_agreement":null},{"id":"W2144444935","doi":"10.5267/j.msl.2012.06.021","title":"A greedy double swap heuristic for nurse scheduling","year":2012,"lang":"en","type":"preprint","venue":"Management Science Letters","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nurse scheduling problem; Swap (finance); Computer science; Greedy algorithm; Scheduling (production processes); Heuristic; Mathematical optimization; Schedule; Operations research; Job shop scheduling; Nursing; Medicine; Artificial intelligence; Mathematics; Economics; Algorithm; Flow shop scheduling","score_opus":0.1482721822949325,"score_gpt":0.4050844058086853,"score_spread":0.2568122235137528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144444935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04593575,0.00044478892,0.9447697,0.00025526006,0.00010695395,0.0002549929,0.00013758014,0.0004781049,0.007616797],"genre_scores_gemma":[0.40643188,0.00033379655,0.5876776,0.00020611702,0.00005488937,0.00045106668,0.0002900373,0.00014756496,0.004406991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.00036813374,0.000026550078,0.000076931516,0.00015515432,0.00015070102],"domain_scores_gemma":[0.9993612,0.00039722334,0.00005763397,0.00004767573,0.00006481358,0.000071380935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079577,0.0008846127,0.0010802107,0.0009727659,0.00064503547,0.0007496318,0.0012419423,0.0011568613,0.004762906],"category_scores_gemma":[0.0019138495,0.0005666153,0.0008225109,0.0012350884,0.0006565683,0.00073247054,0.00083038124,0.0007460538,0.0005695595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022064819,0.00013210521,0.00046570087,0.00011355971,0.00003740019,0.00011198705,0.00006971587,0.9116761,0.0017060766,0.013346538,0.0035223304,0.068597786],"study_design_scores_gemma":[0.00003997243,0.00008054165,0.00012451215,0.000008782385,0.000010422958,0.000038859092,0.000025253801,0.99157166,0.00056851626,0.006103281,0.0014180691,0.000010098848],"about_ca_topic_score_codex":0.0040614796,"about_ca_topic_score_gemma":0.0045062127,"teacher_disagreement_score":0.004762906,"about_ca_system_score_codex":0.0012182519,"about_ca_system_score_gemma":0.0021683252,"threshold_uncertainty_score":0.015933573},"labels":[],"label_agreement":null},{"id":"W2144648064","doi":"10.5555/2675983.2676337","title":"2 Canadian forces flying training school (2 CFFTS) resource allocation simulation tool","year":2013,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Training (meteorology); Resource allocation; Duration (music); Resource (disambiguation); Computer science; Simulation; Resource management (computing); Operations research; Aeronautics; Engineering; Meteorology; Distributed computing","score_opus":0.18646641841219877,"score_gpt":0.38272062098606857,"score_spread":0.1962542025738698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144648064","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11240461,0.00031713807,0.3841781,0.0013213432,0.0005253855,0.0021246087,0.039775304,0.05122266,0.40813076],"genre_scores_gemma":[0.55238116,0.0005283542,0.32194516,0.0004180128,0.000041629755,0.0016039517,0.025933173,0.003274298,0.09387426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.00003835251,0.000010377664,0.000032958644,0.000102563754,0.00005386956],"domain_scores_gemma":[0.9995454,0.00011141091,0.000016318154,0.000037423364,0.0002315709,0.0000579347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005009529,0.0006107803,0.00028946484,0.0006083458,0.0006394129,0.0008349204,0.0009928888,0.00059327425,0.043690294],"category_scores_gemma":[0.0012587946,0.000379995,0.0004998053,0.0006859246,0.00022818924,0.0004990351,0.00048999884,0.0007272526,0.0043373997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003707142,0.00028086032,0.009233269,0.0002630193,0.00005228531,0.00019459504,0.00038202098,0.6754316,0.005308823,0.019503547,0.17345434,0.11552481],"study_design_scores_gemma":[0.00016877464,0.000074514704,0.0031363876,0.000048378402,0.000023304683,0.00004362438,0.00008097926,0.82093865,0.0026607122,0.0018265371,0.17094617,0.0000520522],"about_ca_topic_score_codex":0.39070883,"about_ca_topic_score_gemma":0.4283825,"teacher_disagreement_score":0.6092912,"about_ca_system_score_codex":0.0031137648,"about_ca_system_score_gemma":0.006555353,"threshold_uncertainty_score":0.7768693},"labels":[],"label_agreement":null},{"id":"W2145029849","doi":"10.1109/cec.2010.5586121","title":"Artificial emotional intelligence under ethical constraints in formulating social agent behaviour","year":2010,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Reputation; Multi-agent system; Convergence (economics); Graph; Process (computing); Artificial intelligence; Management science; Knowledge management; Theoretical computer science; Engineering","score_opus":0.2628448554260898,"score_gpt":0.4637222080975839,"score_spread":0.2008773526714941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145029849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2931174,0.000337713,0.6726075,0.002643105,0.00012220754,0.00019192017,0.000042070023,0.00010153618,0.03083653],"genre_scores_gemma":[0.92899394,0.00012770717,0.06848351,0.00016243308,0.000046858193,0.00020320716,0.000022091393,0.00002017438,0.001940189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979546,0.0013896208,0.00006382931,0.00012885849,0.00030176737,0.00016118007],"domain_scores_gemma":[0.99326575,0.0051720305,0.00067345815,0.0003117633,0.0003513177,0.00022569341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031447425,0.0005440924,0.0004394827,0.00045147803,0.0005214849,0.0014365229,0.00078636623,0.0010376539,0.0016110957],"category_scores_gemma":[0.01637682,0.00034576608,0.00046390248,0.00031036304,0.0029938535,0.0020457571,0.0015733293,0.0012898233,0.00011440327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004048221,0.00006925844,0.0015776159,0.00008766986,0.000033434648,0.00020720992,0.00043037397,0.74599564,0.0011143384,0.24043386,0.00044646623,0.009563707],"study_design_scores_gemma":[0.000021970809,0.000041075305,0.00036493628,0.000017153116,0.0000096179165,0.00002081486,0.00012424646,0.8840173,0.00026821758,0.11439547,0.00070824806,0.000010928628],"about_ca_topic_score_codex":0.0022068005,"about_ca_topic_score_gemma":0.0019590773,"teacher_disagreement_score":0.0031447425,"about_ca_system_score_codex":0.0010995792,"about_ca_system_score_gemma":0.0012327953,"threshold_uncertainty_score":0.016631186},"labels":[],"label_agreement":null},{"id":"W2148731999","doi":"10.1109/icsmc.2009.5346925","title":"Automating nurse self-rostering: A multiagent systems model","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multi-agent system; Human–computer interaction; Artificial intelligence","score_opus":0.1584666892584696,"score_gpt":0.4182469768417733,"score_spread":0.25978028758330374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148731999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022678155,0.00013379422,0.9670156,0.0005485516,0.000036047608,0.00016579893,0.00005171403,0.00019899115,0.0091712745],"genre_scores_gemma":[0.5608513,0.00045286372,0.42906544,0.000120023775,0.000066525594,0.0005353902,0.000106846586,0.000045328456,0.00875627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993895,0.00025119277,0.000039177576,0.00011672673,0.0001508984,0.00005241319],"domain_scores_gemma":[0.9993191,0.00030798512,0.00012547817,0.000066291504,0.00010651378,0.00007475493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470244,0.00044980057,0.00035201985,0.0004260726,0.00079823344,0.0013005815,0.0014191557,0.0009944182,0.0031084141],"category_scores_gemma":[0.0016783255,0.0003402407,0.0005994679,0.0004553771,0.0005826981,0.0017410102,0.00082450255,0.00071728975,0.0004582192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098488075,0.00018716881,0.0013681352,0.00013686513,0.000054366054,0.00029308413,0.0005723898,0.76853806,0.003850136,0.18086515,0.0013171139,0.042719014],"study_design_scores_gemma":[0.00003333354,0.000052668864,0.00018092556,0.000013099506,0.000017305865,0.000039167546,0.000076504446,0.97530955,0.00086075306,0.01918173,0.004219628,0.000015421452],"about_ca_topic_score_codex":0.0043957178,"about_ca_topic_score_gemma":0.0036691069,"teacher_disagreement_score":0.0043957178,"about_ca_system_score_codex":0.00094448,"about_ca_system_score_gemma":0.0014521028,"threshold_uncertainty_score":0.010398686},"labels":[],"label_agreement":null},{"id":"W2149308764","doi":"","title":"An Integer Linear Programming-based Heuristic for Weekly Scheduling of Fast-Food Restaurant Employees","year":2009,"lang":"en","type":"article","venue":"ASAC","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Integer programming; Linear programming; Scheduling (production processes); Computer science; Heuristic; Mathematical optimization; Operations research; Mathematics","score_opus":0.11205429188572645,"score_gpt":0.4079181972146087,"score_spread":0.29586390532888224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149308764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27242342,0.0009770317,0.70317316,0.00082120905,0.00037934876,0.0009057575,0.00091848866,0.0020244548,0.018377168],"genre_scores_gemma":[0.55596715,0.00026762494,0.4380531,0.00021021915,0.000070132846,0.0005083012,0.00069312303,0.0001542366,0.0040761316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938715,0.00022205972,0.000026118472,0.00008779931,0.00010838315,0.00016850983],"domain_scores_gemma":[0.99835473,0.0010144372,0.00012979736,0.00006778281,0.00026595077,0.00016713409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655568,0.0008278081,0.0015001699,0.0015895307,0.000881295,0.0014531305,0.0017838173,0.0015001277,0.005890069],"category_scores_gemma":[0.0030909553,0.0009804566,0.0010168649,0.0017602149,0.0004475816,0.0009343397,0.000643615,0.0010959248,0.0005110801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037518816,0.00037268226,0.00056805584,0.00013373065,0.000041671712,0.000054175453,0.00006560984,0.92626613,0.0017354962,0.0025439493,0.0031442447,0.064698964],"study_design_scores_gemma":[0.00006452706,0.00009565619,0.00017291952,0.00000730674,0.000019577734,0.0000069109647,0.000027217538,0.9981528,0.000334116,0.0006748652,0.00043689768,0.0000070789843],"about_ca_topic_score_codex":0.025998447,"about_ca_topic_score_gemma":0.025965767,"teacher_disagreement_score":0.025998447,"about_ca_system_score_codex":0.0023262866,"about_ca_system_score_gemma":0.005010244,"threshold_uncertainty_score":0.051694214},"labels":[],"label_agreement":null},{"id":"W2149951690","doi":"","title":"A multi-phase approach to university course timetabling","year":2007,"lang":"en","type":"dissertation","venue":"Open ULeth Scholarship (OPUS) (University of Lethbridge)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Course (navigation); Phase (matter); Computer science; Mathematics education; Operations research; Engineering; Mathematics; Physics; Aerospace engineering","score_opus":0.22195294505341268,"score_gpt":0.4530999365199553,"score_spread":0.2311469914665426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149951690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061308662,0.00018367989,0.9885815,0.00031663396,0.000063045074,0.00041522802,0.0001469184,0.00041369456,0.0037484958],"genre_scores_gemma":[0.0716188,0.00020952836,0.92111516,0.00015118095,0.000060398626,0.0005854639,0.0004532912,0.00021860514,0.0055875746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959514,0.0015485894,0.00018261919,0.0008118587,0.0010340973,0.0004714563],"domain_scores_gemma":[0.99740064,0.0010729913,0.00023269365,0.00042447305,0.00063871045,0.00023052352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030150828,0.0010182497,0.0009524457,0.0014411611,0.0011304467,0.0017807141,0.002817981,0.0011774012,0.014875655],"category_scores_gemma":[0.004231861,0.00093709445,0.0022403265,0.001974931,0.0006281422,0.0025023513,0.0025396019,0.0022018242,0.00169828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034930967,0.0009466506,0.0015874065,0.00060142594,0.00013273268,0.0001886794,0.00050041603,0.47119102,0.012525007,0.07489922,0.012759698,0.42431846],"study_design_scores_gemma":[0.00010011477,0.00045831426,0.00068353064,0.000060601997,0.00005224119,0.00016144775,0.0001664045,0.9293429,0.0050741816,0.03348995,0.030357696,0.000052587195],"about_ca_topic_score_codex":0.0034222908,"about_ca_topic_score_gemma":0.0063210432,"teacher_disagreement_score":0.014875655,"about_ca_system_score_codex":0.0018393716,"about_ca_system_score_gemma":0.0033983656,"threshold_uncertainty_score":0.049764037},"labels":[],"label_agreement":null},{"id":"W2151966264","doi":"10.1016/j.dam.2009.04.015","title":"About equivalent interval colorings of weighted graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Complete coloring; Edge coloring; Fractional coloring; Integer (computer science); Interval (graph theory); Discrete mathematics; Brooks' theorem; Graph; Graph coloring; Chordal graph; Graph power; 1-planar graph","score_opus":0.08162971734262851,"score_gpt":0.3677570846800396,"score_spread":0.28612736733741106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151966264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32339087,0.0016628978,0.61677307,0.0028313133,0.0005489238,0.00010401519,0.0012090203,0.00031722675,0.053162705],"genre_scores_gemma":[0.88337725,0.0021300719,0.0997777,0.0007955673,0.00083219033,0.00016762591,0.0020109059,0.00035427773,0.01055438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00043615833,0.00007103222,0.0002840511,0.00028774882,0.0002049777],"domain_scores_gemma":[0.9923955,0.0054196357,0.0006515588,0.0005099975,0.0006913543,0.00033187532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016011845,0.00095264777,0.0010312407,0.0014852104,0.0010653513,0.0032942772,0.0019851339,0.0012484643,0.009484647],"category_scores_gemma":[0.012419409,0.00069068203,0.0016239617,0.0025093942,0.0017400682,0.0062711537,0.0012286238,0.003552315,0.00047201524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002717168,0.000104954546,0.00060794293,0.00022154556,0.00006644864,0.000109232715,0.00047479873,0.06473231,0.0013790826,0.90245026,0.0039876658,0.025594005],"study_design_scores_gemma":[0.000028075681,0.000019346915,0.00017820131,0.000023195453,0.000023960327,0.00003434362,0.00008121791,0.055669107,0.00027894054,0.94230443,0.0013493175,0.000009859431],"about_ca_topic_score_codex":0.003345464,"about_ca_topic_score_gemma":0.0023713354,"teacher_disagreement_score":0.009484647,"about_ca_system_score_codex":0.0016524704,"about_ca_system_score_gemma":0.0006830225,"threshold_uncertainty_score":0.03172934},"labels":[],"label_agreement":null},{"id":"W2153627921","doi":"10.5539/ies.v7n12p20","title":"Students’ Progress throughout Examination Process as a Markov Chain","year":2014,"lang":"en","type":"article","venue":"International Education Studies","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Markov chain; Absorbing Markov chain; Mathematics education; Process (computing); Markov process; Computer science; Markov model; Markov property; Psychology; Mathematics; Statistics; Machine learning","score_opus":0.138564543617166,"score_gpt":0.5330010016903308,"score_spread":0.39443645807316485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153627921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5337478,0.00045074645,0.44941184,0.0016091492,0.00007564902,0.00032660764,0.0012488978,0.00047320742,0.012656094],"genre_scores_gemma":[0.9669312,0.0005277444,0.016469916,0.000053887972,0.000039893974,0.0003669822,0.0006120366,0.000052437037,0.014945874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984536,0.00048279477,0.00008296864,0.00040525463,0.00026523846,0.00031020076],"domain_scores_gemma":[0.99243915,0.0053286636,0.0008973069,0.00036621184,0.00063691725,0.00033157892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028436047,0.00069164106,0.0008307256,0.001403183,0.0007593873,0.0022474665,0.0015251618,0.0015203101,0.0077871387],"category_scores_gemma":[0.008094217,0.0005660335,0.0009945679,0.0010442726,0.0013224297,0.0022875932,0.0012707368,0.0015782372,0.001209387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004631631,0.0002424571,0.02608695,0.00020990497,0.000103967504,0.0008971834,0.0019511587,0.74828744,0.004314163,0.19057758,0.001851733,0.025014326],"study_design_scores_gemma":[0.000038789844,0.00016351348,0.0031201546,0.000042847598,0.000058829042,0.00013427195,0.00014543398,0.9711582,0.00083827344,0.023050299,0.0011982399,0.000051101422],"about_ca_topic_score_codex":0.011852133,"about_ca_topic_score_gemma":0.0058411844,"teacher_disagreement_score":0.011852133,"about_ca_system_score_codex":0.0015329454,"about_ca_system_score_gemma":0.0014062726,"threshold_uncertainty_score":0.026050568},"labels":[],"label_agreement":null},{"id":"W2158898837","doi":"10.1016/j.dam.2006.07.018","title":"Graph coloring in the estimation of sparse derivative matrices: Instances and applications","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Mathematics; Graph coloring; Graph; Combinatorics; Partition (number theory); Intersection (aeronautics); Derivative (finance); Discrete mathematics; Algorithm","score_opus":0.08157609739785825,"score_gpt":0.37058067989692284,"score_spread":0.2890045824990646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158898837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025323,0.00086695334,0.92372346,0.0010307723,0.00009797358,0.00016481603,0.0006278734,0.00056211423,0.0026728325],"genre_scores_gemma":[0.5919121,0.001010685,0.39978617,0.0002651053,0.0002704364,0.00027882628,0.0014841415,0.00046038642,0.0045320773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981713,0.0008736916,0.00006568128,0.00044656027,0.0002816404,0.00016109335],"domain_scores_gemma":[0.96469784,0.03105746,0.0014148102,0.0010922624,0.0010547722,0.00068284903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038922874,0.002497095,0.003102536,0.0021414715,0.0012706666,0.0022111507,0.0036006612,0.0032580965,0.003712918],"category_scores_gemma":[0.026000144,0.0015557655,0.0014424243,0.004276917,0.002174398,0.0035359215,0.0017768473,0.0032380647,0.00038382527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014732723,0.00018588862,0.001365457,0.00013717265,0.000052175306,0.00009543401,0.00006831133,0.9550313,0.00031913645,0.017903576,0.002384268,0.022309875],"study_design_scores_gemma":[0.000019676017,0.000010351589,0.000092338756,0.00000566249,0.0000063285593,0.000012398177,0.000011937739,0.9834869,0.00014700912,0.016038079,0.00016297757,0.000006430305],"about_ca_topic_score_codex":0.02912396,"about_ca_topic_score_gemma":0.022366313,"teacher_disagreement_score":0.02912396,"about_ca_system_score_codex":0.0027588631,"about_ca_system_score_gemma":0.0031154763,"threshold_uncertainty_score":0.057908893},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.17683955197974974,"score_gpt":0.4410135482310937,"score_spread":0.26417399625134397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165843305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04742382,0.00062341447,0.9459729,0.0010512853,0.000092186056,0.0002276189,0.0001644101,0.00028579883,0.0041584754],"genre_scores_gemma":[0.8214025,0.0006494566,0.1723893,0.00032410532,0.00019117528,0.00034653046,0.00020553546,0.00015629633,0.004335181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770373,0.0011418624,0.000077104785,0.00028382492,0.0003536102,0.00043988053],"domain_scores_gemma":[0.9968893,0.0022689446,0.00026079628,0.00007692218,0.00020967824,0.00029434185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033482697,0.0015395568,0.0024959003,0.0018433934,0.0007181831,0.0026223762,0.0018855743,0.0019535006,0.004324257],"category_scores_gemma":[0.0072360993,0.0015741558,0.0011312158,0.0022219329,0.0007983423,0.0024206247,0.0019264073,0.0020203595,0.0005778719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008028989,0.00008933815,0.00033640597,0.000041823656,0.00003431136,0.000015909085,0.0000151941695,0.9798749,0.0004278705,0.0065759583,0.00060782616,0.01190012],"study_design_scores_gemma":[0.000018172037,0.000039050316,0.00010517103,0.000005168816,0.000013039949,0.000009738431,0.000010390616,0.99259466,0.00015315188,0.0068691894,0.00017582676,0.0000064269198],"about_ca_topic_score_codex":0.009643534,"about_ca_topic_score_gemma":0.007769633,"teacher_disagreement_score":0.009643534,"about_ca_system_score_codex":0.0034135673,"about_ca_system_score_gemma":0.006574815,"threshold_uncertainty_score":0.02476734},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09904310839770022,"score_gpt":0.38101977286631233,"score_spread":0.28197666446861214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167699778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5474493,0.00031087568,0.42736816,0.0006065194,0.00050994527,0.0020850787,0.00038184976,0.00057764485,0.020710694],"genre_scores_gemma":[0.86461323,0.00013766353,0.12733418,0.00005921473,0.00006736137,0.00038723633,0.00014884763,0.00006860832,0.0071835523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982886,0.00057768123,0.000100557794,0.00032448195,0.00029405422,0.0004146026],"domain_scores_gemma":[0.9978017,0.00068748934,0.00020838037,0.0003559344,0.00039192158,0.0005544989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272234,0.00086754444,0.0010967818,0.0012156144,0.001632831,0.0018867896,0.0018962249,0.0010866999,0.011764043],"category_scores_gemma":[0.0048513752,0.00069338107,0.0011113129,0.0015799867,0.000529946,0.0014626886,0.0015024171,0.0015639731,0.001188056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002719412,0.0025534884,0.010741392,0.0005567885,0.00018940757,0.00033925936,0.0006855104,0.4104505,0.025318967,0.015727244,0.003473559,0.52724457],"study_design_scores_gemma":[0.00038450357,0.002678491,0.013567028,0.00010445299,0.00021559173,0.00026222068,0.0019013063,0.88340753,0.019098677,0.06506466,0.013201175,0.000114399714],"about_ca_topic_score_codex":0.0031175977,"about_ca_topic_score_gemma":0.00470575,"teacher_disagreement_score":0.011764043,"about_ca_system_score_codex":0.0012757697,"about_ca_system_score_gemma":0.0027287197,"threshold_uncertainty_score":0.039354682},"labels":[],"label_agreement":null},{"id":"W2170031843","doi":"10.5430/air.v2n1p122","title":"Domain transformation approach to deterministic optimization of examination timetables","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Benchmark (surveying); Mathematical optimization; Transformation (genetics); Constructive; Scheduling (production processes); Domain (mathematical analysis); Optimization problem; Graph; Operations research; Algorithm; Process (computing); Theoretical computer science; Mathematics","score_opus":0.537345404345089,"score_gpt":0.5153357917927699,"score_spread":0.022009612552319147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170031843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002341652,0.00007195361,0.99548316,0.00005194723,0.000024219875,0.00003472492,0.000048286507,0.00014511331,0.0017989323],"genre_scores_gemma":[0.13172884,0.00030837848,0.8630325,0.00008531217,0.000050133644,0.0002830087,0.00031425533,0.00026027963,0.003937195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.00031360012,0.00003571941,0.00016628957,0.00025969394,0.0000688024],"domain_scores_gemma":[0.99891293,0.0007014198,0.00008968313,0.00013582324,0.0001290824,0.000031042295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011627116,0.00076785084,0.00060526584,0.0007430448,0.00031786165,0.00077478937,0.0011876662,0.00052800734,0.004777766],"category_scores_gemma":[0.0029116953,0.0004640038,0.00093099975,0.0011378623,0.0006125829,0.0009991084,0.00083034096,0.0016838328,0.0007853568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004461832,0.00008033642,0.00029723064,0.00013592547,0.000026491485,0.000033524928,0.000057289744,0.8449269,0.003134152,0.039909005,0.0018103479,0.10954419],"study_design_scores_gemma":[0.00001225846,0.00003687113,0.00010942625,0.000010792436,0.000007501605,0.00002436454,0.000020767344,0.9754327,0.002033867,0.017307235,0.0049958983,0.000008270871],"about_ca_topic_score_codex":0.0026805317,"about_ca_topic_score_gemma":0.0031210496,"teacher_disagreement_score":0.004777766,"about_ca_system_score_codex":0.0010260092,"about_ca_system_score_gemma":0.0018242968,"threshold_uncertainty_score":0.015983224},"labels":[],"label_agreement":null},{"id":"W2172842020","doi":"10.1016/j.cor.2015.10.016","title":"A comparison of integer and constraint programming models for the deficiency problem","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Integer programming; Combinatorics; Mathematics; Vertex (graph theory); Edge coloring; Graph coloring; Fractional coloring; Graph; Integer (computer science); Discrete mathematics; Computer science; Mathematical optimization; Graph power; Line graph","score_opus":0.6222087096741095,"score_gpt":0.5613072832736856,"score_spread":0.06090142640042384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172842020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13184953,0.0021666677,0.8309641,0.0020266895,0.00023242102,0.00032779493,0.0010828654,0.0005191269,0.030830815],"genre_scores_gemma":[0.6336303,0.0030317598,0.3550558,0.00042566395,0.000113826,0.00043823043,0.001116695,0.00030708703,0.005880569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978211,0.001323245,0.00007673194,0.00015809872,0.000469396,0.00015144135],"domain_scores_gemma":[0.9793241,0.018309219,0.0005637012,0.0006387297,0.0008821795,0.00028206318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053334194,0.00078303163,0.000933662,0.0015763298,0.00038927532,0.0024275237,0.002046838,0.0010511025,0.0062003606],"category_scores_gemma":[0.015648188,0.00046308382,0.0012263878,0.0023508777,0.0006142331,0.0031925226,0.0006908637,0.0013341912,0.00036402483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005427509,0.00034044808,0.0012643096,0.0003335364,0.000060424467,0.000031519183,0.00011843405,0.8425622,0.0004959664,0.09414729,0.0029657504,0.057137437],"study_design_scores_gemma":[0.000038104983,0.00011064934,0.00029527035,0.000037324124,0.000022899332,0.000017242384,0.000049557417,0.98056823,0.00011836755,0.017574474,0.0011564735,0.0000113762135],"about_ca_topic_score_codex":0.01487746,"about_ca_topic_score_gemma":0.012991288,"teacher_disagreement_score":0.01487746,"about_ca_system_score_codex":0.0029150764,"about_ca_system_score_gemma":0.004113237,"threshold_uncertainty_score":0.029581726},"labels":[],"label_agreement":null},{"id":"W2182089961","doi":"10.1142/s1469026816500231","title":"A Multi-Phase Hybrid Metaheuristics Approach for the Exam Timetabling","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Metaheuristic; Tabu search; Simulated annealing; Hill climbing; Benchmarking; Benchmark (surveying); Heuristic; Mathematical optimization; Phase (matter); Algorithm; Artificial intelligence; Mathematics","score_opus":0.22335092826562866,"score_gpt":0.46226281228403093,"score_spread":0.23891188401840227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182089961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020277983,0.00042055498,0.9748138,0.0002633026,0.00008390374,0.00018348156,0.00012795378,0.00041939708,0.0034096173],"genre_scores_gemma":[0.21125025,0.00028292256,0.78433985,0.00026325774,0.000058404134,0.000495321,0.00031129378,0.00014916039,0.0028495763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933976,0.00027992655,0.000030049629,0.000090804264,0.00017522521,0.00008428294],"domain_scores_gemma":[0.99920815,0.0004526331,0.00009118357,0.000074058786,0.00011202835,0.00006181556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581022,0.0008910499,0.0009811785,0.0012773813,0.00041759017,0.00092779374,0.0022947416,0.0012673053,0.0030585073],"category_scores_gemma":[0.0018493333,0.00054971257,0.0013287948,0.0013854324,0.00047754057,0.00097307726,0.00094124145,0.0011242336,0.0003873849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093053444,0.00018581771,0.0006199813,0.0001334902,0.00009869674,0.00006996812,0.000058599424,0.9068462,0.0029087968,0.011370516,0.0020193998,0.07559545],"study_design_scores_gemma":[0.00003004059,0.000065577646,0.00010782806,0.000009174952,0.000013671955,0.000023374716,0.000013166346,0.99485105,0.0006036328,0.0028166978,0.0014588684,0.0000068808167],"about_ca_topic_score_codex":0.0027010555,"about_ca_topic_score_gemma":0.0034356017,"teacher_disagreement_score":0.0030585073,"about_ca_system_score_codex":0.00075990375,"about_ca_system_score_gemma":0.0015928806,"threshold_uncertainty_score":0.010231674},"labels":[],"label_agreement":null},{"id":"W2203691441","doi":"10.1609/aaai.v27i2.18994","title":"Balancing the Traveling Tournament Problem for Weekday and Weekend Games","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"League; Tournament; Heuristics; Operations research; Scheduling (production processes); Computer science; Schedule; Advertising; Operations management; Business; Engineering; Mathematics","score_opus":0.17593365342072856,"score_gpt":0.36642870676881184,"score_spread":0.19049505334808328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203691441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29552394,0.0015454219,0.65274644,0.0012153574,0.0002882996,0.00062034937,0.0014545604,0.0006079019,0.04599775],"genre_scores_gemma":[0.7945328,0.00095432246,0.19123933,0.00020065714,0.00018504894,0.00047190624,0.0022638089,0.00023383522,0.009918299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913377,0.00039592394,0.000039884715,0.0001401216,0.00010613107,0.0001841574],"domain_scores_gemma":[0.999171,0.00042098248,0.00011676477,0.00005966151,0.00009079577,0.000140896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012331553,0.0008023344,0.00085882744,0.00061002723,0.00077862974,0.0012776606,0.001290198,0.0009321567,0.0064013186],"category_scores_gemma":[0.0028943992,0.00036397766,0.00092840916,0.0008923201,0.00041218626,0.0015848541,0.000665304,0.0010605014,0.00048061917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072759186,0.00064984895,0.0032512501,0.00037350066,0.00018903882,0.00037560888,0.0002710572,0.7677948,0.0034754411,0.06689388,0.02133828,0.13465974],"study_design_scores_gemma":[0.00015963228,0.00027133682,0.002773447,0.00003657577,0.000050703242,0.00020188456,0.000266447,0.93262714,0.0009116415,0.049306028,0.013357774,0.000037474467],"about_ca_topic_score_codex":0.009593813,"about_ca_topic_score_gemma":0.010340564,"teacher_disagreement_score":0.009593813,"about_ca_system_score_codex":0.0010389566,"about_ca_system_score_gemma":0.0013903461,"threshold_uncertainty_score":0.021414578},"labels":[],"label_agreement":null},{"id":"W2219576758","doi":"","title":"Utilisation de langages formels pour la modelisation et la resolution de problemes de planification de quarts de travail","year":2011,"lang":"fr","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Theoretical computer science; Mathematics","score_opus":0.20756163380884698,"score_gpt":0.38897810443587266,"score_spread":0.18141647062702568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219576758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005948889,0.0004112317,0.99007004,0.00049349613,0.00009418715,0.000114046576,0.00020512396,0.0005009629,0.0021621136],"genre_scores_gemma":[0.11725943,0.001203829,0.87070554,0.00028932677,0.00018430004,0.001026224,0.0011338164,0.0004254509,0.007772193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99229276,0.0031087135,0.0006517741,0.0014621235,0.0019663817,0.00051829906],"domain_scores_gemma":[0.98309094,0.013344403,0.0010475545,0.001135977,0.0011302541,0.0002508204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067676837,0.0030977689,0.0016668848,0.002453426,0.0016461164,0.005511158,0.0027799546,0.0034990066,0.005894365],"category_scores_gemma":[0.020919649,0.0021765823,0.0072546857,0.0022892796,0.006167314,0.006599168,0.0036474771,0.0071350695,0.0018366659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101471116,0.00011280823,0.00087715033,0.00030207794,0.000099577504,0.0003791169,0.0008330834,0.5398067,0.0016033152,0.4277985,0.0013705984,0.02671564],"study_design_scores_gemma":[0.00005939755,0.000046945628,0.00011942764,0.0001005045,0.000034130746,0.0000745595,0.00012853408,0.83384126,0.0013809172,0.15277062,0.011405766,0.000038000726],"about_ca_topic_score_codex":0.03148157,"about_ca_topic_score_gemma":0.021125987,"teacher_disagreement_score":0.03148157,"about_ca_system_score_codex":0.004791309,"about_ca_system_score_gemma":0.003985369,"threshold_uncertainty_score":0.06259662},"labels":[],"label_agreement":null},{"id":"W2286452095","doi":"10.2298/yjor151102003a","title":"A new efficient RLF-like algorithm for the vertex coloring problem","year":2016,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vertex (graph theory); Greedy algorithm; Heuristics; Greedy coloring; Algorithm; Mathematics; Computer science; Fractional coloring; Chromatic scale; Combinatorics; Mathematical optimization; Graph","score_opus":0.3141830685573495,"score_gpt":0.5029930622972192,"score_spread":0.18880999373986967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286452095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060069766,0.00028854955,0.98886514,0.00019385979,0.00012472928,0.00016765106,0.00017498163,0.0013682445,0.002809983],"genre_scores_gemma":[0.046239834,0.00015258329,0.9489161,0.00019697145,0.000071376984,0.00031827335,0.00075844745,0.00028974365,0.0030566438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998985,0.00022883787,0.000043273845,0.00027321107,0.00028420673,0.00018542391],"domain_scores_gemma":[0.9992768,0.00028892615,0.00006758903,0.00013207483,0.00016372833,0.00007094925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796647,0.0013805624,0.0016057985,0.0015394775,0.0009408246,0.0012114927,0.003105657,0.0021118491,0.006220697],"category_scores_gemma":[0.0026962059,0.0006445585,0.0015602183,0.0019259965,0.00066105986,0.0015910441,0.0011281413,0.0016637604,0.0018511306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021118048,0.0003254914,0.000611963,0.00032495125,0.00008125253,0.00015549945,0.00013010122,0.48549867,0.008205281,0.02643754,0.0235381,0.45447996],"study_design_scores_gemma":[0.00010796975,0.000073963965,0.00014342282,0.000020265894,0.00001797069,0.00013877796,0.000021725738,0.9783201,0.0014761825,0.011903417,0.007750042,0.00002618578],"about_ca_topic_score_codex":0.006935711,"about_ca_topic_score_gemma":0.009603504,"teacher_disagreement_score":0.006935711,"about_ca_system_score_codex":0.0018542407,"about_ca_system_score_gemma":0.0031524654,"threshold_uncertainty_score":0.020810306},"labels":[],"label_agreement":null},{"id":"W2296525102","doi":"10.1007/978-3-642-41575-3_10","title":"Planning System for Emergency Services","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science","score_opus":0.08652663191863594,"score_gpt":0.35410814686896336,"score_spread":0.26758151495032745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296525102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029605411,0.00082185824,0.7716689,0.00086801394,0.00053776,0.00080938666,0.010723097,0.085185505,0.09978007],"genre_scores_gemma":[0.42165267,0.0009826915,0.47878346,0.000492132,0.00013266994,0.00091669813,0.015307295,0.0016450804,0.08008728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988246,0.000022351493,0.000009081601,0.000029615321,0.00003850187,0.000017982826],"domain_scores_gemma":[0.9998939,0.000025832864,0.000008734316,0.000023165927,0.00002973764,0.000018716484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028172365,0.00058855943,0.00035113737,0.0005841194,0.0004865892,0.00076167885,0.0007279616,0.00033280157,0.030584946],"category_scores_gemma":[0.00052472187,0.00026607802,0.0003254591,0.00050895853,0.00012982504,0.00056594744,0.0005312792,0.0005554198,0.007845285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047942784,0.00024017273,0.0020508121,0.00037530978,0.00007602053,0.0004507761,0.00021966717,0.1911693,0.018357247,0.029225772,0.21522674,0.5421288],"study_design_scores_gemma":[0.00009981414,0.00013675973,0.0016660404,0.0000561799,0.00007528204,0.00024876941,0.0000986509,0.7887341,0.016766751,0.016523324,0.17553927,0.000055004348],"about_ca_topic_score_codex":0.0067041335,"about_ca_topic_score_gemma":0.0063017635,"teacher_disagreement_score":0.030584946,"about_ca_system_score_codex":0.0005070879,"about_ca_system_score_gemma":0.0012970417,"threshold_uncertainty_score":0.102316916},"labels":[],"label_agreement":null},{"id":"W2311727642","doi":"10.5539/mas.v10n2p194","title":"Presentation of Multi-Skill Workforce Scheduling Model and Solving the Model Using Meta-Heuristic Algorithms","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Workforce; Computer science; Algorithm; Artificial bee colony algorithm; Scheduling (production processes); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.315235415205722,"score_gpt":0.4140467031842538,"score_spread":0.09881128797853178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311727642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091855945,0.0007288355,0.9732045,0.00075501873,0.00014870959,0.0001632427,0.00037253278,0.0002287376,0.015212802],"genre_scores_gemma":[0.4669337,0.0028765996,0.49141654,0.00035259963,0.0003349717,0.0019437168,0.0011742751,0.00014509913,0.03482253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997359,0.00007225405,0.000014840794,0.00007084085,0.00006887602,0.00003724544],"domain_scores_gemma":[0.9997787,0.00010845034,0.000032649077,0.000013243492,0.000051987176,0.000015060347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172056,0.00078318716,0.00083165814,0.00068041135,0.0004948055,0.0013496606,0.0016405876,0.0016638205,0.009596313],"category_scores_gemma":[0.00083233527,0.00046504324,0.0015094854,0.00091479847,0.00030402723,0.0009510607,0.000779437,0.0013147359,0.0010425762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018860506,0.000028861488,0.0002570714,0.00014054617,0.000016005286,0.000107878004,0.00003426295,0.97171974,0.0007143291,0.015287296,0.001284778,0.01039029],"study_design_scores_gemma":[0.000010427272,0.000023413933,0.000109693865,0.000018517108,0.000009067333,0.000029557255,0.000019157413,0.99130696,0.0002673515,0.0058841975,0.0023141464,0.000007598956],"about_ca_topic_score_codex":0.008730115,"about_ca_topic_score_gemma":0.0065640346,"teacher_disagreement_score":0.009596313,"about_ca_system_score_codex":0.0009657687,"about_ca_system_score_gemma":0.0016773104,"threshold_uncertainty_score":0.032102883},"labels":[],"label_agreement":null},{"id":"W2323070360","doi":"10.3166/jesa.38.1041-1064","title":"Métaheuristiques pour le problème de <i>Crew Scheduling</i>","year":2004,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crew scheduling; Crew; Computer science; Humanities; Engineering; Aeronautics; Philosophy","score_opus":0.061815809065326494,"score_gpt":0.34471693658853897,"score_spread":0.2829011275232125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323070360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03500835,0.0020929223,0.95376575,0.0011683389,0.00023832828,0.00012882032,0.00018807975,0.00035909156,0.007050382],"genre_scores_gemma":[0.33892217,0.0020993256,0.6492505,0.00030373316,0.0006267479,0.0004531221,0.00029444264,0.0004020401,0.0076479022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846244,0.00050953514,0.00010034739,0.00018509485,0.0006079615,0.00013457322],"domain_scores_gemma":[0.99492717,0.0037091577,0.00040534738,0.00035880294,0.0004534107,0.00014604814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003559501,0.0011877657,0.0015156897,0.0022045202,0.0012250533,0.0028873768,0.0018199786,0.0024882169,0.003858337],"category_scores_gemma":[0.01103715,0.0011366885,0.0025086745,0.002772435,0.0010069842,0.0029774252,0.0014073002,0.0037666287,0.0005469191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023200548,0.00021332067,0.0013239118,0.0003718839,0.00023897299,0.00012283046,0.00019988125,0.7720529,0.00581141,0.10138048,0.0025494853,0.115502864],"study_design_scores_gemma":[0.00004937109,0.00007803224,0.00033003816,0.000058973154,0.00006203853,0.000054808996,0.00003958613,0.9428631,0.0014678283,0.052385364,0.002593959,0.000016868928],"about_ca_topic_score_codex":0.0070148073,"about_ca_topic_score_gemma":0.007873231,"teacher_disagreement_score":0.0070148073,"about_ca_system_score_codex":0.002254259,"about_ca_system_score_gemma":0.0020971997,"threshold_uncertainty_score":0.018824637},"labels":[],"label_agreement":null},{"id":"W2325136417","doi":"10.1287/ijoc.2015.0683","title":"Branch-and-Price for Personalized Multiactivity Tour Scheduling","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Computer science; Time horizon; Mathematical optimization; Shortest path problem; Upper and lower bounds; Context (archaeology); Path (computing); Mathematics; Theoretical computer science; Graph","score_opus":0.11864144798097395,"score_gpt":0.39393687763682905,"score_spread":0.2752954296558551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325136417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024465492,0.0007912058,0.96412516,0.0005848135,0.000121341014,0.0002962611,0.00021264412,0.00086480496,0.008538282],"genre_scores_gemma":[0.31695172,0.0007468643,0.6726955,0.00029395818,0.00015674831,0.0006889616,0.00077146967,0.0005286675,0.0071660858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985676,0.00067574537,0.000054221935,0.00018388355,0.0002761401,0.00024248265],"domain_scores_gemma":[0.99696594,0.002385981,0.00015873411,0.00015753355,0.0001359023,0.00019586249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030167818,0.0016113934,0.0023425003,0.0013533939,0.0011457267,0.0017176184,0.0022104976,0.0021701728,0.012427875],"category_scores_gemma":[0.00471035,0.0010347965,0.0013768118,0.002465797,0.0009938404,0.0025824155,0.001441509,0.0029740427,0.0013401143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014271354,0.00017308586,0.0003738179,0.00015138903,0.000053666412,0.000081938255,0.000079691476,0.906763,0.00056170917,0.02801907,0.0036370342,0.059962884],"study_design_scores_gemma":[0.00003140036,0.00004492436,0.00005635847,0.000008730331,0.0000094526395,0.000015537798,0.000016045105,0.98106164,0.0001605006,0.017421477,0.0011680693,0.0000058390733],"about_ca_topic_score_codex":0.007543253,"about_ca_topic_score_gemma":0.008522831,"teacher_disagreement_score":0.012427875,"about_ca_system_score_codex":0.0022405195,"about_ca_system_score_gemma":0.0032034228,"threshold_uncertainty_score":0.041575372},"labels":[],"label_agreement":null},{"id":"W2334550270","doi":"10.9790/1684-0162840","title":"Staff Scheduling in Health Care Systems","year":2012,"lang":"en","type":"article","venue":"IOSR Journal of Mechanical and Civil Engineering","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Nurse scheduling problem; Scheduling (production processes); Computer science; Fair-share scheduling; MATLAB; Dynamic priority scheduling; Mathematical optimization; Job shop scheduling; Operations research; Two-level scheduling; Health care; Rate-monotonic scheduling; Distributed computing; Mathematics; Operating system; Schedule; Economics","score_opus":0.05216557871757429,"score_gpt":0.3288273123361916,"score_spread":0.27666173361861734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334550270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29276463,0.012906502,0.62416416,0.005401473,0.0012033429,0.0006741358,0.0016986596,0.000887887,0.060299166],"genre_scores_gemma":[0.8907189,0.0031393706,0.097065285,0.00020126365,0.00017241709,0.00016713052,0.0005140614,0.000055824657,0.007965824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892753,0.000541421,0.000056159504,0.0001563801,0.00019175846,0.00012666122],"domain_scores_gemma":[0.9994717,0.00022934513,0.00008482826,0.000023190223,0.00010513111,0.00008580837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010213499,0.00024286092,0.00041923043,0.0005563585,0.0008538764,0.0012415957,0.0005086016,0.00071483274,0.0049020806],"category_scores_gemma":[0.0023022997,0.00020619095,0.00034393076,0.0013565316,0.00031468837,0.00045415986,0.0005530498,0.000326093,0.00047395076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002174423,0.00012985535,0.008433889,0.0006015211,0.000104157974,0.0003866804,0.0004871287,0.71404624,0.002815651,0.07309207,0.013944565,0.1857408],"study_design_scores_gemma":[0.00007028514,0.00026363955,0.00838657,0.00017895945,0.00005234887,0.00018309751,0.0009107335,0.8694931,0.0017091276,0.076373875,0.042335372,0.000042855834],"about_ca_topic_score_codex":0.013499622,"about_ca_topic_score_gemma":0.0077953744,"teacher_disagreement_score":0.013499622,"about_ca_system_score_codex":0.0019477514,"about_ca_system_score_gemma":0.0026219173,"threshold_uncertainty_score":0.026842058},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06896844559053537,"score_gpt":0.31885566906181795,"score_spread":0.24988722347128256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336488339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048895095,0.00043756436,0.9427537,0.00031585922,0.000044959674,0.0001995754,0.00022503176,0.00224074,0.004887532],"genre_scores_gemma":[0.24370627,0.0002178965,0.75030196,0.00016581971,0.00005228159,0.00029312258,0.0007195688,0.00022752881,0.004315548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922955,0.00025897456,0.000043505388,0.0001310037,0.00021740273,0.00011966534],"domain_scores_gemma":[0.99803394,0.0012192096,0.00012793246,0.00026646358,0.00025956117,0.000092910916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377598,0.0008344487,0.0007343902,0.0012199408,0.00061987346,0.00089407025,0.0014408441,0.0007821487,0.00419633],"category_scores_gemma":[0.0050981734,0.00046437923,0.0007611891,0.0012011536,0.00082401093,0.0014773407,0.00103522,0.0012288227,0.00069694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043743808,0.00031408106,0.0025026866,0.00035050386,0.000069671725,0.00015691665,0.00024139142,0.5398663,0.0040417532,0.041965727,0.012656933,0.3973965],"study_design_scores_gemma":[0.00009099186,0.00016141857,0.0004389578,0.000022810704,0.00001925226,0.000115141265,0.000065765315,0.96171033,0.0025476585,0.027538309,0.0072668362,0.000022423586],"about_ca_topic_score_codex":0.0061031072,"about_ca_topic_score_gemma":0.009544192,"teacher_disagreement_score":0.0061031072,"about_ca_system_score_codex":0.001111988,"about_ca_system_score_gemma":0.0014186166,"threshold_uncertainty_score":0.014038086},"labels":[],"label_agreement":null},{"id":"W2336562797","doi":"","title":"A Flexible MILP Model for Multiple-Shift Workforce Planning Under Annualized Hours","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Overtime; Workforce; Workforce planning; Workload; Flexibility (engineering); Linear programming; Operations research; Integer programming; Workforce management; Computer science; Mathematical optimization; Operations management; Labour economics; Engineering; Economics; Mathematics; Algorithm","score_opus":0.13218136680100703,"score_gpt":0.3612752885141872,"score_spread":0.2290939217131802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336562797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01598662,0.00017023714,0.976591,0.00035692987,0.000051678526,0.00006866393,0.00029490545,0.00017945594,0.006300563],"genre_scores_gemma":[0.72766864,0.0005864661,0.25892577,0.00016672548,0.00008160964,0.000586566,0.0005605406,0.00011090986,0.011312731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.00018352977,0.000017945542,0.000085824475,0.00011687286,0.000106211184],"domain_scores_gemma":[0.99953854,0.00024516488,0.0000842952,0.000021927062,0.000060272083,0.000049908496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419653,0.0008930082,0.0008424722,0.0005195871,0.00065501494,0.0012603945,0.0013212255,0.0012233725,0.0035446822],"category_scores_gemma":[0.0013119315,0.00057739817,0.00091166294,0.0009168018,0.0006023059,0.0008605332,0.00077310123,0.0012739246,0.00042277682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083669975,0.0000058183555,0.00004622447,0.000011863878,0.0000047705967,0.000025868767,0.000012255125,0.9938963,0.00018624785,0.004085484,0.00019248079,0.0015244079],"study_design_scores_gemma":[0.0000049064574,0.000009836438,0.00003536061,0.0000043502732,0.000003580666,0.0000069321,0.000010841898,0.9962745,0.00009592102,0.003050459,0.000499786,0.0000036213194],"about_ca_topic_score_codex":0.00920515,"about_ca_topic_score_gemma":0.008152188,"teacher_disagreement_score":0.00920515,"about_ca_system_score_codex":0.0009881647,"about_ca_system_score_gemma":0.0018119919,"threshold_uncertainty_score":0.018303156},"labels":[],"label_agreement":null},{"id":"W2353414802","doi":"","title":"A Graph Coloring Algorithm for Optimization of Course Examination Arrange Problem","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph coloring; Computer science; Algorithm; Table (database); Graph; Greedy coloring; Theoretical computer science; Graph power; Data mining; Line graph","score_opus":0.05446657139485067,"score_gpt":0.35253804677430883,"score_spread":0.29807147537945816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353414802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013090855,0.00024566124,0.9790639,0.00022081014,0.00012638647,0.00016069932,0.00016618262,0.00069501373,0.0062305415],"genre_scores_gemma":[0.121126786,0.00038006628,0.871528,0.00010155762,0.00007484692,0.0002535987,0.0004853328,0.00019075518,0.0058590686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942076,0.00014784769,0.000023020213,0.00013590005,0.00017616167,0.000096279015],"domain_scores_gemma":[0.9995604,0.00017203503,0.00004424706,0.00004708027,0.00013630615,0.000039952316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061189145,0.00080013927,0.00082577945,0.0010076185,0.000742912,0.00075767876,0.001114908,0.0007839858,0.0055469046],"category_scores_gemma":[0.0014800499,0.0003081347,0.0006386775,0.0020600734,0.00046697093,0.0008846043,0.0005760715,0.0011980919,0.00091229554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017441472,0.00025552142,0.00082021067,0.00019841942,0.000046672838,0.00007232203,0.00008599329,0.5858588,0.006587929,0.027376216,0.012337051,0.36618644],"study_design_scores_gemma":[0.000059634513,0.00009663265,0.00035442566,0.000012305689,0.000019039913,0.000054459273,0.000025384577,0.98108554,0.001786242,0.0096466355,0.0068440977,0.000015685198],"about_ca_topic_score_codex":0.011873652,"about_ca_topic_score_gemma":0.008813279,"teacher_disagreement_score":0.011873652,"about_ca_system_score_codex":0.0013534804,"about_ca_system_score_gemma":0.0028501644,"threshold_uncertainty_score":0.023609102},"labels":[],"label_agreement":null},{"id":"W2358407808","doi":"","title":"New Algorithms for Graph Coloring Problem","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph coloring; Computer science; Heuristic; Algorithm; Graph; NP-complete; Time complexity; Theoretical computer science; Artificial intelligence","score_opus":0.10182073180532529,"score_gpt":0.3821459175294481,"score_spread":0.2803251857241228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358407808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013768488,0.0015360086,0.98886734,0.0004311825,0.00048684375,0.00014911583,0.00011908215,0.000805467,0.00622808],"genre_scores_gemma":[0.019358387,0.0021139306,0.9722899,0.00039731947,0.00049700233,0.00046795097,0.000511349,0.0002879327,0.004076227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977348,0.0005607953,0.00014828071,0.00047009814,0.0008947986,0.00019123893],"domain_scores_gemma":[0.997738,0.0012240959,0.00014898751,0.00035829112,0.0004366397,0.00009399537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017110084,0.0021176604,0.0012642153,0.0024538857,0.0012046942,0.0025025452,0.0029789757,0.001982631,0.0065002157],"category_scores_gemma":[0.0069439043,0.00073127024,0.0013398692,0.0036718128,0.001176858,0.0044456962,0.0020805744,0.004506542,0.0023344217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014414606,0.00026563628,0.000393508,0.0007160674,0.00010925217,0.00011729725,0.00016510814,0.13298577,0.004313455,0.27341318,0.041173168,0.54620343],"study_design_scores_gemma":[0.0001988308,0.00010951962,0.00020046213,0.00011880693,0.00007052315,0.00038814414,0.000063644584,0.6188432,0.004086441,0.27181345,0.104044765,0.00006226021],"about_ca_topic_score_codex":0.002065238,"about_ca_topic_score_gemma":0.002490732,"teacher_disagreement_score":0.0065002157,"about_ca_system_score_codex":0.0016539635,"about_ca_system_score_gemma":0.0015490672,"threshold_uncertainty_score":0.021745384},"labels":[],"label_agreement":null},{"id":"W2374483656","doi":"","title":"Research on Teaching Assistance System of TSP Based on Clark-Wright Saving Algorithm","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Travelling salesman problem; Algorithm; Wright; Quality (philosophy); Order (exchange)","score_opus":0.15340059595327368,"score_gpt":0.42453551139767803,"score_spread":0.2711349154444044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2374483656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.149613,0.000802565,0.7943221,0.00048580216,0.00026424526,0.00045103356,0.00015832692,0.006652048,0.047250923],"genre_scores_gemma":[0.7528475,0.0008234338,0.22422343,0.00016264712,0.000112256756,0.000343817,0.00035818134,0.00017906923,0.020949591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00007901058,0.00002020497,0.00009179585,0.00012656102,0.000044820405],"domain_scores_gemma":[0.9997303,0.000070312366,0.00001587921,0.000027940629,0.00012322587,0.00003234003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034556718,0.00039030198,0.0004278447,0.00072560436,0.00052244536,0.0006706742,0.0008796926,0.00053674506,0.008469636],"category_scores_gemma":[0.0011212529,0.00018578184,0.00031652141,0.000645088,0.00018321349,0.0008541701,0.00034805932,0.00029574838,0.001105336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003832384,0.0004190766,0.0049855723,0.00039697438,0.00006195624,0.00033817993,0.0005716063,0.083217934,0.047066104,0.026712827,0.015079196,0.82076746],"study_design_scores_gemma":[0.00023678047,0.0003465649,0.0022318496,0.0000295796,0.00007299235,0.0003075749,0.00011675251,0.93582666,0.026085503,0.003997418,0.030711744,0.000036550493],"about_ca_topic_score_codex":0.004436892,"about_ca_topic_score_gemma":0.0017543938,"teacher_disagreement_score":0.008469636,"about_ca_system_score_codex":0.00041302247,"about_ca_system_score_gemma":0.0009612257,"threshold_uncertainty_score":0.028333783},"labels":[],"label_agreement":null},{"id":"W2375721693","doi":"","title":"Statistical analysis of Annual teaching-hour in local universities——take a certain university as an example","year":2007,"lang":"en","type":"article","venue":"Journal of Yichun University","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Workload; Quarter (Canadian coin); Mathematics education; Work hours; Psychology; School teachers; Statistical analysis; Index (typography); Medical education; Sociology; Working hours; Medicine; Mathematics; Geography; Management; Statistics; Economics; Labour economics; Computer science","score_opus":0.06933099722121537,"score_gpt":0.35746159074254347,"score_spread":0.2881305935213281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375721693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97884285,0.00066464057,0.01188541,0.00014329678,0.00012001749,0.00025270446,0.004363896,0.00024233312,0.0034848761],"genre_scores_gemma":[0.99363506,0.00006186145,0.002913034,0.000015295715,0.000040422277,0.00026520493,0.0022199764,0.000032417083,0.00081668526],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9936702,0.0026288864,0.00075560954,0.0011746173,0.001253347,0.0005172955],"domain_scores_gemma":[0.96727943,0.023224479,0.00398549,0.0018351333,0.0022705023,0.0014048828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006414142,0.00029996532,0.0009728715,0.003364527,0.00048673677,0.0005902897,0.00083928433,0.00036601548,0.0039232727],"category_scores_gemma":[0.017789278,0.00013222064,0.0011474245,0.0044456143,0.0006752888,0.0006406723,0.0006358969,0.00092582137,0.00036737672],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016224876,0.00023724855,0.95079935,0.00039664944,0.0015456672,0.00034906899,0.00089175266,0.003183784,0.0011222266,0.0012062512,0.0038754279,0.034769967],"study_design_scores_gemma":[0.00003044597,0.001763552,0.9687234,0.000045995945,0.00023975557,0.00041061433,0.0038610857,0.016601788,0.0013140347,0.0009528328,0.0060085785,0.000047876176],"about_ca_topic_score_codex":0.0033812178,"about_ca_topic_score_gemma":0.0025215358,"teacher_disagreement_score":0.006414142,"about_ca_system_score_codex":0.0007146778,"about_ca_system_score_gemma":0.00058816234,"threshold_uncertainty_score":0.03392166},"labels":[],"label_agreement":null},{"id":"W2376346328","doi":"","title":"Build a Quarter Map Model for Staff Training","year":2010,"lang":"en","type":"article","venue":"Adult Education Quarterly","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Training (meteorology); Quarter (Canadian coin); Human resources; Process (computing); Business; Human resource management; Operations management; Knowledge management; Computer science; Management; Engineering; Geography; Economics","score_opus":0.07921835100888065,"score_gpt":0.3966153444416567,"score_spread":0.31739699343277605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376346328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398389,0.00018853908,0.9417732,0.00053636637,0.00010558196,0.00019857164,0.00062737346,0.0014490361,0.015282404],"genre_scores_gemma":[0.4384553,0.00043680548,0.542926,0.00012726513,0.00003504802,0.000616337,0.0014158234,0.00028000478,0.015707346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962413,0.0001139004,0.000020251653,0.00007326851,0.000100359954,0.00006809215],"domain_scores_gemma":[0.9995902,0.00011228568,0.000037500213,0.00005300739,0.0001468078,0.000060099734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068785215,0.00048439522,0.0004090877,0.0007282412,0.00052718085,0.0014377396,0.0014272851,0.0007318349,0.009782924],"category_scores_gemma":[0.0014180513,0.00035130847,0.0008577298,0.0008554583,0.00024917955,0.001675975,0.00068613776,0.00075967674,0.0016868149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024355426,0.00019495362,0.0035948588,0.00012297939,0.0000445627,0.00011842377,0.00028205433,0.8150706,0.0018414182,0.044947397,0.0067161093,0.1268231],"study_design_scores_gemma":[0.0000162875,0.00005525113,0.00046538145,0.000013371668,0.0000134832535,0.00003872779,0.00008731514,0.97903574,0.00056589895,0.013278952,0.0064153406,0.00001430281],"about_ca_topic_score_codex":0.017913619,"about_ca_topic_score_gemma":0.01386638,"teacher_disagreement_score":0.017913619,"about_ca_system_score_codex":0.0011436854,"about_ca_system_score_gemma":0.0020061256,"threshold_uncertainty_score":0.035618663},"labels":[],"label_agreement":null},{"id":"W2379725660","doi":"","title":"The Application of Backtracking Algorithm in Multi-constraint Assignment Problem","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Backtracking; Computer science; Algorithm; Constraint (computer-aided design); Realization (probability); Constraint learning; Mathematical optimization; Constraint satisfaction problem; Local consistency; Artificial intelligence; Mathematics","score_opus":0.09363981460313706,"score_gpt":0.3630973764983849,"score_spread":0.26945756189524783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2379725660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014879533,0.00037052942,0.9817914,0.00019001361,0.00004795128,0.000090389236,0.000042633135,0.00032432514,0.002263321],"genre_scores_gemma":[0.23279491,0.0009923953,0.7615098,0.00016083458,0.00007640221,0.00028115825,0.0002946758,0.00010980346,0.0037801466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989656,0.00032945353,0.00007699011,0.0002379709,0.00026080367,0.00012905055],"domain_scores_gemma":[0.9988701,0.0006693846,0.00006956762,0.00007860006,0.00026661385,0.00004571659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116416,0.00088550657,0.0011632246,0.0013042445,0.0014281927,0.0011054971,0.0014190511,0.0013239898,0.0028024206],"category_scores_gemma":[0.0023254247,0.0006044279,0.0011111763,0.0023724998,0.00060564437,0.0017663866,0.0008475953,0.0012261204,0.00046796325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019382815,0.0001840133,0.0016067034,0.00037795794,0.00009769948,0.00025164115,0.00039384273,0.63419497,0.007550099,0.028306415,0.0050569605,0.3217859],"study_design_scores_gemma":[0.000049371374,0.00006622252,0.00023060579,0.000025062442,0.000025753661,0.00008464829,0.00004143862,0.98309374,0.002272966,0.011584767,0.0025072363,0.000018236255],"about_ca_topic_score_codex":0.016762746,"about_ca_topic_score_gemma":0.008033085,"teacher_disagreement_score":0.016762746,"about_ca_system_score_codex":0.00090989476,"about_ca_system_score_gemma":0.0023773953,"threshold_uncertainty_score":0.03333032},"labels":[],"label_agreement":null},{"id":"W2384669999","doi":"","title":"The Hungarian method of the competition assignment problem","year":2006,"lang":"en","type":"article","venue":"Dongbei Nongye Daxue xuebao","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Assignment problem; Task (project management); Competition (biology); Scope (computer science); Generalized assignment problem; Hungarian algorithm; Computer science; Weapon target assignment problem; Zhàng; Operations research; Mathematical economics; Mathematical optimization; Mathematics; Economics; Political science; Law; Management; China","score_opus":0.04891805889027949,"score_gpt":0.3596806302821683,"score_spread":0.3107625713918888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2384669999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012903153,0.00016892326,0.995331,0.00007396931,0.000038691174,0.000041163566,0.00002704484,0.00008075645,0.0029480609],"genre_scores_gemma":[0.110099435,0.00089707406,0.87466174,0.00018089444,0.00015564136,0.0004478705,0.00025405613,0.00016118816,0.013141958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984262,0.000648053,0.00006808375,0.00028509152,0.0004232126,0.00014930315],"domain_scores_gemma":[0.99927515,0.000367794,0.00004753824,0.00008459322,0.00018869298,0.00003628811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840613,0.00077516533,0.0009837258,0.0013754778,0.0007040006,0.001186263,0.00160345,0.00079958094,0.0069503877],"category_scores_gemma":[0.0032449176,0.00048447997,0.0010822631,0.0022206435,0.0012994672,0.001921719,0.0014285458,0.0015175829,0.0013128282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092522976,0.00010089306,0.00037326946,0.0003417044,0.00012371005,0.00009197384,0.00016813497,0.25612804,0.002347685,0.38496342,0.012423258,0.34284526],"study_design_scores_gemma":[0.000055706103,0.00008349328,0.00028793633,0.000031112373,0.000036637142,0.0001513781,0.000054974636,0.80109626,0.001727909,0.17573932,0.020695884,0.000039421386],"about_ca_topic_score_codex":0.0030984976,"about_ca_topic_score_gemma":0.00219579,"teacher_disagreement_score":0.0069503877,"about_ca_system_score_codex":0.0011559718,"about_ca_system_score_gemma":0.0024383466,"threshold_uncertainty_score":0.023251355},"labels":[],"label_agreement":null},{"id":"W2392428564","doi":"","title":"Examples of Combining Algebra and Geometry","year":2013,"lang":"en","type":"article","venue":"Studies in College Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Mathematics; Algebra over a field; Algebraic geometry; Geometric algebra; Focus (optics); CONTEST; Calculus (dental); Geometry; Pure mathematics; Algebra representation","score_opus":0.25819510840190874,"score_gpt":0.42403999870864983,"score_spread":0.1658448903067411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392428564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016174197,0.008890554,0.64127177,0.00911204,0.00080870016,0.00008429798,0.00021855229,0.00043797435,0.32300183],"genre_scores_gemma":[0.598441,0.007459638,0.35874662,0.0022503128,0.0019078314,0.0003322434,0.0003268927,0.0003479089,0.030187475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99628854,0.0018494256,0.00015891972,0.00041843022,0.0010640918,0.00022048969],"domain_scores_gemma":[0.9979693,0.0010735049,0.00013038346,0.00038210378,0.000275075,0.00016957645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026315264,0.0008802959,0.0008677474,0.0028292155,0.0032203223,0.0039756745,0.0011812943,0.0016978728,0.009065059],"category_scores_gemma":[0.0047915983,0.00043568684,0.0011891973,0.0021867089,0.010448108,0.008278352,0.0047847675,0.0036471982,0.0012828637],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029516007,0.0000025695406,0.000025558265,0.000019870942,0.0000037095863,0.000022201108,0.00008014529,0.00025337044,0.00006344127,0.99700135,0.0006787428,0.0018460044],"study_design_scores_gemma":[0.00000483582,0.0000060223524,0.000042662152,0.00001601206,0.0000028503057,0.00006934849,0.00006809673,0.00106422,0.000097976656,0.97982657,0.01879272,0.00000860305],"about_ca_topic_score_codex":0.0011925163,"about_ca_topic_score_gemma":0.0010082412,"teacher_disagreement_score":0.009065059,"about_ca_system_score_codex":0.001292378,"about_ca_system_score_gemma":0.0007387523,"threshold_uncertainty_score":0.030325651},"labels":[],"label_agreement":null},{"id":"W2397478800","doi":"10.4230/dagsemproc.09261.9","title":"Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Integer programming; Solver; Rule-based machine translation; Scheduling (production processes); Grammar; ENCODE; Theoretical computer science; Integer (computer science); Mathematical optimization; Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.20195313577961396,"score_gpt":0.4130827993715797,"score_spread":0.21112966359196575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397478800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009209399,0.00012520129,0.98486114,0.00036860435,0.000034191882,0.0001105842,0.00031923072,0.00021974056,0.0047518243],"genre_scores_gemma":[0.18848845,0.0005808759,0.8015829,0.00022388792,0.00007957832,0.0010356037,0.001148021,0.0002540028,0.0066067385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988721,0.00042598197,0.00006477321,0.00020559967,0.00028504588,0.00014642598],"domain_scores_gemma":[0.997919,0.0015448922,0.00016836869,0.0001705382,0.00012694491,0.00007026641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013581631,0.0011884527,0.0008271064,0.0005815221,0.00050128176,0.0015295102,0.0018665537,0.0014232979,0.0050370456],"category_scores_gemma":[0.004176812,0.00070145103,0.001827749,0.0013246547,0.0013988141,0.0020144389,0.0015445278,0.0031677824,0.00069363654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023670103,0.000067271976,0.00017183974,0.00009956034,0.000016211818,0.00008305245,0.00014039254,0.805396,0.00077347027,0.17706093,0.0014394827,0.0147281205],"study_design_scores_gemma":[0.000030329214,0.000023681381,0.000043396267,0.000017150884,0.000011237338,0.000024046465,0.000028113996,0.8558336,0.00045586392,0.1396619,0.0038617547,0.000008931257],"about_ca_topic_score_codex":0.0038430365,"about_ca_topic_score_gemma":0.0061955494,"teacher_disagreement_score":0.0050370456,"about_ca_system_score_codex":0.0016086211,"about_ca_system_score_gemma":0.0025525424,"threshold_uncertainty_score":0.01685059},"labels":[],"label_agreement":null},{"id":"W2400076959","doi":"10.1080/03155986.2003.11732682","title":"Rostering For A Restaurant Jeffrey Allen Litchfield. Armann Ingolfsson*. And Kwuntung Jonathan Cheng","year":2003,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tabu search; Supervisor; Heuristic; Scheduling (production processes); Computer science; Operations research; Mathematical optimization; Psychology; Operations management; Mathematics; Engineering; Management; Economics","score_opus":0.2991740233332931,"score_gpt":0.46885630398177214,"score_spread":0.169682280648479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400076959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5827842,0.0022112068,0.27818036,0.008264277,0.000878944,0.0011759613,0.0011781041,0.002998614,0.12232831],"genre_scores_gemma":[0.6218682,0.0009511506,0.24221027,0.00030881207,0.00006961617,0.00014684458,0.0013399392,0.00029806158,0.13280708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.000050948012,0.00000946847,0.000055356897,0.000048687038,0.00005977145],"domain_scores_gemma":[0.9996611,0.00006677327,0.000049223032,0.000033315435,0.00008571257,0.00010395265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941308,0.0003289011,0.0002172679,0.00034821415,0.0019793021,0.0006564883,0.00055708596,0.0003918139,0.03213198],"category_scores_gemma":[0.00083736883,0.00021566794,0.00027157608,0.00032863847,0.00019395407,0.00043920378,0.00041829716,0.00034728486,0.0043947874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013919887,0.0008232762,0.014316324,0.00041667928,0.000055137498,0.0014987562,0.0008467238,0.13036256,0.029913928,0.033561695,0.13083436,0.65597856],"study_design_scores_gemma":[0.00033822973,0.0015886857,0.015929677,0.00018188656,0.0001159425,0.0014030662,0.0037766942,0.5023992,0.03321886,0.014639363,0.42624182,0.00016655786],"about_ca_topic_score_codex":0.016613888,"about_ca_topic_score_gemma":0.04143643,"teacher_disagreement_score":0.03213198,"about_ca_system_score_codex":0.00073480216,"about_ca_system_score_gemma":0.0016181768,"threshold_uncertainty_score":0.10749215},"labels":[],"label_agreement":null},{"id":"W2404458076","doi":"","title":"Solving Graph Coloring Problems Using Cultural Algorithms.","year":2011,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Graph coloring; Greedy coloring; Algorithm; Computer science; Graph; Graph power; Theoretical computer science; Line graph","score_opus":0.6703678257479699,"score_gpt":0.5151333103976619,"score_spread":0.15523451535030808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404458076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009099298,0.00014976374,0.9885433,0.000104516155,0.00003036884,0.000071942726,0.000016551561,0.00020082484,0.0017835416],"genre_scores_gemma":[0.09896302,0.00024044572,0.8995014,0.00010464112,0.00004013522,0.00020372939,0.00009532536,0.00005445884,0.00079682464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989573,0.00049386284,0.00005403899,0.00019575238,0.0002394393,0.000059607515],"domain_scores_gemma":[0.99788815,0.0012999029,0.00019658885,0.00028951417,0.00025953614,0.0000662356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017032867,0.0010855033,0.00070069847,0.00089298055,0.00092223514,0.00087901176,0.0013948587,0.0009796424,0.0015292255],"category_scores_gemma":[0.005660633,0.00044224755,0.001133162,0.0009775464,0.00081264414,0.0012565965,0.0009402382,0.0013313473,0.00038704547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007288371,0.0002457136,0.0023800996,0.00037469587,0.00019199208,0.00008148798,0.00029835792,0.64103436,0.0054658647,0.054831482,0.0023583807,0.29266474],"study_design_scores_gemma":[0.00004065428,0.00009596752,0.00022556748,0.000031798598,0.000029989596,0.00009534219,0.0000902198,0.9546622,0.0026710045,0.03777837,0.004261881,0.000016980486],"about_ca_topic_score_codex":0.002982975,"about_ca_topic_score_gemma":0.004287479,"teacher_disagreement_score":0.002982975,"about_ca_system_score_codex":0.0008041135,"about_ca_system_score_gemma":0.0022649588,"threshold_uncertainty_score":0.00900799},"labels":[],"label_agreement":null},{"id":"W2407302650","doi":"","title":"Optimization of clinical teaching unit call schedules at the Ottawa hospital through tabu search heuristics.","year":2002,"lang":"en","type":"article","venue":"PubMed","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Tabu search; Heuristics; Computer science; Scheduling (production processes); Nurse scheduling problem; Schedule; Task (project management); Heuristic; Operations research; Job shop scheduling; Operations management; Artificial intelligence; Flow shop scheduling; Engineering; Operating system","score_opus":0.2702474310676144,"score_gpt":0.41127739063523294,"score_spread":0.14102995956761855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407302650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68238837,0.002984547,0.25423527,0.0014400623,0.0001757917,0.0022344168,0.0033937145,0.0021839412,0.050963864],"genre_scores_gemma":[0.7761186,0.0010940729,0.21036617,0.0001354472,0.000025050242,0.00071246515,0.0016311693,0.00023948553,0.009677511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949884,0.00023020466,0.000018920568,0.000044587265,0.00007512396,0.0001322311],"domain_scores_gemma":[0.99852836,0.0010358338,0.00013289473,0.00003524047,0.00014269984,0.00012492297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326526,0.00073034986,0.0005552788,0.0011612854,0.0009920889,0.0012649399,0.00076761894,0.0007295604,0.005985684],"category_scores_gemma":[0.0030484537,0.0006042914,0.0006097084,0.001575644,0.00054486335,0.0005899812,0.00033295865,0.000665932,0.0005392308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000249334,0.00010752683,0.0009985509,0.00016453181,0.000033254837,0.00005425621,0.00010353859,0.95824337,0.0011061771,0.0030733398,0.003427586,0.032438543],"study_design_scores_gemma":[0.00014797889,0.00022183143,0.0015232139,0.000028378989,0.000054390963,0.000024730769,0.00024759784,0.9901276,0.0014589869,0.0022583893,0.0038825327,0.0000242668],"about_ca_topic_score_codex":0.18627962,"about_ca_topic_score_gemma":0.23511305,"teacher_disagreement_score":0.18627962,"about_ca_system_score_codex":0.005322488,"about_ca_system_score_gemma":0.009408571,"threshold_uncertainty_score":0.3703907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.131738151946533,"score_gpt":0.3866086343133353,"score_spread":0.2548704823668023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467648358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06384278,0.00051929714,0.91979635,0.0013555025,0.00028527086,0.00026134023,0.00044135988,0.00074068684,0.012757447],"genre_scores_gemma":[0.47572604,0.0007623575,0.5023074,0.00029474552,0.00019281187,0.0002369906,0.0004747478,0.00028858412,0.019716231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997187,0.0000854538,0.000010462885,0.000066743494,0.00006573794,0.000052827665],"domain_scores_gemma":[0.99954754,0.00024188275,0.00003603106,0.00004557829,0.000076690005,0.000052307423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045084002,0.00066003844,0.0006423955,0.00055101956,0.0008323491,0.0009862887,0.0011428044,0.000955997,0.005395992],"category_scores_gemma":[0.0013836458,0.0002658574,0.00081812695,0.001031567,0.00042365835,0.0007295096,0.0006800642,0.00113592,0.0006404848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024536712,0.00027935117,0.00091013015,0.00050158636,0.00007077465,0.00042755544,0.00015521003,0.78567266,0.0152336415,0.1027579,0.0090197725,0.084726125],"study_design_scores_gemma":[0.00001820582,0.000046408328,0.00027227402,0.00001443477,0.000018776482,0.000068918904,0.00003389825,0.94884515,0.0013562664,0.046123687,0.0031920003,0.000009950122],"about_ca_topic_score_codex":0.0063964077,"about_ca_topic_score_gemma":0.009526768,"teacher_disagreement_score":0.0063964077,"about_ca_system_score_codex":0.0011350645,"about_ca_system_score_gemma":0.0019406889,"threshold_uncertainty_score":0.018051326},"labels":[],"label_agreement":null},{"id":"W2468582779","doi":"10.1016/j.dam.2008.11.008","title":"Corrigendum to “Variable space search for graph coloring” [Discrete Appl. Math. 156 (2008) 2551–2560]","year":2008,"lang":"en","type":"erratum","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Graph; Combinatorics; Space (punctuation); Graph coloring; Discrete mathematics; Computer science","score_opus":0.12092423409665076,"score_gpt":0.36123069238706884,"score_spread":0.24030645829041808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468582779","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019029065,0.0051161773,0.0038779513,0.0385399,0.93175906,0.00009138032,0.0019932243,0.0007508935,0.017681172],"genre_scores_gemma":[0.01349302,0.02614756,0.015556309,0.08108272,0.2869693,0.0005967776,0.009220436,0.003012163,0.56392175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948689,0.0009887589,0.0006290807,0.00088664825,0.002196556,0.0004301029],"domain_scores_gemma":[0.9821898,0.0038341363,0.00056330714,0.0014598304,0.011336761,0.0006161477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033172718,0.0032842315,0.0042865938,0.006662323,0.003447596,0.0040377956,0.0061548846,0.0054508382,0.15121278],"category_scores_gemma":[0.035387415,0.0015537218,0.0035907335,0.0058571333,0.0024714533,0.004789729,0.0029057858,0.006468103,0.07589788],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002829731,0.000010904872,0.000035366207,0.00016553038,0.000017108898,0.00007216213,0.000012199561,0.00016107869,0.00005006592,0.0016551261,0.9919268,0.005865375],"study_design_scores_gemma":[0.00007751345,0.000061337596,0.0013290752,0.00039696402,0.00008946707,0.0003614795,0.000063354775,0.0017950484,0.0006265063,0.013275571,0.9818188,0.00010480759],"about_ca_topic_score_codex":0.036178473,"about_ca_topic_score_gemma":0.040902574,"teacher_disagreement_score":0.15121278,"about_ca_system_score_codex":0.0067861127,"about_ca_system_score_gemma":0.003328261,"threshold_uncertainty_score":0.5058571},"labels":[],"label_agreement":null},{"id":"W2472380137","doi":"10.1007/978-3-319-33954-2_21","title":"Balancing Nursing Workload by Constraint Programming","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Workload; Staffing; Computer science; Constraint (computer-aided design); Nursing; Constraint satisfaction; Constraint programming; Constraint satisfaction problem; Mathematical optimization; Medicine; Artificial intelligence; Mathematics","score_opus":0.05043044749838462,"score_gpt":0.3399339706376986,"score_spread":0.289503523139314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472380137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076310234,0.00068846106,0.94726044,0.0008418393,0.00023405509,0.00018074374,0.00023807946,0.0004506288,0.042474702],"genre_scores_gemma":[0.3189632,0.0022895348,0.64368683,0.00062813476,0.00034529722,0.0005870638,0.00078231253,0.0006677098,0.03204995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917346,0.00024740674,0.00002920867,0.000114883995,0.0002969433,0.0001381282],"domain_scores_gemma":[0.9985909,0.0009022307,0.00008285945,0.000086345855,0.00023145747,0.00010619759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012090143,0.0009504891,0.00059775164,0.00065503427,0.00053330074,0.0020014446,0.0017974525,0.0006162516,0.010457854],"category_scores_gemma":[0.0039666025,0.00042008437,0.0005865154,0.0019763862,0.00035351375,0.0011764533,0.0009341198,0.0014357106,0.0011276213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015614161,0.00016514916,0.00044049873,0.0002874158,0.00004490489,0.000089582616,0.00012247225,0.557458,0.004032587,0.07428244,0.023196084,0.33972472],"study_design_scores_gemma":[0.0000256787,0.00004518811,0.00025268187,0.000056155357,0.000017368815,0.000060712682,0.0000883789,0.9329637,0.0015355528,0.04714579,0.017791027,0.000017733018],"about_ca_topic_score_codex":0.006868392,"about_ca_topic_score_gemma":0.0075992933,"teacher_disagreement_score":0.010457854,"about_ca_system_score_codex":0.0011334195,"about_ca_system_score_gemma":0.0024923366,"threshold_uncertainty_score":0.034984946},"labels":[],"label_agreement":null},{"id":"W2515263955","doi":"10.1111/itor.12332","title":"Event‐based allocation of airline check‐in counters: a simple dynamic optimization method supported by empirical data","year":2016,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Civil Aviation Authority of Singapore; Singapore Management University","keywords":"Computer science; Queue; Operations research; Dynamic programming; Event (particle physics); Empirical research; Mathematical optimization; Dynamic data; State (computer science); Queueing theory; Real-time computing; Algorithm; Engineering; Mathematics","score_opus":0.3530142915842454,"score_gpt":0.5871679270424353,"score_spread":0.23415363545818985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515263955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14050552,0.00018314227,0.8544097,0.00057139393,0.000036364556,0.00019824321,0.00029805856,0.00048378782,0.0033138092],"genre_scores_gemma":[0.84155446,0.00009508081,0.15606351,0.00009785372,0.000029474864,0.00019565024,0.00025515875,0.0000853878,0.0016233741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990332,0.0005144418,0.00004287295,0.00017851316,0.0001161779,0.00011479275],"domain_scores_gemma":[0.9923847,0.006189646,0.00058632577,0.00028129533,0.0003752846,0.00018284941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030426695,0.0010631441,0.0012717678,0.000980117,0.00043148547,0.001162777,0.0015641444,0.0012287368,0.0036030877],"category_scores_gemma":[0.009568212,0.00084190274,0.0006335999,0.0008573589,0.00083443127,0.0015738163,0.00080378674,0.0015867626,0.00021763405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029854727,0.000046415484,0.0003874527,0.00001365679,0.000009503773,0.000010985244,0.000007211545,0.99351066,0.00013538428,0.0018225403,0.00014705918,0.0038792982],"study_design_scores_gemma":[0.0000036853341,0.0000058534015,0.00004815095,0.0000010765873,9.832352e-7,0.0000011641662,0.0000021930273,0.99943,0.00003744882,0.00043566668,0.000032335807,0.0000014181601],"about_ca_topic_score_codex":0.014634698,"about_ca_topic_score_gemma":0.0096417805,"teacher_disagreement_score":0.014634698,"about_ca_system_score_codex":0.0018704516,"about_ca_system_score_gemma":0.002065702,"threshold_uncertainty_score":0.029099047},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.5537578790127029,"score_gpt":0.568445045148991,"score_spread":0.014687166136288066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527340811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064993575,0.00013557643,0.9877846,0.0002683062,0.000055273675,0.00010823309,0.00014463146,0.00014152275,0.00486249],"genre_scores_gemma":[0.13620356,0.000485107,0.85613024,0.00014775258,0.00013725103,0.00042802014,0.00042207848,0.00015923768,0.0058867033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804115,0.0009829468,0.00008331202,0.0002606876,0.00034631306,0.00028552403],"domain_scores_gemma":[0.99679875,0.0024882148,0.00017756574,0.00011312089,0.00029699143,0.00012535152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031012045,0.0011119245,0.0014201183,0.0016611977,0.00086409017,0.0023731692,0.002355817,0.0013073251,0.009038626],"category_scores_gemma":[0.008088854,0.001099319,0.0017256497,0.0030135093,0.00084759644,0.0018711053,0.0013472583,0.002652844,0.0006248611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006340619,0.00021344007,0.00042366865,0.00009999729,0.00003315706,0.000040405215,0.00010510193,0.8853713,0.0005155054,0.05539616,0.002384065,0.055353828],"study_design_scores_gemma":[0.000018095883,0.00003845342,0.00013400856,0.000018441357,0.0000138952255,0.000010084928,0.000041777752,0.9733446,0.00022934614,0.024733027,0.0014081858,0.000010109638],"about_ca_topic_score_codex":0.017020496,"about_ca_topic_score_gemma":0.018384287,"teacher_disagreement_score":0.017020496,"about_ca_system_score_codex":0.002233625,"about_ca_system_score_gemma":0.004517785,"threshold_uncertainty_score":0.03384286},"labels":[],"label_agreement":null},{"id":"W2527830873","doi":"10.1007/s10951-018-0582-0","title":"Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Danish Agency for Science and Higher Education; Natural Sciences and Engineering Research Council of Canada","keywords":"Course (navigation); Preprocessor; Computer science; Set (abstract data type); Integer programming; Mathematical optimization; Relaxation (psychology); Linear programming relaxation; Integer (computer science); Mathematics; Artificial intelligence; Programming language; Engineering","score_opus":0.12147508441677701,"score_gpt":0.4068748154038947,"score_spread":0.2853997309871177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527830873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03224292,0.00036009648,0.9506649,0.0011040283,0.00014101405,0.00030206674,0.0015767274,0.00012439417,0.0134839425],"genre_scores_gemma":[0.41534406,0.0008331052,0.5614386,0.0004097245,0.00029904372,0.0010133857,0.004338804,0.00021550934,0.016107716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976872,0.00066491065,0.00011407153,0.0004298713,0.000667233,0.00043676657],"domain_scores_gemma":[0.99487644,0.0035357273,0.00042756094,0.00027733378,0.0006684378,0.0002145914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023955784,0.0011153967,0.0011923335,0.0012985219,0.00062505173,0.002304329,0.0027483995,0.0016909151,0.009174614],"category_scores_gemma":[0.009832488,0.00085289497,0.0021669865,0.002093159,0.00097251055,0.0026735656,0.001529918,0.0036046323,0.00057787466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022914296,0.0005509702,0.001945109,0.00044186536,0.000112839705,0.0002165926,0.00022864439,0.7314302,0.0029604589,0.17766668,0.009524061,0.074693486],"study_design_scores_gemma":[0.000035676967,0.00009255235,0.00055490166,0.000046360827,0.000025679567,0.000041237792,0.00006943647,0.9155098,0.00074223673,0.0805263,0.0023363144,0.000019427594],"about_ca_topic_score_codex":0.020209434,"about_ca_topic_score_gemma":0.019159433,"teacher_disagreement_score":0.020209434,"about_ca_system_score_codex":0.0023337754,"about_ca_system_score_gemma":0.004223909,"threshold_uncertainty_score":0.040183604},"labels":[],"label_agreement":null},{"id":"W2555091906","doi":"10.1504/ijmheur.2016.080266","title":"Simulated annealing for the uncapacitated exam scheduling problem","year":2016,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Scheduling (production processes); Benchmark (surveying); Mathematical optimization; Heuristic; Job shop scheduling; Graph; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Schedule","score_opus":0.1799146154358367,"score_gpt":0.428892417151283,"score_spread":0.2489778017154463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555091906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09968962,0.0015897682,0.8805912,0.0008980543,0.00014156537,0.00023094016,0.00036578692,0.0008150212,0.015678035],"genre_scores_gemma":[0.5939101,0.0007936964,0.39857715,0.00021153594,0.00006206483,0.0004500921,0.0005860021,0.00021254965,0.005196781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00045720098,0.000023303031,0.00009808716,0.00011595758,0.00007347566],"domain_scores_gemma":[0.9982851,0.0013341208,0.000119762655,0.00009839108,0.000100471276,0.00006217235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009525279,0.00092677324,0.00088954705,0.0007207762,0.0005236796,0.0008681758,0.00096985826,0.0010314318,0.002718065],"category_scores_gemma":[0.0037573443,0.0005909497,0.00090205204,0.00090359396,0.0007102546,0.0007422744,0.0005377277,0.0014426049,0.00038303135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042575317,0.00002306336,0.00013621763,0.000029268173,0.00001684361,0.000014531805,0.000025750098,0.98661673,0.00043193268,0.0042171786,0.0004996702,0.007946243],"study_design_scores_gemma":[0.000011503121,0.000017102879,0.00006026486,0.0000045642805,0.0000051460984,0.000004716366,0.0000064332185,0.9952992,0.0001949422,0.0037510055,0.0006422357,0.0000028513302],"about_ca_topic_score_codex":0.008501755,"about_ca_topic_score_gemma":0.008661541,"teacher_disagreement_score":0.008501755,"about_ca_system_score_codex":0.0017324202,"about_ca_system_score_gemma":0.0016316825,"threshold_uncertainty_score":0.016904593},"labels":[],"label_agreement":null},{"id":"W2559713566","doi":"10.1109/cec.2016.7743979","title":"Adding local edge mobility to graph evolution","year":2016,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.10416558327822631,"score_gpt":0.38171300002484015,"score_spread":0.2775474167466139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559713566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055362374,0.00010022138,0.93851495,0.00024629044,0.00003510527,0.00006596793,0.000034998302,0.00058162806,0.0050583757],"genre_scores_gemma":[0.78475946,0.0002543379,0.20971043,0.00015172966,0.00004787211,0.00018561803,0.00010512413,0.00019655772,0.0045888703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995047,0.00022902573,0.000020873531,0.00008278435,0.00011799323,0.00004473225],"domain_scores_gemma":[0.9981505,0.0011691427,0.00012412116,0.00037615735,0.00010668275,0.00007325894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009809321,0.00046396375,0.0004478741,0.000626636,0.00040182332,0.00070040603,0.0013517354,0.0007928382,0.002818761],"category_scores_gemma":[0.005009892,0.00023550828,0.0006992435,0.0006155226,0.0010007084,0.0015867808,0.0017149445,0.0011204211,0.00034587717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064206135,0.00008072731,0.0016165713,0.00009221987,0.00003627889,0.00019652098,0.00037373984,0.75522494,0.0075396723,0.12952907,0.00076076674,0.10448522],"study_design_scores_gemma":[0.000014667675,0.000087552835,0.00019465225,0.000012677109,0.000019798956,0.000120158285,0.000034674496,0.95902216,0.0022744178,0.035331484,0.002869963,0.00001767912],"about_ca_topic_score_codex":0.0012171518,"about_ca_topic_score_gemma":0.0014013401,"teacher_disagreement_score":0.002818761,"about_ca_system_score_codex":0.000634878,"about_ca_system_score_gemma":0.00046085712,"threshold_uncertainty_score":0.009429693},"labels":[],"label_agreement":null},{"id":"W2566322472","doi":"10.71781/10166","title":"Développement d’un système d’appariement pour l’e-recrutement","year":2016,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Political science; Philosophy","score_opus":0.18363585597171497,"score_gpt":0.43570622087570055,"score_spread":0.2520703649039856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566322472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044084538,0.001255724,0.84111035,0.0019708755,0.0005802426,0.0013754291,0.0025687811,0.08879863,0.018255375],"genre_scores_gemma":[0.18906812,0.0012331214,0.74406725,0.0010601556,0.00015677598,0.0011807865,0.009514114,0.0045993384,0.049120452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950675,0.0007897817,0.0005316501,0.0015318394,0.0017647564,0.00031446965],"domain_scores_gemma":[0.9915707,0.002615075,0.0004533837,0.0023017786,0.0025404464,0.00051855727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004425749,0.0017871982,0.0018898607,0.0030734143,0.0018099216,0.0068335948,0.0033649858,0.003253945,0.016008869],"category_scores_gemma":[0.014002699,0.0013786862,0.0019409095,0.002119259,0.0011973291,0.008859573,0.0041238214,0.0036643997,0.014554149],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019599572,0.00096670253,0.015627751,0.002555815,0.00042649315,0.0018873761,0.009329931,0.013111523,0.06968172,0.021399291,0.053974412,0.8090791],"study_design_scores_gemma":[0.00025828928,0.0013963293,0.015420297,0.0010302811,0.00046441818,0.0021645578,0.003021449,0.22675532,0.12069748,0.01173401,0.6164809,0.0005766284],"about_ca_topic_score_codex":0.01151971,"about_ca_topic_score_gemma":0.009345448,"teacher_disagreement_score":0.016008869,"about_ca_system_score_codex":0.0015954403,"about_ca_system_score_gemma":0.0033833282,"threshold_uncertainty_score":0.05355507},"labels":[],"label_agreement":null},{"id":"W2592554260","doi":"10.1016/j.cor.2017.10.003","title":"Online algorithms for the maximum k-colorable subgraph problem","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Colored; Online algorithm; Combinatorics; Benchmark (surveying); Algorithm; Mathematics; Computer science; Competitive analysis; Greedy coloring; Graph; Upper and lower bounds","score_opus":0.4906069269434795,"score_gpt":0.5419991593872532,"score_spread":0.05139223244377367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592554260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08093157,0.0019177273,0.8783356,0.0033682226,0.00040623406,0.00064383255,0.0017867635,0.0037388501,0.028871132],"genre_scores_gemma":[0.4639516,0.0011384033,0.5191993,0.0005524505,0.00040942396,0.0006520638,0.0024689198,0.00070173666,0.010926105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983015,0.0005280419,0.000075332886,0.0004553517,0.0002738774,0.00036591644],"domain_scores_gemma":[0.99119085,0.006340088,0.0006231626,0.0009906894,0.00035573417,0.0004993511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020299843,0.0015316614,0.0019794719,0.001527952,0.0011805929,0.0029891261,0.0044874516,0.0025186278,0.01566834],"category_scores_gemma":[0.00894256,0.0009001048,0.0015013904,0.0031971922,0.0011863264,0.005712745,0.0023023218,0.0030655612,0.0016803577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015954484,0.002121363,0.0020531092,0.0011672076,0.00021797544,0.00018034015,0.00029528086,0.46528694,0.004416862,0.083632655,0.035503592,0.40352926],"study_design_scores_gemma":[0.00041921213,0.00014119179,0.0005559933,0.00005321294,0.00007941713,0.000094523304,0.000091665206,0.86490107,0.0012907403,0.12867813,0.0036712429,0.000023634071],"about_ca_topic_score_codex":0.008176839,"about_ca_topic_score_gemma":0.013650858,"teacher_disagreement_score":0.01566834,"about_ca_system_score_codex":0.0033422175,"about_ca_system_score_gemma":0.0046538217,"threshold_uncertainty_score":0.05241579},"labels":[],"label_agreement":null},{"id":"W2593222654","doi":"10.24908/pceea.v0i0.6459","title":"INNOVATIVE COURSE SCHEDULING AND CURRICULUM DESIGN","year":2017,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Curriculum; Workload; Scheduling (production processes); Computer science; Schedule; Class (philosophy); Mathematics education; Engineering management; Operations research; Engineering; Operations management; Psychology; Artificial intelligence; Pedagogy; Operating system","score_opus":0.044621867981644026,"score_gpt":0.3254877813965929,"score_spread":0.2808659134149489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593222654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030936282,0.00018561007,0.95698553,0.00033553052,0.00006857357,0.0004895794,0.000090864625,0.0002337052,0.010674361],"genre_scores_gemma":[0.26451656,0.00043415956,0.7266476,0.00013301996,0.00005241718,0.00066443003,0.00024939934,0.00006484037,0.0072376006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988165,0.0005278407,0.000045983925,0.00022867885,0.00024199414,0.00013905423],"domain_scores_gemma":[0.9988379,0.0004763062,0.00014912829,0.00012067693,0.00027786987,0.00013815347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019203502,0.0004956595,0.0004354726,0.0008559406,0.00036053368,0.0011546479,0.0012515557,0.000605256,0.006213441],"category_scores_gemma":[0.0037315697,0.00029082166,0.00058302196,0.00082107994,0.00044676143,0.00085550436,0.0009322913,0.0006997645,0.000651842],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013939267,0.00049928884,0.0029313914,0.00048444502,0.00006741534,0.000117881056,0.00028996708,0.3596085,0.012930871,0.14439428,0.004152297,0.47438416],"study_design_scores_gemma":[0.00013017072,0.0006680506,0.0016945103,0.00007342746,0.00006881721,0.00010687606,0.00024671832,0.8674773,0.007856457,0.089200914,0.03244525,0.000031542437],"about_ca_topic_score_codex":0.0013783304,"about_ca_topic_score_gemma":0.002195393,"teacher_disagreement_score":0.006213441,"about_ca_system_score_codex":0.001432437,"about_ca_system_score_gemma":0.0024858012,"threshold_uncertainty_score":0.020785987},"labels":[],"label_agreement":null},{"id":"W2600304459","doi":"","title":"On Edge Orienting Methods for Graph Coloring","year":2006,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Graph coloring; Tabu search; Edge coloring; Fractional coloring; Digraph; Mathematics; Combinatorics; Graph; Algorithm; Discrete mathematics; Line graph; Graph power","score_opus":0.05052054320022054,"score_gpt":0.3637215132136669,"score_spread":0.3132009700134464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600304459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00516766,0.0017066139,0.98535246,0.00018917852,0.0000749658,0.0000616406,0.00005176427,0.00024564684,0.0071500707],"genre_scores_gemma":[0.09518474,0.0029575652,0.8943417,0.00021002571,0.00019075756,0.00037236008,0.00018443473,0.00040462383,0.006153752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991892,0.00040885448,0.00002259646,0.00009573708,0.00022741208,0.00005613865],"domain_scores_gemma":[0.9980369,0.0015031,0.00008831277,0.00016291483,0.0001656122,0.000043177813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013808925,0.0009398082,0.0007161904,0.0013530873,0.0007261857,0.000969382,0.0014398332,0.0008993093,0.0055775973],"category_scores_gemma":[0.005638555,0.00035948123,0.0007128158,0.002769983,0.0014505258,0.0019584629,0.0009882536,0.0015822591,0.0013633572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012311697,0.00014462424,0.00057061197,0.00033428863,0.000048438662,0.00004668908,0.00022461794,0.36784717,0.0033162946,0.27362767,0.006001859,0.34771448],"study_design_scores_gemma":[0.000047509995,0.00008984613,0.00024338426,0.00008201464,0.000018499326,0.00006320584,0.0000592935,0.7699055,0.001465355,0.21567671,0.0123280585,0.000020604019],"about_ca_topic_score_codex":0.0027513823,"about_ca_topic_score_gemma":0.0032135379,"teacher_disagreement_score":0.0055775973,"about_ca_system_score_codex":0.0010543268,"about_ca_system_score_gemma":0.0006675158,"threshold_uncertainty_score":0.018658936},"labels":[],"label_agreement":null},{"id":"W2600608404","doi":"10.1287/trsc.2018.0857","title":"Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Operations research; Plan (archaeology); Operational planning; Computer science; Operations management; Job shop scheduling; Work (physics); Engineering; Business; Schedule","score_opus":0.07066389539547975,"score_gpt":0.34579274561103635,"score_spread":0.2751288502155566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600608404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2131369,0.00035691325,0.7799017,0.00021784529,0.00010275045,0.00013894631,0.00021029927,0.00039837862,0.0055362377],"genre_scores_gemma":[0.92253006,0.00017535682,0.07077805,0.00005007606,0.000050255283,0.000101760495,0.00023819978,0.000086810236,0.005989438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.00016447832,0.000017203389,0.00012626116,0.00013608944,0.00019140306],"domain_scores_gemma":[0.99963176,0.00014488927,0.00006550931,0.00002502654,0.0000544932,0.0000782561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071743573,0.00092015584,0.0011736372,0.000526839,0.0005515634,0.0009284631,0.0011809792,0.00095908873,0.003918537],"category_scores_gemma":[0.0010380445,0.00057106174,0.00089737144,0.00077490386,0.0004030291,0.00078114384,0.0009726542,0.0010154161,0.00037456254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019223154,0.00018173529,0.00056522357,0.000062259176,0.00006039882,0.00012589913,0.0000687148,0.9735136,0.0025987246,0.0027616834,0.00083615177,0.019033428],"study_design_scores_gemma":[0.00002234532,0.00010556516,0.00034932815,0.0000034804373,0.00001630039,0.000023195273,0.000043905748,0.9969008,0.0005426541,0.0014514892,0.00053413835,0.000006801744],"about_ca_topic_score_codex":0.009685325,"about_ca_topic_score_gemma":0.008080343,"teacher_disagreement_score":0.009685325,"about_ca_system_score_codex":0.0011709102,"about_ca_system_score_gemma":0.0014254432,"threshold_uncertainty_score":0.019257903},"labels":[],"label_agreement":null},{"id":"W2607161507","doi":"10.71781/10653","title":"Optimisation stochastique pour l'affectation du personnel polyvalent dans un centre d'appels téléphoniques","year":2006,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Computer science; Political science","score_opus":0.06308038709806789,"score_gpt":0.3641013693044197,"score_spread":0.3010209822063518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607161507","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082502976,0.0015108674,0.8983892,0.0026610992,0.00036995538,0.00016103948,0.00045930254,0.0002738794,0.013671619],"genre_scores_gemma":[0.7724974,0.0021452897,0.1810636,0.00045759018,0.00040995868,0.00069495186,0.00068654603,0.0004417779,0.04160285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.00038373514,0.000024136549,0.00013902242,0.00019455313,0.00018567876],"domain_scores_gemma":[0.9942498,0.0047740736,0.00020543982,0.00007747479,0.0004585458,0.0002346541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022394964,0.001562801,0.0019904096,0.0010925761,0.0012138289,0.0024273782,0.0016033509,0.0025594232,0.0053012636],"category_scores_gemma":[0.008798312,0.000802618,0.0018062571,0.0013252313,0.0019042016,0.0011600549,0.0012936433,0.0030817299,0.00043336808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000887964,0.000040165378,0.0004944916,0.00008471057,0.000032448716,0.000060688588,0.000073188356,0.9773235,0.0007237077,0.0145588815,0.0014052526,0.0051141437],"study_design_scores_gemma":[0.000029381128,0.000020989637,0.0004519076,0.000010301812,0.000009152193,0.00001121669,0.00003242563,0.994389,0.0002022831,0.0041751754,0.00065587397,0.000012374489],"about_ca_topic_score_codex":0.15122359,"about_ca_topic_score_gemma":0.0716141,"teacher_disagreement_score":0.15122359,"about_ca_system_score_codex":0.004415849,"about_ca_system_score_gemma":0.005300776,"threshold_uncertainty_score":0.30068678},"labels":[],"label_agreement":null},{"id":"W2610733719","doi":"","title":"A General Multi-Shift Scheduling System","year":2001,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Robustness (evolution); Scheduling (production processes); Computer science; Constraint programming; Mathematical optimization; Constraint (computer-aided design); Operations research; Constraint satisfaction; Variety (cybernetics); Industrial engineering; Artificial intelligence; Engineering; Mathematics; Stochastic programming","score_opus":0.08885830895559776,"score_gpt":0.3426135323313483,"score_spread":0.2537552233757505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610733719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13474186,0.0012540994,0.8267504,0.00105553,0.0002978067,0.00044220558,0.0017400556,0.0014208829,0.03229724],"genre_scores_gemma":[0.87379783,0.0009480982,0.09924215,0.00018810184,0.00017250993,0.00023110084,0.0012148215,0.00008624982,0.02411915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943787,0.0001035207,0.00002408098,0.00022485848,0.00010581433,0.000103833234],"domain_scores_gemma":[0.9997508,0.00005775841,0.000041921197,0.00004281566,0.0000636453,0.000043064807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046050272,0.0007060442,0.00078721193,0.00045450605,0.0010272827,0.0011897582,0.0014592314,0.0012786996,0.010588572],"category_scores_gemma":[0.00066553766,0.00031230215,0.000698486,0.0014249051,0.00049072335,0.0010835887,0.0011315774,0.0005529354,0.0018523152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040904141,0.00010388638,0.0012358086,0.00039635372,0.000092982315,0.0008198171,0.00015051784,0.86537826,0.011415832,0.0438043,0.007613338,0.06857996],"study_design_scores_gemma":[0.00009457943,0.00014938922,0.0010455725,0.000013855374,0.00003948911,0.00029170435,0.000057589514,0.95789826,0.0009718222,0.021181567,0.01822782,0.000028384844],"about_ca_topic_score_codex":0.0055182735,"about_ca_topic_score_gemma":0.005080596,"teacher_disagreement_score":0.010588572,"about_ca_system_score_codex":0.00081079593,"about_ca_system_score_gemma":0.0012486444,"threshold_uncertainty_score":0.035422325},"labels":[],"label_agreement":null},{"id":"W2611924894","doi":"","title":"Branch-and-cut-and-price for the traveling salesman problem with time windows","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Travelling salesman problem; Computer science; Mathematics; Algorithm","score_opus":0.06432540089113045,"score_gpt":0.33557207073282,"score_spread":0.27124666984168955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611924894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05732007,0.0043368437,0.9101146,0.0021076235,0.00037747933,0.00060925103,0.00073804986,0.00066461525,0.023731425],"genre_scores_gemma":[0.45832226,0.0066445945,0.50615066,0.00032549107,0.00074871257,0.001010402,0.0011476291,0.00048784981,0.025162335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902844,0.00035068436,0.00004340154,0.00013105929,0.00022869118,0.00021782817],"domain_scores_gemma":[0.9970885,0.002311252,0.0001593265,0.000099636956,0.00015187,0.00018944377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027123154,0.001711767,0.0031467897,0.0018631766,0.0011645423,0.0030647526,0.0023049235,0.0029493147,0.011401015],"category_scores_gemma":[0.008115553,0.001566052,0.0015982068,0.003515669,0.0013069721,0.0045828004,0.0011941787,0.003316906,0.0010030125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003361022,0.00030428453,0.00041825126,0.0004080535,0.00010975763,0.00009593522,0.000090585694,0.8279841,0.0007955019,0.07806594,0.008136219,0.08325529],"study_design_scores_gemma":[0.00007445245,0.0000847749,0.00014668633,0.000028372326,0.00004070183,0.000022668482,0.00002284244,0.9351211,0.00025986458,0.062801234,0.0013841018,0.000013187764],"about_ca_topic_score_codex":0.015629176,"about_ca_topic_score_gemma":0.008330053,"teacher_disagreement_score":0.015629176,"about_ca_system_score_codex":0.0026680212,"about_ca_system_score_gemma":0.004523918,"threshold_uncertainty_score":0.038140237},"labels":[],"label_agreement":null},{"id":"W2620834784","doi":"","title":"Variable Space Search for Graph Coloring","year":2006,"lang":"fr","type":"article","venue":"Archive ouverte UNIGE (University of Geneva)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Graph coloring; Complete coloring; Fractional coloring; Combinatorics; Edge coloring; Vertex (graph theory); Local search (optimization); Best-first search; Space (punctuation); List coloring; Graph; Search algorithm; Discrete mathematics; Beam search; Algorithm; Computer science; Graph power; Line graph","score_opus":0.05449283544052927,"score_gpt":0.2807459374511388,"score_spread":0.22625310201060952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620834784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034537558,0.0006874151,0.9583695,0.0002894549,0.0000457761,0.00007813356,0.000069093556,0.00037889893,0.0055441307],"genre_scores_gemma":[0.46475664,0.0005936015,0.52885795,0.00015352972,0.000068467365,0.00035551426,0.0002527288,0.00013601407,0.004825504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992417,0.00044052227,0.000018053997,0.00009563078,0.00012618136,0.00007795144],"domain_scores_gemma":[0.998505,0.0011495905,0.00010714753,0.00008398973,0.00010206329,0.00005234533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401601,0.0007437457,0.0008060137,0.0010221165,0.00052898086,0.00086841075,0.00081084267,0.0008909192,0.002836681],"category_scores_gemma":[0.0038135245,0.00040776745,0.0006623116,0.0013085116,0.0012321074,0.0010520527,0.0010732618,0.0010238478,0.00034610688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087224296,0.000058559963,0.00051873334,0.00009911975,0.00003267183,0.00003163861,0.000095002266,0.8692289,0.0007793875,0.066232674,0.001838029,0.060998034],"study_design_scores_gemma":[0.00002130485,0.000037318252,0.000066056986,0.000010153691,0.0000053343556,0.000011303584,0.000015733407,0.97764844,0.00024155754,0.021027202,0.0009114861,0.0000040135365],"about_ca_topic_score_codex":0.0038443601,"about_ca_topic_score_gemma":0.0035331994,"teacher_disagreement_score":0.0038443601,"about_ca_system_score_codex":0.001294918,"about_ca_system_score_gemma":0.0014027582,"threshold_uncertainty_score":0.009489596},"labels":[],"label_agreement":null},{"id":"W2623334881","doi":"","title":"Implicit Shift Scheduling with Multiple Breaks and Work Stretch Duration Restrictions","year":2005,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Duration (music); Work (physics); Scheduling (production processes); Constraint (computer-aided design); Flexibility (engineering); Computer science; Mathematical optimization; Context (archaeology); Mathematics; Statistics; Engineering; Geometry","score_opus":0.028465296090177453,"score_gpt":0.2900718074664054,"score_spread":0.2616065113762279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623334881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25597504,0.00030556484,0.7323594,0.0003108958,0.0000647451,0.00015769404,0.00037565656,0.0001579097,0.010293083],"genre_scores_gemma":[0.8675377,0.00031496419,0.120934255,0.000039147082,0.00006578148,0.00017205722,0.00032750392,0.00006085841,0.010547786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989403,0.00044157324,0.000048471855,0.00016911612,0.00021813759,0.00018240424],"domain_scores_gemma":[0.99761426,0.001315345,0.0004531756,0.0003274671,0.000112758506,0.0001770165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010811652,0.00081009703,0.0008623066,0.0003983946,0.00059413665,0.0010368875,0.0019971584,0.001106865,0.005501711],"category_scores_gemma":[0.0036489258,0.0005953784,0.0006769816,0.0010167849,0.00087565085,0.0026500255,0.0011489925,0.0014463464,0.0005293523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004556239,0.00022183341,0.0009644131,0.00018340335,0.000036801062,0.0001939817,0.0002012126,0.8778132,0.0046799956,0.0714924,0.00085536274,0.042901803],"study_design_scores_gemma":[0.00008734589,0.00025532822,0.0006261588,0.000025127803,0.000019427524,0.00007535735,0.000085696665,0.94681346,0.0017587706,0.04588641,0.0043377965,0.000029129196],"about_ca_topic_score_codex":0.002864627,"about_ca_topic_score_gemma":0.0039316933,"teacher_disagreement_score":0.005501711,"about_ca_system_score_codex":0.00077958376,"about_ca_system_score_gemma":0.0011414781,"threshold_uncertainty_score":0.01840508},"labels":[],"label_agreement":null},{"id":"W2625613098","doi":"","title":"A Branch-and-Price Algorithm for the Robust Graph Coloring Problem","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Edge coloring; Fractional coloring; Graph; Vertex (graph theory); Greedy coloring; Complete coloring; Discrete mathematics; Algorithm; Graph power; Line graph","score_opus":0.07599896732650815,"score_gpt":0.2963153579850985,"score_spread":0.22031639065859035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625613098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018508319,0.00032089555,0.9709231,0.0005814379,0.00007634318,0.00035288092,0.00028467915,0.0014354902,0.0075168023],"genre_scores_gemma":[0.09947911,0.00023108404,0.8951567,0.0001629403,0.000073252544,0.00049745647,0.0007490569,0.0002857505,0.003364794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.00029151136,0.00005208578,0.0002311448,0.0002707583,0.00019825334],"domain_scores_gemma":[0.9984785,0.00092828943,0.00014183471,0.00015082253,0.0001735278,0.00012702467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792853,0.001465526,0.0017701986,0.0015117006,0.0011859044,0.0017015606,0.0023700737,0.0018838106,0.01079492],"category_scores_gemma":[0.004337989,0.00074338366,0.0010014881,0.0025124385,0.00077768683,0.0024560355,0.0015182442,0.002123243,0.001747068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037176211,0.0004824923,0.00077099627,0.0002175235,0.00007263193,0.00016718946,0.00015664232,0.6147696,0.0029176716,0.05257383,0.015866129,0.3116336],"study_design_scores_gemma":[0.00012812568,0.000093708186,0.00012071551,0.000013568418,0.000018630117,0.000053602183,0.000026394831,0.9688274,0.00061688357,0.028090201,0.0019981968,0.000012513921],"about_ca_topic_score_codex":0.0069080046,"about_ca_topic_score_gemma":0.0070016137,"teacher_disagreement_score":0.01079492,"about_ca_system_score_codex":0.002030412,"about_ca_system_score_gemma":0.0037704704,"threshold_uncertainty_score":0.036112547},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07469503885769585,"score_gpt":0.36792915259262926,"score_spread":0.2932341137349334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2677624263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008407208,0.00023877487,0.9860029,0.00029381717,0.000087386914,0.000117481875,0.00007729369,0.00020543653,0.004569669],"genre_scores_gemma":[0.26245353,0.0007257344,0.72876185,0.00020199662,0.00020489644,0.0005371405,0.0002940744,0.00026912024,0.0065515726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.0002804291,0.00002483274,0.00008100332,0.00018937868,0.00012200544],"domain_scores_gemma":[0.99877423,0.00083061284,0.000073778116,0.000076342185,0.00016256323,0.000082423576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523275,0.00089383055,0.0020509972,0.0011318172,0.0008996234,0.0013740892,0.0021619115,0.0013483467,0.011311018],"category_scores_gemma":[0.0043063094,0.00078706007,0.0011829727,0.0020570592,0.00086353667,0.0016998136,0.0013091473,0.0019108051,0.0013295163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001238305,0.00010747832,0.0002272497,0.00008379988,0.000023984216,0.00004020705,0.000038454407,0.89202154,0.0009629243,0.022847826,0.0027420358,0.08078065],"study_design_scores_gemma":[0.000017054625,0.000017391443,0.00003431907,0.0000036166102,0.0000058343667,0.000005814226,0.000005830017,0.9943177,0.000114600436,0.005073975,0.00040067098,0.0000031638453],"about_ca_topic_score_codex":0.016074818,"about_ca_topic_score_gemma":0.011720826,"teacher_disagreement_score":0.016074818,"about_ca_system_score_codex":0.0016151845,"about_ca_system_score_gemma":0.0036043872,"threshold_uncertainty_score":0.037839174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1325292087268326,"score_gpt":0.34432314721797647,"score_spread":0.21179393849114386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731086824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010066657,0.00015269786,0.9801767,0.00017442335,0.000056707602,0.0003032245,0.00069712073,0.0019020544,0.006470396],"genre_scores_gemma":[0.05663819,0.00011433699,0.93780214,0.00009365774,0.000035671816,0.00054580194,0.0008874952,0.00033931492,0.003543358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994748,0.00015511435,0.00003262017,0.000119998964,0.00012635218,0.000091102804],"domain_scores_gemma":[0.9989691,0.00068141404,0.00007920353,0.00009029718,0.00012614572,0.000053865668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013010758,0.0011353191,0.00071147544,0.00082764373,0.00041882123,0.0010608562,0.001622352,0.0013211621,0.013762823],"category_scores_gemma":[0.0032890395,0.0005667277,0.0011158607,0.0012894947,0.00035952614,0.00077933556,0.001086573,0.0011950294,0.0022734054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019236864,0.00028644974,0.0009504176,0.000539036,0.00007466973,0.00017793124,0.00012041405,0.71283543,0.004998107,0.042564005,0.013985592,0.2232756],"study_design_scores_gemma":[0.00017513362,0.000097208256,0.00019138638,0.000029324034,0.00002742999,0.00008439915,0.000032100575,0.9698724,0.002860534,0.013544169,0.013071573,0.000014212263],"about_ca_topic_score_codex":0.00290549,"about_ca_topic_score_gemma":0.005582593,"teacher_disagreement_score":0.013762823,"about_ca_system_score_codex":0.0008457039,"about_ca_system_score_gemma":0.0028155714,"threshold_uncertainty_score":0.04604125},"labels":[],"label_agreement":null},{"id":"W2735816152","doi":"","title":"Tabu Search for a Job Scheduling Problem","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Tabu search; Heuristics; Computer science; Graph coloring; Mathematical optimization; Scheduling (production processes); Integer programming; Variable neighborhood search; Generalization; Vertex (graph theory); Job shop scheduling; Heuristic; Graph; Algorithm; Theoretical computer science; Mathematics; Metaheuristic; Schedule","score_opus":0.10696704662161165,"score_gpt":0.33788195282934563,"score_spread":0.23091490620773397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735816152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19423172,0.005264298,0.7558349,0.003041151,0.00061952585,0.0005989986,0.0027693743,0.0024349887,0.035205044],"genre_scores_gemma":[0.46271175,0.001704728,0.5155038,0.00043015607,0.0003420847,0.00073633745,0.0019921558,0.0005231488,0.016055703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992244,0.00040485375,0.000029149885,0.00010575169,0.00012540266,0.00011034107],"domain_scores_gemma":[0.9972926,0.002261325,0.00011285865,0.0000969604,0.00015262887,0.00008369189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017055827,0.0007884341,0.0015359444,0.0016922816,0.0010479544,0.0017797973,0.0012601335,0.0023778996,0.011492094],"category_scores_gemma":[0.007678232,0.00077472813,0.0010867604,0.0030323593,0.00078369334,0.0013267442,0.00061715156,0.0014281301,0.0012782837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004005664,0.00024086841,0.0004942013,0.00053187396,0.00009096613,0.000082556384,0.000085940075,0.87206745,0.001412817,0.019639526,0.011655136,0.09329808],"study_design_scores_gemma":[0.000102636346,0.000100094934,0.00021102534,0.000029284824,0.000025140129,0.00002899846,0.000031070867,0.97214204,0.0003823751,0.024841066,0.002094875,0.000011405725],"about_ca_topic_score_codex":0.006803197,"about_ca_topic_score_gemma":0.005195686,"teacher_disagreement_score":0.011492094,"about_ca_system_score_codex":0.0013714097,"about_ca_system_score_gemma":0.0020499055,"threshold_uncertainty_score":0.038444936},"labels":[],"label_agreement":null},{"id":"W2736210115","doi":"10.5539/emr.v6n2p16","title":"The Rational Distribution of Teaching Resources in Colleges——Course Arrangement","year":2017,"lang":"en","type":"article","venue":"Engineering Management Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Schedule; Economic shortage; Class (philosophy); Curriculum; Scheduling (production processes); Computer science; Genetic algorithm; Scheme (mathematics); Constraint (computer-aided design); Mathematical optimization; Mathematics education; Operations research; Simulation; Engineering; Mathematics; Artificial intelligence; Pedagogy","score_opus":0.15181542938518142,"score_gpt":0.4571408695559981,"score_spread":0.30532544017081664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736210115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26957762,0.0002236534,0.70591044,0.0009744614,0.000055695367,0.0004953367,0.00020447357,0.00032579975,0.022232408],"genre_scores_gemma":[0.8874567,0.0001799129,0.10754328,0.000030293404,0.000015929681,0.00012799462,0.00010262994,0.00003626981,0.004506938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986481,0.00051063445,0.00005394931,0.00022789059,0.00031215564,0.00024729225],"domain_scores_gemma":[0.99933404,0.00018520729,0.00013856392,0.000078101664,0.00014136061,0.00012264767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012297261,0.00028592517,0.00032230033,0.0006633571,0.00082136947,0.0012368684,0.00086217024,0.00046344966,0.0032325368],"category_scores_gemma":[0.0035123343,0.00025553114,0.00029697292,0.0009771475,0.0005038307,0.0015867567,0.00070196035,0.000518137,0.00030276898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020542518,0.00030116946,0.009649821,0.00013150132,0.000035684167,0.00013198894,0.00035369903,0.6688378,0.00648149,0.123710066,0.0043443516,0.1858169],"study_design_scores_gemma":[0.00005952217,0.00016181394,0.003985614,0.000021488677,0.000016587026,0.0000636714,0.00040319373,0.9469775,0.0032900653,0.03857963,0.0064114016,0.000029579554],"about_ca_topic_score_codex":0.01418771,"about_ca_topic_score_gemma":0.014435589,"teacher_disagreement_score":0.01418771,"about_ca_system_score_codex":0.0033819282,"about_ca_system_score_gemma":0.0037033784,"threshold_uncertainty_score":0.028210282},"labels":[],"label_agreement":null},{"id":"W2737732247","doi":"","title":"A Patient Assignment Algorithm for Home Care Services","year":2006,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Workload; Tabu search; Integer programming; Linear programming; Computer science; Mathematical optimization; Integer (computer science); Extension (predicate logic); Work (physics); Balance (ability); Algorithm; Measure (data warehouse); Operations research; Nursing; Mathematics; Medicine; Engineering; Data mining; Programming language","score_opus":0.02024137755531061,"score_gpt":0.28388166323552927,"score_spread":0.26364028568021863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737732247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022511343,0.00023061078,0.9694122,0.0005123948,0.000091158545,0.00034110973,0.00041414544,0.0016202022,0.0048668315],"genre_scores_gemma":[0.15931256,0.00022023999,0.8306174,0.00021822493,0.00006704742,0.00051287416,0.00089362555,0.00018536413,0.00797266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999463,0.00017749073,0.000026939764,0.0001308375,0.0001087096,0.000093089395],"domain_scores_gemma":[0.9995459,0.00019735837,0.0000609969,0.000027464053,0.00010142526,0.000066816785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085642154,0.00079291983,0.00094352075,0.000871017,0.0008338228,0.0010988393,0.0014400211,0.0012563476,0.013220371],"category_scores_gemma":[0.0017552978,0.00042332933,0.0005605614,0.001681373,0.00031953093,0.0008609585,0.0008633178,0.0008718511,0.0017481761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031937833,0.0003959881,0.0012502909,0.00018689908,0.00006324623,0.00009854404,0.00013096914,0.56086797,0.0019904263,0.012515203,0.014912634,0.4072684],"study_design_scores_gemma":[0.000089602574,0.00007597614,0.00024912352,0.000010162925,0.00001376399,0.00006297466,0.00003657462,0.98650116,0.00059118494,0.008517388,0.0038434486,0.000008654264],"about_ca_topic_score_codex":0.0063157645,"about_ca_topic_score_gemma":0.0058194133,"teacher_disagreement_score":0.013220371,"about_ca_system_score_codex":0.0012214268,"about_ca_system_score_gemma":0.0023878203,"threshold_uncertainty_score":0.044226527},"labels":[],"label_agreement":null},{"id":"W2744447489","doi":"10.1007/978-3-319-66263-3_10","title":"(I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Schedule; Scheduling (production processes); Entertainment; Operations research; Multimedia; Mathematical optimization; Visual arts; Engineering; Mathematics","score_opus":0.2533122819494547,"score_gpt":0.37216416065465296,"score_spread":0.11885187870519826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744447489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03181552,0.0019424625,0.9108174,0.00482193,0.0018302446,0.00021359701,0.0009206519,0.0026167622,0.04502153],"genre_scores_gemma":[0.33176446,0.0029932875,0.5479743,0.0011316934,0.0012919981,0.00031572947,0.0019977842,0.0013538455,0.11117696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996321,0.00009011556,0.000016779644,0.00007473942,0.00011240225,0.00007379095],"domain_scores_gemma":[0.9994531,0.0002215785,0.000034554007,0.000045281548,0.00013316187,0.00011230102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880315,0.00081937405,0.0006213131,0.00033494818,0.0005434274,0.001228295,0.0012835964,0.0008635798,0.031975444],"category_scores_gemma":[0.0023583611,0.00036536844,0.0009334001,0.0010299948,0.00039226067,0.0017789842,0.00079552067,0.0017104539,0.005494395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007958893,0.00039926756,0.0010800012,0.0005918567,0.00007870702,0.0000992678,0.0003157575,0.06308207,0.008066823,0.036707316,0.1273587,0.7614243],"study_design_scores_gemma":[0.00029640424,0.0015358826,0.004311385,0.00014460378,0.00011860755,0.00040010776,0.0009821462,0.69535476,0.011067144,0.14804173,0.13758937,0.00015791785],"about_ca_topic_score_codex":0.0039889994,"about_ca_topic_score_gemma":0.006437715,"teacher_disagreement_score":0.031975444,"about_ca_system_score_codex":0.00088636886,"about_ca_system_score_gemma":0.00093287724,"threshold_uncertainty_score":0.10696852},"labels":[],"label_agreement":null},{"id":"W2753502872","doi":"","title":"Reconfiguring Graph Colorings","year":2017,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.06638340076455272,"score_gpt":0.30354003312597033,"score_spread":0.2371566323614176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753502872","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049013082,0.0011722414,0.8471024,0.0015160703,0.0009795994,0.000392518,0.0011791909,0.006983843,0.09166095],"genre_scores_gemma":[0.48783433,0.001847295,0.46321988,0.0014755426,0.00045606453,0.0004799394,0.002974771,0.0028424538,0.03886978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811566,0.0004608545,0.00008656194,0.0005896223,0.00038894205,0.00035833416],"domain_scores_gemma":[0.9948214,0.0016999141,0.00039604382,0.0022963597,0.0004628217,0.00032326745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097095803,0.0014436047,0.0006331164,0.0011711195,0.0014289531,0.0020355918,0.0018695669,0.0009989167,0.018490361],"category_scores_gemma":[0.0069676186,0.00071813003,0.0013372927,0.0017488701,0.0019942143,0.0029215878,0.002649868,0.0023802842,0.0039142864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003580019,0.00024718768,0.0015737978,0.000547545,0.000089108835,0.000483719,0.0006453841,0.19102879,0.020547537,0.4421763,0.040915236,0.3013874],"study_design_scores_gemma":[0.00011430241,0.00015655773,0.00062633544,0.00011891489,0.00006889075,0.0004734998,0.00037210516,0.25590318,0.01334303,0.59073436,0.13801612,0.00007266294],"about_ca_topic_score_codex":0.0038205418,"about_ca_topic_score_gemma":0.0063347,"teacher_disagreement_score":0.018490361,"about_ca_system_score_codex":0.0021915482,"about_ca_system_score_gemma":0.0016018173,"threshold_uncertainty_score":0.06185645},"labels":[],"label_agreement":null},{"id":"W2761740106","doi":"10.1007/s10951-017-0544-y","title":"An implicit model for multi-activity shift scheduling problems","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Construct (python library); Mathematics; Programming language","score_opus":0.3347182439140028,"score_gpt":0.4707354262469032,"score_spread":0.1360171823329004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761740106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03946988,0.00022719287,0.9515007,0.0005681915,0.00006099461,0.000063650856,0.00027837369,0.00009993584,0.007731216],"genre_scores_gemma":[0.787247,0.0007684883,0.18652758,0.00013046844,0.00013213711,0.00042774263,0.00061601785,0.00010027107,0.024050307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.00024266001,0.000034595756,0.00010902791,0.00018414005,0.00012107035],"domain_scores_gemma":[0.99872464,0.0007616929,0.00015734888,0.000101122874,0.00017276137,0.0000823571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192384,0.0006568171,0.0010485931,0.0005851399,0.0004530082,0.0015939645,0.0027083522,0.0015901643,0.0046719825],"category_scores_gemma":[0.0041299732,0.00071334786,0.00095459976,0.0010782178,0.0008281261,0.0024600716,0.0013793705,0.0021492273,0.0005462458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008620728,0.0000755273,0.00032944893,0.00008807422,0.00001887853,0.00007226191,0.0001106517,0.809553,0.0009105012,0.17851363,0.00070233527,0.009539524],"study_design_scores_gemma":[0.000014961882,0.000016560645,0.00004450868,0.000006274799,0.000007832817,0.0000086038,0.000008687105,0.96985334,0.00009176642,0.029003108,0.00094012014,0.00000426244],"about_ca_topic_score_codex":0.0051289066,"about_ca_topic_score_gemma":0.0068400125,"teacher_disagreement_score":0.0051289066,"about_ca_system_score_codex":0.0011564691,"about_ca_system_score_gemma":0.0018098921,"threshold_uncertainty_score":0.015629351},"labels":[],"label_agreement":null},{"id":"W2788555957","doi":"10.1609/aaai.v32i1.12076","title":"A Recursive Algorithm to Generate Balanced Weekend Tournaments","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; League; Schedule; Corollary; Scheduling (production processes); Computer science; Directed graph; Hamiltonian path; Simple (philosophy); Mathematics; Graph; Mathematical economics; Operations research; Algorithm; Combinatorics; Mathematical optimization","score_opus":0.22900074592288563,"score_gpt":0.4119095838618458,"score_spread":0.18290883793896015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788555957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034767076,0.00007489001,0.95595443,0.00015312409,0.0000420519,0.00033442763,0.00023321464,0.0021279296,0.006312997],"genre_scores_gemma":[0.14733961,0.00005079118,0.84708714,0.00008272157,0.000019789679,0.00034393033,0.0009878365,0.00037917274,0.0037090846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919313,0.00022456383,0.00004527996,0.00019961564,0.00014840557,0.0001890617],"domain_scores_gemma":[0.9987656,0.00062051933,0.00009718596,0.00025095267,0.00016844919,0.000097362776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271923,0.0007258907,0.00079339143,0.00082291744,0.0010012406,0.00097269914,0.0018639286,0.00092346035,0.010645573],"category_scores_gemma":[0.0034439024,0.000511794,0.00093488285,0.0007113446,0.0006121691,0.0012573698,0.0017001388,0.001078071,0.0021316784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046850444,0.00070257304,0.00387913,0.00039635197,0.00011623502,0.00032000578,0.00079182105,0.21967979,0.01691343,0.11584967,0.019490847,0.6213917],"study_design_scores_gemma":[0.00033259412,0.0002474009,0.000686018,0.000039618397,0.00004908314,0.00019596292,0.00020147456,0.897438,0.0068123555,0.072288476,0.021667214,0.00004181501],"about_ca_topic_score_codex":0.0021894937,"about_ca_topic_score_gemma":0.004694173,"teacher_disagreement_score":0.010645573,"about_ca_system_score_codex":0.0008076444,"about_ca_system_score_gemma":0.00142586,"threshold_uncertainty_score":0.035613},"labels":[],"label_agreement":null},{"id":"W2796934628","doi":"10.1016/j.cor.2018.04.004","title":"Tabu search and iterated local search for the cyclic bottleneck assignment problem","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Tabu search; Guided Local Search; Iterated local search; Mathematical optimization; Bottleneck; Solver; Local search (optimization); Block (permutation group theory); Benchmark (surveying); Metaheuristic; Hill climbing; Computer science; Algorithm; Mathematics; Job shop scheduling; Scheduling (production processes); Iterated function; Schedule; Combinatorics","score_opus":0.3270447379013257,"score_gpt":0.5011930913327103,"score_spread":0.17414835343138457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796934628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113102555,0.003378511,0.8618511,0.0007709199,0.00019433264,0.0001919018,0.0002720071,0.00081637944,0.019422222],"genre_scores_gemma":[0.5933515,0.00096824276,0.3967723,0.00020766085,0.00015209233,0.00045186715,0.0004079225,0.00030723462,0.0073812506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915147,0.0005048825,0.000025056059,0.000077704,0.00014161324,0.000099300145],"domain_scores_gemma":[0.9971324,0.0022490264,0.00018679582,0.00012290626,0.0002264208,0.000082423176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020780496,0.0006402932,0.0013491465,0.0015412817,0.00080720126,0.0010889792,0.0019001674,0.0016787186,0.0049656504],"category_scores_gemma":[0.0084618395,0.00065484137,0.0008722042,0.0023351882,0.0011114368,0.0015108135,0.001061317,0.0013922163,0.0004364727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013653442,0.000101272555,0.0002820573,0.00013143028,0.000049785267,0.000026983422,0.000071767325,0.9215979,0.00035242876,0.021548523,0.0023618394,0.053339552],"study_design_scores_gemma":[0.000021705757,0.000026787904,0.000067631576,0.000008697771,0.000009063437,0.0000058986807,0.00000994107,0.98893726,0.00007352184,0.010526503,0.00030797854,0.0000049976925],"about_ca_topic_score_codex":0.01493352,"about_ca_topic_score_gemma":0.012643371,"teacher_disagreement_score":0.01493352,"about_ca_system_score_codex":0.001387368,"about_ca_system_score_gemma":0.0023673354,"threshold_uncertainty_score":0.029693186},"labels":[],"label_agreement":null},{"id":"W2801873872","doi":"10.1002/cjas.1491","title":"Workforce Scheduling in Administrative Operations: A Case Study in Accounting","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Administrative Sciences / Revue Canadienne des Sciences de l Administration","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Overtime; Computer science; Scheduling (production processes); Operations research; Workforce; Set (abstract data type); Task (project management); Time horizon; Operations management; Mathematical optimization; Economics; Engineering; Mathematics; Labour economics","score_opus":0.3357834813927588,"score_gpt":0.45084074100635124,"score_spread":0.11505725961359242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801873872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98412466,0.00017866852,0.00906222,0.0004309397,0.000035296882,0.00014410341,0.000113408874,0.00006475359,0.0058458922],"genre_scores_gemma":[0.9876686,0.00011252386,0.010461047,0.000025552788,0.000014323879,0.000032317217,0.000055204127,0.000011103864,0.0016192539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99849737,0.00077383005,0.000047761932,0.000099126926,0.0002247656,0.00035724833],"domain_scores_gemma":[0.9947948,0.0038734036,0.00031940648,0.00021429137,0.00030099356,0.00049722014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023495045,0.0005380636,0.00044656306,0.00088886556,0.002395721,0.0016147447,0.0013071893,0.00178323,0.0029959364],"category_scores_gemma":[0.0040588365,0.00028208274,0.0004939606,0.0013833018,0.001036216,0.0007705501,0.0006989986,0.00097626715,0.00022221437],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001486669,0.0026802542,0.025365485,0.00040965594,0.000080372694,0.011023974,0.0031560517,0.86367494,0.007292405,0.024413124,0.0043837274,0.056033272],"study_design_scores_gemma":[0.0004458669,0.0020193693,0.020677103,0.000104622064,0.000088614026,0.0018778234,0.012867752,0.91819555,0.013266032,0.009841492,0.020466058,0.0001497222],"about_ca_topic_score_codex":0.023149265,"about_ca_topic_score_gemma":0.02575395,"teacher_disagreement_score":0.023149265,"about_ca_system_score_codex":0.0025852753,"about_ca_system_score_gemma":0.0021505235,"threshold_uncertainty_score":0.04602903},"labels":[],"label_agreement":null},{"id":"W2804702513","doi":"10.1080/17509653.2018.1445045","title":"Iterated local and very-large-scale neighborhood search for a novel uncapacitated exam scheduling model","year":2018,"lang":"en","type":"article","venue":"International Journal of Management Science and Engineering Management","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Iterated local search; Iterated function; Computer science; Scheduling (production processes); Local search (optimization); Mathematical optimization; Benchmark (surveying); Heuristic; Scale (ratio); Mathematics; Algorithm","score_opus":0.05860504167797429,"score_gpt":0.3409210195313355,"score_spread":0.2823159778533612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804702513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13245401,0.00041355012,0.8612549,0.00033704535,0.000035337798,0.0000665632,0.00016564508,0.00016288254,0.00511008],"genre_scores_gemma":[0.8858343,0.00026225104,0.10919026,0.000048673763,0.000028155253,0.00012355817,0.0001570669,0.000047008216,0.0043086777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997267,0.00011667762,0.000008880205,0.000055447483,0.00004368448,0.000048451664],"domain_scores_gemma":[0.9993592,0.00036163107,0.00012874434,0.00003851748,0.000046744855,0.00006521193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862885,0.0005105525,0.00083432667,0.00044532644,0.00036662328,0.0007794741,0.0017932567,0.00079914747,0.0020448072],"category_scores_gemma":[0.0016907027,0.00037311064,0.00065622205,0.0006060396,0.0006155877,0.0008071263,0.0006249457,0.0007827667,0.00014669653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027829432,0.000020252579,0.00017502018,0.000020365454,0.000009498133,0.00004891256,0.000014725397,0.99057823,0.00030551318,0.0062591983,0.00021738882,0.002323026],"study_design_scores_gemma":[0.0000033976319,0.000007698093,0.000023229386,9.279719e-7,0.0000017462976,0.000005507411,0.0000033350311,0.99873453,0.000046305966,0.0010890636,0.00008294317,0.000001324858],"about_ca_topic_score_codex":0.006976737,"about_ca_topic_score_gemma":0.0068520866,"teacher_disagreement_score":0.006976737,"about_ca_system_score_codex":0.0011569627,"about_ca_system_score_gemma":0.0009955297,"threshold_uncertainty_score":0.013872206},"labels":[],"label_agreement":null},{"id":"W2805910173","doi":"10.1609/aaai.v32i1.11383","title":"An Automated Employee Timetabling System for Small Businesses","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Seniority; Scheduling (production processes); Integer programming; Work (physics); Business; Computer science; Operations management; Marketing; Operations research; Economics; Engineering","score_opus":0.29406755595754197,"score_gpt":0.42673446947263516,"score_spread":0.1326669135150932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805910173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21276034,0.00045216538,0.6053116,0.00066816027,0.00017499723,0.0009941896,0.003603188,0.16933665,0.006698727],"genre_scores_gemma":[0.48557785,0.00020298445,0.5044186,0.00013970221,0.000048209862,0.0005883577,0.0034981945,0.0010420021,0.00448412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955934,0.000094864336,0.0000404885,0.00014218595,0.00011640048,0.000046627316],"domain_scores_gemma":[0.9988921,0.0004405192,0.00014448166,0.0001769924,0.00020066409,0.0001453562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723308,0.0006191493,0.00042879482,0.00067078765,0.0006847613,0.0006530766,0.0014492922,0.00049032917,0.007779954],"category_scores_gemma":[0.0025454222,0.0003925491,0.00039261568,0.0006740492,0.00018697821,0.0009022536,0.0008064205,0.0005866698,0.0018042026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019966715,0.0009423648,0.0077175885,0.00046830837,0.0000730194,0.00036017102,0.00076259876,0.09310162,0.05289926,0.0058938735,0.056400653,0.77938384],"study_design_scores_gemma":[0.00020927243,0.00019700201,0.0028774687,0.000029103028,0.000030463261,0.00009766435,0.00014261779,0.94977313,0.01845974,0.0028009755,0.025330666,0.000052008283],"about_ca_topic_score_codex":0.007641501,"about_ca_topic_score_gemma":0.007181201,"teacher_disagreement_score":0.007779954,"about_ca_system_score_codex":0.0009540661,"about_ca_system_score_gemma":0.0016174051,"threshold_uncertainty_score":0.026026547},"labels":[],"label_agreement":null},{"id":"W2884858736","doi":"10.1097/01.naj.0000544173.84595.dc","title":"The Quandary of Scheduling Vacation Time for Nurses","year":2018,"lang":"en","type":"article","venue":"AJN American Journal of Nursing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Government of Canada","funders":"","keywords":"Variety (cybernetics); Column (typography); Computer science; Scheduling (production processes); Psychology; World Wide Web; Multimedia; Engineering; Artificial intelligence; Operations management; Telecommunications","score_opus":0.10529144138669087,"score_gpt":0.4567337326522234,"score_spread":0.3514422912655325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884858736","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064035086,0.012381515,0.010637189,0.74458617,0.14261822,0.00014839655,0.0012140917,0.0013486164,0.08066225],"genre_scores_gemma":[0.1919736,0.055762187,0.065516956,0.27618387,0.08619171,0.0006178459,0.0024671145,0.0032888318,0.3179979],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923517,0.0019834335,0.00080952403,0.0005348439,0.00395809,0.00036232756],"domain_scores_gemma":[0.95978093,0.01549935,0.0033775843,0.0022260211,0.011832422,0.00728367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011050082,0.00057405775,0.00047328958,0.0011336057,0.0035388225,0.007552421,0.0014120243,0.0037487333,0.0313911],"category_scores_gemma":[0.071436785,0.00061699335,0.0006325018,0.0017594763,0.002930076,0.0054445867,0.0015681224,0.009914891,0.009492561],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006170617,0.00004354396,0.00068218523,0.00017699938,0.0000064586734,0.000030083824,0.00014360255,0.00021801506,0.00022593724,0.009273079,0.9020387,0.087099746],"study_design_scores_gemma":[0.00003427659,0.00013593187,0.0036880884,0.00062098645,0.000013948936,0.00012815367,0.0007330615,0.001226988,0.00043223746,0.009390433,0.98352975,0.000066184126],"about_ca_topic_score_codex":0.017680585,"about_ca_topic_score_gemma":0.026737107,"teacher_disagreement_score":0.0313911,"about_ca_system_score_codex":0.0043648225,"about_ca_system_score_gemma":0.008774417,"threshold_uncertainty_score":0.10501373},"labels":[],"label_agreement":null},{"id":"W2886351742","doi":"10.1016/j.endm.2018.07.043","title":"A hybrid heuristic for the multi-activity tour scheduling problem","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Heuristic; Incremental heuristic search; Beam search; Time horizon; Artificial intelligence; Search algorithm; Mathematics; Algorithm; Schedule","score_opus":0.10465804007470333,"score_gpt":0.39678739451841666,"score_spread":0.29212935444371335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886351742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10598086,0.00072042557,0.8760058,0.00033640797,0.00027213132,0.00033166623,0.00029819418,0.001211543,0.014842988],"genre_scores_gemma":[0.5223924,0.00028853948,0.46891746,0.0001997413,0.00008467595,0.0004754683,0.00037624117,0.00017764472,0.0070877415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.00013575764,0.000019180688,0.000059066482,0.00012382491,0.00009300752],"domain_scores_gemma":[0.9993173,0.0004201931,0.000042944688,0.000057655405,0.00008671717,0.00007529937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068547146,0.0006985961,0.0009847812,0.0011392338,0.0005050431,0.0010135106,0.0017667154,0.0013204588,0.006209776],"category_scores_gemma":[0.0012166521,0.0005023034,0.0007554963,0.0011963181,0.00041008668,0.0009099347,0.0009851243,0.00072488864,0.00057260745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033984953,0.0003103426,0.0006113139,0.00018944521,0.00009151464,0.00014126628,0.000071888564,0.8423797,0.0047183232,0.010486028,0.0025773754,0.13808309],"study_design_scores_gemma":[0.000079529076,0.00011377117,0.00016500162,0.000010286944,0.00002707384,0.00003262214,0.000021910828,0.9951096,0.0006119511,0.0024621268,0.0013548854,0.000011356245],"about_ca_topic_score_codex":0.004076378,"about_ca_topic_score_gemma":0.005730472,"teacher_disagreement_score":0.006209776,"about_ca_system_score_codex":0.00086746836,"about_ca_system_score_gemma":0.0013617759,"threshold_uncertainty_score":0.020773709},"labels":[],"label_agreement":null},{"id":"W2886357227","doi":"10.5539/cis.v11n3p82","title":"The Brilliant Scheduler: Automated Scheduling System for Video Conferencing Courses","year":2018,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Videoconferencing; Scheduling (production processes); Reservation; Multimedia; Computer network; Operations management","score_opus":0.0688552236639599,"score_gpt":0.3668847579581867,"score_spread":0.2980295342942268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886357227","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22806339,0.0005779579,0.63047886,0.00037844223,0.00029196628,0.0019267312,0.0017649757,0.12853147,0.007986196],"genre_scores_gemma":[0.6237626,0.00032990475,0.36387628,0.00012699502,0.000121519384,0.0006675852,0.0021703537,0.00091248075,0.008032362],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940634,0.00016231186,0.000060366558,0.00014674566,0.00016263663,0.00006154286],"domain_scores_gemma":[0.99885225,0.00040184025,0.00015131517,0.00015673124,0.00025368232,0.00018417486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013272301,0.0005907701,0.00048258426,0.0010114523,0.0005877051,0.0008977032,0.0011890144,0.00044706353,0.0046273014],"category_scores_gemma":[0.0030038871,0.00035766605,0.00025603987,0.0006609342,0.00016314363,0.00071962184,0.00043582183,0.00044199405,0.0017431738],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029064615,0.0014207227,0.01149142,0.0005349006,0.00009381045,0.0004986007,0.0007923365,0.0376271,0.07464301,0.0045293136,0.040861733,0.8246005],"study_design_scores_gemma":[0.000829055,0.0012771367,0.016049871,0.00007876942,0.00014218916,0.00039684033,0.00031811796,0.8342943,0.06782315,0.002508137,0.07608996,0.00019258715],"about_ca_topic_score_codex":0.004557498,"about_ca_topic_score_gemma":0.002769614,"teacher_disagreement_score":0.0046273014,"about_ca_system_score_codex":0.00066268665,"about_ca_system_score_gemma":0.0018305297,"threshold_uncertainty_score":0.015479803},"labels":[],"label_agreement":null},{"id":"W2898638454","doi":"10.5539/mas.v12n11p385","title":"Hybrid Simulated Annealing with Meta-Heuristic Methods to Solve UCT Problem","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Tabu search; Computer science; Mathematical optimization; Heuristic; Meta heuristic; Local search (optimization); Space (punctuation); Algorithm; Artificial intelligence; Mathematics","score_opus":0.19359324425946714,"score_gpt":0.4494770177911564,"score_spread":0.25588377353168923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898638454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021996202,0.0016611429,0.96826607,0.00025590183,0.00014591141,0.00018860024,0.00009934165,0.00080608495,0.0065806895],"genre_scores_gemma":[0.37975195,0.0008336489,0.61453164,0.00022912365,0.00010700258,0.00074950774,0.0003553098,0.00020237162,0.0032394377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.00040629643,0.000054300253,0.00013078582,0.00018659634,0.00008902875],"domain_scores_gemma":[0.9987596,0.0008182687,0.00010262816,0.000103652405,0.00017371195,0.000042145995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013805967,0.0012888587,0.0014130023,0.0016098452,0.000661623,0.001098447,0.0017049244,0.0016549597,0.002637454],"category_scores_gemma":[0.0026130478,0.0007437135,0.0019652871,0.0017909732,0.00051680673,0.0007282801,0.00082975643,0.0013346582,0.00048596508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035752444,0.000043191736,0.00036030824,0.00008247326,0.000080132595,0.00003595596,0.00003549205,0.9609203,0.0006795776,0.0032336628,0.00081245945,0.033680722],"study_design_scores_gemma":[0.000009368586,0.000021142678,0.000049529484,0.0000088725365,0.0000117849795,0.000011504627,0.000007236707,0.9977857,0.0002865026,0.0010718717,0.0007329152,0.0000035470437],"about_ca_topic_score_codex":0.009636583,"about_ca_topic_score_gemma":0.008446769,"teacher_disagreement_score":0.009636583,"about_ca_system_score_codex":0.0009541788,"about_ca_system_score_gemma":0.0018415616,"threshold_uncertainty_score":0.019160986},"labels":[],"label_agreement":null},{"id":"W2898686011","doi":"10.1007/978-3-319-99719-3_3","title":"Exact Coloring of Sparse Matrices","year":2018,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph coloring; Heuristic; Fractional coloring; Algorithm; Computer science; Greedy coloring; Matrix (chemical analysis); List coloring; Combinatorics; Sparse matrix; Graph partition; Graph; Mathematics; Artificial intelligence; Graph power; Line graph","score_opus":0.1146550088647792,"score_gpt":0.35980905483758185,"score_spread":0.24515404597280266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898686011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050626118,0.0019689272,0.8688559,0.0018952785,0.0010710816,0.00013180642,0.001025483,0.0014926874,0.072932765],"genre_scores_gemma":[0.518899,0.0032694072,0.39135763,0.00092922436,0.0013976914,0.00028772114,0.0028320465,0.0013666122,0.07966071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924743,0.00022029602,0.000021846588,0.00015194649,0.00022500567,0.00013354672],"domain_scores_gemma":[0.99800617,0.0008644154,0.00011412421,0.000563106,0.00028679034,0.0001653803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049777306,0.0011432056,0.001002585,0.00073844363,0.00075833686,0.0020436193,0.0011955451,0.00078843493,0.011812809],"category_scores_gemma":[0.004355683,0.00073091354,0.0005813193,0.0018863389,0.0009630797,0.0019600377,0.0015452389,0.0024024474,0.0022490046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025646127,0.00015512669,0.00037864895,0.0004112026,0.000055920595,0.00009904144,0.00023298392,0.16745126,0.007394737,0.5591506,0.06752585,0.19688827],"study_design_scores_gemma":[0.00003385476,0.000029903316,0.00016690012,0.000029934847,0.000011228447,0.00006360827,0.00004362632,0.19420643,0.0013715148,0.7919539,0.012073344,0.000015717747],"about_ca_topic_score_codex":0.0027066707,"about_ca_topic_score_gemma":0.0046322346,"teacher_disagreement_score":0.011812809,"about_ca_system_score_codex":0.0013845554,"about_ca_system_score_gemma":0.0013760771,"threshold_uncertainty_score":0.03951776},"labels":[],"label_agreement":null},{"id":"W2902000811","doi":"10.1016/j.ejor.2020.09.017","title":"An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs","year":2020,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Universitetet i Bergen; Türkiye Bilimler Akademisi","keywords":"Graph coloring; Fractional coloring; Combinatorics; Greedy coloring; Perfect graph; Mathematics; List coloring; Complete coloring; Graph partition; Discrete mathematics; Graph; Algorithm; Computer science; Graph power; Line graph","score_opus":0.29019233814412476,"score_gpt":0.4730422828480221,"score_spread":0.18284994470389732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902000811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070980825,0.000376398,0.914159,0.00037952853,0.00013276574,0.00018514956,0.00044996254,0.0013639638,0.011972381],"genre_scores_gemma":[0.24340478,0.00027558033,0.7506455,0.00013792452,0.00006266161,0.00022276443,0.00085343653,0.00017551456,0.0042217746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996094,0.00007257893,0.00001925951,0.00009386054,0.000108482134,0.00009646779],"domain_scores_gemma":[0.99923563,0.00045762534,0.000053978478,0.00012828612,0.00007476209,0.00004972275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060853857,0.0009277712,0.00089064206,0.0008066092,0.0005271424,0.0010885051,0.0016620696,0.0011056234,0.0068535693],"category_scores_gemma":[0.00231777,0.00056034105,0.0006994038,0.0017202818,0.0004919966,0.0013403555,0.0009947713,0.0012020207,0.0006299804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042814115,0.00033330408,0.00083324156,0.0003194269,0.00007659332,0.00010651377,0.00011469239,0.5867935,0.007153282,0.038193047,0.011743501,0.35390484],"study_design_scores_gemma":[0.000093790884,0.00006800532,0.00024160916,0.000009572117,0.00002091712,0.000040318268,0.00003067866,0.9736318,0.0010944898,0.023400292,0.0013626311,0.0000059746058],"about_ca_topic_score_codex":0.00585667,"about_ca_topic_score_gemma":0.006516755,"teacher_disagreement_score":0.0068535693,"about_ca_system_score_codex":0.0009338394,"about_ca_system_score_gemma":0.0021156208,"threshold_uncertainty_score":0.022927523},"labels":[],"label_agreement":null},{"id":"W2902345746","doi":"10.1111/poms.12978","title":"A Network‐Based Formulation for Scheduling Clinical Rotations","year":2018,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Counterfactual thinking; Scheduling (production processes); Operations research; Mathematical optimization; Mathematics","score_opus":0.23210208250058165,"score_gpt":0.45772537278201214,"score_spread":0.2256232902814305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902345746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05481313,0.0009290005,0.91661525,0.002658939,0.00028053313,0.00043426047,0.0025468487,0.00022168815,0.021500334],"genre_scores_gemma":[0.70470953,0.0014424144,0.2610244,0.00042646346,0.0002073513,0.0014549007,0.002390078,0.00019045944,0.028154444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989796,0.00048593784,0.000034624172,0.0002047194,0.00013203641,0.0001629055],"domain_scores_gemma":[0.99676645,0.0025244944,0.0002531021,0.000049138012,0.00021429223,0.00019256609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021036402,0.0015265362,0.0013077733,0.0010487365,0.00065089285,0.001751427,0.0018028455,0.0023541232,0.011321448],"category_scores_gemma":[0.00492566,0.0010918155,0.0010339342,0.0015465403,0.00095871644,0.0017886789,0.0010085497,0.0020549342,0.0005694328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017111937,0.000014187108,0.00010800051,0.000018127079,0.0000073181372,0.000015552467,0.000009167016,0.9933623,0.00005025772,0.004846259,0.0003605155,0.0011911476],"study_design_scores_gemma":[0.000014031917,0.000009743597,0.00004956439,0.000004708839,0.0000035266598,0.00000317201,0.0000102787935,0.9964085,0.000028086524,0.0029916149,0.00047389936,0.0000028036175],"about_ca_topic_score_codex":0.035478182,"about_ca_topic_score_gemma":0.028994387,"teacher_disagreement_score":0.035478182,"about_ca_system_score_codex":0.004661119,"about_ca_system_score_gemma":0.0041766968,"threshold_uncertainty_score":0.07054335},"labels":[],"label_agreement":null},{"id":"W2914927841","doi":"","title":"Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355","year":2015,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Volume (thermodynamics); Computer science; Physics; Thermodynamics","score_opus":0.20590856377032568,"score_gpt":0.3898679408667366,"score_spread":0.18395937709641091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914927841","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013756308,0.058591597,0.74069446,0.026590275,0.028865729,0.00023936371,0.0018490289,0.0010046478,0.1284085],"genre_scores_gemma":[0.21883826,0.051672142,0.41917273,0.00798575,0.03453452,0.0011444767,0.007656263,0.0023998653,0.25659606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715734,0.0013360558,0.00017050393,0.0005645042,0.0005860422,0.00018565463],"domain_scores_gemma":[0.98854977,0.007570656,0.0002818913,0.0014350853,0.0015989919,0.0005635673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005939473,0.0016742487,0.0039570364,0.0018010125,0.0013212331,0.006749959,0.0023489157,0.0023670392,0.050719988],"category_scores_gemma":[0.013970719,0.0009870238,0.0019738993,0.0024107494,0.0024501942,0.0040967707,0.0030912198,0.0076178317,0.010036366],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040024274,0.0005608818,0.0022552086,0.00087361375,0.0006906854,0.00012899708,0.0002466539,0.035648238,0.0010524702,0.28482816,0.29879686,0.37451798],"study_design_scores_gemma":[0.00015661327,0.00017011125,0.002147809,0.0007326599,0.00027957413,0.00023738667,0.00015395263,0.257424,0.0009186564,0.55956227,0.17814323,0.00007372104],"about_ca_topic_score_codex":0.0038335558,"about_ca_topic_score_gemma":0.003753732,"teacher_disagreement_score":0.94928,"about_ca_system_score_codex":0.0026480553,"about_ca_system_score_gemma":0.0028379546,"threshold_uncertainty_score":0.16967529},"labels":[],"label_agreement":null},{"id":"W2914964871","doi":"10.1007/s13675-019-00119-3","title":"A decomposition-based heuristic for large employee scheduling problems with inter-department transfers","year":2019,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Job shop scheduling; Heuristic; Schedule; Time horizon; Mathematical optimization; Operations research; Mathematics; Artificial intelligence","score_opus":0.05109040726476697,"score_gpt":0.3510804581731453,"score_spread":0.2999900509083783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914964871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10264104,0.0014063116,0.8823543,0.00066690566,0.00015600483,0.000556189,0.0004935566,0.0009681472,0.010757509],"genre_scores_gemma":[0.44830105,0.0006260036,0.54604393,0.00033103174,0.00007714844,0.00072587456,0.0012035061,0.00027250475,0.0024188587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.0004977888,0.000048312846,0.00016090833,0.0001318105,0.00026510356],"domain_scores_gemma":[0.9973724,0.0018582578,0.00019522497,0.000117122414,0.00019229161,0.00026469363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421786,0.0021674186,0.0021294754,0.0011976509,0.00082019693,0.0012659518,0.0018908727,0.0019106278,0.0041830344],"category_scores_gemma":[0.0033712923,0.0009375231,0.001718702,0.001505922,0.0007501685,0.0012815564,0.0014693261,0.0020792612,0.00057859777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001195398,0.00020437659,0.00037060902,0.00012760528,0.000050343802,0.00009324527,0.00005788372,0.97329783,0.0010643172,0.0029932512,0.0013765442,0.020244503],"study_design_scores_gemma":[0.00005280265,0.00005408793,0.00009190933,0.000012993973,0.000016841353,0.000015542912,0.000038019956,0.996439,0.00021678649,0.002608089,0.00044760897,0.0000064028295],"about_ca_topic_score_codex":0.008825459,"about_ca_topic_score_gemma":0.008344289,"teacher_disagreement_score":0.008825459,"about_ca_system_score_codex":0.0017501785,"about_ca_system_score_gemma":0.0029203172,"threshold_uncertainty_score":0.017548144},"labels":[],"label_agreement":null},{"id":"W2916350071","doi":"10.5555/2431518.2431817","title":"1 canadian forces flying training school (1 CFFTS) resource allocation simulation tool","year":2011,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Train; Resource allocation; Reliability (semiconductor); Computer science; Resource (disambiguation); Duration (music); Presentation (obstetrics); Operations research; Training (meteorology); Simulation; Resource management (computing); Reliability engineering; Engineering; Distributed computing; Meteorology; Computer network","score_opus":0.34176069050136293,"score_gpt":0.39233005407690885,"score_spread":0.05056936357554592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916350071","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1176536,0.0003716726,0.31698826,0.0015336972,0.0004916042,0.0021132026,0.04643693,0.042736378,0.47167468],"genre_scores_gemma":[0.51585865,0.0006386679,0.31536064,0.0003310624,0.00003938144,0.0013814184,0.027415711,0.0022142117,0.13676031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998293,0.000033979533,0.0000069859816,0.000023492736,0.00006751653,0.00003866709],"domain_scores_gemma":[0.99959606,0.000119579614,0.000015696147,0.000032895216,0.00017556491,0.00006025969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040369813,0.00058181986,0.0002831527,0.0005809515,0.000648703,0.0007758533,0.0009602271,0.00050781906,0.06733577],"category_scores_gemma":[0.0012548544,0.0003214062,0.00035382446,0.0007586928,0.00020000317,0.00046135645,0.00037740238,0.00065580633,0.0050893654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034017017,0.00033993195,0.0083035,0.00026039078,0.000034503377,0.000132531,0.00028196914,0.6304846,0.0033458252,0.024761593,0.19814871,0.13356625],"study_design_scores_gemma":[0.00016803118,0.00008494917,0.0029413532,0.00004843038,0.000019935622,0.000032403917,0.0000889893,0.7715439,0.0019014244,0.0022012233,0.2209283,0.00004104788],"about_ca_topic_score_codex":0.4295422,"about_ca_topic_score_gemma":0.5185277,"teacher_disagreement_score":0.5704578,"about_ca_system_score_codex":0.0037321725,"about_ca_system_score_gemma":0.006653824,"threshold_uncertainty_score":0.854084},"labels":[],"label_agreement":null},{"id":"W292355835","doi":"10.1609/aaai.v28i1.9031","title":"Solving the Traveling Tournament Problem by Packing Three-Vertex Paths","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; Schedule; Mathematical optimization; Vertex (graph theory); Integer programming; TRIPS architecture; Computer science; Scheduling (production processes); Job shop scheduling; Graph; Benchmark (surveying); Mathematics; Theoretical computer science; Combinatorics; Geography; Parallel computing","score_opus":0.16066170412888656,"score_gpt":0.35453162501407115,"score_spread":0.1938699208851846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W292355835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33042565,0.00018556617,0.6478846,0.00031189682,0.00008238627,0.0003543621,0.00039008542,0.0006774107,0.01968792],"genre_scores_gemma":[0.60025847,0.00024035625,0.39465627,0.0000725965,0.000026862397,0.00022412557,0.00090626755,0.00016382887,0.0034512156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962735,0.00013963868,0.000015184407,0.000070985785,0.000058409416,0.00008848548],"domain_scores_gemma":[0.99946135,0.00029130295,0.000059260063,0.00006481136,0.000051216004,0.00007208913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005604364,0.0007304477,0.000596648,0.0004640549,0.0006162995,0.0008172955,0.00096926524,0.00066262257,0.0046597254],"category_scores_gemma":[0.0017491258,0.00032378265,0.0006817059,0.0009580389,0.00049517426,0.0009189134,0.0006498778,0.00079061714,0.0003795365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018046622,0.00018370751,0.0015021868,0.00014162362,0.000055815475,0.0002518846,0.00017144436,0.8677598,0.0030747345,0.027239362,0.004662829,0.09477616],"study_design_scores_gemma":[0.00007472246,0.000261868,0.0003539555,0.000010561314,0.000024190012,0.000112579815,0.00013141934,0.96984285,0.0018585682,0.023619294,0.0036987837,0.000011214748],"about_ca_topic_score_codex":0.0038623582,"about_ca_topic_score_gemma":0.004349003,"teacher_disagreement_score":0.0046597254,"about_ca_system_score_codex":0.0005336165,"about_ca_system_score_gemma":0.0010837818,"threshold_uncertainty_score":0.015588284},"labels":[],"label_agreement":null},{"id":"W2941679361","doi":"10.1504/ijsom.2019.10020831","title":"Hybridising plant propagation and local search for uncapacitated exam scheduling problems","year":2019,"lang":"en","type":"article","venue":"International Journal of Services and Operations Management","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metaheuristic; Computer science; Benchmark (surveying); Local search (optimization); Mathematical optimization; Scheduling (production processes); Job shop scheduling; Population; Context (archaeology); Operations research; Artificial intelligence; Mathematics; Geography","score_opus":0.05700839003826297,"score_gpt":0.34046900908351657,"score_spread":0.2834606190452536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941679361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11654686,0.0016420112,0.87259114,0.00060896255,0.00012617641,0.00015519075,0.0001913773,0.0014001643,0.00673803],"genre_scores_gemma":[0.6621885,0.0005166304,0.332611,0.00034636975,0.00008872898,0.00024788917,0.0004541708,0.00022516861,0.0033216034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999387,0.0002946117,0.000028165676,0.000086988686,0.00012396243,0.00007918032],"domain_scores_gemma":[0.9974407,0.001985768,0.00018522204,0.00012327451,0.00015694425,0.00010802412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019499265,0.0010980451,0.0010309686,0.001151007,0.00036981713,0.0009709311,0.0017987594,0.0012741921,0.0022256307],"category_scores_gemma":[0.004004481,0.0004179968,0.0009767401,0.0012404054,0.0007010708,0.001217974,0.0010879444,0.0013727124,0.00033331724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054117438,0.00008321302,0.000609369,0.00006888983,0.000039729326,0.000037959446,0.000026529371,0.96031237,0.0006552249,0.0024480475,0.0007269256,0.034937605],"study_design_scores_gemma":[0.000012292319,0.00004018219,0.0000701696,0.0000060923744,0.0000067542633,0.000009485036,0.000009435532,0.99827516,0.00020385308,0.0010564313,0.0003074317,0.000002699095],"about_ca_topic_score_codex":0.0057590236,"about_ca_topic_score_gemma":0.0070635206,"teacher_disagreement_score":0.0057590236,"about_ca_system_score_codex":0.00094706035,"about_ca_system_score_gemma":0.0014493784,"threshold_uncertainty_score":0.011451006},"labels":[],"label_agreement":null},{"id":"W2944684921","doi":"10.1088/1361-6560/ab1beb","title":"Corrigendum: A mixed-integer linear programming optimization model framework for capturing expert planning style in low dose rate prostate brachytherapy (2019 <i>Phys. Med. Biol</i> . <b>64</b> 075007)","year":2019,"lang":"en","type":"erratum","venue":"Physics in Medicine and Biology","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Brachytherapy; Integer programming; Dose rate; Prostate brachytherapy; Radiation treatment planning; Integer (computer science); Linear programming; Prostate; Computer science; Medical physics; Nuclear medicine; Medicine; Mathematical optimization; Mathematics; Algorithm; Radiology; Internal medicine; Radiation therapy; Programming language","score_opus":0.32028626096222335,"score_gpt":0.46024690419813585,"score_spread":0.1399606432359125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944684921","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019275876,0.009740603,0.5960178,0.051083576,0.16209838,0.00031128025,0.022959298,0.0111785345,0.144683],"genre_scores_gemma":[0.02639781,0.009427953,0.32805705,0.011754406,0.016528672,0.00055610813,0.01656,0.008077163,0.5826408],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989673,0.00025368202,0.00008098976,0.00019615912,0.0004426534,0.00005924744],"domain_scores_gemma":[0.99739873,0.0010269727,0.00010044144,0.00016027933,0.0011964464,0.00011704411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017945373,0.0014482153,0.00077025907,0.0013606054,0.00091867225,0.0032706126,0.0017553763,0.0022834723,0.1221883],"category_scores_gemma":[0.009570015,0.0006390084,0.0012984896,0.0013315217,0.00069825933,0.0020428398,0.0013796175,0.0029168148,0.047117263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025071371,0.000017295162,0.00010403416,0.00020840204,0.000016596343,0.00013198316,0.000023787314,0.011964614,0.0002052985,0.018185535,0.90888673,0.06023068],"study_design_scores_gemma":[0.000047282705,0.00003608802,0.00036984947,0.00032107823,0.000038311155,0.00020638572,0.000040371364,0.062887855,0.0010510801,0.032616984,0.90231735,0.000067468],"about_ca_topic_score_codex":0.028915934,"about_ca_topic_score_gemma":0.059413325,"teacher_disagreement_score":0.1221883,"about_ca_system_score_codex":0.0021062985,"about_ca_system_score_gemma":0.0027848352,"threshold_uncertainty_score":0.4087606},"labels":[],"label_agreement":null},{"id":"W297251781","doi":"","title":"On the Expected Value of the Bottleneck Assignment Problem","year":2010,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Value (mathematics); Bottleneck; Computer science; Mathematics; Statistics","score_opus":0.04820036672738068,"score_gpt":0.28857360894082873,"score_spread":0.24037324221344805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W297251781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13362539,0.006708515,0.7930943,0.010555833,0.0006513091,0.00013985152,0.0007990732,0.00025159234,0.054174166],"genre_scores_gemma":[0.8831254,0.0056575267,0.0932509,0.00087750837,0.0014760891,0.00033082993,0.0007382729,0.00035812755,0.014185314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966859,0.0019666872,0.00007935185,0.0003060245,0.0005415882,0.00042044412],"domain_scores_gemma":[0.95170265,0.04443077,0.000961808,0.0005670072,0.0013183508,0.0010193557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007355976,0.0015267398,0.002310447,0.0023499473,0.0008410111,0.0034190705,0.0027773662,0.002169223,0.007847639],"category_scores_gemma":[0.04408556,0.00093291857,0.0011667518,0.0023852354,0.0030548817,0.00609971,0.0017673597,0.0039459127,0.00036606204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004992583,0.00020803668,0.0010208002,0.00038337475,0.00014458598,0.00013850768,0.00015750663,0.5060372,0.00090872933,0.45601234,0.007851803,0.026637776],"study_design_scores_gemma":[0.00007207718,0.000067793204,0.00042250674,0.000097763084,0.000047615624,0.00005206622,0.00005410608,0.5645514,0.00027301596,0.43308428,0.0012535402,0.000023867566],"about_ca_topic_score_codex":0.003544044,"about_ca_topic_score_gemma":0.0022010407,"teacher_disagreement_score":0.007847639,"about_ca_system_score_codex":0.003998882,"about_ca_system_score_gemma":0.0025511514,"threshold_uncertainty_score":0.03890258},"labels":[],"label_agreement":null},{"id":"W2983223026","doi":"10.1163/9789087909352_023","title":"Mathematical E-nrichment: Problem-of-the-week Model","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science","score_opus":0.17100721684576492,"score_gpt":0.3572924508401738,"score_spread":0.18628523399440888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983223026","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152318375,0.0031924744,0.8396641,0.0058857803,0.0008118337,0.00017373751,0.0017012944,0.0003235568,0.13301533],"genre_scores_gemma":[0.48046216,0.00921584,0.21462362,0.0014289266,0.0018709935,0.0010582336,0.002629709,0.00053311995,0.2881774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991417,0.00038500063,0.000029174085,0.0001515848,0.0001736058,0.00011883772],"domain_scores_gemma":[0.998594,0.0008395489,0.00012830345,0.00016817146,0.00015868613,0.000111330235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014531853,0.0013872749,0.001441833,0.000793821,0.0007243666,0.0022516984,0.0035577405,0.0024795637,0.022829857],"category_scores_gemma":[0.007063277,0.00069955015,0.0014949357,0.0023172915,0.0013466239,0.0042227036,0.0013627029,0.0043600677,0.0034516058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007008291,0.000107123466,0.00024258032,0.00020148924,0.00004037948,0.00009714583,0.000081074766,0.24165195,0.0002781928,0.69137216,0.038376916,0.027480863],"study_design_scores_gemma":[0.00003367693,0.000032333897,0.00017131666,0.000030621934,0.000018190745,0.000092785245,0.000041191033,0.4750018,0.000190413,0.5002216,0.024144871,0.000021201507],"about_ca_topic_score_codex":0.0061797625,"about_ca_topic_score_gemma":0.0044323276,"teacher_disagreement_score":0.022829857,"about_ca_system_score_codex":0.0023249649,"about_ca_system_score_gemma":0.0016109409,"threshold_uncertainty_score":0.07637352},"labels":[],"label_agreement":null},{"id":"W2993304593","doi":"","title":"Sense of Vocation","year":2010,"lang":"en","type":"article","venue":"Intersections Canadian Journal of Music","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sense (electronics); Engineering; Electrical engineering","score_opus":0.09259193457445508,"score_gpt":0.3426845377894289,"score_spread":0.25009260321497384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993304593","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15311922,0.001156057,0.024234815,0.007223586,0.0009421197,0.000065860906,0.00025277544,0.00011559236,0.81289],"genre_scores_gemma":[0.9721299,0.00020306866,0.0024549677,0.00076564983,0.00008638899,0.000029226285,0.000102330225,0.000055918594,0.024172619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99596405,0.0013033634,0.00015467715,0.00060797605,0.0011912903,0.0007786194],"domain_scores_gemma":[0.9954171,0.0005169755,0.0006457001,0.0006321769,0.0014764691,0.0013115272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021525524,0.00035133626,0.00043647294,0.0014817662,0.0037139126,0.0066528944,0.00077493745,0.0011567859,0.013867221],"category_scores_gemma":[0.0079144845,0.00023792005,0.00044975104,0.0009670293,0.007723279,0.00455468,0.006622987,0.0021609848,0.0013898906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002934227,0.00009076237,0.017777504,0.00014475886,0.00009502883,0.0006523278,0.11304135,0.0006078103,0.0046409485,0.77379435,0.018269453,0.07059227],"study_design_scores_gemma":[0.00003755915,0.00031610168,0.044622,0.00025824874,0.00006177746,0.0020767637,0.18175195,0.0017789855,0.0014635607,0.27319667,0.49425322,0.00018321346],"about_ca_topic_score_codex":0.004980412,"about_ca_topic_score_gemma":0.006567724,"teacher_disagreement_score":0.013867221,"about_ca_system_score_codex":0.0016055737,"about_ca_system_score_gemma":0.001623385,"threshold_uncertainty_score":0.046390474},"labels":[],"label_agreement":null},{"id":"W2995560424","doi":"10.1007/978-3-030-37584-3_5","title":"Modelling Alternative Staffing Scenarios for Workforce Rejuvenation","year":2019,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence","funders":"","keywords":"Workforce; Staffing; Attrition; Workforce planning; Computer science; Work (physics); Service (business); Operations research; Operations management; Business; Mathematics; Engineering; Marketing; Economics; Management; Mechanical engineering; Medicine; Economic growth","score_opus":0.2322927041397261,"score_gpt":0.3985131027689909,"score_spread":0.16622039862926477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995560424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53823406,0.0015332412,0.34467325,0.0031482968,0.00051944645,0.00054122834,0.00416155,0.0005035507,0.10668533],"genre_scores_gemma":[0.9412051,0.0005449461,0.026271489,0.00012609207,0.000059586673,0.00034767474,0.00077683036,0.00010973849,0.030558653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924845,0.00033023107,0.000023345636,0.00010809376,0.00007939911,0.00021035774],"domain_scores_gemma":[0.9970379,0.00241573,0.0001635562,0.000058119876,0.00013568715,0.00018902596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017172408,0.0010257136,0.0012965526,0.0011412156,0.00072845846,0.0025331501,0.0026145307,0.004184141,0.014767137],"category_scores_gemma":[0.0046049054,0.0011653429,0.0019080625,0.0013272498,0.0010059036,0.0018480635,0.00090575544,0.0019440305,0.00082834077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034935303,0.000019008854,0.00012333365,0.000019830693,0.000007685254,0.000036720638,0.000020238216,0.99270815,0.000098723496,0.0052424227,0.00041638332,0.0012725652],"study_design_scores_gemma":[0.000012040776,0.000022902674,0.00011864262,0.000008892284,0.0000062407407,0.000009540519,0.0000419166,0.9939944,0.000053013122,0.005295108,0.00043036687,0.0000068798895],"about_ca_topic_score_codex":0.023302026,"about_ca_topic_score_gemma":0.019725539,"teacher_disagreement_score":0.023302026,"about_ca_system_score_codex":0.00359786,"about_ca_system_score_gemma":0.0018823257,"threshold_uncertainty_score":0.049400985},"labels":[],"label_agreement":null},{"id":"W2998541205","doi":"10.6000/1929-7092.2019.08.102","title":"A Critical Appraisal of Employee Work Life Balance among Deposit Money Banks in Enugu State, Nigeria","year":2019,"lang":"en","type":"article","venue":"Journal of Reviews on Global Economics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Work (physics); Business; State (computer science); Balance (ability); Work–life balance; Critical appraisal; Operations management; Finance; Economics; Psychology; Engineering; Medicine; Computer science; Mechanical engineering","score_opus":0.05966012334861354,"score_gpt":0.3798788254458099,"score_spread":0.3202187020971964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998541205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99234176,0.0015793551,0.00025777702,0.00084725406,0.000052273877,0.00008378297,0.00021207295,0.0000038944404,0.004621886],"genre_scores_gemma":[0.99848145,0.0005358816,0.000179575,0.000035773715,0.000014136215,0.000018693183,0.000065490996,0.0000010836003,0.0006678141],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99857557,0.00055517565,0.00023351274,0.000101521524,0.0003162758,0.00021784242],"domain_scores_gemma":[0.9922042,0.0029868975,0.001630153,0.000076923956,0.0024422724,0.00065958867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030837113,0.00022608553,0.00028592302,0.003680383,0.0020785024,0.002018473,0.00029185854,0.00043227055,0.0024237633],"category_scores_gemma":[0.0077298526,0.00018313751,0.00021384677,0.002300002,0.00072648725,0.00079608674,0.0007248955,0.0003914159,0.0001639275],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089654635,0.00015825419,0.849061,0.0011228041,0.000083409126,0.0017484254,0.04932538,0.0013577908,0.0020978386,0.0025417737,0.0036919052,0.0879149],"study_design_scores_gemma":[0.000007930522,0.00036873252,0.87787384,0.0004425014,0.00003842336,0.00028170133,0.11322344,0.0010296446,0.0005280827,0.00063404447,0.005542243,0.00002949552],"about_ca_topic_score_codex":0.01788377,"about_ca_topic_score_gemma":0.03791584,"teacher_disagreement_score":0.01788377,"about_ca_system_score_codex":0.0039087627,"about_ca_system_score_gemma":0.0028744435,"threshold_uncertainty_score":0.035559356},"labels":[],"label_agreement":null},{"id":"W3004735658","doi":"","title":"Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem","year":2016,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Course (navigation); Preprocessor; Set (abstract data type); Computer science; Integer programming; Mathematical optimization; Relaxation (psychology); Mathematics; Artificial intelligence; Programming language; Engineering","score_opus":0.06341377254974971,"score_gpt":0.31097728931270713,"score_spread":0.2475635167629574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004735658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014749722,0.00041270308,0.9761578,0.0008374443,0.000085308755,0.00020949829,0.00074660924,0.00024871327,0.0065521435],"genre_scores_gemma":[0.20229861,0.0010963698,0.78608096,0.00047896896,0.00029661824,0.00092860823,0.0030936096,0.0004434528,0.005282772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518,0.0017173443,0.00021649421,0.0008639493,0.0012684962,0.0007537713],"domain_scores_gemma":[0.9898414,0.0073764585,0.0010779438,0.00076984585,0.00064593786,0.00028839792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040436196,0.0021910542,0.0013810252,0.0015841026,0.00085959816,0.0029009364,0.0038495993,0.0017459024,0.008571608],"category_scores_gemma":[0.013544363,0.0012378284,0.0027732921,0.0029677926,0.0012246445,0.0048698056,0.0015199858,0.0059877327,0.001275828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000200672,0.00051176833,0.0013258534,0.00057298713,0.00011073447,0.00019929085,0.00019366048,0.8121071,0.0031444423,0.098726586,0.008123692,0.07478321],"study_design_scores_gemma":[0.00003924412,0.00012179874,0.00038213082,0.00006660013,0.000032064592,0.000088196844,0.00005316889,0.94088364,0.0013532755,0.053064734,0.0038934543,0.000021690257],"about_ca_topic_score_codex":0.00833064,"about_ca_topic_score_gemma":0.009649789,"teacher_disagreement_score":0.008571608,"about_ca_system_score_codex":0.003095668,"about_ca_system_score_gemma":0.0047024144,"threshold_uncertainty_score":0.02867484},"labels":[],"label_agreement":null},{"id":"W3010667731","doi":"10.5220/0008877803220330","title":"Discrete Focus Group Optimization Algorithm for Solving Constraint Satisfaction Problems","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Computer science; Focus (optics); Constraint satisfaction; Group (periodic table); Algorithm; Constraint (computer-aided design); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.10364364676920725,"score_gpt":0.3452219852240495,"score_spread":0.24157833845484228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010667731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005712896,0.00008985946,0.9907136,0.000099162455,0.00003137634,0.000082218285,0.000047725996,0.00025896644,0.00296424],"genre_scores_gemma":[0.11764336,0.0001300657,0.87598246,0.00016875405,0.000033347424,0.0006504259,0.0003111826,0.00013023587,0.0049501713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999355,0.00022845286,0.000019710318,0.000105916115,0.0002125047,0.00007843652],"domain_scores_gemma":[0.99874425,0.0008908116,0.0000513586,0.000076490964,0.00018135125,0.00005580125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015355955,0.0010384663,0.001193518,0.0010216658,0.0008636173,0.00074667943,0.0019487379,0.0013090151,0.007607118],"category_scores_gemma":[0.0033012484,0.00055365445,0.0007312138,0.0013924232,0.0006389871,0.0011896663,0.001589228,0.0016256665,0.0010673703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041262337,0.00043982652,0.00065139413,0.00027827173,0.00010443206,0.00010190525,0.00035872016,0.60929215,0.0046418873,0.063093685,0.011220059,0.309405],"study_design_scores_gemma":[0.000077607765,0.000085154046,0.000081739614,0.000008040888,0.000011982293,0.000014500165,0.000024958386,0.9858516,0.00073619344,0.011213824,0.0018897584,0.000004782901],"about_ca_topic_score_codex":0.0058259666,"about_ca_topic_score_gemma":0.005425644,"teacher_disagreement_score":0.007607118,"about_ca_system_score_codex":0.0009401127,"about_ca_system_score_gemma":0.0015819586,"threshold_uncertainty_score":0.025448382},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.3593459955887414,"score_gpt":0.41249422560570065,"score_spread":0.05314823001695923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025824561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021601995,0.0006058487,0.97293955,0.00039318533,0.000050736813,0.00021855612,0.00008603815,0.00065495743,0.0034490621],"genre_scores_gemma":[0.15450932,0.00044451142,0.84189636,0.00015861701,0.000057273093,0.00027640435,0.0003123408,0.00013501121,0.0022101374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975343,0.0012183181,0.000108481094,0.00038541434,0.0005388295,0.00021477987],"domain_scores_gemma":[0.994822,0.003393308,0.00039846796,0.000573453,0.0006209524,0.0001917979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003634857,0.0011503214,0.0012340554,0.0024314355,0.00086690974,0.0014214091,0.0021720768,0.0010053163,0.004267973],"category_scores_gemma":[0.008545422,0.00068795506,0.001578658,0.002811098,0.001619521,0.0021012882,0.001411949,0.0016979058,0.0005617477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015673958,0.0004104484,0.0023228053,0.0005861526,0.000100370824,0.00014879853,0.00043651753,0.5688959,0.0036657047,0.038556658,0.0040393802,0.38068056],"study_design_scores_gemma":[0.0000686046,0.00034500207,0.00066658267,0.00006724854,0.00006198961,0.00011800809,0.00014895543,0.9552552,0.0037911292,0.03065999,0.00879133,0.000025869915],"about_ca_topic_score_codex":0.0060069486,"about_ca_topic_score_gemma":0.009138172,"teacher_disagreement_score":0.0060069486,"about_ca_system_score_codex":0.0016092369,"about_ca_system_score_gemma":0.0036526064,"threshold_uncertainty_score":0.019223154},"labels":[],"label_agreement":null},{"id":"W3066458696","doi":"10.29207/resti.v4i4.2066","title":"Application of Heuristic Combinations in Hyper-Heuristic Framework for Exam Scheduling Problems","year":2020,"lang":"en","type":"article","venue":"Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Hill climbing; Heuristics; Guided Local Search; Mathematical optimization; Computer science; Heuristic; Scheduling (production processes); Algorithm; Mathematics","score_opus":0.14825243529762283,"score_gpt":0.37665478041907446,"score_spread":0.22840234512145163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3066458696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09863495,0.0024896243,0.8830789,0.0005575992,0.00017606959,0.0007241787,0.00028282244,0.0008386463,0.0132172275],"genre_scores_gemma":[0.4938034,0.00093518785,0.5021573,0.00020856885,0.000052783143,0.00069548876,0.00029985275,0.00010725382,0.001740127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984445,0.0008860506,0.0000780131,0.00015638245,0.0002610403,0.00017410603],"domain_scores_gemma":[0.99818677,0.0011178983,0.00022401506,0.0001103946,0.0002503861,0.000110503825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024487018,0.001249776,0.0012798053,0.002667274,0.00089179905,0.0018419867,0.0016162188,0.0012345832,0.0026344927],"category_scores_gemma":[0.0044380315,0.00073995156,0.0015638354,0.002245985,0.00070647424,0.0009103097,0.00087686774,0.0011840769,0.00034429113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009478257,0.00017861906,0.0013746825,0.00020548284,0.00011113409,0.00012520347,0.00012514173,0.93281174,0.0009230722,0.009849926,0.00089333334,0.05330691],"study_design_scores_gemma":[0.00003061699,0.00009137912,0.00031801753,0.0000442736,0.000041880878,0.000033183944,0.00008151001,0.9923692,0.0005772027,0.004657443,0.001742161,0.000013108137],"about_ca_topic_score_codex":0.009482013,"about_ca_topic_score_gemma":0.011327172,"teacher_disagreement_score":0.009482013,"about_ca_system_score_codex":0.0019146358,"about_ca_system_score_gemma":0.003095253,"threshold_uncertainty_score":0.018853664},"labels":[],"label_agreement":null},{"id":"W3082183127","doi":"","title":"Méthodes heuristiques de planification et de ré-optimisation en temps réel pour les problèmes d’horaires de personnel","year":2019,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Humanities; Computer science; Philosophy","score_opus":0.04659044250036032,"score_gpt":0.3351109392301156,"score_spread":0.28852049672975527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082183127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035632413,0.0005762391,0.99315697,0.00015116055,0.00008131359,0.0000900062,0.00004796468,0.0002514548,0.0020816457],"genre_scores_gemma":[0.08431108,0.000988445,0.90328634,0.00016213332,0.000105568695,0.00063901424,0.00019475863,0.0003795091,0.009933065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998097,0.0006764512,0.00009532275,0.00027305153,0.00071364,0.00014453773],"domain_scores_gemma":[0.99660134,0.0022347749,0.00023432093,0.00034923307,0.0004788962,0.00010146614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034777827,0.0016409296,0.0015141554,0.0014498112,0.0008705329,0.0015250485,0.0018195941,0.0016508397,0.005901942],"category_scores_gemma":[0.007453906,0.000836543,0.00196208,0.0014173149,0.0012070035,0.0013938878,0.0013107661,0.0034467967,0.001330913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016502824,0.00015558259,0.0008675921,0.0005197291,0.0001834722,0.00007461525,0.0003265919,0.6835129,0.0051307655,0.045246806,0.0030087691,0.26080802],"study_design_scores_gemma":[0.00006036836,0.0000675643,0.0004155753,0.00007111199,0.000040620995,0.00005121164,0.00005850818,0.96724945,0.0027748493,0.020531513,0.008652567,0.000026669944],"about_ca_topic_score_codex":0.014748446,"about_ca_topic_score_gemma":0.017894186,"teacher_disagreement_score":0.014748446,"about_ca_system_score_codex":0.0015583616,"about_ca_system_score_gemma":0.003681159,"threshold_uncertainty_score":0.029325247},"labels":[],"label_agreement":null},{"id":"W3087028867","doi":"10.3968/11815","title":"Personnel Utilization: A Major Challenge in Nigeria Local Government System","year":2020,"lang":"en","type":"article","venue":"Canadian social science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mandate; Setback; Local government; Task (project management); Government (linguistics); Business; Order (exchange); Human resources; State (computer science); Operations management; Marketing; Public relations; Public administration; Computer science; Economics; Management; Finance; Political science; Law","score_opus":0.1415734123524382,"score_gpt":0.3395874940680687,"score_spread":0.1980140817156305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087028867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98555434,0.0006275946,0.00056641566,0.0025046053,0.000029678522,0.000049638835,0.00011288243,0.000015633996,0.010539174],"genre_scores_gemma":[0.99660695,0.00032902564,0.0002816029,0.00013420008,0.000009687539,0.000017982058,0.00004008039,0.000004283906,0.0025761405],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975866,0.0007003973,0.00021825997,0.00016095584,0.00054401375,0.0007898116],"domain_scores_gemma":[0.996876,0.00074246246,0.00091320305,0.00015923467,0.0007221778,0.0005868023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018348232,0.00009327935,0.00017945645,0.0009977515,0.0025371294,0.0025472376,0.00044681705,0.00043563865,0.0029685362],"category_scores_gemma":[0.0035481993,0.00018218168,0.00015293054,0.0020112358,0.0006553552,0.000675163,0.0009058344,0.0005740523,0.00033412213],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029347328,0.00042432713,0.69186926,0.00069816655,0.000053434193,0.0029089926,0.041517615,0.0039709588,0.00377397,0.020580208,0.008927289,0.22498229],"study_design_scores_gemma":[0.000016777201,0.00042498772,0.749764,0.0005041231,0.000028927152,0.0014385695,0.17363685,0.0042531393,0.0015677867,0.0038429042,0.064456396,0.00006552129],"about_ca_topic_score_codex":0.037128713,"about_ca_topic_score_gemma":0.05341436,"teacher_disagreement_score":0.037128713,"about_ca_system_score_codex":0.004503544,"about_ca_system_score_gemma":0.0066776937,"threshold_uncertainty_score":0.07382518},"labels":[],"label_agreement":null},{"id":"W3091028802","doi":"10.1007/978-3-030-58942-4_19","title":"Optimizing Student Course Preferences in School Timetabling","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Computer science; Course (navigation); Set (abstract data type); Graph coloring; Integer programming; Graph; Linear programming; Mathematics education; Core (optical fiber); Mathematical optimization; Operations research; Theoretical computer science; Programming language; Algorithm; Mathematics; Engineering; Telecommunications","score_opus":0.09666459316536698,"score_gpt":0.36772344332159135,"score_spread":0.2710588501562244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091028802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2788327,0.0008567054,0.69592273,0.0004037777,0.000083189654,0.00021206483,0.00050656375,0.0006770922,0.02250519],"genre_scores_gemma":[0.76093507,0.0005777964,0.22058007,0.000104301784,0.000068564164,0.00019993434,0.000680995,0.00042129774,0.01643203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939,0.00029952414,0.000016847582,0.000083075836,0.00010599419,0.00010454914],"domain_scores_gemma":[0.9990362,0.0006708362,0.000066520704,0.00006364367,0.00007415657,0.00008863394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200264,0.00060293335,0.0009336367,0.0005757926,0.0002980988,0.0008583594,0.0010927931,0.0006167464,0.008827995],"category_scores_gemma":[0.0030461792,0.00046588024,0.00055075675,0.0014538903,0.0002215205,0.0011152193,0.000669471,0.0009111879,0.00086272164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004667318,0.0004264086,0.0025226977,0.00012832544,0.00005152446,0.000025038202,0.00009068586,0.6167778,0.003611839,0.013804856,0.0071011665,0.35499287],"study_design_scores_gemma":[0.000030330977,0.00015452677,0.0012025827,0.000010654631,0.00002171454,0.000015570762,0.00004843961,0.98639154,0.0012624549,0.009415229,0.0014387829,0.000008207015],"about_ca_topic_score_codex":0.0037352126,"about_ca_topic_score_gemma":0.006170527,"teacher_disagreement_score":0.008827995,"about_ca_system_score_codex":0.0009892017,"about_ca_system_score_gemma":0.0009776237,"threshold_uncertainty_score":0.029532552},"labels":[],"label_agreement":null},{"id":"W3094448984","doi":"10.18280/ria.340405","title":"Two Stages Best First Search Algorithm Using Hard and Soft Constraints Heuristic for Course Timetabling","year":2020,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristic; Computer science; Algorithm; Meta heuristic; Mathematical optimization; Course (navigation); Artificial intelligence; Mathematics; Engineering","score_opus":0.2988225842573874,"score_gpt":0.42290440941324575,"score_spread":0.12408182515585836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094448984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020773921,0.00061633636,0.969681,0.00021723745,0.000076656,0.00039108115,0.00007415851,0.0005828726,0.007586611],"genre_scores_gemma":[0.2064149,0.00040297158,0.784449,0.00015769147,0.000036305162,0.000770106,0.00026444488,0.00013855242,0.0073660538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990397,0.00028669855,0.00006489669,0.00017204546,0.00027234852,0.00016425822],"domain_scores_gemma":[0.9991654,0.0005420886,0.00006921959,0.00004506052,0.00012805517,0.00005021091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001258525,0.0011634916,0.001518143,0.0017699165,0.0010112604,0.0014194882,0.0019222137,0.0017523351,0.0060719084],"category_scores_gemma":[0.0021224641,0.00088015164,0.0013567552,0.0017611898,0.00082451,0.0011424642,0.0009982132,0.0010984276,0.000630366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035232742,0.00030291904,0.0012144978,0.00036778455,0.00012191947,0.00018017516,0.0002785294,0.7992535,0.003839427,0.025597632,0.0042967936,0.16419439],"study_design_scores_gemma":[0.00013220799,0.00014823448,0.00025386855,0.000028350005,0.000039767543,0.00006690762,0.000037530877,0.989407,0.0015328916,0.0057452447,0.0025851545,0.00002285479],"about_ca_topic_score_codex":0.013742747,"about_ca_topic_score_gemma":0.013816944,"teacher_disagreement_score":0.013742747,"about_ca_system_score_codex":0.0017575317,"about_ca_system_score_gemma":0.0037766907,"threshold_uncertainty_score":0.027325511},"labels":[],"label_agreement":null},{"id":"W310536150","doi":"","title":"On a Generalization of the Gallai-Roy-Vitaver Theorem and Mathematical Programming Models for the Bandwidth Coloring Problem","year":2007,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Graph coloring; Graph","score_opus":0.04526399196713131,"score_gpt":0.30967256814252314,"score_spread":0.2644085761753918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W310536150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011310293,0.00062131044,0.95824957,0.004065354,0.00015301189,0.000058078927,0.00015204196,0.00016153327,0.025228813],"genre_scores_gemma":[0.42558303,0.0040854514,0.5248066,0.0034548107,0.0011290879,0.0007660562,0.0005340322,0.00059158105,0.039049335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979048,0.0006354962,0.00006539452,0.0005518826,0.0005324122,0.00030994453],"domain_scores_gemma":[0.9956844,0.0029299539,0.00033747032,0.0005070312,0.00035427266,0.00018689102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024238036,0.0011561634,0.00095342775,0.0013318585,0.0012463335,0.0037608102,0.0020977836,0.0022188523,0.008798437],"category_scores_gemma":[0.008556045,0.0007559677,0.002498126,0.0022766136,0.0041172314,0.009164291,0.0026590428,0.0049050404,0.0012750451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143167945,0.000035139918,0.00018123817,0.000046992234,0.000009567795,0.000035826324,0.00012449594,0.024843862,0.0004520369,0.9645769,0.0019207895,0.00775882],"study_design_scores_gemma":[0.00001563795,0.000026474305,0.00014686075,0.000031884505,0.00000997528,0.00005483538,0.000068683534,0.11922855,0.0004843933,0.8690516,0.010864889,0.000016183634],"about_ca_topic_score_codex":0.005824398,"about_ca_topic_score_gemma":0.0034406814,"teacher_disagreement_score":0.008798437,"about_ca_system_score_codex":0.0034672308,"about_ca_system_score_gemma":0.0022762106,"threshold_uncertainty_score":0.029433727},"labels":[],"label_agreement":null},{"id":"W3110716649","doi":"10.3233/idt-190114","title":"A new approach based on graph matching and evolutionary approach for sport scheduling problem","year":2020,"lang":"en","type":"article","venue":"Intelligent Decision Technologies","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Crossover; Tournament; Tournament selection; Mathematical optimization; Computer science; Schedule; Genetic algorithm; Scheduling (production processes); Constructive; Job shop scheduling; Operator (biology); Graph; Evolutionary algorithm; Operations research; Heuristic; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics","score_opus":0.1264925375277027,"score_gpt":0.35193642735680675,"score_spread":0.22544388982910404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110716649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008126924,0.00039203383,0.9854176,0.00025575073,0.00013152708,0.00014449666,0.00007491464,0.00022855816,0.0052281055],"genre_scores_gemma":[0.118343264,0.0009680307,0.8726706,0.00026727334,0.00015376609,0.00036924155,0.00049110496,0.00012938849,0.0066072536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927455,0.00016235361,0.000039876413,0.00017881086,0.00026316752,0.00008128615],"domain_scores_gemma":[0.9997217,0.000091217895,0.000038647453,0.00003515915,0.000083412204,0.000029814237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059808674,0.0009895948,0.0008174774,0.0022765235,0.00073557254,0.0008819658,0.0017534022,0.0011412166,0.0036136364],"category_scores_gemma":[0.0013019844,0.0003838004,0.0014383455,0.0026273122,0.0003812463,0.0013641553,0.0009136538,0.0010419481,0.00050892873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008920976,0.0003222269,0.0014789227,0.00037034473,0.00014968019,0.00029156465,0.0001236117,0.4672286,0.009585218,0.05955688,0.0094168885,0.45138693],"study_design_scores_gemma":[0.000029238205,0.00011683153,0.00038822734,0.00002547207,0.000051142528,0.00025715257,0.000044702145,0.969415,0.0017037165,0.015313283,0.0126381405,0.000017008902],"about_ca_topic_score_codex":0.0040492504,"about_ca_topic_score_gemma":0.0036647427,"teacher_disagreement_score":0.0040492504,"about_ca_system_score_codex":0.00075917924,"about_ca_system_score_gemma":0.0016574189,"threshold_uncertainty_score":0.012088895},"labels":[],"label_agreement":null},{"id":"W3110969133","doi":"10.1145/3429551.3429571","title":"Application of Integer Programming in Maximizing the Number of Industrial Engineering Students Allowed to Attend Face-to-Face classes for Blended Learning in Mapúa University during the COVID-19 Pandemic","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blended learning; Solver; Face-to-face; Class (philosophy); Computer science; Quarter (Canadian coin); Coronavirus disease 2019 (COVID-19); Face (sociological concept); Mathematics education; Online learning; Integer programming; Pandemic; Multimedia; Medical education; Mathematics; Artificial intelligence; Educational technology; Medicine; Programming language; Algorithm; Sociology","score_opus":0.15043421442143146,"score_gpt":0.3879183015105184,"score_spread":0.23748408708908697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110969133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45582575,0.00084116135,0.5057721,0.0016961999,0.0001437097,0.0009856152,0.00069639855,0.000274158,0.033764977],"genre_scores_gemma":[0.87076753,0.0004585885,0.12296429,0.0001432906,0.000037290643,0.00050959043,0.00018354312,0.000051157072,0.0048847604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825007,0.0010530209,0.000049369755,0.00017474442,0.0001386004,0.00033407047],"domain_scores_gemma":[0.9967224,0.002468082,0.0002876881,0.000051762257,0.00021054737,0.00025953844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032754787,0.0011895887,0.0011320281,0.0009366124,0.0006765282,0.0023738455,0.0010461456,0.0011292418,0.0032005052],"category_scores_gemma":[0.005477417,0.0007612994,0.0008968418,0.0010730987,0.00052097935,0.0011976018,0.00097079336,0.0011838671,0.00027335994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021587368,0.00025094475,0.0014473004,0.00009078828,0.00002956839,0.00007479172,0.00010571382,0.97497344,0.0006205481,0.0055066925,0.0005572547,0.016127074],"study_design_scores_gemma":[0.00002324244,0.00018961962,0.00046964595,0.000022025994,0.00002025151,0.00001938426,0.00018938178,0.9954541,0.00048176132,0.002400043,0.0007178209,0.000012753467],"about_ca_topic_score_codex":0.010234816,"about_ca_topic_score_gemma":0.009898928,"teacher_disagreement_score":0.010234816,"about_ca_system_score_codex":0.002953479,"about_ca_system_score_gemma":0.0035561991,"threshold_uncertainty_score":0.021429121},"labels":[],"label_agreement":null},{"id":"W3122020906","doi":"10.5430/rwe.v12n2p113","title":"Remuneration Reforms and Welfare of Employees in Public Schools: Experience From Nigeria","year":2021,"lang":"en","type":"article","venue":"Research in World Economy","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Remuneration; Welfare; Consumption (sociology); Earnings; Business; Government (linguistics); Economics; Labour economics; Accounting; Finance","score_opus":0.2979810839495878,"score_gpt":0.45997531148296567,"score_spread":0.1619942275333779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122020906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9993709,0.000111412075,0.00001024156,0.00010722132,0.0000029494256,0.0000037007815,0.0000067344163,3.8178763e-7,0.00038657253],"genre_scores_gemma":[0.9984092,0.0003833406,0.00003068875,0.00007984903,0.0000034641432,0.0000035380504,0.000009335025,8.0603405e-7,0.001079847],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99934405,0.00022813836,0.000034619767,0.000034116467,0.000060312563,0.0002987658],"domain_scores_gemma":[0.9990343,0.00023019467,0.00023849301,0.00003148809,0.0001261394,0.00033938646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010175471,0.00016362533,0.00019943988,0.0003047667,0.0023687729,0.0008821204,0.00030430473,0.00047734217,0.0017983698],"category_scores_gemma":[0.0012469711,0.00023703245,0.00015953848,0.00045091243,0.0008938743,0.0005032919,0.0010276189,0.00081451953,0.00020477753],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003347641,0.0011531648,0.53772724,0.0003148449,0.000017517148,0.0047187814,0.40398088,0.00018755495,0.0026007772,0.0009584757,0.0014147045,0.046591308],"study_design_scores_gemma":[0.000008790805,0.0007828799,0.29916343,0.00013492828,0.00001499918,0.0008168325,0.68774134,0.00009708783,0.00062384317,0.00009373291,0.0105027845,0.000019382338],"about_ca_topic_score_codex":0.015690845,"about_ca_topic_score_gemma":0.050386563,"teacher_disagreement_score":0.015690845,"about_ca_system_score_codex":0.0011675912,"about_ca_system_score_gemma":0.0016263198,"threshold_uncertainty_score":0.031198978},"labels":[],"label_agreement":null},{"id":"W3123499759","doi":"","title":"Accounting for Time-Varying Queueing Effects in Workplace Scheduling","year":2001,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Staffing; Queueing theory; Schedule; Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Queue; Set (abstract data type); Real-time computing; Computer network; Engineering; Mathematics; Economics","score_opus":0.031754982816814,"score_gpt":0.3409042990950528,"score_spread":0.30914931627823883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123499759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051366232,0.0001503647,0.94635457,0.00013269474,0.000035196103,0.00006497943,0.00004258676,0.00018026549,0.0016731364],"genre_scores_gemma":[0.64452016,0.00033017664,0.35216004,0.000054017288,0.00006711248,0.00016634338,0.000077165285,0.00008167397,0.0025433856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931943,0.0002810974,0.000019593552,0.000094330564,0.00019784749,0.00008769596],"domain_scores_gemma":[0.99774903,0.0015514378,0.00024517588,0.00016684165,0.00019017135,0.00009740228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019301221,0.0005706226,0.0006605752,0.00057221926,0.00057946227,0.0007337414,0.0017236787,0.00088216533,0.0016602491],"category_scores_gemma":[0.006188138,0.00053793815,0.00054983,0.0007087283,0.0005603448,0.001492944,0.00072792725,0.0011390678,0.00020700332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019490853,0.000040638937,0.00086578116,0.000015742233,0.000011058439,0.00003470666,0.00004013538,0.9718551,0.00073269446,0.009119917,0.00015587785,0.017108897],"study_design_scores_gemma":[0.000006738549,0.000012356794,0.0001408111,0.0000019206327,0.0000046929154,0.0000066587854,0.000004630529,0.99664056,0.00020433687,0.0027165927,0.00025641933,0.000004253575],"about_ca_topic_score_codex":0.018105242,"about_ca_topic_score_gemma":0.016714223,"teacher_disagreement_score":0.018105242,"about_ca_system_score_codex":0.0016635339,"about_ca_system_score_gemma":0.0025056466,"threshold_uncertainty_score":0.035999715},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Queue; Computer science; Operations research; Operations management; Nursing; Computer network; Medicine; Mathematics; Engineering","score_opus":0.15803834856335675,"score_gpt":0.4928225199909892,"score_spread":0.33478417142763245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125033276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18742402,0.0013627642,0.80336994,0.0016896703,0.00042956872,0.00020046711,0.00023192377,0.0002978301,0.004993801],"genre_scores_gemma":[0.90341526,0.0013059956,0.084652826,0.00019718836,0.00042092052,0.00019941936,0.00018517155,0.00015224564,0.009471088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826765,0.0007429089,0.00005783438,0.00027656258,0.0002583367,0.0003966328],"domain_scores_gemma":[0.993075,0.005000187,0.0005911804,0.00021433955,0.00051947124,0.00059971865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037537888,0.0011437475,0.0024055268,0.00089537335,0.0015163227,0.0025500548,0.002807913,0.0019027874,0.004155121],"category_scores_gemma":[0.012186698,0.0010928811,0.0011817709,0.0022763081,0.0015256673,0.0022000242,0.0019457252,0.0022311436,0.0003081929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021231364,0.00018251858,0.00091710134,0.000116067655,0.000045899233,0.00012903684,0.00018681375,0.9553533,0.001022096,0.021980185,0.0016229429,0.018231688],"study_design_scores_gemma":[0.000020814321,0.00004559461,0.00018426201,0.0000059433155,0.000014277601,0.000013809742,0.00005935083,0.9932706,0.00013539237,0.005975304,0.000263959,0.0000107206315],"about_ca_topic_score_codex":0.01800559,"about_ca_topic_score_gemma":0.012660109,"teacher_disagreement_score":0.01800559,"about_ca_system_score_codex":0.0024454019,"about_ca_system_score_gemma":0.0031152985,"threshold_uncertainty_score":0.03580153},"labels":[],"label_agreement":null},{"id":"W3126136843","doi":"","title":"Combining Integer Programming and the Randomization Method to Schedule Employees","year":2009,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Schedule; Mathematical optimization; Integer programming; Computer science; Integer (computer science); Staffing; Generator (circuit theory); Iterated function; Constraint (computer-aided design); Interval (graph theory); Fraction (chemistry); Service (business); Operations research; Algorithm; Mathematics; Power (physics)","score_opus":0.036272663298955975,"score_gpt":0.3790719066700181,"score_spread":0.34279924337106216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126136843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045629046,0.00009362476,0.99224913,0.000091724796,0.000026865673,0.00012787484,0.00004636353,0.00059534394,0.0022061893],"genre_scores_gemma":[0.059191868,0.00016473932,0.93852407,0.00009296319,0.000037338097,0.0003988793,0.00013261537,0.0001646746,0.0012928903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972473,0.0015497684,0.00009983319,0.00031350894,0.00060598017,0.00018358385],"domain_scores_gemma":[0.99681973,0.002325985,0.00035288572,0.00023016395,0.00021182839,0.000059281145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027040746,0.0014095092,0.0011000277,0.0015792669,0.0005206046,0.0007316278,0.0012023866,0.00074021675,0.0040593855],"category_scores_gemma":[0.006396298,0.0007524388,0.0010901521,0.0020099222,0.0007228643,0.0012337709,0.00082334614,0.0017013119,0.0010705042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001815875,0.0002606507,0.00058747054,0.00023140873,0.00006917498,0.000112265385,0.00008821009,0.78174126,0.0038356401,0.035867848,0.0024554946,0.17456903],"study_design_scores_gemma":[0.000073523726,0.00014698316,0.000101684665,0.000016301416,0.000024538766,0.000043610333,0.000009884668,0.979575,0.0015056474,0.01519912,0.0032847633,0.00001900581],"about_ca_topic_score_codex":0.0035411133,"about_ca_topic_score_gemma":0.0043597193,"teacher_disagreement_score":0.0040593855,"about_ca_system_score_codex":0.0009603067,"about_ca_system_score_gemma":0.002316555,"threshold_uncertainty_score":0.014300644},"labels":[],"label_agreement":null},{"id":"W3129384632","doi":"10.1287/inte.2022.1132","title":"Optimization Helps Scheduling Nursing Staff at the Long-Term Care Homes of the City of Toronto","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Scheduling (production processes); Status quo; Computer science; Absenteeism; Schedule; Long-term care; Operations management; Operations research; Nursing; Nurse scheduling problem; Business; Job shop scheduling; Medicine; Flow shop scheduling; Economics; Engineering; Management","score_opus":0.053871199729866065,"score_gpt":0.3475262837933807,"score_spread":0.2936550840635146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129384632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6890147,0.0011496035,0.2574488,0.0019419617,0.00015623703,0.00067089323,0.003342281,0.0024907875,0.04378479],"genre_scores_gemma":[0.85804087,0.00044612252,0.13351442,0.00008093252,0.00001799131,0.00015989666,0.001492296,0.00014668074,0.006100733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996314,0.00012361821,0.000020414336,0.00006419654,0.00008789384,0.00007246379],"domain_scores_gemma":[0.99897325,0.0005978208,0.000092218244,0.000030074181,0.0002099339,0.00009676618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006522537,0.00061789254,0.00024487634,0.00050918513,0.0007546591,0.0008987538,0.00041726368,0.00025655693,0.004700556],"category_scores_gemma":[0.0023258408,0.00023386988,0.00030248216,0.0007138348,0.00022384194,0.00031390213,0.00030560026,0.00033503887,0.00029673352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003025041,0.00016362821,0.012436823,0.00031374785,0.000055619686,0.00014884514,0.00045542922,0.82606405,0.0043999995,0.0042588646,0.014677607,0.13672279],"study_design_scores_gemma":[0.00004462731,0.000099130295,0.0070612016,0.000025382278,0.000032138578,0.000018156548,0.00035986083,0.9806506,0.00239098,0.002126965,0.007168778,0.000022132313],"about_ca_topic_score_codex":0.34436327,"about_ca_topic_score_gemma":0.44795105,"teacher_disagreement_score":0.6556367,"about_ca_system_score_codex":0.0044301255,"about_ca_system_score_gemma":0.007034791,"threshold_uncertainty_score":0.6847177},"labels":[],"label_agreement":null},{"id":"W3139358421","doi":"","title":"Manufacture of game schedules for the sports college and university of Quebec","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Operations research; Computer science; Mathematics","score_opus":0.10194938865710432,"score_gpt":0.3877041653355132,"score_spread":0.2857547766784089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139358421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7450704,0.0005143407,0.13616844,0.00058244827,0.000237495,0.0028285505,0.013539931,0.004183581,0.0968748],"genre_scores_gemma":[0.81290174,0.00028669392,0.13341363,0.00007147205,0.00002004163,0.000432293,0.012116375,0.00048894226,0.040268786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.000106126405,0.000024650632,0.00010484849,0.00016860837,0.000158013],"domain_scores_gemma":[0.9986386,0.00033624555,0.00007794623,0.00017760631,0.0006127345,0.00015683856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081251,0.00077795994,0.0004703323,0.0017674883,0.0025759412,0.0014475839,0.0009047286,0.0005851095,0.015931042],"category_scores_gemma":[0.002321807,0.00066167064,0.00090704486,0.0018369771,0.00038871533,0.0003311495,0.00032861967,0.0005635115,0.0018024268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011446244,0.0006322691,0.011414849,0.00036098235,0.00006895359,0.00039551352,0.0004997304,0.6219597,0.02901884,0.011106392,0.033048168,0.29035],"study_design_scores_gemma":[0.00027738026,0.0011107036,0.04005325,0.00007762628,0.00007479092,0.00012673224,0.0014300402,0.83514374,0.036631748,0.0033190693,0.08163866,0.000116344076],"about_ca_topic_score_codex":0.65907943,"about_ca_topic_score_gemma":0.72772145,"teacher_disagreement_score":0.34092057,"about_ca_system_score_codex":0.008776549,"about_ca_system_score_gemma":0.012448939,"threshold_uncertainty_score":0.6858566},"labels":[],"label_agreement":null},{"id":"W3141641535","doi":"10.14288/1.0374162","title":"Recreational Programming for Commuting Students","year":2018,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Recreation; Computer science; Political science","score_opus":0.07131378777990435,"score_gpt":0.3228211739756658,"score_spread":0.2515073861957614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141641535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159781,0.0014276875,0.0016373459,0.0061125266,0.00049153063,0.0003734922,0.0005590524,0.0001390745,0.073281206],"genre_scores_gemma":[0.9523857,0.0022781913,0.0032281915,0.0021957133,0.00019605634,0.0006065714,0.0005861946,0.000061294835,0.03846197],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993736,0.00019980616,0.00003048437,0.000057335903,0.00012987494,0.00020893627],"domain_scores_gemma":[0.99708885,0.00024113317,0.00024779822,0.00012011275,0.00031815196,0.0019838803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070346176,0.00023613851,0.00031167513,0.0004502634,0.0025432343,0.0027193867,0.0006772078,0.00049104483,0.036073696],"category_scores_gemma":[0.0026380662,0.00017221355,0.00039697878,0.00067246304,0.00048883166,0.0010927806,0.0031637405,0.0015046269,0.0049533932],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038093422,0.0048507084,0.2665014,0.0018683508,0.00006652014,0.0015254264,0.057974745,0.00025975748,0.0031491595,0.0054170545,0.088066675,0.5699394],"study_design_scores_gemma":[0.00009072899,0.0027335654,0.36535752,0.0012516154,0.000088247805,0.0016545707,0.2140769,0.0005673548,0.0015611254,0.004414531,0.40809757,0.00010624149],"about_ca_topic_score_codex":0.0028089562,"about_ca_topic_score_gemma":0.012133731,"teacher_disagreement_score":0.036073696,"about_ca_system_score_codex":0.00070917956,"about_ca_system_score_gemma":0.0022771833,"threshold_uncertainty_score":0.120678484},"labels":[],"label_agreement":null},{"id":"W3155939486","doi":"10.11591/eei.v10i3.2996","title":"Solving examination timetabling problem within a hyper-heuristic framework","year":2021,"lang":"en","type":"article","venue":"Bulletin of Electrical Engineering and Informatics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Mathematical optimization; Benchmark (surveying); Computer science; Scheduling (production processes); Hill climbing; Heuristic; Job shop scheduling; Artificial intelligence; Mathematics; Schedule","score_opus":0.02786895209441351,"score_gpt":0.27486665687300643,"score_spread":0.24699770477859292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155939486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26624942,0.0031242433,0.7060455,0.0013595871,0.00019516746,0.00077402726,0.0008814897,0.0007795242,0.020590965],"genre_scores_gemma":[0.65467113,0.0011306378,0.338805,0.00019352896,0.000053468986,0.00047275264,0.0007750577,0.000071581344,0.00382692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00027796335,0.000027332357,0.000090105954,0.00008833264,0.000104248684],"domain_scores_gemma":[0.99900097,0.0006489775,0.0001115375,0.000055779146,0.000121210396,0.000061435465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125133,0.00071739266,0.00078453997,0.0010861524,0.00048633144,0.0012952702,0.0011089457,0.0010393471,0.0021974214],"category_scores_gemma":[0.0022770155,0.00038984406,0.000831991,0.001316907,0.00040672603,0.0007009866,0.00050654565,0.0009061197,0.00024945123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006729872,0.0001381814,0.0010686486,0.00012708313,0.000048479695,0.00006083221,0.000045225635,0.95711654,0.0007745615,0.0049183676,0.0012490737,0.03438574],"study_design_scores_gemma":[0.000021070462,0.00007890169,0.0003586988,0.00002147852,0.00001906506,0.000023449398,0.000070138754,0.9947418,0.00045105445,0.003090059,0.0011175497,0.0000067175574],"about_ca_topic_score_codex":0.009559616,"about_ca_topic_score_gemma":0.0101602785,"teacher_disagreement_score":0.009559616,"about_ca_system_score_codex":0.0012233328,"about_ca_system_score_gemma":0.0031060171,"threshold_uncertainty_score":0.01900798},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0751777675560772,"score_gpt":0.3478535317128968,"score_spread":0.2726757641568196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203815469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8756147,0.00011315712,0.12219662,0.00055545615,0.00003239814,0.00009847898,0.00010717597,0.00009761537,0.0011843811],"genre_scores_gemma":[0.9879252,0.000052706117,0.011503712,0.000034317003,0.000013197719,0.00003151662,0.00004998016,0.000006725415,0.00038264313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989981,0.00046451227,0.000043112075,0.0001759418,0.00010677284,0.00021153405],"domain_scores_gemma":[0.99600154,0.0022766977,0.0008898123,0.00015492538,0.00029843376,0.00037867346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248626,0.0004707481,0.00051350525,0.00045693203,0.0005195151,0.00071645156,0.0009188298,0.00078025076,0.00095167925],"category_scores_gemma":[0.0072214394,0.00044794052,0.00044239534,0.00059237704,0.00041284555,0.0006145671,0.00059188745,0.00064741494,0.000114987306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033857007,0.00037137372,0.025025196,0.00005855562,0.00008648225,0.0002599494,0.00024280258,0.9365448,0.0034835618,0.003732538,0.00086396234,0.028992208],"study_design_scores_gemma":[0.00006916102,0.00017495778,0.0069989585,0.000004992051,0.000018416267,0.000046532077,0.00025973367,0.9889237,0.0008837148,0.0023518458,0.0002547488,0.00001323974],"about_ca_topic_score_codex":0.008458503,"about_ca_topic_score_gemma":0.0077405204,"teacher_disagreement_score":0.008458503,"about_ca_system_score_codex":0.001503865,"about_ca_system_score_gemma":0.0018642215,"threshold_uncertainty_score":0.016818523},"labels":[],"label_agreement":null},{"id":"W3207040133","doi":"","title":"TALENT MANAGEMENT STRATEGIES FOR ATTRACTING AND RETAINING THE EMPLOYEES OF BPO IN HYDERABAD","year":2019,"lang":"en","type":"article","venue":"Journal of the Gujarat Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Employee retention; Boom; Business; Retention Management; Marketing; Feeling; Simple random sample; Duration (music); Talent management; Quarter (Canadian coin); Employee engagement; Public relations; Operations management; Engineering; Psychology; Sociology; Political science","score_opus":0.3285991233324285,"score_gpt":0.5121517829337024,"score_spread":0.18355265960127393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207040133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96185756,0.0015728913,0.0018113954,0.0054487037,0.00007396721,0.00028851413,0.000058131223,0.000058674148,0.028830148],"genre_scores_gemma":[0.98504907,0.0010485101,0.003220929,0.00032131502,0.000018445788,0.000065709144,0.00003434925,0.0000047926546,0.010236853],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994918,0.00015007066,0.000021996073,0.00003297341,0.00009929779,0.00020378313],"domain_scores_gemma":[0.99913824,0.00015691596,0.00015895699,0.000017915334,0.00011347595,0.0004143554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071583287,0.0001774471,0.000101128295,0.000960799,0.0030856938,0.0019273428,0.00095144816,0.0004631807,0.004399764],"category_scores_gemma":[0.001160718,0.00010216493,0.0001244689,0.00074378337,0.00052283297,0.0004968636,0.0011040712,0.0004832121,0.00045743518],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026764823,0.002663457,0.14644673,0.0009927378,0.00004702731,0.003219441,0.04202498,0.002186848,0.0077599254,0.008690568,0.022052983,0.76364774],"study_design_scores_gemma":[0.000108674445,0.0036817424,0.5751728,0.0010476501,0.00012964745,0.002379687,0.27482414,0.0053899926,0.0059767384,0.004476699,0.12667018,0.00014209253],"about_ca_topic_score_codex":0.006190106,"about_ca_topic_score_gemma":0.016176997,"teacher_disagreement_score":0.006190106,"about_ca_system_score_codex":0.0017415116,"about_ca_system_score_gemma":0.0030281113,"threshold_uncertainty_score":0.014718711},"labels":[],"label_agreement":null},{"id":"W3209351802","doi":"10.1109/ccece53047.2021.9569111","title":"Combining Tabu Search and Genetic Algorithm to Determine Optimal Nurse Schedules","year":2021,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Tabu search; Schedule; Nurse scheduling problem; Computer science; Genetic algorithm; Scheduling (production processes); Scale (ratio); Mathematical optimization; Job shop scheduling; Algorithm; Nursing; Mathematics; Medicine; Machine learning; Flow shop scheduling","score_opus":0.11635803486692378,"score_gpt":0.3949973676327228,"score_spread":0.278639332765799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209351802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08045118,0.00086378295,0.90687567,0.00034308882,0.00010632917,0.00038394894,0.00015318411,0.0019132817,0.008909509],"genre_scores_gemma":[0.27565733,0.00036765978,0.72104025,0.00021911529,0.0000543895,0.00053250376,0.00029688395,0.00021846553,0.0016135199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.0005930854,0.000054209162,0.0001590903,0.000269014,0.00013527338],"domain_scores_gemma":[0.9968149,0.0024323736,0.00016942392,0.00009998089,0.0004253366,0.000058046953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022841676,0.0012599983,0.0016333713,0.0034813161,0.00085612043,0.0013733564,0.0015341844,0.0016066747,0.0022702375],"category_scores_gemma":[0.0067445613,0.00083668804,0.00088111917,0.0035153548,0.00084189227,0.0010423453,0.0008319122,0.00086725346,0.00042795893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005542432,0.00009770112,0.00084228016,0.00006964109,0.00007791404,0.000039154555,0.00006040946,0.9000462,0.00064793054,0.004020605,0.0009770523,0.093065694],"study_design_scores_gemma":[0.000017313274,0.000026060965,0.0000774733,0.000009152579,0.00001458526,0.000009088241,0.000013872087,0.9973399,0.00021199897,0.0019325152,0.00034272196,0.0000053720073],"about_ca_topic_score_codex":0.019367995,"about_ca_topic_score_gemma":0.013552501,"teacher_disagreement_score":0.019367995,"about_ca_system_score_codex":0.0019506513,"about_ca_system_score_gemma":0.0032170254,"threshold_uncertainty_score":0.0385105},"labels":[],"label_agreement":null},{"id":"W3212082921","doi":"10.1155/2021/9974059","title":"Blockchain-IoT-Driven Nursing Workforce Planning for Effective Long-Term Care Management in Nursing Homes","year":2021,"lang":"en","type":"article","venue":"Journal of Healthcare Engineering","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Hong Kong Polytechnic University; University Grants Committee","keywords":"Nursing; Workforce; Blockchain; Long-term care; Term (time); Nursing homes; Medicine; Business; Computer science; Computer security","score_opus":0.049242390353874545,"score_gpt":0.4181900347243553,"score_spread":0.3689476443704807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212082921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11545724,0.0012168942,0.8642441,0.0013480207,0.00017601244,0.0002936985,0.0002963152,0.0006052027,0.016362483],"genre_scores_gemma":[0.97501695,0.00040318965,0.021927923,0.000079094774,0.000024599232,0.00011681916,0.00011851245,0.0000196399,0.0022932822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994436,0.00018027575,0.000032921766,0.00010322563,0.00011455167,0.00012546904],"domain_scores_gemma":[0.99898845,0.00050000125,0.0001536743,0.000057564583,0.00017876257,0.0001215899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209652,0.000492954,0.00069066684,0.00040689355,0.0006524505,0.0012750882,0.000866,0.00077535666,0.003436709],"category_scores_gemma":[0.0020157672,0.00030812886,0.00039445583,0.00056079443,0.0005057602,0.001507079,0.0014222013,0.0007347244,0.00038671723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001323356,0.00007744181,0.0018218728,0.00012439712,0.000025719195,0.00018192502,0.00013230201,0.94566804,0.0022545087,0.00954478,0.0010767384,0.038959913],"study_design_scores_gemma":[0.000017618851,0.000044646637,0.00028899958,0.000017224043,0.000009061445,0.00002533674,0.000046151727,0.9911528,0.00052267645,0.0068711406,0.0009951254,0.000009190432],"about_ca_topic_score_codex":0.006796257,"about_ca_topic_score_gemma":0.008415421,"teacher_disagreement_score":0.006796257,"about_ca_system_score_codex":0.0010448945,"about_ca_system_score_gemma":0.0024364197,"threshold_uncertainty_score":0.013513446},"labels":[],"label_agreement":null},{"id":"W3469504","doi":"","title":"Constructing families of highly similar but non-isomorphic tournaments.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.055067777851644864,"score_gpt":0.338224176091208,"score_spread":0.2831563982395631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3469504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4497156,0.0008830514,0.50182194,0.00079773634,0.00018084193,0.00025100907,0.00063575007,0.00067395554,0.045040082],"genre_scores_gemma":[0.85358256,0.00035419068,0.13570073,0.00020775599,0.00007852853,0.00021793932,0.0012801178,0.00013881487,0.0084393965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850345,0.0005963823,0.00007594792,0.0003314448,0.00025386183,0.00023887331],"domain_scores_gemma":[0.99398464,0.0037404269,0.0005410945,0.001085888,0.0002658747,0.00038211868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014620883,0.00045503385,0.0006937912,0.0012610664,0.001501471,0.001984044,0.0017841749,0.0011757234,0.007764664],"category_scores_gemma":[0.010860526,0.00069662486,0.0013884605,0.0017811271,0.0010912103,0.00232021,0.0020102686,0.001336364,0.0006941913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005147564,0.0004255597,0.0069248965,0.00035453506,0.00032362994,0.0010601301,0.0011017277,0.09031014,0.009538251,0.72584933,0.013137816,0.15045919],"study_design_scores_gemma":[0.00016855221,0.0002481916,0.002576,0.00007890924,0.00015112151,0.0013055928,0.0005782366,0.19840625,0.004504411,0.77409726,0.017830098,0.00005540269],"about_ca_topic_score_codex":0.0009628972,"about_ca_topic_score_gemma":0.0010726429,"teacher_disagreement_score":0.007764664,"about_ca_system_score_codex":0.0009887184,"about_ca_system_score_gemma":0.0005722795,"threshold_uncertainty_score":0.025975406},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06728663749762294,"score_gpt":0.34472560535810315,"score_spread":0.2774389678604802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3628730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09740081,0.00039934265,0.89504844,0.0003355044,0.0000807747,0.0001062594,0.000047892674,0.00026573913,0.006315223],"genre_scores_gemma":[0.6638582,0.00020437622,0.33052278,0.00011554362,0.000041814335,0.00022518807,0.0000791284,0.000060106275,0.004892971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.0001563472,0.000014009133,0.00003783101,0.00007242205,0.000044122135],"domain_scores_gemma":[0.9991147,0.00063229323,0.00005362716,0.000036222125,0.00010672665,0.000056412675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010216316,0.0006192957,0.0008270398,0.0007059789,0.00035604046,0.0006972257,0.0011782893,0.001365201,0.0020134507],"category_scores_gemma":[0.0020458233,0.0003652415,0.00051618693,0.00073583156,0.00042221358,0.0004316762,0.0009183673,0.00066581275,0.00016238594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029526767,0.000039471935,0.00019665326,0.000024566976,0.000023782512,0.000037812413,0.000018172985,0.97816783,0.00037896022,0.0018710418,0.00020691562,0.019005215],"study_design_scores_gemma":[0.000008734769,0.000025204774,0.000036462134,0.0000022334123,0.0000032989878,0.0000071770396,0.0000035535124,0.99920124,0.00007518113,0.0004875649,0.00014775601,0.0000016052902],"about_ca_topic_score_codex":0.004437827,"about_ca_topic_score_gemma":0.0032236134,"teacher_disagreement_score":0.004437827,"about_ca_system_score_codex":0.00050396327,"about_ca_system_score_gemma":0.0007541404,"threshold_uncertainty_score":0.008823991},"labels":[],"label_agreement":null},{"id":"W4206667539","doi":"10.1007/978-3-030-92270-2_13","title":"An Implicit Learning Approach for Solving the Nurse Scheduling Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Regina","funders":"","keywords":"Computer science; Nurse scheduling problem; Scheduling (production processes); Job shop scheduling; Artificial intelligence; Operations research; Mathematical optimization; Flow shop scheduling; Schedule; Mathematics; Operating system","score_opus":0.06718189093934655,"score_gpt":0.3475020556820189,"score_spread":0.28032016474267235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206667539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067584235,0.00018279851,0.98943734,0.00017401767,0.00003903465,0.000019974668,0.000022016773,0.00009883837,0.0032675772],"genre_scores_gemma":[0.36031473,0.0006333992,0.6198045,0.00022303862,0.00021952452,0.00027637763,0.00019440216,0.00011236433,0.018221682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955314,0.00016888921,0.000020460331,0.00006711398,0.00013337334,0.00005700432],"domain_scores_gemma":[0.9987602,0.000899994,0.00006985894,0.000068525376,0.00016076253,0.000040674087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009812724,0.00057446986,0.0007716641,0.00032516292,0.00038341768,0.0007210431,0.00228299,0.0010350144,0.004573712],"category_scores_gemma":[0.0040788837,0.00044517152,0.00047175435,0.00073564437,0.0007181505,0.0015227782,0.0014631755,0.002202388,0.0005010568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011780213,0.00014194196,0.00029911558,0.00013138744,0.000029621653,0.000038776026,0.00008830935,0.77880144,0.0010573813,0.06869801,0.0023377603,0.14825845],"study_design_scores_gemma":[0.0000089147225,0.000013686832,0.00003074657,0.000004982645,0.0000037922382,0.0000042297443,0.0000042670554,0.984447,0.00013545867,0.014860622,0.00048389973,0.0000024223314],"about_ca_topic_score_codex":0.0058913007,"about_ca_topic_score_gemma":0.007288339,"teacher_disagreement_score":0.0058913007,"about_ca_system_score_codex":0.00077076274,"about_ca_system_score_gemma":0.0015053435,"threshold_uncertainty_score":0.015300572},"labels":[],"label_agreement":null},{"id":"W4206759382","doi":"10.1007/978-3-030-91025-9_4","title":"Multiprocessor Operations","year":2021,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing","score_opus":0.2181874486644137,"score_gpt":0.507178714838068,"score_spread":0.2889912661736543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206759382","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034476328,0.00897923,0.06094735,0.0013957927,0.002144963,0.00012878902,0.0016304431,0.002234764,0.919091],"genre_scores_gemma":[0.026338043,0.004990429,0.023872456,0.00031192176,0.00062920875,0.0000948436,0.0022694774,0.00038435828,0.9411093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997265,0.000026082502,0.000014961289,0.000048766928,0.0001621698,0.000021495636],"domain_scores_gemma":[0.9997532,0.000037979364,0.000016224149,0.000073340605,0.0000885417,0.0000306835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029961462,0.0009703463,0.0005179294,0.0010352983,0.0006799168,0.0022110667,0.0004955811,0.00047827174,0.12867779],"category_scores_gemma":[0.0007182083,0.0003210179,0.0002928801,0.0019555562,0.00029988927,0.0015564732,0.00089394127,0.0011101136,0.057369243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054037042,0.000056221794,0.00015835122,0.00012283436,0.000011458286,0.00004309367,0.000059310118,0.0021536648,0.0030056848,0.05293018,0.3428084,0.59859675],"study_design_scores_gemma":[0.000008233942,0.000040497278,0.00070247595,0.00006022027,0.000006422797,0.00015674178,0.000037309408,0.005560613,0.0017573502,0.02102507,0.97063667,0.0000084987505],"about_ca_topic_score_codex":0.0010621753,"about_ca_topic_score_gemma":0.0017030742,"teacher_disagreement_score":0.12867779,"about_ca_system_score_codex":0.0005734499,"about_ca_system_score_gemma":0.0007207972,"threshold_uncertainty_score":0.43047005},"labels":[],"label_agreement":null},{"id":"W4220689859","doi":"10.1287/ited.2021.0266ca","title":"Case Article—Pediatrician Scheduling at British Columbia Women’s Hospital","year":2022,"lang":"en","type":"article","venue":"INFORMS Transactions on Education","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Active listening; Computer science; Integer programming; Scheduling (production processes); Profit (economics); Nurse scheduling problem; Class (philosophy); Iterative and incremental development; Operations research; Mathematics education; Mathematical optimization; Job shop scheduling; Artificial intelligence; Psychology; Schedule; Mathematics; Software engineering","score_opus":0.026877843640826703,"score_gpt":0.29984827040225687,"score_spread":0.2729704267614302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220689859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7647146,0.0049805404,0.010633881,0.06565803,0.002846162,0.0005778633,0.0017372101,0.00045041178,0.1484013],"genre_scores_gemma":[0.96588624,0.0023557749,0.006557088,0.007118514,0.00087611965,0.00012575896,0.00038885098,0.000115639355,0.016575929],"study_design_codex":"case_report","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899167,0.00013289566,0.000055922916,0.00014552633,0.00023487644,0.0004390577],"domain_scores_gemma":[0.9987214,0.00025348878,0.00014230284,0.000032960725,0.00008248905,0.00076727656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003147079,0.0007199466,0.0004354593,0.00096432195,0.003558055,0.0010419303,0.0011538228,0.0029443395,0.006846663],"category_scores_gemma":[0.002631809,0.00033502484,0.0004429456,0.001710979,0.0007583491,0.00069228036,0.0009340753,0.0031989554,0.00060747494],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009736984,0.00031137303,0.020026077,0.00014578368,0.000022123244,0.92309517,0.0021164615,0.0024942362,0.000567172,0.005264575,0.026987521,0.018872254],"study_design_scores_gemma":[0.00007144174,0.0003032363,0.025669359,0.00039810312,0.000029421615,0.8735431,0.008619771,0.004426894,0.0015649393,0.0035382067,0.081767246,0.00006829095],"about_ca_topic_score_codex":0.09786395,"about_ca_topic_score_gemma":0.21819709,"teacher_disagreement_score":0.902136,"about_ca_system_score_codex":0.007149007,"about_ca_system_score_gemma":0.0061715855,"threshold_uncertainty_score":0.1945886},"labels":[],"label_agreement":null},{"id":"W4225375583","doi":"10.1016/j.omega.2022.102671","title":"Staff scheduling for residential care under pandemic conditions: The case of COVID-19","year":2022,"lang":"en","type":"article","venue":"Omega","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Wilfrid Laurier University","funders":"","keywords":"Pandemic; Computer science; Scheduling (production processes); Time horizon; Population; Job shop scheduling; Operations research; Heuristic; Overtime; Coronavirus disease 2019 (COVID-19); Operations management; Mathematical optimization; Engineering; Medicine; Economics; Mathematics; Artificial intelligence; Infectious disease (medical specialty)","score_opus":0.17890784921408664,"score_gpt":0.4483702499631888,"score_spread":0.26946240074910216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225375583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83597153,0.0012928684,0.11500217,0.011296107,0.00075887487,0.0005720454,0.001060469,0.0006864578,0.03335954],"genre_scores_gemma":[0.9690683,0.00024037356,0.026967147,0.0001728485,0.00007933342,0.00007588052,0.00022301186,0.00006424579,0.003108831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866855,0.00062125723,0.000038648177,0.0001388149,0.00013284471,0.0003998729],"domain_scores_gemma":[0.99695253,0.0017750568,0.00017777208,0.00015142413,0.00029954055,0.0006437229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026091596,0.00046675882,0.00048878504,0.0004656472,0.0016403885,0.0015461007,0.0011578038,0.0015052597,0.006668176],"category_scores_gemma":[0.0056357887,0.00034920548,0.00052505184,0.0006196455,0.00057665375,0.0009058758,0.0010686483,0.0015790745,0.00034577347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001565515,0.0010728139,0.01415384,0.0003695156,0.00013671191,0.0027002774,0.0014083877,0.78424823,0.0035174435,0.043707777,0.034011178,0.113108285],"study_design_scores_gemma":[0.00014762883,0.00040733963,0.006061155,0.000057478916,0.000039616505,0.0004993371,0.0030608478,0.95769393,0.0010556914,0.018624298,0.012299577,0.000053170716],"about_ca_topic_score_codex":0.03174301,"about_ca_topic_score_gemma":0.03329417,"teacher_disagreement_score":0.03174301,"about_ca_system_score_codex":0.0026202842,"about_ca_system_score_gemma":0.0051028435,"threshold_uncertainty_score":0.06311649},"labels":[],"label_agreement":null},{"id":"W4229500937","doi":"10.1007/1-4020-0611-x_95","title":"Call centers","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics","score_opus":0.18441095548801598,"score_gpt":0.3771519386650391,"score_spread":0.19274098317702312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229500937","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001498802,0.00054389937,0.0122714415,0.00090672553,0.0005174613,0.00009111863,0.0006869814,0.0014530122,0.9820306],"genre_scores_gemma":[0.014249043,0.0006555981,0.005500567,0.00038194447,0.00020138445,0.00006524069,0.00086996175,0.00023046669,0.9778456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996501,0.000034979017,0.00000943719,0.000082502076,0.00015500639,0.00006798089],"domain_scores_gemma":[0.9997149,0.000028942868,0.0000121905105,0.000054817683,0.00009517245,0.00009395545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028709348,0.0006623334,0.00045645857,0.0008564897,0.0017350536,0.0029941353,0.001258941,0.0011977217,0.25320634],"category_scores_gemma":[0.0007243317,0.0003680789,0.0003615027,0.0011276342,0.00031572333,0.0017852929,0.0011885739,0.0013605839,0.13694674],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059040685,0.000121307676,0.0002447502,0.00008387325,0.000006715611,0.00008533929,0.00015785843,0.0013874922,0.0016947419,0.0963555,0.5778302,0.32197326],"study_design_scores_gemma":[0.000009442288,0.000020080539,0.0005052514,0.000026558359,0.0000051439397,0.00010681187,0.00007476609,0.0015536754,0.00083405455,0.010165027,0.98668957,0.000009434268],"about_ca_topic_score_codex":0.0057392,"about_ca_topic_score_gemma":0.01061383,"teacher_disagreement_score":0.25320634,"about_ca_system_score_codex":0.0015434964,"about_ca_system_score_gemma":0.0015900302,"threshold_uncertainty_score":0.8470596},"labels":[],"label_agreement":null},{"id":"W4240363831","doi":"10.1504/ijmheur.2016.10001113","title":"Simulated annealing for the uncapacitated exam scheduling problem","year":2016,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Scheduling (production processes); Benchmark (surveying); Mathematical optimization; Heuristic; Job shop scheduling; Graph; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Schedule","score_opus":0.1799146154358367,"score_gpt":0.428892417151283,"score_spread":0.2489778017154463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240363831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09968962,0.0015897682,0.8805912,0.0008980543,0.00014156537,0.00023094016,0.00036578692,0.0008150212,0.015678035],"genre_scores_gemma":[0.5939101,0.0007936964,0.39857715,0.00021153594,0.00006206483,0.0004500921,0.0005860021,0.00021254965,0.005196781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00045720098,0.000023303031,0.00009808716,0.00011595758,0.00007347566],"domain_scores_gemma":[0.9982851,0.0013341208,0.000119762655,0.00009839108,0.000100471276,0.00006217235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009525279,0.00092677324,0.00088954705,0.0007207762,0.0005236796,0.0008681758,0.00096985826,0.0010314318,0.002718065],"category_scores_gemma":[0.0037573443,0.0005909497,0.00090205204,0.00090359396,0.0007102546,0.0007422744,0.0005377277,0.0014426049,0.00038303135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042575317,0.00002306336,0.00013621763,0.000029268173,0.00001684361,0.000014531805,0.000025750098,0.98661673,0.00043193268,0.0042171786,0.0004996702,0.007946243],"study_design_scores_gemma":[0.000011503121,0.000017102879,0.00006026486,0.0000045642805,0.0000051460984,0.000004716366,0.0000064332185,0.9952992,0.0001949422,0.0037510055,0.0006422357,0.0000028513302],"about_ca_topic_score_codex":0.008501755,"about_ca_topic_score_gemma":0.008661541,"teacher_disagreement_score":0.008501755,"about_ca_system_score_codex":0.0017324202,"about_ca_system_score_gemma":0.0016316825,"threshold_uncertainty_score":0.016904593},"labels":[],"label_agreement":null},{"id":"W4240579298","doi":"10.5539/mas.v12n11p366","title":"Hybrid Simulated Annealing with Meta-Heuristic Methods to Solve UCT Problem","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Simulated annealing; Computer science; Meta heuristic; Mathematical optimization; Heuristic; Local search (optimization); Algorithm; Hill climbing; Space (punctuation); Artificial intelligence; Mathematics","score_opus":0.19359324425946714,"score_gpt":0.4494770177911564,"score_spread":0.25588377353168923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240579298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021996202,0.0016611429,0.96826607,0.00025590183,0.00014591141,0.00018860024,0.00009934165,0.00080608495,0.0065806895],"genre_scores_gemma":[0.37975195,0.0008336489,0.61453164,0.00022912365,0.00010700258,0.00074950774,0.0003553098,0.00020237162,0.0032394377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.00040629643,0.000054300253,0.00013078582,0.00018659634,0.00008902875],"domain_scores_gemma":[0.9987596,0.0008182687,0.00010262816,0.000103652405,0.00017371195,0.000042145995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013805967,0.0012888587,0.0014130023,0.0016098452,0.000661623,0.001098447,0.0017049244,0.0016549597,0.002637454],"category_scores_gemma":[0.0026130478,0.0007437135,0.0019652871,0.0017909732,0.00051680673,0.0007282801,0.00082975643,0.0013346582,0.00048596508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035752444,0.000043191736,0.00036030824,0.00008247326,0.000080132595,0.00003595596,0.00003549205,0.9609203,0.0006795776,0.0032336628,0.00081245945,0.033680722],"study_design_scores_gemma":[0.000009368586,0.000021142678,0.000049529484,0.0000088725365,0.0000117849795,0.000011504627,0.000007236707,0.9977857,0.0002865026,0.0010718717,0.0007329152,0.0000035470437],"about_ca_topic_score_codex":0.009636583,"about_ca_topic_score_gemma":0.008446769,"teacher_disagreement_score":0.009636583,"about_ca_system_score_codex":0.0009541788,"about_ca_system_score_gemma":0.0018415616,"threshold_uncertainty_score":0.019160986},"labels":[],"label_agreement":null},{"id":"W4243327666","doi":"10.1002/9781119300977.ch12","title":"Residential Care","year":2018,"lang":"en","type":"other","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Health care; Analytics; Scheduling (production processes); Computer science; Operations research; Process management; Nursing; Business; Operations management; Data science; Engineering; Medicine","score_opus":0.1134824310651851,"score_gpt":0.4251633527378346,"score_spread":0.3116809216726495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243327666","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045183343,0.0024455588,0.003245509,0.0030189033,0.0008384064,0.00010745743,0.0032983087,0.00049474154,0.9820327],"genre_scores_gemma":[0.03358915,0.005024868,0.0043241335,0.0021049979,0.0003456487,0.00014202998,0.003977992,0.00015507262,0.9503361],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996618,0.000056225388,0.00001591918,0.00006357691,0.00012757804,0.00007477871],"domain_scores_gemma":[0.9997085,0.000036000412,0.000023200895,0.000032240263,0.000091260634,0.00010877385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002514113,0.00039394927,0.0002680097,0.00057103805,0.0016815563,0.001735042,0.0007981962,0.0008910817,0.34692845],"category_scores_gemma":[0.0011352985,0.0001254157,0.00033018828,0.0011282724,0.00023948743,0.001145527,0.001810081,0.00061669026,0.12813754],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035961664,0.00009159186,0.0020922662,0.00019987918,0.00000734686,0.00027872337,0.0007740621,0.00034235645,0.00029886846,0.049367845,0.63782114,0.3086901],"study_design_scores_gemma":[0.00000287528,0.000013291521,0.001674056,0.00008795977,0.0000020634122,0.00021438136,0.00057966297,0.00014232949,0.00008951586,0.0026720043,0.994517,0.0000048272987],"about_ca_topic_score_codex":0.005266799,"about_ca_topic_score_gemma":0.013981239,"teacher_disagreement_score":0.34692845,"about_ca_system_score_codex":0.0011809837,"about_ca_system_score_gemma":0.0016826078,"threshold_uncertainty_score":0.9315273},"labels":[],"label_agreement":null},{"id":"W4243346114","doi":"10.24908/pceea.v0i0.6438","title":"INNOVATIVE COURSE SCHEDULING AND CURRICULUM DESIGNT","year":2017,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Curriculum; Workload; Scheduling (production processes); Computer science; Schedule; Class (philosophy); Mathematics education; Engineering; Operations management; Psychology; Artificial intelligence; Pedagogy; Operating system","score_opus":0.0350378053420689,"score_gpt":0.3230756574921373,"score_spread":0.2880378521500684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243346114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020664446,0.00026817308,0.967904,0.00044662037,0.00008556111,0.00029485088,0.00009290945,0.00017728876,0.010066153],"genre_scores_gemma":[0.21176066,0.00058435684,0.7795871,0.00014955077,0.00007206336,0.0004168059,0.00027510952,0.000061476916,0.0070928982],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985606,0.00063714135,0.00006108701,0.00026054383,0.0003476468,0.0001330762],"domain_scores_gemma":[0.99826825,0.0008145533,0.0002632096,0.00017498275,0.00034745884,0.00013143779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021466224,0.0006287124,0.00046264613,0.0009179588,0.00036429337,0.0012544248,0.0012758656,0.0006838011,0.0055880276],"category_scores_gemma":[0.004785676,0.00028097472,0.0006355146,0.0009477698,0.00046989473,0.00090444763,0.0009382479,0.0007348005,0.00056925346],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011173887,0.00051889196,0.0031098574,0.000599626,0.00007398085,0.000112871894,0.00030275792,0.33154017,0.011867388,0.17499411,0.005009692,0.47175893],"study_design_scores_gemma":[0.00010778092,0.00056639075,0.0020246115,0.00009949509,0.00006865518,0.00015143494,0.00023352724,0.8305505,0.00744841,0.12129798,0.03741321,0.000038013615],"about_ca_topic_score_codex":0.0019265532,"about_ca_topic_score_gemma":0.0030268694,"teacher_disagreement_score":0.0055880276,"about_ca_system_score_codex":0.0016387461,"about_ca_system_score_gemma":0.002821943,"threshold_uncertainty_score":0.018693805},"labels":[],"label_agreement":null},{"id":"W4245052122","doi":"10.17722/ijme.v6i3.827","title":"Determinants of Job Rotation among Administrative staff of Tamale Polytechnic, Ghana","year":2016,"lang":"en","type":"article","venue":"International Journal of Management Excellence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple random sample; Stratified sampling; Psychology; Data collection; Population; Medical education; Job rotation; Job performance; Statistics; Medicine; Mathematics; Job attitude; Social psychology; Job satisfaction; Environmental health","score_opus":0.08249843057171607,"score_gpt":0.3951364153039923,"score_spread":0.3126379847322762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245052122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9995683,0.000061054256,0.000022303377,0.000060636405,0.0000015018248,0.0000058839773,0.000032784592,0.0000011571564,0.0002463901],"genre_scores_gemma":[0.9994916,0.00012660518,0.00007027862,0.00002092045,0.0000035655078,0.000006962787,0.00004270813,8.0819945e-7,0.00023663837],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999676,0.00008880063,0.000028971841,0.000024947769,0.00006957092,0.00011169048],"domain_scores_gemma":[0.9981433,0.00036049442,0.0009177895,0.000055000663,0.00015151322,0.00037197905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004872787,0.00013541538,0.00013147673,0.0005271417,0.0005098962,0.0004098469,0.00021084546,0.00014327708,0.0021232571],"category_scores_gemma":[0.0017276272,0.00014869578,0.00008115664,0.0006543214,0.00032890425,0.00023111542,0.00027898635,0.00024387818,0.00025185297],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024986928,0.00006246306,0.99155277,0.000027092212,0.0000037887876,0.0003242518,0.002772928,0.00003156039,0.00049976906,0.00006984319,0.0002471501,0.0043833046],"study_design_scores_gemma":[0.0000015714256,0.00007304164,0.9918065,0.00001900217,0.000001726741,0.00018107572,0.007004399,0.000055501532,0.000059322327,0.000018000348,0.0007766972,0.0000031171758],"about_ca_topic_score_codex":0.011283467,"about_ca_topic_score_gemma":0.020399995,"teacher_disagreement_score":0.011283467,"about_ca_system_score_codex":0.0005494766,"about_ca_system_score_gemma":0.0009273271,"threshold_uncertainty_score":0.022435546},"labels":[],"label_agreement":null},{"id":"W4246558774","doi":"10.32920/ryerson.14655156.v1","title":"An application of a genetic algorithm to retail staff scheduling","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Genetic algorithm; Mathematical optimization; Integer programming; Computer science; Branch and bound; Population; Job shop scheduling; Linear programming; Upper and lower bounds; Operations research; Algorithm; Mathematics; Medicine; Computer network","score_opus":0.10204285257152727,"score_gpt":0.3959969991864616,"score_spread":0.2939541466149343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246558774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093933895,0.00045943802,0.89596933,0.00038184618,0.00010442405,0.00013109732,0.000047275804,0.0006231055,0.008349555],"genre_scores_gemma":[0.46425894,0.00042058763,0.5321046,0.0001344611,0.000034785353,0.00012786442,0.000080004516,0.00005936542,0.0027793697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.0001983924,0.000013642808,0.00006015908,0.00011877423,0.00003891641],"domain_scores_gemma":[0.99935836,0.00043485136,0.00003388698,0.000033812892,0.00012206884,0.00001704367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076309807,0.0004782293,0.0005367156,0.00076483807,0.00041435106,0.0005476124,0.0007274713,0.0010542916,0.001224393],"category_scores_gemma":[0.002652382,0.00024692828,0.0004117246,0.0010233846,0.00051913783,0.00037803428,0.000377147,0.00054484647,0.00017969597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004698773,0.000066804874,0.0008203426,0.000035587702,0.00003251348,0.00009652406,0.0000542012,0.9211842,0.0025242728,0.005978562,0.0006932703,0.068466805],"study_design_scores_gemma":[0.000015283971,0.000039784987,0.00014374164,0.000005088162,0.000008529321,0.00002451552,0.000011643555,0.99674964,0.0006089307,0.0016912767,0.00069795176,0.0000035633984],"about_ca_topic_score_codex":0.008071702,"about_ca_topic_score_gemma":0.005397815,"teacher_disagreement_score":0.008071702,"about_ca_system_score_codex":0.00066803413,"about_ca_system_score_gemma":0.0011032562,"threshold_uncertainty_score":0.016049445},"labels":[],"label_agreement":null},{"id":"W4247225074","doi":"10.1109/wsc.2013.6721656","title":"2 Canadian Forces Flying Training School (2 CFFTS) resource allocation simulation tool","year":2013,"lang":"en","type":"article","venue":"2013 Winter Simulations Conference (WSC)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Training (meteorology); Resource allocation; Resource (disambiguation); Duration (music); Computer science; Simulation; Resource management (computing); Operations research; Aeronautics; Engineering; Meteorology; Distributed computing","score_opus":0.16394981345041723,"score_gpt":0.36782544962230684,"score_spread":0.2038756361718896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247225074","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13966665,0.00035420083,0.36300707,0.0014310952,0.00056971255,0.0022474057,0.041844018,0.038307805,0.41257215],"genre_scores_gemma":[0.58667606,0.00051799975,0.30605996,0.0003790855,0.00004075382,0.0015962425,0.02325018,0.0025150024,0.07896458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975556,0.00004016613,0.000010280179,0.00003335346,0.0001017931,0.000058856775],"domain_scores_gemma":[0.9995216,0.00012229073,0.000018136981,0.000039129205,0.0002353085,0.000063514424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089367,0.00062963105,0.000318261,0.0006057699,0.0006724272,0.00083197805,0.0010334876,0.0006307356,0.04053597],"category_scores_gemma":[0.001303749,0.00037732898,0.0005117311,0.0007250766,0.00024089286,0.00048440284,0.0004977185,0.00076561107,0.0034634466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029109887,0.00023927655,0.0073973224,0.00022038333,0.000045707944,0.00015644054,0.00027010788,0.77394676,0.0038651102,0.016465498,0.11787021,0.07923209],"study_design_scores_gemma":[0.00015177134,0.00006788599,0.0026439305,0.00004078261,0.000020765276,0.000035675723,0.0000711382,0.8672854,0.0019557683,0.0016332424,0.12605073,0.000042868676],"about_ca_topic_score_codex":0.39309198,"about_ca_topic_score_gemma":0.42670724,"teacher_disagreement_score":0.606908,"about_ca_system_score_codex":0.0031867037,"about_ca_system_score_gemma":0.007021048,"threshold_uncertainty_score":0.78160787},"labels":[],"label_agreement":null},{"id":"W4249106665","doi":"10.17848/pol2015-012","title":"Work Hours in Retail: Room for Improvement","year":2012,"lang":"en","type":"report","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Sage Foundation; W.E. Upjohn Institute for Employment Research; Russell Sage Foundation; Rockefeller Foundation","keywords":"Retail trade; Work (physics); Business; Retail sales; Quality (philosophy); Order (exchange); Retail industry; Marketing; Labour economics; Economics; Commerce; Finance; Engineering","score_opus":0.3922504426376148,"score_gpt":0.44900543072646104,"score_spread":0.056754988088846214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249106665","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09132276,0.13643855,0.01171755,0.6533803,0.008516119,0.0006111516,0.00841478,0.0010659498,0.08853296],"genre_scores_gemma":[0.7037395,0.16500148,0.05916464,0.032384433,0.0071793054,0.0007259874,0.007867604,0.00031846858,0.02361856],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99654335,0.0012594092,0.00025796745,0.00031064986,0.0007926445,0.00083610555],"domain_scores_gemma":[0.9768734,0.007471933,0.0011736712,0.0015719836,0.0071021914,0.005806768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009476492,0.0007990116,0.0011386366,0.0014029358,0.0017344069,0.0054829866,0.0022765582,0.0020406875,0.030838316],"category_scores_gemma":[0.018275062,0.00034602577,0.0011158712,0.0037175615,0.001080518,0.0060085603,0.0024837174,0.0026887974,0.0030355758],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061339576,0.0010444397,0.038818054,0.0023384895,0.00010353788,0.000063439125,0.00095015106,0.0018965481,0.0004064866,0.01626859,0.17019573,0.76730114],"study_design_scores_gemma":[0.00042919404,0.0021276302,0.37232664,0.013335512,0.00040298712,0.0002409877,0.034174666,0.0071979337,0.001897331,0.04884206,0.51875347,0.00027161898],"about_ca_topic_score_codex":0.029051274,"about_ca_topic_score_gemma":0.054566808,"teacher_disagreement_score":0.030838316,"about_ca_system_score_codex":0.0036282472,"about_ca_system_score_gemma":0.022140589,"threshold_uncertainty_score":0.103164434},"labels":[],"label_agreement":null},{"id":"W4255765049","doi":"10.32920/ryerson.14655156","title":"An application of a genetic algorithm to retail staff scheduling","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Integer programming; Genetic algorithm; Mathematical optimization; Computer science; Branch and bound; Population; Linear programming; Upper and lower bounds; Job shop scheduling; Operations research; Algorithm; Mathematics; Medicine; Computer network","score_opus":0.10204285257152727,"score_gpt":0.3959969991864616,"score_spread":0.2939541466149343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255765049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093933895,0.00045943802,0.89596933,0.00038184618,0.00010442405,0.00013109732,0.000047275804,0.0006231055,0.008349555],"genre_scores_gemma":[0.46425894,0.00042058763,0.5321046,0.0001344611,0.000034785353,0.00012786442,0.000080004516,0.00005936542,0.0027793697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.0001983924,0.000013642808,0.00006015908,0.00011877423,0.00003891641],"domain_scores_gemma":[0.99935836,0.00043485136,0.00003388698,0.000033812892,0.00012206884,0.00001704367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076309807,0.0004782293,0.0005367156,0.00076483807,0.00041435106,0.0005476124,0.0007274713,0.0010542916,0.001224393],"category_scores_gemma":[0.002652382,0.00024692828,0.0004117246,0.0010233846,0.00051913783,0.00037803428,0.000377147,0.00054484647,0.00017969597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004698773,0.000066804874,0.0008203426,0.000035587702,0.00003251348,0.00009652406,0.0000542012,0.9211842,0.0025242728,0.005978562,0.0006932703,0.068466805],"study_design_scores_gemma":[0.000015283971,0.000039784987,0.00014374164,0.000005088162,0.000008529321,0.00002451552,0.000011643555,0.99674964,0.0006089307,0.0016912767,0.00069795176,0.0000035633984],"about_ca_topic_score_codex":0.008071702,"about_ca_topic_score_gemma":0.005397815,"teacher_disagreement_score":0.008071702,"about_ca_system_score_codex":0.00066803413,"about_ca_system_score_gemma":0.0011032562,"threshold_uncertainty_score":0.016049445},"labels":[],"label_agreement":null},{"id":"W4281633131","doi":"10.1613/jair.1.12670","title":"Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Maximum satisfiability problem; Computer science; Answer set programming; Constraint programming; Scheduling (production processes); Mathematical optimization; Satisfiability; Job shop scheduling; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Schedule; Stochastic programming; Programming language","score_opus":0.6624061415240893,"score_gpt":0.47780059357857924,"score_spread":0.18460554794551004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281633131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074383994,0.0008817066,0.9800348,0.000933059,0.0000714477,0.00029634446,0.00057488156,0.00029755596,0.009471743],"genre_scores_gemma":[0.067248076,0.001673707,0.9269895,0.00023339048,0.000094874595,0.00040011446,0.00081033964,0.00013306778,0.002416919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981281,0.00090768107,0.00010620549,0.0003018878,0.00040610504,0.00014999101],"domain_scores_gemma":[0.9967056,0.0025848318,0.00018030283,0.00019139289,0.00025587835,0.000082045255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020680546,0.0013596591,0.0006500705,0.0010956571,0.0007843994,0.0021432003,0.002174181,0.001137092,0.007584602],"category_scores_gemma":[0.0061674546,0.00062960706,0.001314997,0.00354915,0.00086845836,0.0021601769,0.0012049983,0.0026330235,0.0007724598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015666593,0.00022629775,0.0004184381,0.0010056033,0.000117301344,0.00019341143,0.00022852374,0.6432159,0.002457579,0.17913984,0.007798849,0.16504163],"study_design_scores_gemma":[0.000096952834,0.000102761056,0.00023178793,0.00013407016,0.000052979303,0.00017340887,0.00016886943,0.85612184,0.0028868685,0.11567772,0.02432509,0.000027721666],"about_ca_topic_score_codex":0.0069997944,"about_ca_topic_score_gemma":0.007905425,"teacher_disagreement_score":0.007584602,"about_ca_system_score_codex":0.0016000774,"about_ca_system_score_gemma":0.0033076701,"threshold_uncertainty_score":0.025373042},"labels":[],"label_agreement":null},{"id":"W4284678263","doi":"10.5430/jct.v11n5p64","title":"Occupational Stress and Academic Staff Job Performance in Two Nigerian Universities","year":2022,"lang":"en","type":"article","venue":"Journal of Curriculum and Teaching","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Remuneration; Job performance; Workload; Psychology; Government (linguistics); Null hypothesis; Medical education; Sample (material); Simple random sample; Population; Simple linear regression; Regression analysis; Job satisfaction; Business; Medicine; Management; Social psychology; Statistics; Mathematics","score_opus":0.049305554865392044,"score_gpt":0.37685089531672594,"score_spread":0.3275453404513339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284678263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99978465,0.000039547005,0.000007904832,0.000023351926,0.0000026029236,0.0000025482882,0.000006696337,2.4550775e-7,0.00013247138],"genre_scores_gemma":[0.9997514,0.00008044863,0.000015639036,0.00001189905,0.0000037873406,0.0000039953297,0.000010078359,2.2696969e-7,0.00012250843],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992699,0.00022598404,0.00008461885,0.000050837658,0.00012659765,0.00024206935],"domain_scores_gemma":[0.9976336,0.00056629465,0.0006919103,0.000053782573,0.00027738902,0.00077710475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013650989,0.00027193726,0.00035546743,0.0010188688,0.0022467019,0.0013154398,0.0003112594,0.0005345968,0.0013098826],"category_scores_gemma":[0.0028416936,0.0003516439,0.0002434066,0.00083843025,0.0007462711,0.00042737593,0.0010812151,0.0006040403,0.00020458805],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023585564,0.000515037,0.97733784,0.00005000996,0.00001641136,0.00038905774,0.015062162,0.000081169615,0.00067312195,0.00010587411,0.000114279996,0.0054191523],"study_design_scores_gemma":[0.000008979519,0.00046507208,0.9628206,0.00005010098,0.000014352734,0.00020015812,0.035624087,0.00018713008,0.00018832582,0.000057656252,0.00036765906,0.000015984016],"about_ca_topic_score_codex":0.011484978,"about_ca_topic_score_gemma":0.02163272,"teacher_disagreement_score":0.011484978,"about_ca_system_score_codex":0.001373658,"about_ca_system_score_gemma":0.0013536189,"threshold_uncertainty_score":0.022836268},"labels":[],"label_agreement":null},{"id":"W4285132227","doi":"10.2139/ssrn.4104581","title":"Staff Scheduling During a Pandemic: The Case of Radiation Therapy Department","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Grand River Hospital; University of Waterloo","funders":"","keywords":"Emergency department; Pandemic; Medical emergency; Medicine; Coronavirus disease 2019 (COVID-19); Infectious disease (medical specialty); Nursing; Internal medicine","score_opus":0.05476673047134911,"score_gpt":0.3511099761227269,"score_spread":0.29634324565137776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285132227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8233617,0.0020592383,0.0509866,0.0746334,0.0027630387,0.0005571332,0.00087459217,0.000451596,0.044312723],"genre_scores_gemma":[0.97442836,0.0006075494,0.0206363,0.0012107638,0.00049678463,0.000042573673,0.00013678487,0.000060588332,0.0023803734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99756324,0.0011457865,0.0000993456,0.00021006606,0.00031884227,0.00066280505],"domain_scores_gemma":[0.99184424,0.0042962683,0.0007886512,0.00029050506,0.00069502107,0.0020853784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004717136,0.00055119157,0.0004500137,0.0005821951,0.0035139355,0.0022966757,0.0015919966,0.004506478,0.004737981],"category_scores_gemma":[0.009273518,0.00058715645,0.00066538993,0.00089751167,0.0012967051,0.0014221302,0.001309839,0.0031612734,0.00040005293],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026792802,0.0025412193,0.054966807,0.0010703317,0.00036569292,0.05942625,0.009366142,0.5663054,0.012528601,0.075465634,0.085425586,0.12985906],"study_design_scores_gemma":[0.00062069076,0.0019312962,0.033866227,0.00046502578,0.00019981903,0.016028892,0.054721326,0.7188795,0.0047221063,0.06930556,0.0988797,0.00037984896],"about_ca_topic_score_codex":0.021446256,"about_ca_topic_score_gemma":0.02121715,"teacher_disagreement_score":0.021446256,"about_ca_system_score_codex":0.0028310285,"about_ca_system_score_gemma":0.004214297,"threshold_uncertainty_score":0.04264283},"labels":[],"label_agreement":null},{"id":"W4285182772","doi":"10.1007/978-3-031-08011-1_21","title":"A MinCumulative Resource Constraint","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Resource (disambiguation); Computer science; Mathematics; Computer network; Geometry","score_opus":0.09723528290310375,"score_gpt":0.353271974118806,"score_spread":0.2560366912157023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285182772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014696037,0.0028076954,0.6850558,0.0033990683,0.0010458345,0.0001485057,0.0009144138,0.00035756966,0.29157504],"genre_scores_gemma":[0.31462574,0.0037414746,0.4375573,0.0017454376,0.00097249914,0.000588295,0.0010438946,0.000605124,0.2391202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991398,0.00025404032,0.000044820004,0.00018978537,0.00025984878,0.00011173186],"domain_scores_gemma":[0.9984664,0.00092512136,0.00009036896,0.00021067413,0.0002233013,0.000084222855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000878789,0.00092918176,0.000695142,0.00069448416,0.0012756378,0.0021986575,0.0018225828,0.00126343,0.02242099],"category_scores_gemma":[0.003806056,0.0006174704,0.0005791738,0.0020877675,0.0011937818,0.0035381736,0.0016319489,0.0026148863,0.0029052193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007693791,0.000038565435,0.000081576865,0.0002234956,0.000012109649,0.00015627375,0.00008568846,0.01916779,0.0028429509,0.8984179,0.018116891,0.060779855],"study_design_scores_gemma":[0.000032834094,0.00007565881,0.00022954216,0.00018159334,0.00002458785,0.00051861093,0.000093488365,0.09470254,0.0057840915,0.6883285,0.2099947,0.00003380623],"about_ca_topic_score_codex":0.0021163095,"about_ca_topic_score_gemma":0.0028077662,"teacher_disagreement_score":0.02242099,"about_ca_system_score_codex":0.0013734906,"about_ca_system_score_gemma":0.0014372577,"threshold_uncertainty_score":0.07500571},"labels":[],"label_agreement":null},{"id":"W4294225733","doi":"10.7717/peerj-cs.1068","title":"An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling","year":2022,"lang":"en","type":"article","venue":"PeerJ Computer Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Initialization; Computer science; Domain (mathematical analysis); Heuristic; Preference; Firefly algorithm; Mathematical optimization; Particle swarm optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.18325232280437495,"score_gpt":0.36716842860479015,"score_spread":0.1839161058004152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294225733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004858456,0.0006306348,0.9888781,0.00026894052,0.00017238804,0.000114531686,0.00008021423,0.000543253,0.004453642],"genre_scores_gemma":[0.11930324,0.00088650413,0.87170845,0.0002747008,0.00014414647,0.00038205396,0.00029946535,0.00016287083,0.0068386034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995271,0.00010665794,0.00003304276,0.00010980797,0.00017343227,0.000049972314],"domain_scores_gemma":[0.99971575,0.00009943964,0.00003903828,0.000036363846,0.00008490417,0.000024532423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503499,0.0008178463,0.00080917275,0.0005901727,0.00037567632,0.0006882167,0.001431811,0.0009741501,0.004083836],"category_scores_gemma":[0.001296536,0.00033927802,0.0009930019,0.00069908693,0.00034120702,0.0007355073,0.00068048784,0.0015234133,0.00090251066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014828054,0.00017275101,0.0015212306,0.00036771817,0.00010270965,0.00015080534,0.00017002993,0.52966803,0.015340042,0.033999078,0.01033364,0.40802568],"study_design_scores_gemma":[0.00003137561,0.00007699671,0.00030533926,0.000023256413,0.000014674184,0.000077161436,0.000016311778,0.9815654,0.0018756544,0.004360886,0.0116311135,0.000021936254],"about_ca_topic_score_codex":0.0050224653,"about_ca_topic_score_gemma":0.0043118517,"teacher_disagreement_score":0.0050224653,"about_ca_system_score_codex":0.00064411026,"about_ca_system_score_gemma":0.001252854,"threshold_uncertainty_score":0.013661802},"labels":[],"label_agreement":null},{"id":"W4306178539","doi":"10.3233/jid-220019","title":"Impact of course timetabling on learning quality: sustaining an optimized stress level to stimulate enhanced comprehension","year":2022,"lang":"en","type":"article","venue":"Journal of Integrated Design and Process Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Workload; Computer science; Set (abstract data type); Course (navigation); Scheduling (production processes); Prioritization; Analytic hierarchy process; Integer programming; Comprehension; Process (computing); Operations research; Mathematics education; Mathematical optimization; Process management; Psychology; Engineering; Mathematics","score_opus":0.24287138797954202,"score_gpt":0.4941625424503994,"score_spread":0.25129115447085737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306178539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45702744,0.00048898876,0.53812015,0.00020981632,0.000058433776,0.00029769196,0.000095326905,0.0003745356,0.0033275262],"genre_scores_gemma":[0.862313,0.00017836771,0.13628897,0.000043080927,0.000026762164,0.00019576601,0.0000911605,0.000055397675,0.0008075321],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99943143,0.00016481466,0.000029910396,0.00013396001,0.00017951903,0.00006032859],"domain_scores_gemma":[0.9986059,0.0005735366,0.0003636325,0.00012107838,0.0002139723,0.000121895646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012134433,0.00057277636,0.00042106622,0.00056555215,0.00027043946,0.00077311887,0.0007143054,0.00033292183,0.0013097498],"category_scores_gemma":[0.0032415972,0.00017594258,0.0003060344,0.0003501546,0.00019734942,0.0007367132,0.0004473453,0.0004497105,0.00017713792],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095692714,0.0014727957,0.008692211,0.00048878207,0.00007623241,0.00006567597,0.00037928682,0.31798708,0.16472259,0.0056155412,0.00095920864,0.49858364],"study_design_scores_gemma":[0.00019872264,0.0040306863,0.017846737,0.000058067788,0.000121248835,0.00009734917,0.00024484456,0.8962551,0.0726429,0.004619713,0.0038165573,0.00006800126],"about_ca_topic_score_codex":0.001655569,"about_ca_topic_score_gemma":0.0022778453,"teacher_disagreement_score":0.001655569,"about_ca_system_score_codex":0.0007059059,"about_ca_system_score_gemma":0.001482553,"threshold_uncertainty_score":0.0064173937},"labels":[],"label_agreement":null},{"id":"W4307640846","doi":"10.1111/itor.13226","title":"A stochastic optimization approach for staff scheduling decisions at inpatient units","year":2022,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa; Children's Hospital of Eastern Ontario","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Staffing; Computer science; Scheduling (production processes); Time horizon; Inpatient care; Mathematical optimization; Integer programming; Stochastic programming; Markov decision process; Operations research; Linear programming; Health care; Markov process; Medicine; Mathematics; Statistics; Algorithm","score_opus":0.38137943929197693,"score_gpt":0.48093619319885866,"score_spread":0.09955675390688173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307640846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02428879,0.00020218847,0.9718946,0.00036762047,0.000051597926,0.00012533496,0.00015526311,0.00017550097,0.0027390192],"genre_scores_gemma":[0.7356123,0.0004475015,0.25840208,0.00019221102,0.0001520091,0.0005405064,0.000419988,0.00009460105,0.004138916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988035,0.0005973095,0.000041835126,0.00015209596,0.00026552478,0.00013982556],"domain_scores_gemma":[0.99807596,0.0013476182,0.00020558789,0.000037586407,0.00023545044,0.000097800235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024704917,0.00086783915,0.0013408579,0.0011197936,0.00059622223,0.0009430247,0.0013971679,0.001010944,0.0029714508],"category_scores_gemma":[0.0038065207,0.00085464155,0.0010622335,0.0012441777,0.0006239881,0.00066027656,0.00074215274,0.0012525384,0.0002210618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000928286,0.000009422634,0.00007383722,0.000009357084,0.000008580355,0.000008314811,0.000005403672,0.9953773,0.00006783714,0.002202983,0.00013456847,0.0020931382],"study_design_scores_gemma":[0.0000029548435,0.0000045095703,0.00002494742,0.0000014256104,0.0000014774733,0.0000011049723,0.0000019427373,0.99894816,0.00002097646,0.00093035627,0.00006106167,0.0000010811034],"about_ca_topic_score_codex":0.025975853,"about_ca_topic_score_gemma":0.019151784,"teacher_disagreement_score":0.025975853,"about_ca_system_score_codex":0.0027351857,"about_ca_system_score_gemma":0.0035384225,"threshold_uncertainty_score":0.051649332},"labels":[],"label_agreement":null},{"id":"W4307999489","doi":"10.3390/app122111146","title":"A Review of the Scheduling Problem within Canadian Healthcare Centres","year":2022,"lang":"en","type":"review","venue":"Applied Sciences","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Nurse scheduling problem; Computer science; Fair-share scheduling; Two-level scheduling; Dynamic priority scheduling; Scheduling (production processes); Heuristics; Health care; Rate-monotonic scheduling; Operations research; Distributed computing; Operations management; Engineering; Political science; Operating system; Schedule","score_opus":0.2918358294277099,"score_gpt":0.4410873164600278,"score_spread":0.1492514870323179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307999489","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010798865,0.99725,0.0002905681,0.0003736972,0.0001601876,0.000010864836,0.000058627917,0.0000068177346,0.0017412526],"genre_scores_gemma":[0.0009949782,0.9979081,0.00041945413,0.0001455963,0.000088906134,0.000007978959,0.00007785691,0.0000033648637,0.00035385435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989555,0.00013484141,0.00013166544,0.00012488382,0.0005500656,0.00010301388],"domain_scores_gemma":[0.99704474,0.001217258,0.0002801913,0.00005441867,0.0012239036,0.00017961339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017467919,0.0014954845,0.0015166973,0.0077686035,0.0012098079,0.0018749306,0.0017254485,0.0012900009,0.0061437003],"category_scores_gemma":[0.0047003413,0.0005986628,0.0012255885,0.017188055,0.0009952186,0.0013701298,0.00084714836,0.0014276815,0.0011120585],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055370998,0.000059223286,0.00030729087,0.049511716,0.00012038742,0.00011349695,0.00017443948,0.002974281,0.00034053484,0.007332752,0.062254846,0.87675565],"study_design_scores_gemma":[0.0000131908455,0.00006220249,0.002835058,0.018856762,0.00021151092,0.00029345814,0.00017841709,0.00039450848,0.00023958688,0.0016714475,0.9751924,0.000051374762],"about_ca_topic_score_codex":0.37981716,"about_ca_topic_score_gemma":0.42470825,"teacher_disagreement_score":0.9885529,"about_ca_system_score_codex":0.011447085,"about_ca_system_score_gemma":0.029370343,"threshold_uncertainty_score":0.7552128},"labels":[],"label_agreement":null},{"id":"W4310145552","doi":"10.23919/fruct56874.2022.9953830","title":"Where to Put A Rower: A Novel and Practical Solution to Dragon Boat Partition Problem","year":2022,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Partition (number theory); Heuristic; Set (abstract data type); Computer science; Integer (computer science); Greedy algorithm; Mathematical optimization; Partition problem; Algorithm; Artificial intelligence; Mathematics; Combinatorics; Programming language","score_opus":0.155652993027058,"score_gpt":0.41534638132846885,"score_spread":0.25969338830141087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310145552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024501005,0.00028453025,0.963875,0.00065489934,0.00014439975,0.00038462997,0.00025457158,0.00064674567,0.009254112],"genre_scores_gemma":[0.13555412,0.00025476588,0.85541886,0.00019291778,0.00006220746,0.00025940078,0.00042306032,0.00016088306,0.0076736407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932456,0.00016656748,0.000022918772,0.00017846307,0.00013343646,0.00017410568],"domain_scores_gemma":[0.9995148,0.00014015513,0.00006731781,0.0000758339,0.000078591715,0.00012318404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065023464,0.001340743,0.00094941293,0.00082867354,0.0014164803,0.0013330493,0.0022342391,0.001510655,0.008682444],"category_scores_gemma":[0.0014259592,0.00061167893,0.0006775051,0.0012411937,0.0009262992,0.0018156465,0.001971389,0.0014496993,0.0013189041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000427632,0.00050998136,0.0014200135,0.00062532787,0.000087131455,0.0005137512,0.00052363746,0.5206223,0.021394754,0.07728188,0.030925905,0.3456677],"study_design_scores_gemma":[0.00011662875,0.00033756756,0.00055877975,0.000049052527,0.000043473963,0.00032985347,0.00046731404,0.9350174,0.0047804127,0.02836413,0.02987489,0.000060359005],"about_ca_topic_score_codex":0.0070791366,"about_ca_topic_score_gemma":0.012132976,"teacher_disagreement_score":0.008682444,"about_ca_system_score_codex":0.00087865425,"about_ca_system_score_gemma":0.0023903002,"threshold_uncertainty_score":0.029045641},"labels":[],"label_agreement":null},{"id":"W4313020197","doi":"10.1016/j.ifacol.2022.09.414","title":"Patient Scheduling: The Case of an Iranian Cardiology Clinic","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Medicine; Schedule; Time constraint; Scheduling (production processes); Constraint programming; Constraint (computer-aided design); Emergency medicine; Medical emergency; Family medicine; Computer science; Operations management; Engineering; Statistics; Mathematics","score_opus":0.11571111298486869,"score_gpt":0.3943454244822475,"score_spread":0.27863431149737883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313020197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607764,0.00039548034,0.023293916,0.0031671498,0.00018013282,0.0002230304,0.00061311986,0.00013683332,0.011213849],"genre_scores_gemma":[0.9824677,0.00019629112,0.015177183,0.00012071287,0.00006175532,0.000057881454,0.00020340936,0.000019411948,0.0016956084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99904996,0.00036070007,0.000033811906,0.00013149882,0.00013913543,0.00028494172],"domain_scores_gemma":[0.9973092,0.0017613055,0.00023391044,0.00006621334,0.00016315571,0.00046634447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000748,0.0006742021,0.00042867442,0.0005241208,0.0021774594,0.0010340362,0.0012291751,0.0020941175,0.004156737],"category_scores_gemma":[0.0028430056,0.00036945226,0.00061601796,0.001030034,0.00063982164,0.0005287096,0.0006265267,0.0010814406,0.00022370456],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010604023,0.0013129167,0.02139911,0.00026324907,0.00008484111,0.02503399,0.0011045077,0.8977757,0.0032819617,0.011797616,0.009252265,0.027633432],"study_design_scores_gemma":[0.00023010981,0.0003924276,0.00976838,0.000030429253,0.000039419218,0.0020723862,0.0033448916,0.97284794,0.0012758971,0.0040391623,0.005897686,0.000061255945],"about_ca_topic_score_codex":0.031428948,"about_ca_topic_score_gemma":0.03202233,"teacher_disagreement_score":0.031428948,"about_ca_system_score_codex":0.0023389494,"about_ca_system_score_gemma":0.0023541052,"threshold_uncertainty_score":0.062492013},"labels":[],"label_agreement":null},{"id":"W4318604517","doi":"10.1109/ssci51031.2022.10022250","title":"A Constraint Satisfaction Problem (CSP) Approach for the Nurse Scheduling Problem","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Heuristics; Constraint satisfaction problem; Constraint satisfaction; Computer science; Nurse scheduling problem; Constraint programming; Job shop scheduling; Scheduling (production processes); Constraint satisfaction dual problem; Constraint (computer-aided design); Integer programming; Branch and bound; Linear programming; Combinatorial optimization; Constraint logic programming; Mathematics; Artificial intelligence; Routing (electronic design automation); Flow shop scheduling","score_opus":0.08505266767852177,"score_gpt":0.35304562675987317,"score_spread":0.2679929590813514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318604517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012720311,0.0003367321,0.9935509,0.0005170836,0.00007476669,0.0001563844,0.00020798891,0.000092582435,0.0037914515],"genre_scores_gemma":[0.05765984,0.001508529,0.93588,0.0003938706,0.00020134138,0.00073165353,0.00069392886,0.00009232984,0.0028385362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996696,0.0015799341,0.00016450392,0.000497589,0.00089881767,0.00016305927],"domain_scores_gemma":[0.99723756,0.0019030795,0.00020826254,0.00015882614,0.00040390578,0.000088288674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019571483,0.0019577658,0.0010496761,0.0012074865,0.00092022994,0.0015397304,0.0020813646,0.0016391745,0.0053269602],"category_scores_gemma":[0.00511501,0.00059758424,0.001923904,0.0037945765,0.0010530294,0.0016607787,0.0013905128,0.0038622443,0.0009798991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006981046,0.0002205156,0.000501458,0.0008054834,0.00013376887,0.00034340177,0.00018644464,0.7044852,0.002591327,0.16928892,0.013217819,0.10815584],"study_design_scores_gemma":[0.00004075316,0.00009210591,0.00015549494,0.000083936124,0.000035788093,0.00022906747,0.00008353819,0.9182563,0.001254485,0.059811898,0.01993206,0.000024518455],"about_ca_topic_score_codex":0.007211177,"about_ca_topic_score_gemma":0.008185652,"teacher_disagreement_score":0.007211177,"about_ca_system_score_codex":0.0014661386,"about_ca_system_score_gemma":0.0044294335,"threshold_uncertainty_score":0.017820418},"labels":[],"label_agreement":null},{"id":"W4318715110","doi":"10.2139/ssrn.4329426","title":"Enhanced Iterated Local Search for the Technician Routing and Scheduling Problem","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Iterated local search; Technician; Scheduling (production processes); Computer science; Job shop scheduling; Local search (optimization); Mathematical optimization; Routing (electronic design automation); Operations research; Engineering; Artificial intelligence; Computer network; Mathematics","score_opus":0.06572872360642042,"score_gpt":0.37386230198893167,"score_spread":0.30813357838251126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318715110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09400458,0.00040792493,0.8928296,0.00033092347,0.000056334808,0.000098575314,0.0000878178,0.00038775528,0.011796532],"genre_scores_gemma":[0.76575583,0.00023073703,0.22632374,0.0001379436,0.00006934024,0.00032346105,0.00017275506,0.00014311221,0.006843039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994405,0.0002854609,0.000017571085,0.000053221596,0.0001314277,0.00007182536],"domain_scores_gemma":[0.99785185,0.0016272216,0.0001585676,0.00007700013,0.00020260613,0.000082772945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015290778,0.0005886722,0.0013094367,0.0007663475,0.00036810894,0.00073339255,0.001468756,0.0015207264,0.003736334],"category_scores_gemma":[0.0045487494,0.00040871272,0.00069746986,0.0006993025,0.0006263392,0.00087632687,0.0011318361,0.0009477901,0.00032819575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062826635,0.000065547414,0.00020745778,0.000045171746,0.000025537278,0.000038540544,0.000030935546,0.9782899,0.000559541,0.0065065622,0.0005943978,0.013573552],"study_design_scores_gemma":[0.000018668716,0.000026633483,0.000037686426,0.0000028568936,0.000004854228,0.0000059772456,0.000004024492,0.9979347,0.00007724283,0.0017779294,0.00010731605,0.0000021034098],"about_ca_topic_score_codex":0.005094078,"about_ca_topic_score_gemma":0.0043237456,"teacher_disagreement_score":0.005094078,"about_ca_system_score_codex":0.00095374166,"about_ca_system_score_gemma":0.0013266078,"threshold_uncertainty_score":0.012499332},"labels":[],"label_agreement":null},{"id":"W4319215029","doi":"10.1287/ijoc.2023.0019","title":"A Dedicated Pricing Algorithm to Solve a Large Family of Nurse Scheduling Problems with Branch-and-Price","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Mathematics","score_opus":0.04881488983816907,"score_gpt":0.3535815859209205,"score_spread":0.3047666960827514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319215029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012670834,0.00048509424,0.9770741,0.00037939122,0.0001545968,0.00017471597,0.000090355854,0.00095270626,0.008018258],"genre_scores_gemma":[0.14301942,0.00043977785,0.8496738,0.00027631797,0.00014249292,0.0004543235,0.00039967545,0.00036227892,0.0052318657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930704,0.00020581948,0.000035438963,0.00014070769,0.00016484555,0.00014621786],"domain_scores_gemma":[0.998884,0.00074106146,0.00007027556,0.000118836426,0.00010438753,0.000081351376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061587,0.0011136598,0.0009733485,0.00079613377,0.0007743277,0.0010449264,0.0016847918,0.0013144942,0.009541933],"category_scores_gemma":[0.0034070413,0.00057056174,0.0011291262,0.001353218,0.0005712964,0.0015919876,0.0012066994,0.0022191552,0.0017131225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018535764,0.00038215762,0.000995762,0.00025683572,0.00008124285,0.00014476778,0.00010875517,0.6141652,0.0029705344,0.04172077,0.013051743,0.32593694],"study_design_scores_gemma":[0.00007141016,0.000070898306,0.00012698541,0.000011139003,0.000015135917,0.000059964674,0.0000177477,0.97641796,0.00048364545,0.019488102,0.00322959,0.0000073888227],"about_ca_topic_score_codex":0.0035472617,"about_ca_topic_score_gemma":0.004699465,"teacher_disagreement_score":0.009541933,"about_ca_system_score_codex":0.00092278316,"about_ca_system_score_gemma":0.0020585104,"threshold_uncertainty_score":0.03192091},"labels":[],"label_agreement":null},{"id":"W4319337692","doi":"10.21203/rs.3.rs-2511227/v1","title":"Exam Room Timetabling Using MIP and SMAC","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Schedule; Computer science; Solver; Session (web analytics); Scheduling (production processes); Greedy algorithm; Mathematical optimization; Operations research; Algorithm; Programming language; Engineering; Mathematics","score_opus":0.7041909162899727,"score_gpt":0.5871448906765433,"score_spread":0.11704602561342936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319337692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0878984,0.0005968797,0.8689964,0.00094988046,0.00013954983,0.00063796923,0.0017710277,0.0018268096,0.037183102],"genre_scores_gemma":[0.34575087,0.00041037434,0.64415175,0.00015879447,0.00010153914,0.00059590454,0.002012474,0.00037867177,0.0064395447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913365,0.00040974646,0.000029769488,0.00011872814,0.00017197174,0.00013609651],"domain_scores_gemma":[0.9979545,0.0014580067,0.00016203093,0.00013663333,0.0001911988,0.00009766419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016302981,0.0010193008,0.00081942236,0.0013589581,0.000521771,0.0018052385,0.001525938,0.0009547481,0.009797606],"category_scores_gemma":[0.004515253,0.0006709171,0.0013198259,0.001888573,0.0005250138,0.0009952774,0.0008210099,0.0014929809,0.0009508836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006616281,0.00011649579,0.00035790203,0.00011317983,0.000022632985,0.000035366673,0.000027797343,0.9451842,0.0006467719,0.01195342,0.002638805,0.038837202],"study_design_scores_gemma":[0.000015348924,0.000042641586,0.00012978542,0.000011433239,0.0000054528214,0.000010949595,0.000022127882,0.9943178,0.00033986662,0.003419992,0.0016794913,0.000005038281],"about_ca_topic_score_codex":0.018017808,"about_ca_topic_score_gemma":0.018614009,"teacher_disagreement_score":0.018017808,"about_ca_system_score_codex":0.0019204344,"about_ca_system_score_gemma":0.003872664,"threshold_uncertainty_score":0.03582585},"labels":[],"label_agreement":null},{"id":"W4361003657","doi":"10.1145/3588869","title":"Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring","year":2023,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Graph coloring; Constraint satisfaction problem; Partition (number theory); Computer science; Vertex (graph theory); Implementation; Binary number; Graph; Graph partition; Theoretical computer science; Mathematical optimization; Combinatorics; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.11747035310145508,"score_gpt":0.3966672885918802,"score_spread":0.2791969354904251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361003657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02597036,0.00032011155,0.96139324,0.00065604906,0.00011247951,0.0001873487,0.0002847419,0.0006631348,0.010412556],"genre_scores_gemma":[0.36386186,0.00043859452,0.6294782,0.00034438734,0.00014386859,0.0003486353,0.00069261255,0.0005343975,0.004157407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968863,0.0015157495,0.00011312079,0.00035534953,0.00072822336,0.0004011708],"domain_scores_gemma":[0.9949857,0.0036883117,0.00029452035,0.0004023348,0.0004282468,0.00020099968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028344456,0.0011440193,0.0010065808,0.0010233013,0.000993644,0.0018936376,0.001714121,0.001011011,0.0054589356],"category_scores_gemma":[0.010938561,0.0005506791,0.0010779286,0.0026994993,0.0013000594,0.002349991,0.0023149566,0.0024606884,0.0005824982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040581022,0.00026971143,0.0007603705,0.00034013914,0.00007376165,0.00007180595,0.00020987344,0.72516507,0.0037769964,0.1645245,0.010208526,0.09419339],"study_design_scores_gemma":[0.000048586367,0.000051063813,0.00011784141,0.000013605029,0.0000126379155,0.000021987735,0.000039013892,0.9384384,0.0017127163,0.057685103,0.0018499893,0.000009061693],"about_ca_topic_score_codex":0.011035661,"about_ca_topic_score_gemma":0.008016452,"teacher_disagreement_score":0.011035661,"about_ca_system_score_codex":0.0022285148,"about_ca_system_score_gemma":0.0035263912,"threshold_uncertainty_score":0.021942854},"labels":[],"label_agreement":null},{"id":"W4365511950","doi":"10.1111/itor.13298","title":"A stochastic integer programming approach to reserve staff scheduling with preferences","year":2023,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Fonds de recherche du Québec; Institut de Valorisation des Données; Hydro-Québec","keywords":"Integer programming; Operations research; Scheduling (production processes); Stochastic programming; Computer science; Schedule; Staff management; Business; Operations management; Mathematical optimization; Economics; Mathematics; Management","score_opus":0.3870473081236018,"score_gpt":0.5033384033433449,"score_spread":0.11629109521974312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365511950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037410602,0.00053101283,0.9539104,0.00113449,0.00010831693,0.000098519355,0.00039389927,0.00010518742,0.0063075027],"genre_scores_gemma":[0.8265685,0.00090972346,0.15936618,0.0003465751,0.00026671827,0.00040461606,0.00044857722,0.000092807626,0.011596319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794596,0.0011929077,0.000062778156,0.00024934742,0.00023778832,0.0003111681],"domain_scores_gemma":[0.9959388,0.0030369821,0.00048767353,0.0000746448,0.00024569427,0.0002162918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031885006,0.0012596541,0.0015052173,0.0007907923,0.0004659376,0.0017663309,0.0017015655,0.0014734785,0.004004342],"category_scores_gemma":[0.0049967244,0.001004769,0.0013489017,0.0013178994,0.00085852464,0.0010855958,0.0010537454,0.0022579816,0.00029193814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030123187,0.000034150253,0.00028514987,0.00003296027,0.000027302987,0.000065884626,0.000027050137,0.97660965,0.00020726208,0.02010164,0.00039026546,0.0021885582],"study_design_scores_gemma":[0.000006830538,0.000016395612,0.0000626587,0.0000050346357,0.0000052825617,0.0000060992575,0.000011044381,0.9938135,0.000040944164,0.005805487,0.00022198215,0.0000047050257],"about_ca_topic_score_codex":0.009698391,"about_ca_topic_score_gemma":0.0070218523,"teacher_disagreement_score":0.009698391,"about_ca_system_score_codex":0.0020968495,"about_ca_system_score_gemma":0.0022486602,"threshold_uncertainty_score":0.01928389},"labels":[],"label_agreement":null},{"id":"W4366809316","doi":"10.5220/0007246700002104","title":"Workforce Modelling in Support of Rejuvenation Objectives","year":2019,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence","funders":"","keywords":"Rejuvenation; Workforce; Computer science; Process management; Business; Gerontology; Medicine; Political science","score_opus":0.14680686677489446,"score_gpt":0.3923374724578892,"score_spread":0.24553060568299473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366809316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10138795,0.0003226416,0.8849205,0.0006345131,0.00013830492,0.0001283437,0.00057894055,0.00059210474,0.011296699],"genre_scores_gemma":[0.86670256,0.00033407327,0.12550835,0.00009664929,0.000053086962,0.0001785967,0.0005454681,0.00018110235,0.006400141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994822,0.0002086752,0.000023224417,0.000085507025,0.000105738436,0.000094759824],"domain_scores_gemma":[0.99728036,0.001980026,0.00020433588,0.00010791091,0.00029736568,0.00012998318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013790636,0.0007149316,0.0009575051,0.00074310775,0.0004585589,0.0014976735,0.0016481776,0.001368686,0.004103753],"category_scores_gemma":[0.004887933,0.0005693801,0.001099188,0.00070836535,0.0003022069,0.0011218276,0.00073694525,0.0011240527,0.00039077035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021838581,0.000018109724,0.00024010359,0.000034886307,0.0000070763854,0.00002600645,0.000031462496,0.99170166,0.00033289718,0.0023248359,0.0002599027,0.0050013405],"study_design_scores_gemma":[0.000002228419,0.0000058154765,0.00004543558,0.000004421241,0.0000024767187,0.0000032744142,0.0000075056164,0.9981165,0.00010797749,0.0014709102,0.00023166013,0.0000017522949],"about_ca_topic_score_codex":0.015894976,"about_ca_topic_score_gemma":0.013655295,"teacher_disagreement_score":0.015894976,"about_ca_system_score_codex":0.0009597825,"about_ca_system_score_gemma":0.0022719393,"threshold_uncertainty_score":0.031604946},"labels":[],"label_agreement":null},{"id":"W4377249639","doi":"10.1007/978-3-031-33271-5_28","title":"Multi-objective Optimization for the Design of Salary Structures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Salary; Pareto principle; Equity (law); Computer science; Context (archaeology); Economic shortage; Compensation (psychology); Operations research; Industrial organization; Business; Economics; Operations management; Engineering","score_opus":0.14739507411886008,"score_gpt":0.3646013228011721,"score_spread":0.217206248682312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009106884,0.000983868,0.98099375,0.00012799387,0.000059758328,0.000110207846,0.000100470446,0.00018749062,0.008329614],"genre_scores_gemma":[0.26595196,0.0013920575,0.72059023,0.00014681683,0.000085600266,0.00066404545,0.00026169987,0.00030752667,0.010599947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994771,0.0002065676,0.00002025072,0.000063185056,0.00017459069,0.00005841428],"domain_scores_gemma":[0.99935323,0.0004269784,0.00007765398,0.0000267826,0.000078755234,0.000036528592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013531329,0.0013220651,0.0010709771,0.0009468528,0.00047842012,0.001046002,0.0011941008,0.0010849294,0.0077788793],"category_scores_gemma":[0.0024090058,0.00083089137,0.0010764648,0.0011499171,0.00040237073,0.0007981836,0.00091205485,0.0014629588,0.000974268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028912798,0.000050814633,0.00009557084,0.00012833813,0.000021341217,0.00001980101,0.000025056903,0.94896054,0.0014140278,0.0075343577,0.0010704809,0.04065077],"study_design_scores_gemma":[0.000008926226,0.000045747736,0.00007009306,0.000021208614,0.0000070501437,0.000008213216,0.0000086021255,0.99492466,0.00037694117,0.0032647077,0.0012589565,0.000004872643],"about_ca_topic_score_codex":0.0024536406,"about_ca_topic_score_gemma":0.0037189445,"teacher_disagreement_score":0.0077788793,"about_ca_system_score_codex":0.00096382335,"about_ca_system_score_gemma":0.0012921909,"threshold_uncertainty_score":0.02602297},"labels":[],"label_agreement":null},{"id":"W4377695009","doi":"10.1016/j.eswa.2023.120524","title":"Optimising stochastic task allocation and scheduling plans for mission workers subject to learning-forgetting, fatigue-recovery, and stress-recovery effects","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Computer science; Task (project management); Scheduling (production processes); Subject (documents); Operations research; Cognitive psychology; Mathematical optimization; Psychology; World Wide Web; Mathematics; Management","score_opus":0.05532329433892541,"score_gpt":0.35535601379853987,"score_spread":0.30003271945961446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377695009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44782352,0.0009478642,0.5463032,0.0008132025,0.00013364447,0.0002722704,0.00030144717,0.0004931243,0.0029117751],"genre_scores_gemma":[0.96223867,0.00018321356,0.035366934,0.00007880466,0.000038805716,0.00015576993,0.00015255586,0.00005140672,0.001733954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995586,0.00015102701,0.00002203065,0.000088183464,0.00006011973,0.00011989349],"domain_scores_gemma":[0.9969266,0.0021945594,0.0003445928,0.00006804181,0.00024141972,0.00022477783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018453406,0.0009320097,0.0013250281,0.0006614247,0.00039835434,0.0008349522,0.0009612468,0.0013454586,0.0017315941],"category_scores_gemma":[0.0051953583,0.0008925731,0.00068380765,0.00044302858,0.0005943567,0.00071059656,0.0006832819,0.0011037813,0.00020728141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008151402,0.000029376492,0.00021060821,0.00002227354,0.000012517819,0.000012798903,0.000016561668,0.9952272,0.000344275,0.0003089676,0.000114987844,0.0036189605],"study_design_scores_gemma":[0.000014021561,0.000040529725,0.00015827705,0.0000031628508,0.000006088536,0.000003117684,0.000009745184,0.99913543,0.000111207184,0.00047944952,0.00003641494,0.000002547333],"about_ca_topic_score_codex":0.018615633,"about_ca_topic_score_gemma":0.013333231,"teacher_disagreement_score":0.018615633,"about_ca_system_score_codex":0.0011921461,"about_ca_system_score_gemma":0.0030020885,"threshold_uncertainty_score":0.037014544},"labels":[],"label_agreement":null},{"id":"W4378420044","doi":"10.1007/978-3-031-34020-8_5","title":"Solving the Nurse Scheduling Problem Using the Whale Optimization Algorithm","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Nurse scheduling problem; Job shop scheduling; Workforce; Whale; Operations research; Mathematics; Flow shop scheduling; Economics","score_opus":0.1587079479008343,"score_gpt":0.3851310353442011,"score_spread":0.2264230874433668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378420044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020487849,0.0004359306,0.962387,0.00029433903,0.00016106498,0.000062987514,0.000062957726,0.00022694033,0.015880855],"genre_scores_gemma":[0.3462447,0.0009726477,0.61624026,0.00019740738,0.00015804298,0.0002677392,0.0002699835,0.00029418932,0.035355035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997112,0.00009718498,0.00000979935,0.000043871925,0.00008177507,0.000056187644],"domain_scores_gemma":[0.99981636,0.0001165991,0.000012508189,0.000019511288,0.000022248954,0.000012803627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000413744,0.00060444087,0.0008914609,0.00035634672,0.00049099216,0.0008262549,0.0009494405,0.0008528693,0.0063194293],"category_scores_gemma":[0.0011492458,0.00029250508,0.0006236471,0.00087373477,0.00033159996,0.00092619593,0.00084818096,0.0009913793,0.0006414115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011005905,0.00011234093,0.00030863425,0.00013638221,0.000054444492,0.0000772317,0.00006553038,0.79778063,0.002028203,0.054417994,0.0071636266,0.1377449],"study_design_scores_gemma":[0.0000242952,0.000030699095,0.00013023701,0.000006535666,0.000009371004,0.000026083942,0.00003578684,0.9770233,0.0006005996,0.01877689,0.0033288922,0.000007196608],"about_ca_topic_score_codex":0.007667449,"about_ca_topic_score_gemma":0.010698606,"teacher_disagreement_score":0.007667449,"about_ca_system_score_codex":0.0005589398,"about_ca_system_score_gemma":0.0012837211,"threshold_uncertainty_score":0.021140635},"labels":[],"label_agreement":null},{"id":"W4387607422","doi":"10.1007/s10732-023-09519-6","title":"Effective adaptive large neighborhood search for a firefighters timetabling problem","year":2023,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 Marie Skłodowska-Curie Actions; Ministère de l'Enseignement Supérieur, de la Recherche, de la Science et de la Technologie; CHIST-ERA; Agence Nationale de la Recherche; European Commission","keywords":"Constructive; Computer science; Metaheuristic; Neighbourhood (mathematics); Mathematical optimization; Integer programming; Operations research; Adaptive strategies; Work (physics); Linear programming; Artificial intelligence; Mathematics; Process (computing); Algorithm; Geography; Engineering","score_opus":0.12726708042342302,"score_gpt":0.4145626424144746,"score_spread":0.28729556199105155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387607422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14004906,0.0007167099,0.8499814,0.00061899493,0.0001292226,0.00018287668,0.00012839402,0.00028031398,0.00791299],"genre_scores_gemma":[0.674318,0.00026793763,0.31957445,0.00016303832,0.0000842895,0.0002816138,0.00020507885,0.000089882684,0.005015597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.0003222125,0.000022442706,0.00008602938,0.00011092048,0.00007884358],"domain_scores_gemma":[0.99790925,0.0016273081,0.00013558225,0.00006872566,0.00016468107,0.00009439727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840085,0.0006029121,0.001535913,0.0011043556,0.0007028342,0.0007312267,0.0016876189,0.0013948552,0.002318157],"category_scores_gemma":[0.0046057887,0.00054804474,0.0006939996,0.0008203491,0.0006457714,0.001123229,0.00090231723,0.0009501047,0.00015852718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013452803,0.00012353629,0.0004317947,0.000061987754,0.000033208053,0.00004124367,0.000045524852,0.96637326,0.0009203024,0.0075896145,0.0011676217,0.023077298],"study_design_scores_gemma":[0.000014494967,0.000025943584,0.000036729405,0.0000023766122,0.0000044420103,0.0000047522885,0.00000523258,0.99844235,0.000070434726,0.0012613423,0.00013008785,0.0000019234449],"about_ca_topic_score_codex":0.0090886485,"about_ca_topic_score_gemma":0.00807229,"teacher_disagreement_score":0.0090886485,"about_ca_system_score_codex":0.0011159643,"about_ca_system_score_gemma":0.0016905947,"threshold_uncertainty_score":0.018071473},"labels":[],"label_agreement":null},{"id":"W4387655016","doi":"10.1007/s10951-023-00794-6","title":"A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment","year":2023,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Hydro-Québec; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Time horizon; Scheduling (production processes); Schedule; Heuristic; Probabilistic logic; Supply chain management; Job shop scheduling; Partition (number theory); Operations research; Supply chain; Mathematics; Artificial intelligence","score_opus":0.20023957314529126,"score_gpt":0.38156992083434427,"score_spread":0.181330347689053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387655016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25196588,0.00042862812,0.7331548,0.000531626,0.00020611423,0.0007332445,0.00028782946,0.0018761716,0.010815811],"genre_scores_gemma":[0.61785907,0.0001627604,0.3747473,0.00012598421,0.000062288185,0.0004112769,0.00028979505,0.00026243247,0.0060790414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994288,0.00021853647,0.000020236672,0.000081509854,0.000094424235,0.0001563291],"domain_scores_gemma":[0.999092,0.00049838907,0.000082005645,0.00011456293,0.00007974286,0.00013323783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014503538,0.0005881024,0.002152195,0.0014878991,0.0016156413,0.000995039,0.0028040293,0.001532444,0.006728242],"category_scores_gemma":[0.0023312233,0.00079452747,0.0011403934,0.0012711666,0.00077469193,0.0012653375,0.0016172249,0.0010069439,0.000481492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006871155,0.0004815129,0.0006893408,0.000095990086,0.000056148907,0.00017367442,0.00012517415,0.8858605,0.0023997454,0.003893183,0.0018727543,0.10366493],"study_design_scores_gemma":[0.00015886276,0.00024305064,0.00023966936,0.0000056744425,0.00002643207,0.000026385098,0.000034346915,0.99618894,0.00051452004,0.0018151802,0.00073356833,0.000013396347],"about_ca_topic_score_codex":0.012869101,"about_ca_topic_score_gemma":0.013418486,"teacher_disagreement_score":0.012869101,"about_ca_system_score_codex":0.0011745711,"about_ca_system_score_gemma":0.0025643846,"threshold_uncertainty_score":0.025588393},"labels":[],"label_agreement":null},{"id":"W4387722295","doi":"","title":"Set covering and packing formulations of graph coloring","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Graph coloring; Combinatorics; Mathematics; Graph; List coloring; Set (abstract data type); Computer science; Graph power; Programming language; Line graph","score_opus":0.07002629363039768,"score_gpt":0.3223224019262742,"score_spread":0.2522961082958765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387722295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0750679,0.0023782642,0.8335276,0.0052681086,0.00065951823,0.00042499276,0.0022730094,0.00057730096,0.079823196],"genre_scores_gemma":[0.5523228,0.0031114144,0.37646228,0.0013121592,0.0016697872,0.0010818322,0.004026031,0.0012733223,0.05874034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976682,0.0010048578,0.00007432772,0.0003534398,0.0005379411,0.00036123683],"domain_scores_gemma":[0.9933931,0.0049606264,0.0003640517,0.00048460552,0.00037906432,0.00041854125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002686254,0.0021815838,0.0024502967,0.0019166642,0.0014854239,0.005781455,0.0031316143,0.0029202783,0.019304506],"category_scores_gemma":[0.01029001,0.0015553352,0.002724107,0.004648319,0.0021380526,0.0060132584,0.0022279986,0.0053295027,0.0012067466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018373363,0.00022385591,0.0002660787,0.00040000674,0.0000679941,0.000098032964,0.00036791316,0.24171826,0.0007299514,0.70987266,0.018570919,0.027500648],"study_design_scores_gemma":[0.000050516875,0.0000400795,0.00012779386,0.000058309153,0.000034413522,0.000054417374,0.00009125058,0.46637926,0.0003895763,0.5280933,0.004663709,0.000017368837],"about_ca_topic_score_codex":0.0072736605,"about_ca_topic_score_gemma":0.0064701587,"teacher_disagreement_score":0.019304506,"about_ca_system_score_codex":0.0055986736,"about_ca_system_score_gemma":0.0031152186,"threshold_uncertainty_score":0.06458002},"labels":[],"label_agreement":null},{"id":"W4388650674","doi":"10.48550/arxiv.2311.05713","title":"List-$k$-Coloring $H$-free graphs for all $k&gt;4$","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Induced path; Path (computing); Induced subgraph; Integer (computer science); Complete coloring; Discrete mathematics; Longest path problem; Chordal graph; Computer science; Graph power; Line graph","score_opus":0.4594780831156832,"score_gpt":0.311931187120129,"score_spread":0.1475468959955542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388650674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35044542,0.002063035,0.5026199,0.01683749,0.0008008266,0.0011096745,0.031701345,0.0068333778,0.087588936],"genre_scores_gemma":[0.61258507,0.0017208401,0.32282227,0.0028927801,0.00055605243,0.00086820824,0.024271602,0.001648019,0.032635216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978714,0.00026059104,0.00011082018,0.00077712873,0.00030426748,0.0006756975],"domain_scores_gemma":[0.9885449,0.006350188,0.0012411734,0.0021462329,0.0008636827,0.0008538664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014466812,0.001888777,0.0015925954,0.0011162482,0.0022226137,0.0040591178,0.0034121224,0.0017344747,0.019833803],"category_scores_gemma":[0.008840129,0.000830244,0.0019753303,0.002766109,0.0017608299,0.007030619,0.00220404,0.0036460387,0.0032441975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030672227,0.0014301669,0.009198866,0.0034631437,0.0005462925,0.00067819323,0.000977255,0.28713724,0.027713513,0.31715155,0.1633745,0.18526213],"study_design_scores_gemma":[0.0005492563,0.00023650606,0.0030599288,0.0001272058,0.00027109994,0.000858821,0.0005125117,0.29637143,0.013929462,0.65141237,0.032559358,0.00011208327],"about_ca_topic_score_codex":0.008692644,"about_ca_topic_score_gemma":0.014386263,"teacher_disagreement_score":0.019833803,"about_ca_system_score_codex":0.0035183476,"about_ca_system_score_gemma":0.0057448023,"threshold_uncertainty_score":0.0663507},"labels":[],"label_agreement":null},{"id":"W4389705492","doi":"10.23952/jnva.7.2023.6.03","title":"Weak Henig proper solution sets for set optimization problems","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Set (abstract data type); Mathematics; Optimization problem; Mathematical optimization; Computer science; Programming language","score_opus":0.14073753715216877,"score_gpt":0.3950962165357248,"score_spread":0.25435867938355605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389705492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01713221,0.000998956,0.9691325,0.0008031183,0.00014739978,0.00008460229,0.00006654457,0.00004998728,0.011584822],"genre_scores_gemma":[0.51559085,0.0030553073,0.46037132,0.00094555627,0.00048770854,0.00068408786,0.00028263615,0.00018316781,0.018399425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720335,0.0011714742,0.00018768663,0.00037672438,0.00080994726,0.00025083075],"domain_scores_gemma":[0.99579215,0.002606687,0.00027747522,0.0002955613,0.0008183763,0.00020975951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061915074,0.0018028292,0.0020400342,0.0025435584,0.0013353041,0.0027657396,0.0012283518,0.001834389,0.002751369],"category_scores_gemma":[0.0115367705,0.0011641557,0.0028379802,0.0017998077,0.0046893363,0.0052494854,0.0038869607,0.005091478,0.00045248793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022474449,0.0000146986495,0.000101534395,0.00004681532,0.00003407583,0.000027135435,0.0001545428,0.011267032,0.001070184,0.9810449,0.0005239466,0.0056926636],"study_design_scores_gemma":[0.000023476627,0.000058690817,0.0001864662,0.000033160566,0.000020872441,0.00003291839,0.00008366847,0.11137391,0.0014358779,0.8817471,0.0049738907,0.000029967961],"about_ca_topic_score_codex":0.0015827714,"about_ca_topic_score_gemma":0.0010828545,"teacher_disagreement_score":0.0061915074,"about_ca_system_score_codex":0.0021787104,"about_ca_system_score_gemma":0.0014136793,"threshold_uncertainty_score":0.03274423},"labels":[],"label_agreement":null},{"id":"W4390037189","doi":"10.1007/978-3-031-47058-5_14","title":"Binary Programming for Allocation of Players in Soccer Competitions by a Canadian Sports Event Management Company","year":2023,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Event (particle physics); Event management; Operations research; Advertising; Marketing; Business; Computer science; Operations management; Engineering","score_opus":0.07285589582180765,"score_gpt":0.3460876942023339,"score_spread":0.27323179838052625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390037189","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07253283,0.0312147,0.15271348,0.04723318,0.0040406166,0.0009080453,0.00377628,0.0013493703,0.6862315],"genre_scores_gemma":[0.17476854,0.0077112284,0.038281444,0.0010846449,0.00035308144,0.00013735626,0.0012491195,0.00021539607,0.77619916],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964607,0.000051985135,0.000008144663,0.000040080457,0.0001688516,0.000084955514],"domain_scores_gemma":[0.9995993,0.00012709756,0.000008845992,0.00000863974,0.0001823332,0.00007383442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009152012,0.0006210758,0.0003508297,0.00088403333,0.0018772117,0.0015914099,0.00088588,0.0007123825,0.020809319],"category_scores_gemma":[0.0010485337,0.0003184941,0.00030581185,0.0014063838,0.0004175591,0.00068069674,0.00034371935,0.0011530261,0.0014935831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012610569,0.00014333485,0.0011683292,0.000119708,0.000015478747,0.0000886476,0.0004536024,0.037757043,0.001866237,0.042524513,0.64582807,0.269909],"study_design_scores_gemma":[0.00006952929,0.00013130698,0.009277802,0.00023941473,0.000026099955,0.000082387625,0.0014546199,0.23311767,0.0016703183,0.022430807,0.7314025,0.0000975705],"about_ca_topic_score_codex":0.77476853,"about_ca_topic_score_gemma":0.8793011,"teacher_disagreement_score":0.22523147,"about_ca_system_score_codex":0.014172839,"about_ca_system_score_gemma":0.017011309,"threshold_uncertainty_score":0.45311576},"labels":[],"label_agreement":null},{"id":"W4391854831","doi":"10.1109/access.2024.3365734","title":"Preference-Based Stepping Ahead Firefly Algorithm for Solving Real-World Uncapacitated Examination Timetabling Problem","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Preference; Firefly algorithm; Mathematical optimization; Firefly protocol; Algorithm; Mathematics; Statistics","score_opus":0.32285827817466045,"score_gpt":0.435354634078652,"score_spread":0.11249635590399154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391854831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04605065,0.0003310419,0.9500118,0.00019251436,0.00005631795,0.00008513664,0.000041678562,0.000294405,0.0029364733],"genre_scores_gemma":[0.53532577,0.00027325744,0.46007425,0.00015183675,0.00004385937,0.00024734729,0.00015430903,0.00006476983,0.0036646894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996923,0.00008727722,0.00001805394,0.000057500965,0.0000969104,0.000048006987],"domain_scores_gemma":[0.99966586,0.00015131671,0.00005820364,0.000024922167,0.0000668533,0.000032851956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009121382,0.00060965697,0.000779882,0.00048762816,0.00038574758,0.00049497344,0.0011113161,0.000684825,0.0016487938],"category_scores_gemma":[0.0011254343,0.00024364066,0.0006650121,0.00051136536,0.00035997387,0.00050437823,0.00050984585,0.00072016,0.00018166563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011576702,0.000089154695,0.001213027,0.000103435945,0.000046067693,0.0000730453,0.000071783616,0.912613,0.0051768115,0.0066466187,0.0016742368,0.07217711],"study_design_scores_gemma":[0.0000151122495,0.00004232115,0.00013293042,0.0000037078228,0.0000063211655,0.000012642385,0.0000074756786,0.99812144,0.0004938133,0.0007114561,0.00044899224,0.0000037963848],"about_ca_topic_score_codex":0.004293578,"about_ca_topic_score_gemma":0.004080451,"teacher_disagreement_score":0.004293578,"about_ca_system_score_codex":0.0005368085,"about_ca_system_score_gemma":0.001216724,"threshold_uncertainty_score":0.008537173},"labels":[],"label_agreement":null},{"id":"W4392305536","doi":"10.5220/0012402300003639","title":"Evolutionary Techniques for the Nurse Scheduling Problem","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Nurse scheduling problem; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Flow shop scheduling; Mathematics; Operating system; Schedule","score_opus":0.10559528031570187,"score_gpt":0.41697615147493317,"score_spread":0.3113808711592313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392305536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034587406,0.0010861258,0.9547127,0.00048138524,0.000095506584,0.00006796812,0.000036603018,0.00007049847,0.008861767],"genre_scores_gemma":[0.39853045,0.0018099489,0.5876317,0.00025193236,0.00016444316,0.00029693524,0.00015026348,0.000097584925,0.011066708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963474,0.00016477589,0.000013495014,0.000036725607,0.000102600505,0.00004763796],"domain_scores_gemma":[0.99910283,0.0006832564,0.000049738384,0.0000300681,0.00010427448,0.000029786517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008999492,0.00052214693,0.0006108514,0.0009957497,0.0005343581,0.0005495619,0.0008621148,0.000993229,0.002463472],"category_scores_gemma":[0.0030485045,0.00034818062,0.00087383675,0.0011382733,0.00053735013,0.0006655523,0.0006795025,0.0010905494,0.0002035131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027410733,0.00006606142,0.00042301184,0.000081232516,0.000049477097,0.00005107859,0.00008276749,0.8743375,0.001111546,0.03494594,0.0009889491,0.08783504],"study_design_scores_gemma":[0.000017055934,0.00003108554,0.00021759364,0.000018861509,0.0000145426375,0.000030643292,0.000022496963,0.9791268,0.00023602476,0.018669253,0.0016105103,0.000005054063],"about_ca_topic_score_codex":0.005219123,"about_ca_topic_score_gemma":0.0038804028,"teacher_disagreement_score":0.005219123,"about_ca_system_score_codex":0.00069363555,"about_ca_system_score_gemma":0.0007316299,"threshold_uncertainty_score":0.010377526},"labels":[],"label_agreement":null},{"id":"W4393974747","doi":"10.11591/ijai.v13.i2.pp2155-2164","title":"The performance analysis of hyper-heuristics algorithms over examination timetabling problems","year":2024,"lang":"en","type":"article","venue":"IAES International Journal of Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Computer science; Heuristics; Hill climbing; Simulated annealing; Algorithm; Mathematical optimization; Heuristic; Process (computing); Machine learning; Artificial intelligence; Mathematics","score_opus":0.1449176419297288,"score_gpt":0.42355088803075913,"score_spread":0.27863324610103035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393974747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8462506,0.008853181,0.11828713,0.0009783447,0.00035007397,0.00051624834,0.001282644,0.0019653135,0.021516498],"genre_scores_gemma":[0.89412546,0.0014138654,0.101128824,0.00014012006,0.00005908843,0.00024737106,0.001247567,0.00014643774,0.0014914102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969261,0.0016053957,0.00017462121,0.00038031905,0.00051565905,0.00039790082],"domain_scores_gemma":[0.98646927,0.010206348,0.00088718993,0.0007658489,0.0012526031,0.0004187906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005684002,0.0012343652,0.0011690786,0.0026047556,0.00075749826,0.0020683834,0.0013277909,0.0013046532,0.0017836696],"category_scores_gemma":[0.014601282,0.0003289165,0.00088734354,0.0026771904,0.0006004431,0.001135377,0.0006993878,0.0008641861,0.00033569607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007919901,0.0004204038,0.0057193898,0.00043828288,0.0002337239,0.000046272413,0.000099241275,0.8882564,0.0011609205,0.004428977,0.002358363,0.09604604],"study_design_scores_gemma":[0.00006906263,0.00041692302,0.0017944304,0.000047461388,0.00005424998,0.000034406745,0.00010751048,0.9932273,0.0014031716,0.0017655948,0.0010667042,0.000013117959],"about_ca_topic_score_codex":0.012340435,"about_ca_topic_score_gemma":0.008861395,"teacher_disagreement_score":0.012340435,"about_ca_system_score_codex":0.0027235032,"about_ca_system_score_gemma":0.0035432728,"threshold_uncertainty_score":0.030060232},"labels":[],"label_agreement":null},{"id":"W4394093606","doi":"10.6084/m9.figshare.24739581.v1","title":"CS Home Training data.xlsx","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Training (meteorology); Physics; Meteorology","score_opus":0.7414195884044866,"score_gpt":0.4999340654792643,"score_spread":0.24148552292522235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394093606","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006949254,0.00011392243,0.00299479,0.0006379153,0.00057655026,0.00040859237,0.92892873,0.028242778,0.037401803],"genre_scores_gemma":[0.014037868,0.00046401125,0.020375488,0.0021318865,0.00033321496,0.0039325086,0.8071275,0.043265067,0.10833241],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989243,0.00011850486,0.000118437405,0.0002828133,0.00034527972,0.00021057727],"domain_scores_gemma":[0.99554896,0.0015688716,0.00021958511,0.00091168174,0.0011975508,0.00055331556],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021607864,0.0021474161,0.0022995053,0.0031048509,0.001523774,0.0037941441,0.0040898467,0.0024999494,0.90169567],"category_scores_gemma":[0.010664121,0.0013332303,0.0009959788,0.0037641174,0.00089486624,0.0029713942,0.0038037424,0.0028379695,0.6642076],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026536887,0.00009364805,0.0004850316,0.001199014,0.000023330991,0.00006861062,0.0001041565,0.0002374291,0.0005372775,0.0014798972,0.9770975,0.018408732],"study_design_scores_gemma":[0.00040409892,0.00008309893,0.0020502978,0.0005603302,0.000023236262,0.00009119271,0.00013016257,0.0006753283,0.001819623,0.0054552257,0.9886396,0.000067899804],"about_ca_topic_score_codex":0.005248634,"about_ca_topic_score_gemma":0.0068193222,"teacher_disagreement_score":0.90169567,"about_ca_system_score_codex":0.0012218906,"about_ca_system_score_gemma":0.0028976735,"threshold_uncertainty_score":0.14021921},"labels":[],"label_agreement":null},{"id":"W4394168181","doi":"10.6084/m9.figshare.24739581","title":"CS Home Training data.xlsx","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Training (meteorology); Geography; Meteorology","score_opus":0.7414195884044866,"score_gpt":0.4999340654792643,"score_spread":0.24148552292522235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394168181","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006949254,0.00011392243,0.00299479,0.0006379153,0.00057655026,0.00040859237,0.92892873,0.028242778,0.037401803],"genre_scores_gemma":[0.014037868,0.00046401125,0.020375488,0.0021318865,0.00033321496,0.0039325086,0.8071275,0.043265067,0.10833241],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989243,0.00011850486,0.000118437405,0.0002828133,0.00034527972,0.00021057727],"domain_scores_gemma":[0.99554896,0.0015688716,0.00021958511,0.00091168174,0.0011975508,0.00055331556],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021607864,0.0021474161,0.0022995053,0.0031048509,0.001523774,0.0037941441,0.0040898467,0.0024999494,0.90169567],"category_scores_gemma":[0.010664121,0.0013332303,0.0009959788,0.0037641174,0.00089486624,0.0029713942,0.0038037424,0.0028379695,0.6642076],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026536887,0.00009364805,0.0004850316,0.001199014,0.000023330991,0.00006861062,0.0001041565,0.0002374291,0.0005372775,0.0014798972,0.9770975,0.018408732],"study_design_scores_gemma":[0.00040409892,0.00008309893,0.0020502978,0.0005603302,0.000023236262,0.00009119271,0.00013016257,0.0006753283,0.001819623,0.0054552257,0.9886396,0.000067899804],"about_ca_topic_score_codex":0.005248634,"about_ca_topic_score_gemma":0.0068193222,"teacher_disagreement_score":0.90169567,"about_ca_system_score_codex":0.0012218906,"about_ca_system_score_gemma":0.0028976735,"threshold_uncertainty_score":0.14021921},"labels":[],"label_agreement":null},{"id":"W4394794863","doi":"10.61091/ars158-09","title":"A Variant of the Round-Robin Scheduling Problem","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Mathematics; Weighted round robin; Construct (python library); Job shop scheduling; Mathematical optimization; Combinatorics; Computer science; Round-robin scheduling; Dynamic priority scheduling; Computer network","score_opus":0.05936538615957712,"score_gpt":0.3395977549067772,"score_spread":0.28023236874720003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394794863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059949055,0.0002380572,0.90790045,0.0012345448,0.00037284236,0.0004190654,0.0011680746,0.0004956473,0.028222155],"genre_scores_gemma":[0.41123536,0.00048879196,0.5528051,0.0004976503,0.00037361967,0.0004764175,0.0014951957,0.00029421432,0.03233365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978607,0.0008414516,0.000103003294,0.000537552,0.000315218,0.00034208174],"domain_scores_gemma":[0.9974369,0.0012114692,0.0002920487,0.00049557636,0.00023809943,0.00032594372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017572657,0.0010384208,0.00084259536,0.00043428305,0.0009901192,0.0015099216,0.0026063952,0.0012067695,0.012249614],"category_scores_gemma":[0.005029478,0.00046084303,0.0011722797,0.0009596413,0.0009943561,0.003115691,0.0009543693,0.0018999903,0.0016932866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007015029,0.0003839588,0.0008619397,0.00040224858,0.00011659079,0.0004895692,0.00030812714,0.33587033,0.009550675,0.5635743,0.023595136,0.06414569],"study_design_scores_gemma":[0.00020452945,0.00027624262,0.0004864934,0.00003125879,0.000051783172,0.00042369342,0.00017852124,0.6118892,0.004371646,0.34716567,0.034862664,0.00005823127],"about_ca_topic_score_codex":0.0031104302,"about_ca_topic_score_gemma":0.003269857,"teacher_disagreement_score":0.012249614,"about_ca_system_score_codex":0.0013072274,"about_ca_system_score_gemma":0.0018921565,"threshold_uncertainty_score":0.040979028},"labels":[],"label_agreement":null},{"id":"W4399389097","doi":"10.1007/s12532-024-00256-w","title":"The MIP Workshop 2023 Computational Competition on reoptimization","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Theory of computation; Competition (biology); Computer science; Integer programming; Integer (computer science); Linear programming; Mathematical optimization; Operations research; Algorithm; Mathematics; Programming language","score_opus":0.1145559480526452,"score_gpt":0.41249560669244284,"score_spread":0.29793965863979766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399389097","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14976326,0.0068007414,0.42241693,0.074882284,0.016422613,0.0026378052,0.026851833,0.008276008,0.29194847],"genre_scores_gemma":[0.5076101,0.0014959815,0.38108397,0.00869516,0.0026541005,0.0024402454,0.03763937,0.003538787,0.054842394],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99032426,0.0041507715,0.00034537236,0.001325643,0.0025884714,0.0012654791],"domain_scores_gemma":[0.98466563,0.0074719824,0.00044116346,0.0024772917,0.0031670486,0.0017768862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015133322,0.0022000836,0.0021905329,0.001257152,0.0017548751,0.0056706397,0.003924562,0.0028185558,0.021454282],"category_scores_gemma":[0.024599595,0.0006001859,0.002416768,0.001977203,0.0016272352,0.0030786784,0.0037519382,0.0063394564,0.0033550202],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009948276,0.0007601918,0.00071140425,0.00047128784,0.0001685581,0.0002851111,0.00010683522,0.20135738,0.0014066931,0.12600857,0.56955814,0.098171055],"study_design_scores_gemma":[0.0006630488,0.0004943571,0.0015076343,0.00026926873,0.000063076586,0.00018678942,0.0003124348,0.6548291,0.005697617,0.10083655,0.23504975,0.000090429756],"about_ca_topic_score_codex":0.0075726956,"about_ca_topic_score_gemma":0.009594891,"teacher_disagreement_score":0.021454282,"about_ca_system_score_codex":0.0047644093,"about_ca_system_score_gemma":0.006424141,"threshold_uncertainty_score":0.0800336},"labels":[],"label_agreement":null},{"id":"W4399498702","doi":"10.1007/s10732-024-09527-0","title":"A large-scale neighborhood search algorithm for multi-activity tour scheduling problems","year":2024,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Scale (ratio); Scheduling (production processes); Mathematical optimization; Mathematics; Geography; Cartography","score_opus":0.17365266993463255,"score_gpt":0.4287558264857538,"score_spread":0.25510315655112126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399498702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04939164,0.00041841195,0.94317,0.00029672962,0.00012151007,0.0002427664,0.00017059455,0.00097547995,0.0052128457],"genre_scores_gemma":[0.30350032,0.00021826455,0.6908835,0.00011692679,0.00006620789,0.00055266137,0.00041780376,0.00016558579,0.004078672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995981,0.00016395569,0.000020915975,0.00006744217,0.00010632691,0.000043249023],"domain_scores_gemma":[0.9989832,0.0006413883,0.000057343193,0.00008513861,0.00016229652,0.00007049641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392398,0.00054783607,0.0013100179,0.00081103545,0.0008001313,0.00069775013,0.0016203483,0.0010481457,0.0030925984],"category_scores_gemma":[0.003037367,0.00049304095,0.00062074466,0.001054259,0.0003990668,0.0012725028,0.0013194971,0.00080281036,0.000446138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024576604,0.00021910142,0.00061786664,0.000081259575,0.000043518143,0.000056587247,0.00006597234,0.8442339,0.0015152532,0.008730077,0.003765133,0.1404257],"study_design_scores_gemma":[0.00003470851,0.000033560085,0.00005635639,0.0000026950386,0.000005563084,0.000008250735,0.000007918138,0.9976611,0.00011752863,0.0016306819,0.0004388193,0.0000028195102],"about_ca_topic_score_codex":0.00755496,"about_ca_topic_score_gemma":0.009362407,"teacher_disagreement_score":0.00755496,"about_ca_system_score_codex":0.00079285714,"about_ca_system_score_gemma":0.0014067522,"threshold_uncertainty_score":0.01502192},"labels":[],"label_agreement":null},{"id":"W4399771450","doi":"10.32920/26052748","title":"Real-Time Healthcare Resource Management Planning Using Advanced Machine Learning Methods","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Health care; Computer science; Resource planning; Resource (disambiguation); Enterprise resource planning; Process management; Knowledge management; Operations management; Business; Engineering management; Engineering; Environmental resource management; Political science; Environmental science","score_opus":0.2183579467853387,"score_gpt":0.5143892771208799,"score_spread":0.2960313303355412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399771450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029484902,0.00091640576,0.9655527,0.00068877445,0.000074558055,0.00010305931,0.00021432611,0.0004318043,0.0025335164],"genre_scores_gemma":[0.75848377,0.00092659536,0.23645371,0.0002564519,0.00013358984,0.000401967,0.0005209028,0.00007119684,0.0027519201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914813,0.0003671114,0.000056700756,0.00016862914,0.00015433808,0.00010500861],"domain_scores_gemma":[0.9970188,0.0021995148,0.00028526227,0.000064272615,0.00035696028,0.00007531528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018380396,0.0011310898,0.0013181493,0.001046275,0.00047208657,0.0013807057,0.0010397092,0.0010445755,0.0019792505],"category_scores_gemma":[0.003772816,0.0007250755,0.00084872794,0.0012513626,0.00048198755,0.0010981063,0.0006891759,0.001519883,0.00029090763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012044006,0.00001802694,0.00027916563,0.000018051043,0.000011565587,0.000013074917,0.000008422171,0.99044913,0.00006508587,0.00075920584,0.0001917362,0.008174396],"study_design_scores_gemma":[0.0000013051824,0.000003855502,0.00002956735,0.0000019123254,0.0000011521172,0.0000011084547,0.0000022304087,0.999243,0.000024849625,0.00064124214,0.000048598853,0.0000011912801],"about_ca_topic_score_codex":0.020790026,"about_ca_topic_score_gemma":0.01446627,"teacher_disagreement_score":0.020790026,"about_ca_system_score_codex":0.0016193921,"about_ca_system_score_gemma":0.0025952477,"threshold_uncertainty_score":0.041338086},"labels":[],"label_agreement":null},{"id":"W4399771490","doi":"10.32920/26052748.v1","title":"Real-Time Healthcare Resource Management Planning Using Advanced Machine Learning Methods","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Health care; Computer science; Artificial intelligence; Knowledge management; Process management; Business; Political science","score_opus":0.2183579467853387,"score_gpt":0.5143892771208799,"score_spread":0.2960313303355412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399771490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029484902,0.00091640576,0.9655527,0.00068877445,0.000074558055,0.00010305931,0.00021432611,0.0004318043,0.0025335164],"genre_scores_gemma":[0.75848377,0.00092659536,0.23645371,0.0002564519,0.00013358984,0.000401967,0.0005209028,0.00007119684,0.0027519201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914813,0.0003671114,0.000056700756,0.00016862914,0.00015433808,0.00010500861],"domain_scores_gemma":[0.9970188,0.0021995148,0.00028526227,0.000064272615,0.00035696028,0.00007531528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018380396,0.0011310898,0.0013181493,0.001046275,0.00047208657,0.0013807057,0.0010397092,0.0010445755,0.0019792505],"category_scores_gemma":[0.003772816,0.0007250755,0.00084872794,0.0012513626,0.00048198755,0.0010981063,0.0006891759,0.001519883,0.00029090763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012044006,0.00001802694,0.00027916563,0.000018051043,0.000011565587,0.000013074917,0.000008422171,0.99044913,0.00006508587,0.00075920584,0.0001917362,0.008174396],"study_design_scores_gemma":[0.0000013051824,0.000003855502,0.00002956735,0.0000019123254,0.0000011521172,0.0000011084547,0.0000022304087,0.999243,0.000024849625,0.00064124214,0.000048598853,0.0000011912801],"about_ca_topic_score_codex":0.020790026,"about_ca_topic_score_gemma":0.01446627,"teacher_disagreement_score":0.020790026,"about_ca_system_score_codex":0.0016193921,"about_ca_system_score_gemma":0.0025952477,"threshold_uncertainty_score":0.041338086},"labels":[],"label_agreement":null},{"id":"W4399924169","doi":"10.1109/icnc59896.2024.10556170","title":"Dragonfly Algorithm Application for Solving the Nurse Scheduling Problem","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Nurse scheduling problem; Scheduling (production processes); Parallel computing; Algorithm; Mathematical optimization; Fair-share scheduling; Rate-monotonic scheduling; Mathematics; Operating system; Schedule","score_opus":0.07218219857450721,"score_gpt":0.4004991241264708,"score_spread":0.3283169255519636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399924169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16289154,0.0016300029,0.80173624,0.001116241,0.0004083124,0.00041680143,0.00084310217,0.0025684086,0.028389461],"genre_scores_gemma":[0.48620456,0.00060837885,0.50304073,0.00028060496,0.00006943503,0.00047079334,0.0011484381,0.00014245648,0.008034578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987495,0.000027329632,0.000008515444,0.000030208046,0.000028515593,0.00003051514],"domain_scores_gemma":[0.9998247,0.00009617675,0.000013626839,0.000008723897,0.00004019527,0.000016661039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032356416,0.0008370616,0.00055249815,0.0007823965,0.0005821219,0.00052656967,0.0008381643,0.0009446028,0.0030612329],"category_scores_gemma":[0.0006994665,0.00021412689,0.0004988337,0.00062988314,0.00021777148,0.00037161956,0.00044000123,0.00057957775,0.00027478693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007991123,0.00009624144,0.0012253663,0.00011726569,0.000047887766,0.000114427385,0.00006098162,0.8996358,0.0019012511,0.004505346,0.0052275634,0.08698808],"study_design_scores_gemma":[0.0000200042,0.000033897144,0.00014638464,0.0000071789036,0.000009012335,0.000023188373,0.000021567243,0.99592125,0.00051063346,0.0011125788,0.0021901554,0.00000405829],"about_ca_topic_score_codex":0.016529115,"about_ca_topic_score_gemma":0.01803153,"teacher_disagreement_score":0.016529115,"about_ca_system_score_codex":0.0006874275,"about_ca_system_score_gemma":0.0014601676,"threshold_uncertainty_score":0.032865822},"labels":[],"label_agreement":null},{"id":"W4399999954","doi":"10.1016/j.cor.2024.106751","title":"Learning tabu search algorithms: A scheduling application","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Institut de Valorisation des Données; Canada First Research Excellence Fund","keywords":"Tabu search; Metaheuristic; Guided Local Search; Computer science; Mathematical optimization; Algorithm; Search algorithm; Scheduling (production processes); Hill climbing; Parallel metaheuristic; Combinatorial optimization; Machine learning; Artificial intelligence; Mathematics","score_opus":0.2661410071844727,"score_gpt":0.5149645061832497,"score_spread":0.24882349899877704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399999954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053160805,0.0013812543,0.9321579,0.0012182565,0.0002511845,0.00019513175,0.0004729835,0.0045844293,0.006578174],"genre_scores_gemma":[0.27401087,0.0007943234,0.71667486,0.00037997207,0.0002344156,0.0003878697,0.0007102114,0.00055879046,0.0062487284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994454,0.00024429112,0.000023398832,0.00012464586,0.00011483255,0.000047480007],"domain_scores_gemma":[0.9937384,0.005178468,0.00016031858,0.0002411347,0.00057679723,0.00010487062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021077893,0.00094161415,0.0011875022,0.0011388661,0.0008569787,0.0010552288,0.0017067159,0.0021137714,0.00885843],"category_scores_gemma":[0.012348702,0.00067228265,0.0007014441,0.0029504152,0.00056635396,0.0014591564,0.00086787064,0.0017325265,0.0011121877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019685087,0.00034672345,0.0009362275,0.00019852066,0.00007600033,0.000049527036,0.000100487996,0.66123885,0.0007875758,0.0065915254,0.009077413,0.3204003],"study_design_scores_gemma":[0.000045769357,0.000035639092,0.00009617765,0.0000071457594,0.0000082823035,0.0000091397915,0.000014615614,0.99314755,0.00030232992,0.005581204,0.00074792275,0.000004184625],"about_ca_topic_score_codex":0.015104388,"about_ca_topic_score_gemma":0.01237029,"teacher_disagreement_score":0.015104388,"about_ca_system_score_codex":0.0013650372,"about_ca_system_score_gemma":0.0020484037,"threshold_uncertainty_score":0.030032933},"labels":[],"label_agreement":null},{"id":"W4400005792","doi":"10.1007/s11750-024-00678-8","title":"Gaining insight into crew rostering instances through ML-based sequential assignment","year":2024,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Crew; Operations research; Mathematical optimization; Mathematics; Aeronautics; Engineering","score_opus":0.20289949668711652,"score_gpt":0.4339951749443921,"score_spread":0.2310956782572756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400005792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050211057,0.00016837714,0.9400388,0.0003957369,0.000046050805,0.00010693765,0.00042621745,0.0009613931,0.007645507],"genre_scores_gemma":[0.4802414,0.00016257718,0.5138103,0.00020451206,0.00007359331,0.00015951325,0.00094265037,0.00040621453,0.0039992994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992181,0.00026446042,0.000027494038,0.0001635834,0.000204632,0.00012165764],"domain_scores_gemma":[0.99631244,0.0026272722,0.00027623895,0.00028555482,0.00036266886,0.00013580002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011889095,0.00086283014,0.00086604414,0.0010444805,0.0005874388,0.001454774,0.0014368363,0.00078657834,0.010182222],"category_scores_gemma":[0.0076855016,0.0006394095,0.0007890858,0.0012646448,0.0005623788,0.002255377,0.0013005103,0.0015219331,0.0008896387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020091691,0.00018036716,0.0011668297,0.00016966808,0.000029741814,0.000060214457,0.00011440129,0.88431156,0.0024369129,0.012168314,0.0033511901,0.0958099],"study_design_scores_gemma":[0.000008264925,0.000021992497,0.00012285115,0.000007809694,0.0000047663593,0.000008071167,0.000028801518,0.9920993,0.00043269634,0.006694677,0.0005682254,0.0000025864942],"about_ca_topic_score_codex":0.0067978282,"about_ca_topic_score_gemma":0.011617039,"teacher_disagreement_score":0.010182222,"about_ca_system_score_codex":0.0009859251,"about_ca_system_score_gemma":0.0018939927,"threshold_uncertainty_score":0.03406298},"labels":[],"label_agreement":null},{"id":"W4400544896","doi":"10.7769/gesec.v15i7.4004","title":"Uma nova abordagem para a heurística Fix-and-optimize aplicada à escala de professores do ensino médio","year":2024,"lang":"pt","type":"article","venue":"Revista de Gestão e Secretariado (Management and Administrative Professional Review)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Humanities; Physics; Computer science; Philosophy","score_opus":0.1296300266126543,"score_gpt":0.43896309061211336,"score_spread":0.30933306399945903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400544896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020129804,0.0011585102,0.94812083,0.003381325,0.00060548354,0.00053948484,0.00025110014,0.0018330496,0.023980381],"genre_scores_gemma":[0.14833213,0.0012231193,0.820282,0.0011152806,0.00027082663,0.0006322129,0.00043455226,0.0007205007,0.026989348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953053,0.0018011566,0.00023383796,0.0008398412,0.0011795893,0.00064027985],"domain_scores_gemma":[0.9951579,0.0017394667,0.00040117785,0.0010850381,0.0012167366,0.00039964085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036765274,0.0019364485,0.0013250307,0.0017513793,0.0032022884,0.0052162125,0.0033144194,0.0027184957,0.017771615],"category_scores_gemma":[0.013613778,0.0010544383,0.0019797883,0.0025048126,0.0018443142,0.0038581186,0.002872371,0.0043430026,0.0033659409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006412915,0.00078147464,0.0070518227,0.0014581627,0.00041285143,0.0006624713,0.0029633003,0.21181734,0.014085993,0.21573566,0.044804826,0.4995849],"study_design_scores_gemma":[0.00036223597,0.0008516598,0.003674978,0.0004047263,0.0004559824,0.0009522332,0.0022807992,0.5549428,0.014916291,0.13460205,0.28630215,0.00025418858],"about_ca_topic_score_codex":0.012686129,"about_ca_topic_score_gemma":0.029444646,"teacher_disagreement_score":0.017771615,"about_ca_system_score_codex":0.0034767832,"about_ca_system_score_gemma":0.0052837115,"threshold_uncertainty_score":0.059451938},"labels":[],"label_agreement":null},{"id":"W4401467860","doi":"10.62051/bsn66s98","title":"Warehousing Cost Optimization in the Restaurant Brands International (Canada) Inc.","year":2024,"lang":"en","type":"article","venue":"Transactions on Economics Business and Management Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Salary; Integer programming; Business; Scheduling (production processes); Operations research; Labor cost; Operations management; Computer science; Marketing; Economics; Engineering","score_opus":0.16924202536082492,"score_gpt":0.4030229550701086,"score_spread":0.23378092970928369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401467860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8136821,0.0013405646,0.1627395,0.0018824518,0.000062155195,0.00031501017,0.0011319728,0.00043719297,0.01840912],"genre_scores_gemma":[0.94403,0.000485275,0.049073197,0.00008945023,0.000014568411,0.00008477164,0.00035691587,0.00005054666,0.005815406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9994636,0.00014571329,0.000015976826,0.00008118221,0.00014219267,0.00015140085],"domain_scores_gemma":[0.9995585,0.00025654692,0.0000421219,0.000020249494,0.00007563418,0.000046812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093575526,0.0007345743,0.00055575586,0.0005508478,0.0007541451,0.001650861,0.0006248132,0.00063031673,0.0015533793],"category_scores_gemma":[0.0011018699,0.00045697278,0.0006910817,0.0009536957,0.00039364517,0.00073210284,0.00042317036,0.000747115,0.00010881076],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063479936,0.00007373986,0.0011573613,0.000054283504,0.00002061932,0.00003493014,0.00004421896,0.97734183,0.0007719087,0.0038724807,0.0012007604,0.015364309],"study_design_scores_gemma":[0.000010416567,0.000046343186,0.0009136866,0.0000066206676,0.0000128077345,0.000006649579,0.00009233281,0.9966446,0.00052181556,0.00096636836,0.00077046634,0.000007900714],"about_ca_topic_score_codex":0.41319895,"about_ca_topic_score_gemma":0.4181366,"teacher_disagreement_score":0.58680105,"about_ca_system_score_codex":0.0072339587,"about_ca_system_score_gemma":0.011176266,"threshold_uncertainty_score":0.82158774},"labels":[],"label_agreement":null},{"id":"W4401865059","doi":"10.5430/jnep.v14n12p45","title":"Nurse faculty shortage problem and a grant solution to the problem","year":2024,"lang":"en","type":"article","venue":"Journal of Nursing Education and Practice","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Health Resources and Services Administration; U.S. Department of Health and Human Services","keywords":"Economic shortage; Nursing; Nursing shortage; Medicine; Nurse education; Philosophy","score_opus":0.24175268223124677,"score_gpt":0.5140446275435226,"score_spread":0.27229194531227585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401865059","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004199079,0.0025025948,0.0028952293,0.9585261,0.01578822,0.00009344144,0.00008504696,0.00024839825,0.015661906],"genre_scores_gemma":[0.20585762,0.019907752,0.03404209,0.53663045,0.03706806,0.0012132947,0.0008694108,0.00074801414,0.16366343],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836769,0.004499462,0.0013367973,0.0018050248,0.0054733674,0.0032083453],"domain_scores_gemma":[0.95137227,0.007582006,0.0029465165,0.0017214929,0.013542005,0.022835609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020404235,0.0013165246,0.00065357663,0.0026683728,0.009960146,0.010298235,0.005809832,0.018952804,0.039248697],"category_scores_gemma":[0.064638466,0.00073942216,0.0011193723,0.0030736262,0.0060175667,0.015581124,0.016321193,0.016652713,0.007083374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004230263,0.00034142745,0.004590419,0.0004420952,0.000030938172,0.0016321004,0.001776762,0.0006803578,0.00027569133,0.049331326,0.8200487,0.120807976],"study_design_scores_gemma":[0.00009945533,0.00026125685,0.0036852034,0.0011955667,0.000030192301,0.0027539437,0.012213758,0.0012606843,0.0003150088,0.042505678,0.9355679,0.000111287634],"about_ca_topic_score_codex":0.0096338065,"about_ca_topic_score_gemma":0.011230462,"teacher_disagreement_score":0.039248697,"about_ca_system_score_codex":0.005864582,"about_ca_system_score_gemma":0.04366247,"threshold_uncertainty_score":0.13129997},"labels":[],"label_agreement":null},{"id":"W4402995528","doi":"10.1007/s41870-024-02196-z","title":"Modified simulated annealing for university teacher course assignment considering socio-cultural constraints","year":2024,"lang":"en","type":"article","venue":"International Journal of Information Technology","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Computer science; Simulated annealing; Course (navigation); Multimedia; Simulation; Machine learning; Aerospace engineering","score_opus":0.06665464092292153,"score_gpt":0.3833293872664327,"score_spread":0.3166747463435111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402995528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19164705,0.00067312096,0.79221725,0.0007203632,0.00023537985,0.00035081626,0.00031557013,0.0006158351,0.013224531],"genre_scores_gemma":[0.80403715,0.00020303462,0.18799026,0.00012612923,0.00006017504,0.00047069378,0.00023409938,0.0001536805,0.0067247823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992636,0.00041557392,0.000016989703,0.00009733508,0.00007382913,0.00013255612],"domain_scores_gemma":[0.9979068,0.0016197391,0.00011175139,0.000090541245,0.00016062836,0.00011065029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010625483,0.00069546205,0.0019341029,0.0008683648,0.0008560842,0.0009981309,0.0018673029,0.0018715443,0.006282807],"category_scores_gemma":[0.0033411025,0.00091560284,0.0015318694,0.0009433842,0.0007185469,0.000734797,0.000894966,0.0011564933,0.0003621912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006092998,0.000033519787,0.00016650383,0.000021195452,0.000021411128,0.000021532785,0.00002558311,0.99256027,0.00027836984,0.0014396389,0.0003614128,0.0050097588],"study_design_scores_gemma":[0.000014451226,0.00002241473,0.000104410654,0.0000023957434,0.000007177877,0.00000294171,0.000008868728,0.9987947,0.00006952225,0.00079362415,0.00017698981,0.0000026496646],"about_ca_topic_score_codex":0.029981853,"about_ca_topic_score_gemma":0.0214848,"teacher_disagreement_score":0.029981853,"about_ca_system_score_codex":0.001975857,"about_ca_system_score_gemma":0.0029665737,"threshold_uncertainty_score":0.05961466},"labels":[],"label_agreement":null},{"id":"W4403913260","doi":"10.1016/j.heliyon.2024.e39694","title":"A scheduling perspective on modular educational systems in Europe","year":2024,"lang":"en","type":"article","venue":"Heliyon","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"Gesellschaft für Forschungsförderung Niederösterreich","keywords":"Modular design; Perspective (graphical); Scheduling (production processes); Engineering ethics; Computer science; Management science; Engineering management; Engineering; Operations management; Artificial intelligence; Programming language","score_opus":0.10010676431493881,"score_gpt":0.40556537206932936,"score_spread":0.30545860775439054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403913260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47840458,0.0023540528,0.3029396,0.0048680613,0.0001203838,0.00010737239,0.00012511059,0.00011712603,0.21096382],"genre_scores_gemma":[0.97156864,0.0005165397,0.023793388,0.0001769377,0.000022162914,0.00004363086,0.000046566154,0.00001486535,0.0038172572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982377,0.0009526526,0.00012634414,0.00020621132,0.00017177919,0.0003051372],"domain_scores_gemma":[0.998596,0.0007654203,0.00024850815,0.000107177635,0.00013417267,0.00014870438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066882,0.0003501921,0.00017785991,0.0012552865,0.0015562093,0.0032954155,0.00054723537,0.0008816183,0.0021554006],"category_scores_gemma":[0.0023401403,0.00019929465,0.00040869229,0.0018493965,0.0040701707,0.003286452,0.0015721769,0.0007096755,0.00012686121],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025737112,0.00003100175,0.0019800204,0.000050083527,0.000008879982,0.00013793232,0.005623363,0.015571074,0.0005564576,0.9586806,0.0004988539,0.016835991],"study_design_scores_gemma":[0.00006596961,0.00018859925,0.014946834,0.00033349136,0.00003265393,0.000397393,0.017439459,0.037984848,0.002457757,0.7658984,0.16018884,0.00006561404],"about_ca_topic_score_codex":0.0076117064,"about_ca_topic_score_gemma":0.004732433,"teacher_disagreement_score":0.0076117064,"about_ca_system_score_codex":0.004195754,"about_ca_system_score_gemma":0.0019911304,"threshold_uncertainty_score":0.030442417},"labels":[],"label_agreement":null},{"id":"W4404375524","doi":"10.1007/s10729-024-09692-5","title":"A reinforcement learning approach for the online dynamic home health care scheduling problem","year":2024,"lang":"en","type":"article","venue":"Health Care Management Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Health informatics; Reinforcement learning; Health administration; Computer science; Scheduling (production processes); Health care; Health care management; Public health; Nursing; Medicine; Artificial intelligence; Operations management; Engineering; Economics","score_opus":0.0678228919818413,"score_gpt":0.4161921797689222,"score_spread":0.3483692877870809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404375524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021632394,0.00023287919,0.9731599,0.0005585554,0.00006386685,0.0000833158,0.00006715356,0.00019671157,0.00400526],"genre_scores_gemma":[0.79773355,0.0003066485,0.19428954,0.00028228053,0.00017467658,0.00031566902,0.00016234357,0.000091775124,0.00664345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935,0.0002890923,0.0000242327,0.00011742585,0.000120838566,0.000098475],"domain_scores_gemma":[0.9973826,0.0020714873,0.0001401428,0.000053937907,0.0002111958,0.00014061967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016528575,0.0007405688,0.0015824843,0.00058541965,0.0004681364,0.0008485395,0.0017751169,0.0015282255,0.004883482],"category_scores_gemma":[0.0046140724,0.0005249585,0.0006241011,0.0005526506,0.0009182412,0.0010083555,0.0011179663,0.001737213,0.00030045875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048733167,0.00008446838,0.00023770468,0.0000355705,0.000021392461,0.000027823811,0.00002341099,0.9761627,0.00017279468,0.00727557,0.0006196584,0.0152902305],"study_design_scores_gemma":[0.000011684533,0.0000110487545,0.000025929205,0.0000022595189,0.0000026711025,0.000002475127,0.000002517108,0.99733424,0.000022922126,0.0024923056,0.00009017753,0.0000017999978],"about_ca_topic_score_codex":0.014695946,"about_ca_topic_score_gemma":0.009773233,"teacher_disagreement_score":0.014695946,"about_ca_system_score_codex":0.0013376138,"about_ca_system_score_gemma":0.002082057,"threshold_uncertainty_score":0.02922082},"labels":[],"label_agreement":null},{"id":"W4405133505","doi":"10.1016/j.eswa.2024.125915","title":"Personnel scheduling problem for ready-mixed concrete delivery","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Center for Interuniversity Research and Analysis on Organizations; Global Affairs Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Operations research; Mathematical optimization; Operating system; Schedule; Mathematics","score_opus":0.09929024395607605,"score_gpt":0.368135883397784,"score_spread":0.268845639441708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405133505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20684715,0.001062275,0.76136893,0.0016894613,0.00040316777,0.0007945435,0.0019728008,0.00051016436,0.025351569],"genre_scores_gemma":[0.72927237,0.00091863616,0.25214654,0.00021679679,0.00023964011,0.0006249416,0.0019797604,0.0002397368,0.014361527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00041972386,0.000052209456,0.0001876033,0.00018265832,0.00018935006],"domain_scores_gemma":[0.9990664,0.00056312693,0.00013938302,0.00003931632,0.000084330706,0.00010749853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015327849,0.0012805948,0.001229372,0.00071279745,0.0007455571,0.0014230208,0.0015130413,0.0016852723,0.0082233865],"category_scores_gemma":[0.0022522449,0.00067109487,0.0014868092,0.00092884357,0.0005685694,0.0011386079,0.0007976176,0.0013586617,0.0006845731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019646369,0.00017483126,0.00090073346,0.0003050886,0.0000801948,0.0003312343,0.00010730554,0.9519865,0.0021631615,0.016143618,0.004009985,0.023600833],"study_design_scores_gemma":[0.00012359773,0.00023466858,0.0008290995,0.00004000404,0.000043367236,0.00017689994,0.00020946152,0.97570634,0.0014037787,0.013259838,0.007939553,0.000033445547],"about_ca_topic_score_codex":0.008201141,"about_ca_topic_score_gemma":0.006204755,"teacher_disagreement_score":0.0082233865,"about_ca_system_score_codex":0.0015256505,"about_ca_system_score_gemma":0.0026876058,"threshold_uncertainty_score":0.027509987},"labels":[],"label_agreement":null},{"id":"W4405639190","doi":"10.1145/3709013","title":"Data Mining-Driven Shift Enumeration for Accelerating the Solution of Large-Scale Personnel Scheduling Problems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Scheduling (production processes); Scale (ratio); Computer science; Operations research; Operations management; Engineering; Mathematics; Geography; Cartography","score_opus":0.11201870965983116,"score_gpt":0.3617451143697751,"score_spread":0.24972640470994392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405639190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13211381,0.00093404285,0.8574968,0.00092034525,0.00021696043,0.00035865686,0.00078377617,0.0024479215,0.0047276965],"genre_scores_gemma":[0.28249246,0.00025234724,0.71405554,0.00017371721,0.00005166864,0.0002724168,0.001363708,0.00016028018,0.0011777938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994155,0.00019164715,0.0000388335,0.00013232237,0.00013609207,0.0000856474],"domain_scores_gemma":[0.9986137,0.00077994366,0.00014908842,0.00012788098,0.00022483166,0.0001045341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012167153,0.0012065363,0.0009333832,0.0010577132,0.00059046695,0.0008199794,0.0013445575,0.0008311717,0.002718334],"category_scores_gemma":[0.0036123951,0.00060943654,0.0013100829,0.0013755516,0.0003785365,0.0010367093,0.00088388816,0.0015257028,0.0005564661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001682121,0.0003575639,0.002898036,0.00029869573,0.0000814829,0.00011361141,0.0001273214,0.8586963,0.003629577,0.0051188488,0.00336914,0.12514126],"study_design_scores_gemma":[0.00002897266,0.000043695578,0.00021286582,0.000009625899,0.0000091569,0.000016256576,0.00005035647,0.9948566,0.0009171919,0.002844701,0.0010064567,0.0000040756836],"about_ca_topic_score_codex":0.006478704,"about_ca_topic_score_gemma":0.0074613146,"teacher_disagreement_score":0.006478704,"about_ca_system_score_codex":0.00072879175,"about_ca_system_score_gemma":0.002183859,"threshold_uncertainty_score":0.012881994},"labels":[],"label_agreement":null},{"id":"W4406011513","doi":"10.1007/978-3-031-75623-8_12","title":"An Imitation-Based Learning Approach Using DAgger for the Casual Employee Call Timing Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Casual; Dagger; Computer science; Imitation; Artificial intelligence; Psychology","score_opus":0.14996482727276603,"score_gpt":0.387215227889825,"score_spread":0.23725040061705896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406011513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021790832,0.00049625157,0.97419477,0.00044105505,0.00009211937,0.00006272303,0.00009643593,0.0006987208,0.0021270656],"genre_scores_gemma":[0.6461624,0.00048670737,0.34143972,0.0003994895,0.00017466824,0.00035355552,0.00047460102,0.00034858388,0.010160311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.0003662878,0.000042601256,0.00020869424,0.00009703804,0.00013404948],"domain_scores_gemma":[0.9926352,0.0064140973,0.00019466605,0.00023824023,0.00029055713,0.00022728533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002771909,0.0010132998,0.0031245616,0.0012284752,0.0008318396,0.0011610438,0.0035731753,0.0025261801,0.006089799],"category_scores_gemma":[0.008387375,0.0009463621,0.0012944229,0.0017181516,0.0012366376,0.002386738,0.0021995667,0.003058068,0.0005798919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009097178,0.00010239085,0.0004195701,0.00006524765,0.000045598274,0.000042109135,0.000038354556,0.93466353,0.0002589245,0.01008645,0.0011764913,0.05301037],"study_design_scores_gemma":[0.000006528989,0.000008221866,0.000023256805,0.0000020243192,0.0000030611673,0.0000030412637,0.0000027237024,0.9942509,0.000037063182,0.0055849906,0.00007564538,0.000002593105],"about_ca_topic_score_codex":0.0133080315,"about_ca_topic_score_gemma":0.012416117,"teacher_disagreement_score":0.0133080315,"about_ca_system_score_codex":0.0015597051,"about_ca_system_score_gemma":0.0025028368,"threshold_uncertainty_score":0.026461124},"labels":[],"label_agreement":null},{"id":"W4406141787","doi":"10.1137/1.9781611978322.34","title":"Approximating Traveling Salesman Problems Using a Bridge Lemma","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Travelling salesman problem; Lemma (botany); Bridge (graph theory); Computer science; Mathematics; Mathematical optimization; Biology; Botany; Anatomy","score_opus":0.3603334120662399,"score_gpt":0.3621988861380646,"score_spread":0.001865474071824691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406141787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02072541,0.0011941757,0.96066487,0.00047636603,0.00023299012,0.000089825524,0.00016774019,0.0009539476,0.015494637],"genre_scores_gemma":[0.20517582,0.0012183014,0.77879256,0.00035736567,0.00017065504,0.00036433327,0.0010917576,0.00055574963,0.012273572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988059,0.0003347391,0.000055417648,0.00016004463,0.00044698393,0.00019695889],"domain_scores_gemma":[0.9974988,0.0015321373,0.00010166711,0.0004134205,0.0003428792,0.000111142406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019555534,0.0012450549,0.0012200251,0.0015482119,0.0006886442,0.0016584947,0.0025291257,0.0013160701,0.010915422],"category_scores_gemma":[0.0075715063,0.0006058343,0.0016006038,0.002054016,0.0007719601,0.0038333808,0.002465716,0.0028458461,0.0025620551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025282218,0.00033582348,0.0010847707,0.00023770714,0.00010774016,0.00016822171,0.0002564988,0.536492,0.0038158575,0.21830243,0.01970428,0.21924175],"study_design_scores_gemma":[0.000020551986,0.000048709288,0.00008668419,0.000022358596,0.000013337934,0.000039517938,0.000033135315,0.962008,0.00053189124,0.032178685,0.0050098533,0.000007269622],"about_ca_topic_score_codex":0.005718799,"about_ca_topic_score_gemma":0.0063481275,"teacher_disagreement_score":0.010915422,"about_ca_system_score_codex":0.0016805625,"about_ca_system_score_gemma":0.0013385918,"threshold_uncertainty_score":0.036515772},"labels":[],"label_agreement":null},{"id":"W4406819681","doi":"10.1007/978-3-031-81455-6_18","title":"On Solving the Physicians Scheduling Problem at an Emergency Department: A Case Study from Canada","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Emergency department; Scheduling (production processes); Operations research; Computer science; Medical emergency; Operations management; Medicine; Engineering; Nursing","score_opus":0.09052007791210864,"score_gpt":0.36514774189895516,"score_spread":0.2746276639868465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406819681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7392756,0.004759843,0.024787227,0.012045052,0.00039955665,0.00076717546,0.00085857656,0.00044295273,0.21666396],"genre_scores_gemma":[0.81319237,0.00540847,0.059746657,0.0012700307,0.000108039014,0.00013524946,0.0009647466,0.00027312856,0.11890129],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993235,0.00011323967,0.000017405759,0.00005458238,0.00019315253,0.00029826743],"domain_scores_gemma":[0.9988674,0.0005532786,0.00003179018,0.000021062282,0.00029394397,0.00023254765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007477254,0.0007214913,0.0004579585,0.0008579199,0.0065308567,0.0019434902,0.001386812,0.00217915,0.005293957],"category_scores_gemma":[0.0027925358,0.00030646974,0.0005215376,0.0025985145,0.0010941718,0.00053805433,0.0007503365,0.0011290234,0.00047494774],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069219916,0.0018643735,0.03177746,0.001050632,0.00013163264,0.018695915,0.01645019,0.24803486,0.006489238,0.055106834,0.18694808,0.4327587],"study_design_scores_gemma":[0.0005058889,0.0009819873,0.049397387,0.0005012507,0.00017465271,0.004202763,0.1042234,0.34425986,0.006483373,0.02192647,0.46711624,0.000226671],"about_ca_topic_score_codex":0.93359774,"about_ca_topic_score_gemma":0.9720329,"teacher_disagreement_score":0.06640226,"about_ca_system_score_codex":0.013135123,"about_ca_system_score_gemma":0.025063097,"threshold_uncertainty_score":0.13358659},"labels":[],"label_agreement":null},{"id":"W4407182862","doi":"10.21203/rs.3.rs-5927527/v1","title":"Evolutionary Algorithms for Physician Scheduling Problem with Emphasis on Workload Balancing","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"Alliance de recherche numérique du Canada","keywords":"Workload; Emphasis (telecommunications); Computer science; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Mathematics; Computer network","score_opus":0.22555632032374828,"score_gpt":0.4950554617363592,"score_spread":0.26949914141261094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407182862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047322903,0.0006577871,0.9403524,0.0008800552,0.00011730516,0.00011222592,0.00008522647,0.00011570611,0.010356435],"genre_scores_gemma":[0.54142743,0.00081358093,0.44335672,0.00033402766,0.00019032015,0.00037870946,0.00021084427,0.00009736263,0.013190927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996985,0.00013599657,0.000009428282,0.000045215158,0.000061939456,0.000048913727],"domain_scores_gemma":[0.99923086,0.0005542365,0.000052913743,0.000028145541,0.00009016971,0.00004369801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009034063,0.00051417114,0.0006565264,0.00095628476,0.00051878736,0.00077802927,0.0009337767,0.0015280684,0.003785319],"category_scores_gemma":[0.0031725862,0.00035811763,0.0006225351,0.0009391213,0.00045496557,0.00059475057,0.00067068596,0.0009452065,0.00025097447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003189806,0.000047308422,0.0004443916,0.000038978356,0.000023031536,0.00003409923,0.000041161307,0.95078945,0.000519435,0.013531541,0.001096164,0.033402532],"study_design_scores_gemma":[0.000011586078,0.000015904305,0.00012374378,0.0000068298755,0.00000578886,0.000012901115,0.000010579085,0.9951662,0.00009183912,0.0041432893,0.00040930294,0.0000020706236],"about_ca_topic_score_codex":0.006218684,"about_ca_topic_score_gemma":0.003767781,"teacher_disagreement_score":0.006218684,"about_ca_system_score_codex":0.00081232795,"about_ca_system_score_gemma":0.0011651536,"threshold_uncertainty_score":0.012663126},"labels":[],"label_agreement":null},{"id":"W4407359792","doi":"10.11834/jig.230541","title":"Co-history： learning with noisy labels by co-teaching with history losses","year":2024,"lang":"en","type":"article","venue":"Journal of Image and Graphics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Mathematics education; Psychology","score_opus":0.054231490959092014,"score_gpt":0.34731746689908577,"score_spread":0.29308597593999375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407359792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18948916,0.002340088,0.43421888,0.028508734,0.0009178182,0.0002420885,0.00031808522,0.0010483363,0.34291682],"genre_scores_gemma":[0.93632054,0.00050128205,0.033585504,0.00073473353,0.00017963546,0.00015117865,0.000087525535,0.00013575239,0.028303908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682474,0.0015542718,0.00011607329,0.00058217143,0.00068944227,0.00023322894],"domain_scores_gemma":[0.9907804,0.0056275413,0.0006769721,0.001167504,0.0012116479,0.00053580635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004420275,0.00051957916,0.00053194375,0.001456993,0.0025883582,0.005528025,0.0010359214,0.0012353626,0.01022641],"category_scores_gemma":[0.017674822,0.00037139235,0.00042693372,0.0015866049,0.007352286,0.014073668,0.0035940926,0.0030173857,0.0010825038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081981474,0.00007994578,0.0044732033,0.00015045576,0.00004930129,0.00013899895,0.011285416,0.0074007297,0.0009386802,0.8748433,0.0056980955,0.09485985],"study_design_scores_gemma":[0.000030305197,0.000049905484,0.0023769338,0.000096685,0.000035283112,0.000105661595,0.0057496466,0.021763183,0.002180096,0.9345526,0.033012114,0.000047606154],"about_ca_topic_score_codex":0.005410396,"about_ca_topic_score_gemma":0.0048152837,"teacher_disagreement_score":0.01022641,"about_ca_system_score_codex":0.0036035704,"about_ca_system_score_gemma":0.0036019257,"threshold_uncertainty_score":0.03421074},"labels":[],"label_agreement":null},{"id":"W4408020775","doi":"10.1016/j.cor.2025.107030","title":"Feasible and infeasible region search for the maximally diverse grouping problem","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Tabu search; Mathematics","score_opus":0.4141977771985357,"score_gpt":0.5103312919633891,"score_spread":0.09613351476485343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408020775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09585577,0.0010103389,0.88539016,0.0006515889,0.00005504851,0.0002396184,0.00047022104,0.00027290327,0.01605432],"genre_scores_gemma":[0.42855746,0.00058041257,0.5625067,0.00016744218,0.000065555105,0.00036974277,0.00079054304,0.0001732026,0.006789057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877816,0.0006954189,0.000035502046,0.00013874992,0.00021296962,0.00013920375],"domain_scores_gemma":[0.9972523,0.002130225,0.00023028975,0.00010079168,0.00016648813,0.00011993634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023902217,0.00083620386,0.0014017452,0.001457546,0.0007372195,0.0013134574,0.0013079267,0.0016649503,0.0047207098],"category_scores_gemma":[0.007772316,0.0007731203,0.0011932406,0.0015017871,0.0009767928,0.0018006542,0.0014365894,0.0014481306,0.0004200201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002897398,0.00015892656,0.00046160133,0.00017818937,0.00005623637,0.00009676787,0.00010672898,0.9145406,0.001047809,0.04057141,0.0027581935,0.039733756],"study_design_scores_gemma":[0.00006325476,0.00009910069,0.00020818376,0.000032764445,0.000017910561,0.000039038387,0.00004898986,0.96197826,0.00040290484,0.03607677,0.0010197135,0.000013069313],"about_ca_topic_score_codex":0.0048230523,"about_ca_topic_score_gemma":0.003960069,"teacher_disagreement_score":0.0048230523,"about_ca_system_score_codex":0.0009565536,"about_ca_system_score_gemma":0.0017308911,"threshold_uncertainty_score":0.01579237},"labels":[],"label_agreement":null},{"id":"W4408224736","doi":"10.2196/67747","title":"Integrating Nurse Preferences Into AI-Based Scheduling Systems: Qualitative Study","year":2025,"lang":"en","type":"article","venue":"JMIR Formative Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Preprint; Qualitative research; Computer science; Psychology; Operations research; Nursing; Medicine; Engineering; World Wide Web; Sociology","score_opus":0.26030973158322257,"score_gpt":0.5887629328180152,"score_spread":0.3284532012347926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408224736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868385,0.0007333581,0.0046552015,0.0020586974,0.000061032737,0.00043016515,0.00022368408,0.000017485505,0.0049817865],"genre_scores_gemma":[0.9938915,0.0008606463,0.0018447437,0.0006953453,0.000012281109,0.00057391135,0.000073403084,0.00002047145,0.002027718],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.986126,0.010861847,0.00036348033,0.0005254728,0.0010465063,0.0010767162],"domain_scores_gemma":[0.96747,0.026161645,0.001749867,0.00046714343,0.0025663811,0.0015849293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020452948,0.00042389566,0.0006827029,0.0011010057,0.0051707863,0.0026693565,0.0015047673,0.0009839695,0.0028784808],"category_scores_gemma":[0.029903557,0.00057454954,0.0003303533,0.001179942,0.0047420794,0.0027707918,0.0037608715,0.00211548,0.0003432226],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005184081,0.00006540755,0.004925203,0.00029271503,0.0000059310332,0.00057398115,0.98546547,0.00007508702,0.0006780158,0.00094548025,0.0004453288,0.006475542],"study_design_scores_gemma":[0.0000057927145,0.00006392683,0.0015180242,0.00021538818,0.0000032348428,0.00015816477,0.99298745,0.00017123019,0.00025595768,0.00029527943,0.0043136626,0.000011897218],"about_ca_topic_score_codex":0.007585999,"about_ca_topic_score_gemma":0.0116770575,"teacher_disagreement_score":0.020452948,"about_ca_system_score_codex":0.005574716,"about_ca_system_score_gemma":0.006422745,"threshold_uncertainty_score":0.108166814},"labels":[],"label_agreement":null},{"id":"W4408256336","doi":"10.5267/j.dsl.2024.12.009","title":"Dynamic multicriteria optimization for the nurse scheduling problem","year":2025,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Nacional de Colombia","keywords":"Mathematical optimization; Multi-objective optimization; Scheduling (production processes); Nurse scheduling problem; Computer science; Operations research; Management science; Operations management; Job shop scheduling; Engineering; Mathematics; Schedule; Flow shop scheduling","score_opus":0.0500320352390751,"score_gpt":0.41150355607621986,"score_spread":0.36147152083714473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408256336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023239847,0.00087355706,0.9658471,0.0005918228,0.0001051882,0.00020495003,0.00020127291,0.00012232013,0.008813884],"genre_scores_gemma":[0.6366343,0.0014557894,0.3477571,0.0002566414,0.00017607813,0.0011198294,0.0006514941,0.00015425755,0.011794532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806064,0.0010635332,0.00007360317,0.00030098288,0.00027140186,0.00022984447],"domain_scores_gemma":[0.9980983,0.0013788585,0.00023163338,0.00004253636,0.00016923904,0.000079402176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639483,0.0016766734,0.0016650916,0.0011137171,0.0006765191,0.0017162978,0.0013072467,0.0015002827,0.0040740594],"category_scores_gemma":[0.004461466,0.00072937994,0.001520927,0.0013294675,0.0007858561,0.0011389962,0.0012121969,0.0019990925,0.00046537226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030988744,0.000039606904,0.00019640855,0.000063724096,0.000031963653,0.000031951644,0.000030086983,0.9825278,0.00017587724,0.00984795,0.00043924656,0.0065843742],"study_design_scores_gemma":[0.000009934841,0.000026082373,0.00008518586,0.0000071988443,0.0000058690853,0.000007683693,0.000012196336,0.99501425,0.0000703881,0.0042194235,0.0005365815,0.0000052296296],"about_ca_topic_score_codex":0.011369585,"about_ca_topic_score_gemma":0.0088971695,"teacher_disagreement_score":0.011369585,"about_ca_system_score_codex":0.0029336403,"about_ca_system_score_gemma":0.002770847,"threshold_uncertainty_score":0.02260679},"labels":[],"label_agreement":null},{"id":"W4409361128","doi":"10.1609/aaai.v39i28.35265","title":"High School Course Scheduling: Student Preferences and Fairness Constraints (Student Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Course (navigation); Computer science; Scheduling (production processes); Mathematics education; Psychology; Operations management; Economics; Engineering","score_opus":0.15069941612155238,"score_gpt":0.417552881993605,"score_spread":0.2668534658720526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6798919,0.00010179254,0.2992834,0.0011800267,0.000049591505,0.000097868375,0.00022430813,0.00008954651,0.019081544],"genre_scores_gemma":[0.98815656,0.000021902213,0.010196001,0.00003343596,0.000009347181,0.0000223599,0.000031096624,0.0000070449187,0.0015224066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989052,0.0006786609,0.00003321027,0.00014104454,0.00010335389,0.0001385733],"domain_scores_gemma":[0.99669504,0.0021237663,0.00039173302,0.00020500625,0.00026394989,0.0003204179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022379723,0.0002157432,0.00022736267,0.00023342857,0.00048255367,0.0011744587,0.0005465416,0.00044336697,0.0045196726],"category_scores_gemma":[0.0067188516,0.0001424252,0.00026732168,0.0004356989,0.0005651275,0.0010639447,0.00052756065,0.0006581459,0.00017136015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006345073,0.00057350297,0.04243459,0.00010132674,0.00006620185,0.00023497356,0.0006238944,0.67131424,0.0033517582,0.17946841,0.0055046543,0.095691904],"study_design_scores_gemma":[0.000043550306,0.00021190716,0.008261689,0.000016458605,0.000024162193,0.00006662475,0.0004980837,0.9201893,0.0016644447,0.06566704,0.003332587,0.000024170582],"about_ca_topic_score_codex":0.0045248605,"about_ca_topic_score_gemma":0.0064528366,"teacher_disagreement_score":0.0045248605,"about_ca_system_score_codex":0.0011452226,"about_ca_system_score_gemma":0.001077227,"threshold_uncertainty_score":0.015119791},"labels":[],"label_agreement":null},{"id":"W4409580902","doi":"10.61091/jcmcc127a-087","title":"Research on Teaching Resource Allocation Model Based on Optimization Algorithm in Higher Vocational Education","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vocational education; Resource allocation; Computer science; Resource (disambiguation); Mathematics education; Operations research; Psychology; Engineering; Pedagogy; Computer network","score_opus":0.09620473649479873,"score_gpt":0.4120094258202682,"score_spread":0.3158046893254695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409580902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022805652,0.00046935197,0.969842,0.0002866296,0.000056076096,0.000097389115,0.000045379427,0.0001799281,0.006217578],"genre_scores_gemma":[0.7439325,0.0017581559,0.24139072,0.00016058184,0.00008854287,0.0007210526,0.00030724736,0.00010566717,0.011535631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992073,0.00026361,0.00003492393,0.00017633564,0.00020802954,0.00010990985],"domain_scores_gemma":[0.9996598,0.00015860995,0.000040362327,0.000014831077,0.000096268435,0.000030145116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937403,0.00092934736,0.001276209,0.00088894425,0.00074811705,0.0016966421,0.0013205733,0.0010097899,0.0027972164],"category_scores_gemma":[0.0014630591,0.0004814872,0.0010235884,0.0017862668,0.0005295587,0.0018405311,0.0007681311,0.001034247,0.0003218272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020811258,0.000037399685,0.0005292111,0.0000628442,0.000025727015,0.00002403991,0.00003540482,0.97117674,0.00049709703,0.008826482,0.00067157723,0.018092763],"study_design_scores_gemma":[0.0000051063903,0.000013093219,0.00009259049,0.000004617557,0.000005767583,0.0000057387124,0.000010992985,0.9972019,0.00013646636,0.002245124,0.0002747969,0.0000037957498],"about_ca_topic_score_codex":0.01347763,"about_ca_topic_score_gemma":0.0067570377,"teacher_disagreement_score":0.01347763,"about_ca_system_score_codex":0.0019643155,"about_ca_system_score_gemma":0.0031421878,"threshold_uncertainty_score":0.026798368},"labels":[],"label_agreement":null},{"id":"W4409791117","doi":"10.61091/jcmcc127a-453","title":"Mathematical model construction for time-optimized path planning and curriculum efficiency enhancement in study tours","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Path (computing); Curriculum; Computer science; Mathematics education; Operations research; Industrial engineering; Engineering; Mathematics; Sociology; Pedagogy; Programming language","score_opus":0.03531749339712789,"score_gpt":0.35420729255619143,"score_spread":0.31888979915906357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409791117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010760436,0.00023009238,0.979699,0.00024540763,0.000034888755,0.00007751356,0.00016535106,0.00012849057,0.0086587835],"genre_scores_gemma":[0.6078839,0.0020157874,0.37351286,0.00011196549,0.000058356673,0.0013972275,0.0007792615,0.00014780178,0.014092928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995826,0.00011741935,0.000020134421,0.00011044107,0.00010690603,0.00006249383],"domain_scores_gemma":[0.9995277,0.00022579069,0.000086744934,0.000025195679,0.000110688685,0.000023896935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069224444,0.00084485207,0.0005160885,0.0011682643,0.0007222084,0.0013843805,0.0012708851,0.0008423361,0.0056492323],"category_scores_gemma":[0.0019989223,0.0004578664,0.0012899443,0.0014026519,0.00057356496,0.0014742406,0.0010404701,0.0010703421,0.0005485378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001513649,0.000024229761,0.0007104892,0.00009396915,0.000012816498,0.000057566893,0.000093273455,0.9454176,0.0006593984,0.041047797,0.0009783764,0.010889308],"study_design_scores_gemma":[0.0000041235608,0.000016890175,0.0001565045,0.000009637434,0.000008299458,0.00002066213,0.000033425422,0.99155265,0.0001606806,0.0067095445,0.001320668,0.000006903438],"about_ca_topic_score_codex":0.020124905,"about_ca_topic_score_gemma":0.013399107,"teacher_disagreement_score":0.020124905,"about_ca_system_score_codex":0.001740382,"about_ca_system_score_gemma":0.0026221655,"threshold_uncertainty_score":0.04001552},"labels":[],"label_agreement":null},{"id":"W4410572358","doi":"10.1007/s10951-025-00844-1","title":"Learning to enumerate shifts for large-scale flexible personnel scheduling problems","year":2025,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Enumeration; Supply chain management; Scale (ratio); Operations research; Operations management; Supply chain; Mathematical optimization; Business; Mathematics; Engineering; Marketing","score_opus":0.07679868546407162,"score_gpt":0.3804134482776762,"score_spread":0.30361476281360456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410572358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11709232,0.00033282168,0.8745172,0.001231155,0.00013252565,0.0001784411,0.00029091552,0.0010862787,0.005138275],"genre_scores_gemma":[0.40100282,0.00030899706,0.5913161,0.00033411806,0.00014164737,0.0003730868,0.0010456946,0.00031102847,0.005166485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991928,0.00029719042,0.0000531137,0.00018637099,0.00014589682,0.00012462541],"domain_scores_gemma":[0.9893169,0.008912129,0.00038573955,0.0005135861,0.00054410344,0.0003274391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578488,0.0010949627,0.0010443188,0.00087297586,0.0006773669,0.00091112056,0.0015615255,0.0014690141,0.006631098],"category_scores_gemma":[0.01737594,0.00071497995,0.0011345893,0.00095173146,0.00082426454,0.0029864374,0.0019770241,0.0031978455,0.0007675414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031117618,0.0003128974,0.0024757027,0.0002455496,0.00005070988,0.00006195927,0.0002101303,0.76113963,0.0015736553,0.01677714,0.004597025,0.21224448],"study_design_scores_gemma":[0.000045229866,0.000058338475,0.00013408007,0.000020982492,0.000009897929,0.000011008817,0.00006213102,0.95736855,0.0004076327,0.04137063,0.00050630636,0.0000052727573],"about_ca_topic_score_codex":0.0042874343,"about_ca_topic_score_gemma":0.0073855286,"teacher_disagreement_score":0.006631098,"about_ca_system_score_codex":0.00089223,"about_ca_system_score_gemma":0.00229578,"threshold_uncertainty_score":0.02218324},"labels":[],"label_agreement":null},{"id":"W4414225942","doi":"10.1249/01.mss.0001157804.76706.0c","title":"Preliminary Assessment Of Initial Stay Times On Work Output For Moderate-Intensity Work In The Heat","year":2025,"lang":"en","type":"article","venue":"Medicine & Science in Sports & Exercise","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Work (physics); Morning; Duration (music); Core (optical fiber); Work hours; Volume (thermodynamics); Workload; Work time","score_opus":0.08537692161563563,"score_gpt":0.4238425011569056,"score_spread":0.33846557954126993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414225942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99785006,0.00011300092,0.00081929134,0.000011520157,0.000006846375,0.000062518455,0.00020384848,0.000011029839,0.0009218535],"genre_scores_gemma":[0.997672,0.00006624034,0.00074038794,0.000011933231,0.0000080218215,0.00009495306,0.00036617636,0.000009398184,0.0010308488],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996568,0.000076755976,0.000029354333,0.00006191572,0.000109623914,0.00006556733],"domain_scores_gemma":[0.99789774,0.0005860564,0.0004457202,0.0001235204,0.00045636107,0.00049063604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647919,0.00037109558,0.00024340059,0.0003135949,0.00028979787,0.0005289241,0.0003644575,0.00036276985,0.0031152274],"category_scores_gemma":[0.0025946752,0.00018894151,0.00035880654,0.00017391637,0.0001835065,0.00021749921,0.00046922176,0.00033996135,0.00048789222],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020618131,0.0021069886,0.7963615,0.00045776632,0.00019775202,0.00018348785,0.0022110224,0.00104512,0.115151845,0.0001909723,0.00057727186,0.060898148],"study_design_scores_gemma":[0.000012792003,0.00268569,0.9942715,0.000014334168,0.000021614263,0.00003421033,0.00020596791,0.00026775373,0.0021800136,0.0000214434,0.00027875855,0.000005863497],"about_ca_topic_score_codex":0.0017364044,"about_ca_topic_score_gemma":0.0031759525,"teacher_disagreement_score":0.0031152274,"about_ca_system_score_codex":0.00020048222,"about_ca_system_score_gemma":0.00025075726,"threshold_uncertainty_score":0.0104215145},"labels":[],"label_agreement":null},{"id":"W4414914302","doi":"","title":"A new paging problem for Mixture-of-Experts LLMs - extended version","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Paging; Competitive analysis; Demand paging; Variety (cybernetics); Online algorithm; Page fault","score_opus":0.04323994520009129,"score_gpt":0.32159745134512063,"score_spread":0.27835750614502935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414914302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14261122,0.0010211949,0.8472635,0.002496743,0.0001584538,0.00035301427,0.0006931507,0.0015541149,0.0038485003],"genre_scores_gemma":[0.65946907,0.00049397995,0.32660422,0.0010032735,0.00026806147,0.00048527747,0.001390519,0.00068335666,0.009602138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968268,0.001228527,0.00018603328,0.0009685843,0.00029779194,0.0004921666],"domain_scores_gemma":[0.9850462,0.01151165,0.00072705507,0.0014009896,0.00051942025,0.00079466024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039956034,0.0013718152,0.002772489,0.00083877944,0.0011554054,0.0026966648,0.0033815904,0.0029935974,0.007015143],"category_scores_gemma":[0.017908914,0.0012073697,0.0017849072,0.001227988,0.0016490835,0.0053442647,0.0029332375,0.003346159,0.0009330133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000864328,0.00032777875,0.0025964472,0.00038352347,0.00012959333,0.00030887607,0.00045870617,0.82367164,0.0029431593,0.061076015,0.010983963,0.09625591],"study_design_scores_gemma":[0.000054780012,0.00007626187,0.00019673177,0.000015956433,0.00002077835,0.00008362208,0.00005020869,0.947981,0.00085883145,0.0493434,0.0013001527,0.000018335048],"about_ca_topic_score_codex":0.0043994444,"about_ca_topic_score_gemma":0.004027953,"teacher_disagreement_score":0.007015143,"about_ca_system_score_codex":0.0021767179,"about_ca_system_score_gemma":0.002769107,"threshold_uncertainty_score":0.023467958},"labels":[],"label_agreement":null},{"id":"W4415974692","doi":"10.1016/j.procs.2025.09.181","title":"Improving Nurse Scheduling Using a Random Forest Algorithm to Predict Employee Well-Being","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Aluminium Refining, Degassing and Filtering (Canada); Group for Research in Decision Analysis; Université du Québec à Chicoutimi","funders":"Mitacs","keywords":"Random forest; Scheduling (production processes); Overtime; Work (physics); Linear programming; Job shop scheduling","score_opus":0.03274423289670193,"score_gpt":0.344962055914178,"score_spread":0.3122178230174761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415974692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09059623,0.0005680275,0.9057248,0.00025445878,0.00009211202,0.00009899175,0.00028559,0.0013363791,0.0010433674],"genre_scores_gemma":[0.6424698,0.00034351114,0.35386348,0.00015325747,0.000116557225,0.00018826377,0.0012362488,0.00012603441,0.0015028024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995085,0.0001712548,0.000025222167,0.00013634677,0.00007870725,0.00007992895],"domain_scores_gemma":[0.99865806,0.00087170344,0.00010939989,0.000052966643,0.00024734729,0.000060449955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598292,0.0008304312,0.0010001984,0.0008151947,0.00038351145,0.0004456029,0.00076773856,0.0005988237,0.0012273443],"category_scores_gemma":[0.0031053587,0.000351576,0.00078723894,0.0006340523,0.00014459727,0.00059812755,0.00032446155,0.0008153544,0.0004629741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025313764,0.0002689374,0.00828236,0.000069692825,0.00008484104,0.00005729687,0.000052790594,0.7799097,0.002458823,0.00080071075,0.0027064327,0.20505528],"study_design_scores_gemma":[0.000009792991,0.000038574035,0.0005336316,0.0000042399665,0.0000083678615,0.000008071635,0.0000056250733,0.998429,0.00027813384,0.00049271935,0.00018762756,0.0000041143867],"about_ca_topic_score_codex":0.017521668,"about_ca_topic_score_gemma":0.017348062,"teacher_disagreement_score":0.017521668,"about_ca_system_score_codex":0.0004718463,"about_ca_system_score_gemma":0.0014470366,"threshold_uncertainty_score":0.03483939},"labels":[],"label_agreement":null},{"id":"W4417179697","doi":"10.5539/jel.v15n3p24","title":"Class Timetable Allocation in Higher Education Using Binary Integer Programming: A Case Study in the Academic Department of Mathematics at a Public University in Paraná, Brazil","year":2025,"lang":"","type":"article","venue":"Journal of Education and Learning","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Graduate Education; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Distributive property; Higher education; Class (philosophy); Binary number; Heuristic; Integer programming; Function (biology); Public university","score_opus":0.15371864222857387,"score_gpt":0.42654665813601894,"score_spread":0.2728280159074451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417179697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9682689,0.00030233435,0.019919312,0.0007088022,0.000029953031,0.0001647833,0.00027112503,0.00007935548,0.0102555],"genre_scores_gemma":[0.9775914,0.0002138926,0.019571831,0.00004213583,0.000010864009,0.000064005086,0.00014727341,0.000024747567,0.0023337922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991399,0.00045949643,0.000022674372,0.00007915802,0.00010500694,0.00019370843],"domain_scores_gemma":[0.99771214,0.0017213165,0.00012761002,0.00007810866,0.00011181796,0.0002489813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779491,0.0005613145,0.00041535814,0.00055260793,0.0010886162,0.001242289,0.0011220344,0.0012310598,0.003323456],"category_scores_gemma":[0.0026818337,0.00028913855,0.0005234069,0.001317513,0.0006045907,0.000864189,0.000718577,0.0008094689,0.00020461222],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051329995,0.001638321,0.01195247,0.00042150065,0.000060062634,0.0032025415,0.0011210038,0.8921902,0.003233962,0.022903873,0.0037949877,0.058967818],"study_design_scores_gemma":[0.0001530736,0.0003657317,0.0070586917,0.00005666376,0.00004309025,0.00033918623,0.002812009,0.9736004,0.0022920172,0.0057879696,0.007456925,0.000034271037],"about_ca_topic_score_codex":0.026619276,"about_ca_topic_score_gemma":0.04517803,"teacher_disagreement_score":0.026619276,"about_ca_system_score_codex":0.0026079675,"about_ca_system_score_gemma":0.0020443012,"threshold_uncertainty_score":0.052928686},"labels":[],"label_agreement":null},{"id":"W4417247349","doi":"10.1142/s0218194025501025","title":"Machine Learning and Constraint Programming for Efficient Healthcare Scheduling","year":2025,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint programming; Heuristics; Scheduling (production processes); Job shop scheduling; Constraint satisfaction; Workload; Computation; Constraint logic programming","score_opus":0.029099736797058635,"score_gpt":0.3481407537252765,"score_spread":0.31904101692821785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417247349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036310423,0.0013799164,0.9891032,0.0012942103,0.000073391406,0.00009062446,0.00021549835,0.00017231009,0.0040398487],"genre_scores_gemma":[0.19483803,0.0035464524,0.79445,0.00044719395,0.00030160657,0.0007124269,0.0007750476,0.00018783449,0.0047413353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827147,0.0009396462,0.00008696006,0.00024012687,0.00034796036,0.0001138244],"domain_scores_gemma":[0.9952426,0.003936868,0.00030923032,0.00015623173,0.00027414397,0.00008100605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445132,0.0013417413,0.0013066051,0.0009578897,0.00055394793,0.0017754134,0.0013434009,0.0014362705,0.0050792512],"category_scores_gemma":[0.008516375,0.00073128863,0.0011192205,0.0025587,0.0011370286,0.001547119,0.0013502442,0.0029056198,0.00078116957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020929656,0.000040309933,0.00018386361,0.0001703234,0.0000301144,0.000026867805,0.000032212844,0.90688986,0.00019563838,0.055869486,0.0022015206,0.03433882],"study_design_scores_gemma":[0.000006425041,0.000007262946,0.00003221651,0.000021960515,0.0000031990824,0.0000050203803,0.000008443158,0.96560794,0.00011534261,0.032760385,0.0014273202,0.000004443308],"about_ca_topic_score_codex":0.011122479,"about_ca_topic_score_gemma":0.011684455,"teacher_disagreement_score":0.011122479,"about_ca_system_score_codex":0.0023584464,"about_ca_system_score_gemma":0.004808723,"threshold_uncertainty_score":0.022115469},"labels":[],"label_agreement":null},{"id":"W610614009","doi":"10.71781/10776","title":"Algorithmes d’apprentissage profonds supervisés et non-supervisés: applications et résultats théoriques","year":2013,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Physics","score_opus":0.10297738320697239,"score_gpt":0.4317939275077208,"score_spread":0.32881654430074836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W610614009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018257517,0.0015458309,0.97548985,0.0003542323,0.00006708465,0.00009365173,0.000067304965,0.0011243703,0.0030000613],"genre_scores_gemma":[0.23910432,0.00209039,0.74684626,0.00023778538,0.00016497086,0.00036308265,0.0004143445,0.00040507907,0.010373749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978284,0.00047394127,0.00015821554,0.00060864317,0.00071504054,0.00021573305],"domain_scores_gemma":[0.99441445,0.003333896,0.00030896653,0.00070110755,0.0010511791,0.00019043063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024004471,0.0014583715,0.001366192,0.0014847853,0.0009609853,0.0026675696,0.002250564,0.001745065,0.0051952647],"category_scores_gemma":[0.010013267,0.0008793142,0.0012409998,0.0014989618,0.0012305393,0.002993297,0.0017609675,0.0027355575,0.0016022185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004645567,0.00021789016,0.0033049495,0.0006701436,0.00017907046,0.0002478756,0.0005887284,0.33158928,0.018232485,0.05381074,0.004716976,0.5859773],"study_design_scores_gemma":[0.000031786705,0.00015501483,0.00080098014,0.00007711249,0.000045388588,0.00015646561,0.00012374781,0.9582393,0.011839278,0.021627724,0.006875551,0.00002759739],"about_ca_topic_score_codex":0.010001533,"about_ca_topic_score_gemma":0.008165867,"teacher_disagreement_score":0.010001533,"about_ca_system_score_codex":0.0018139604,"about_ca_system_score_gemma":0.0021636917,"threshold_uncertainty_score":0.019886672},"labels":[],"label_agreement":null},{"id":"W631043532","doi":"10.1515/jqas-2013-0070","title":"Realignment in the NHL, MLB, NFL, and NBA","year":2014,"lang":"en","type":"article","venue":"Journal of Quantitative Analysis in Sports","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"League; Atlanta; Variety (cybernetics); Computer science; Operations research; Marketing; Business; Geography; Engineering; Artificial intelligence; Metropolitan area","score_opus":0.1307740006839047,"score_gpt":0.43745538634368275,"score_spread":0.30668138565977804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W631043532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8647011,0.00021368942,0.11665475,0.00053238426,0.00004515566,0.00032931083,0.0004221064,0.00032454828,0.016776964],"genre_scores_gemma":[0.9003805,0.00005206481,0.09469312,0.000038057588,0.000008686741,0.00015144219,0.00034286815,0.000042551073,0.0042907535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990404,0.00044895735,0.000028192097,0.00017837252,0.00011737425,0.0001865846],"domain_scores_gemma":[0.9976689,0.0011871015,0.00036136215,0.00020030086,0.00027342627,0.00030897243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022188122,0.0003962725,0.00043832336,0.0010119524,0.00052158505,0.0010120098,0.0010274221,0.0005993853,0.0041161207],"category_scores_gemma":[0.006438731,0.0002651198,0.00045631328,0.0006225434,0.0006158829,0.00068549364,0.000891272,0.00061885844,0.00030180524],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006720711,0.00067520933,0.028331403,0.0001734291,0.00005547961,0.00012443286,0.0004930529,0.74922174,0.0040594246,0.027147679,0.0045060064,0.18454011],"study_design_scores_gemma":[0.00007012832,0.0003612974,0.0068636257,0.000025926134,0.000019354917,0.000030928655,0.00045108158,0.97606575,0.0018207128,0.009538748,0.0047357823,0.000016710876],"about_ca_topic_score_codex":0.030871738,"about_ca_topic_score_gemma":0.04353858,"teacher_disagreement_score":0.030871738,"about_ca_system_score_codex":0.0032938605,"about_ca_system_score_gemma":0.0017984512,"threshold_uncertainty_score":0.06138408},"labels":[],"label_agreement":null},{"id":"W6892626543","doi":"10.5281/zenodo.10946649","title":"Supplemental material for Mapping fault geomorphology with drone-based lidar","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lidar; Point cloud; Laser scanning; Fault (geology); Vegetation (pathology); Point (geometry)","score_opus":0.09460831330013439,"score_gpt":0.3300202232912842,"score_spread":0.23541190999114983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892626543","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010991613,0.00008170405,0.036532894,0.00023979186,0.00025902005,0.00028536285,0.9087719,0.023964992,0.028765135],"genre_scores_gemma":[0.010592095,0.00020304254,0.06178737,0.00038031032,0.00010328727,0.00080982514,0.88033766,0.016507529,0.029278928],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967206,0.000036461017,0.00002670467,0.00007028018,0.00016514024,0.000029337343],"domain_scores_gemma":[0.998317,0.00056036294,0.00007502748,0.00020348694,0.0007557234,0.00008851263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008112944,0.0009039686,0.00058728433,0.0016780014,0.000545015,0.0014253699,0.0016677045,0.00074016524,0.64117086],"category_scores_gemma":[0.0036534881,0.00067807606,0.00047433606,0.0019833304,0.00013661376,0.0012332757,0.0008762263,0.00077156926,0.23143338],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028580642,0.000056192566,0.0007324756,0.000279919,0.000015267871,0.000045058227,0.00003222366,0.0013630296,0.0007819379,0.0013283377,0.9761553,0.019181669],"study_design_scores_gemma":[0.00015100987,0.000029068895,0.00570495,0.00026206803,0.000032723798,0.00017690302,0.00012192436,0.0092677,0.00294253,0.0070076487,0.9742561,0.00004733658],"about_ca_topic_score_codex":0.010617015,"about_ca_topic_score_gemma":0.023225287,"teacher_disagreement_score":0.64117086,"about_ca_system_score_codex":0.0006445383,"about_ca_system_score_gemma":0.0008953038,"threshold_uncertainty_score":0.51182616},"labels":[],"label_agreement":null},{"id":"W6920519300","doi":"10.60692/xzyvr-5z719","title":"Adaptive linear combination of heuristic orderings in constructing examination timetables","year":2014,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristics; Heuristic; Benchmark (surveying); Linear programming; Scheduling (production processes); Graph","score_opus":0.09268986319604676,"score_gpt":0.28228312331347133,"score_spread":0.18959326011742456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920519300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1587592,0.00053459575,0.83253485,0.00016044619,0.000066362794,0.0009863445,0.00015043918,0.0022873983,0.00452033],"genre_scores_gemma":[0.4114448,0.00014697625,0.58607256,0.000091217764,0.000030063251,0.0004590378,0.00025925858,0.00027250507,0.0012235463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565315,0.0020839132,0.00030318083,0.00063505,0.00096445275,0.00036028432],"domain_scores_gemma":[0.98848325,0.007825547,0.0011845642,0.0012652462,0.0009542404,0.0002870978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005319071,0.001235905,0.0011563496,0.0022803175,0.0005252085,0.0011293348,0.0024984337,0.00067958474,0.0028239996],"category_scores_gemma":[0.017206019,0.0009443078,0.0009297166,0.0022557804,0.0007508501,0.0017572565,0.0010726241,0.001352501,0.00059111114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062934967,0.000774398,0.007167255,0.00035559208,0.00015636551,0.00009499263,0.00045703995,0.46056488,0.012839957,0.0034218961,0.0010908719,0.5124474],"study_design_scores_gemma":[0.00013731288,0.00059949263,0.0021491928,0.000048691043,0.00015074656,0.00008680895,0.00024114102,0.9796311,0.008671417,0.0051397495,0.003076553,0.00006773318],"about_ca_topic_score_codex":0.003970184,"about_ca_topic_score_gemma":0.007226696,"teacher_disagreement_score":0.005319071,"about_ca_system_score_codex":0.0013967049,"about_ca_system_score_gemma":0.0022500511,"threshold_uncertainty_score":0.028130293},"labels":[],"label_agreement":null},{"id":"W6920576842","doi":"10.60692/cp2q7-vfd05","title":"Adaptive linear combination of heuristic orderings in constructing examination timetables","year":2014,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristics; Heuristic; Benchmark (surveying); Linear programming; Scheduling (production processes); Graph","score_opus":0.09268986319604676,"score_gpt":0.28228312331347133,"score_spread":0.18959326011742456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920576842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1587592,0.00053459575,0.83253485,0.00016044619,0.000066362794,0.0009863445,0.00015043918,0.0022873983,0.00452033],"genre_scores_gemma":[0.4114448,0.00014697625,0.58607256,0.000091217764,0.000030063251,0.0004590378,0.00025925858,0.00027250507,0.0012235463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565315,0.0020839132,0.00030318083,0.00063505,0.00096445275,0.00036028432],"domain_scores_gemma":[0.98848325,0.007825547,0.0011845642,0.0012652462,0.0009542404,0.0002870978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005319071,0.001235905,0.0011563496,0.0022803175,0.0005252085,0.0011293348,0.0024984337,0.00067958474,0.0028239996],"category_scores_gemma":[0.017206019,0.0009443078,0.0009297166,0.0022557804,0.0007508501,0.0017572565,0.0010726241,0.001352501,0.00059111114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062934967,0.000774398,0.007167255,0.00035559208,0.00015636551,0.00009499263,0.00045703995,0.46056488,0.012839957,0.0034218961,0.0010908719,0.5124474],"study_design_scores_gemma":[0.00013731288,0.00059949263,0.0021491928,0.000048691043,0.00015074656,0.00008680895,0.00024114102,0.9796311,0.008671417,0.0051397495,0.003076553,0.00006773318],"about_ca_topic_score_codex":0.003970184,"about_ca_topic_score_gemma":0.007226696,"teacher_disagreement_score":0.005319071,"about_ca_system_score_codex":0.0013967049,"about_ca_system_score_gemma":0.0022500511,"threshold_uncertainty_score":0.028130293},"labels":[],"label_agreement":null},{"id":"W6926157139","doi":"10.18910/90707","title":"Relations of Language and Identity : Examining the eff ects of Mandarin education in the Xinjiang Uyghur Autonomous Region in China","year":2023,"lang":"en","type":"article","venue":"OUKA (Osaka University Knowledge Archive) (Osaka University)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Xinjiang University; Xinjiang Normal University; York University","keywords":"Mandarin Chinese; Ethnic group; China; Identity (music); Government (linguistics); Harmonious Society; Communism; Bilingual education; Social identity theory","score_opus":0.04420060682415503,"score_gpt":0.3150982060849754,"score_spread":0.27089759926082035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926157139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99879956,0.00012994155,0.000011065843,0.00012270935,0.000002773887,0.0000038758244,0.000010672082,3.0650517e-7,0.000919026],"genre_scores_gemma":[0.99945265,0.00013004053,0.000022894093,0.000028292281,0.000001795076,0.000004058942,0.000016633474,3.578888e-7,0.00034321583],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99934644,0.00021934192,0.0000331914,0.00006354152,0.00009769973,0.0002396907],"domain_scores_gemma":[0.9992229,0.00020525961,0.0002618951,0.00002880213,0.000090964815,0.00019010331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010138236,0.00025725135,0.00028516102,0.0010745524,0.0036283783,0.0012390394,0.000673212,0.0003230368,0.0014486188],"category_scores_gemma":[0.0010933293,0.00021229225,0.0002528891,0.0017264509,0.0021188054,0.0009738656,0.0016440902,0.00058919756,0.00007453547],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004806978,0.00013598907,0.7162214,0.00013068167,0.000028467097,0.0014075944,0.26403525,0.00007223289,0.000816287,0.0018055005,0.00033890363,0.014959663],"study_design_scores_gemma":[0.000001966786,0.00004555527,0.6961,0.00005569675,0.000011505868,0.000089093766,0.30169728,0.00013129474,0.000114134615,0.000105096515,0.0016405899,0.000007665336],"about_ca_topic_score_codex":0.21080373,"about_ca_topic_score_gemma":0.37219903,"teacher_disagreement_score":0.21080373,"about_ca_system_score_codex":0.0037664727,"about_ca_system_score_gemma":0.004137354,"threshold_uncertainty_score":0.41915345},"labels":[],"label_agreement":null},{"id":"W6931098901","doi":"10.5281/zenodo.4037400","title":"Ax3man/vdBijl_etal_EvolLett_2020: For publication","year":2020,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Government (linguistics); Exposition (narrative); Work (physics); Subject (documents); Focus (optics)","score_opus":0.16093917957378473,"score_gpt":0.34835176198940526,"score_spread":0.18741258241562053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931098901","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021621974,0.0008271016,0.050184675,0.0015648372,0.0015146708,0.0003724869,0.14805415,0.1079212,0.6873987],"genre_scores_gemma":[0.0148026245,0.0010392915,0.035304468,0.0010664397,0.0003688991,0.00050462,0.20803642,0.08249496,0.6563823],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991579,0.00011634852,0.00003310119,0.0001486519,0.00039805844,0.00014591355],"domain_scores_gemma":[0.9980307,0.0003605863,0.000088335895,0.00049983495,0.0005740063,0.00044650203],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001738323,0.0016411297,0.000827693,0.0018511246,0.0007566787,0.0039628893,0.0033362268,0.0019718788,0.6857088],"category_scores_gemma":[0.0038263737,0.0007859512,0.0009123786,0.0019879444,0.0005674798,0.00243734,0.0019257527,0.0015615983,0.629349],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000254693,0.000071726376,0.00016085392,0.00032420555,0.000014911036,0.00003606147,0.000037929338,0.0022170888,0.0021437109,0.011958809,0.91121066,0.0715694],"study_design_scores_gemma":[0.000063279316,0.000036048834,0.00015081093,0.000048259928,0.0000043553187,0.00003287349,0.000011852699,0.0029210462,0.0017546781,0.0035798606,0.9913796,0.000017383301],"about_ca_topic_score_codex":0.0069236057,"about_ca_topic_score_gemma":0.0061167427,"teacher_disagreement_score":0.31429118,"about_ca_system_score_codex":0.0014156522,"about_ca_system_score_gemma":0.0016360771,"threshold_uncertainty_score":0.44829822},"labels":[],"label_agreement":null},{"id":"W6931904762","doi":"10.5683/sp3/ybny1c","title":"UNI-CEN Boundaries (CBF-Original Shorelines) - Census Metropolitan Area (CMA) - 2011 - geojson format (WGS84 / EPSG:4326)","year":2023,"lang":"en","type":"dataset","venue":"Borealis","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Shapefile; Census; North American Datum of 1927; File format; Documentation; Geocoding; Metropolitan area; Boundary (topology); Data file","score_opus":0.1491554267638462,"score_gpt":0.39402493522262244,"score_spread":0.24486950845877625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931904762","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075476295,0.000011743738,0.00007019763,0.00002479976,0.000009949649,0.000008175362,0.9987445,0.00022020823,0.00083486777],"genre_scores_gemma":[0.00025717172,0.000023443983,0.00030705633,0.000017573004,0.0000026405664,0.000065743196,0.9985636,0.00009774356,0.000665108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985203,0.00021366544,0.00022948415,0.00035453367,0.00041917924,0.00026280267],"domain_scores_gemma":[0.9960567,0.00061972166,0.0004041237,0.0009973868,0.0016223126,0.0002998107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001689738,0.0015672724,0.0012021209,0.0045831506,0.00077883597,0.00234549,0.002751288,0.0011250313,0.09303941],"category_scores_gemma":[0.00841052,0.00096036657,0.00087675505,0.012082939,0.0004058923,0.0015078103,0.0019080943,0.0019031414,0.13018718],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026736137,0.00000928877,0.0006835403,0.00024917672,0.000010908302,0.000008465639,0.000025729283,0.00012935678,0.000060756505,0.0006673681,0.99667335,0.0014553096],"study_design_scores_gemma":[0.00008695298,0.000004729678,0.004117471,0.00016216908,0.000009455374,0.000019569803,0.00010250521,0.00015971884,0.00026178343,0.0006932705,0.994365,0.000017278348],"about_ca_topic_score_codex":0.08254101,"about_ca_topic_score_gemma":0.10940208,"teacher_disagreement_score":0.917459,"about_ca_system_score_codex":0.003157893,"about_ca_system_score_gemma":0.0053545907,"threshold_uncertainty_score":0.31124783},"labels":[],"label_agreement":null},{"id":"W7006156582","doi":"","title":"Staff Scheduling During a Pandemic","year":2021,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Pandemic; Job shop scheduling; Nurse scheduling problem; Coronavirus disease 2019 (COVID-19); Dynamic priority scheduling; Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); Health care; 2019-20 coronavirus outbreak; Process (computing)","score_opus":0.04876727350820009,"score_gpt":0.294557401672549,"score_spread":0.24579012816434892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006156582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74570674,0.00083733007,0.23321074,0.002836866,0.0003994046,0.0003663988,0.00044914146,0.0006984862,0.015494873],"genre_scores_gemma":[0.96695083,0.00020824854,0.030729072,0.00019337564,0.000045348337,0.000062978426,0.00015859856,0.000042842057,0.0016087905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989604,0.00049875065,0.000036892958,0.00014959346,0.00012577703,0.00022858402],"domain_scores_gemma":[0.9981439,0.0009303846,0.00026059907,0.000119531556,0.00025374428,0.00029184154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001918444,0.00051120576,0.00056708616,0.0003720268,0.000865736,0.00084443676,0.0010204074,0.0010659605,0.0023848733],"category_scores_gemma":[0.0044361698,0.00040374493,0.0004642604,0.00041872583,0.00060769875,0.00076673616,0.00067708705,0.0007539967,0.00027993807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004444629,0.0001961324,0.004227857,0.00008343651,0.00003678617,0.0001759109,0.00022130595,0.9447712,0.0029439873,0.00963054,0.0050351713,0.03223317],"study_design_scores_gemma":[0.00005399735,0.0002404252,0.0014850922,0.000015520049,0.000016967573,0.000066084154,0.00036095333,0.98817134,0.0011482072,0.006519346,0.0019024268,0.00001971463],"about_ca_topic_score_codex":0.009700114,"about_ca_topic_score_gemma":0.006912805,"teacher_disagreement_score":0.009700114,"about_ca_system_score_codex":0.0017491891,"about_ca_system_score_gemma":0.0021774576,"threshold_uncertainty_score":0.019287288},"labels":[],"label_agreement":null},{"id":"W7008404372","doi":"","title":"Cal Poly President's Semester Task Force Recommends Maintaining Quarter System","year":2012,"lang":"en","type":"article","venue":"DigitalCommons - CalPoly (California State Polytechnic University)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Task (project management); Task force; Quarter (Canadian coin); Work (physics)","score_opus":0.04475843944628026,"score_gpt":0.28474988793485345,"score_spread":0.23999144848857318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008404372","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031598993,0.0010268755,0.026024375,0.17001365,0.023267953,0.0048456644,0.008596963,0.015502389,0.71912307],"genre_scores_gemma":[0.050535154,0.00057909614,0.023733424,0.027935829,0.0023153012,0.001056899,0.004417311,0.0014188641,0.88800806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99435544,0.00090342667,0.0003791275,0.00050958805,0.0026929136,0.0011596119],"domain_scores_gemma":[0.97162837,0.003893311,0.0013133553,0.0028497847,0.0139958495,0.006319268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101307705,0.0007086486,0.0007984735,0.0023918152,0.008734399,0.0068815215,0.0019998185,0.0044046273,0.17356496],"category_scores_gemma":[0.016968526,0.0009860379,0.0007337172,0.0019674788,0.0009690537,0.003056356,0.0015144958,0.00394124,0.04763319],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013063593,0.00039950965,0.0023321768,0.00005506132,0.000004486293,0.000036502766,0.00008363698,0.0003711696,0.0009598621,0.0037706825,0.9307665,0.061089624],"study_design_scores_gemma":[0.00011457235,0.00020103126,0.005877578,0.000040474784,0.000013056333,0.000034710432,0.00024457142,0.0009173387,0.0009587661,0.0011646538,0.9904081,0.000025209883],"about_ca_topic_score_codex":0.0647057,"about_ca_topic_score_gemma":0.1371752,"teacher_disagreement_score":0.17356496,"about_ca_system_score_codex":0.005067991,"about_ca_system_score_gemma":0.029326636,"threshold_uncertainty_score":0.5806326},"labels":[],"label_agreement":null},{"id":"W7009203804","doi":"","title":"THE DEVELOPMENT OF A PHARMACY WORKLOAD MEASUREMENT SYSTEM FOR THE CANADIAN FORCES","year":2023,"lang":"en","type":"dissertation","venue":"University Library (University of Saskatchewan)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Workload; Pharmacy; Staffing; Work (physics); Stopwatch","score_opus":0.0814098046881496,"score_gpt":0.27294859985931,"score_spread":0.19153879517116043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009203804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4059251,0.0020388751,0.35357344,0.0075020664,0.0009104797,0.02466704,0.053170767,0.04017353,0.112038784],"genre_scores_gemma":[0.37653688,0.0013897084,0.5660761,0.0012776315,0.00018129051,0.004964531,0.02622852,0.00049436215,0.02285098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513066,0.00038574968,0.00047041054,0.0005419746,0.0029451805,0.0005261113],"domain_scores_gemma":[0.9839893,0.0005983547,0.0005416685,0.0004893271,0.013547037,0.00083434646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004795681,0.0008767287,0.00047337665,0.0055121747,0.0031459134,0.0017817223,0.0018409895,0.00053801946,0.0030150656],"category_scores_gemma":[0.009821273,0.00050550065,0.0006017634,0.0046266713,0.00037552486,0.0013519233,0.0015897827,0.00096178084,0.0012928674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007363069,0.0005976892,0.1199545,0.00073561736,0.000110838235,0.00035890465,0.0031848734,0.006096057,0.033953194,0.007123102,0.07863448,0.7485144],"study_design_scores_gemma":[0.00041043755,0.0009503861,0.4422335,0.0006076426,0.0002483466,0.0003741716,0.0023437592,0.10916829,0.041835934,0.0012751174,0.39974353,0.00080890465],"about_ca_topic_score_codex":0.9251293,"about_ca_topic_score_gemma":0.8999985,"teacher_disagreement_score":0.074870706,"about_ca_system_score_codex":0.02426432,"about_ca_system_score_gemma":0.05621699,"threshold_uncertainty_score":0.17605078},"labels":[],"label_agreement":null},{"id":"W7009837694","doi":"","title":"Fire researchers develop water-mist fire-suppression technology for large industrial oil cookers","year":2003,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Point (geometry); Work (physics); Petroleum industry; Production (economics)","score_opus":0.22648346088157342,"score_gpt":0.4062828002007063,"score_spread":0.17979933931913286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009837694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7197055,0.00079205737,0.25698346,0.001157015,0.00017567012,0.0011139943,0.00024103031,0.001408081,0.018423183],"genre_scores_gemma":[0.65510654,0.0012722723,0.30689248,0.00027499144,0.00003181014,0.00027881944,0.00044989286,0.0001272219,0.035565954],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973243,0.000029185378,0.000012845174,0.000061081526,0.000114712595,0.000049688915],"domain_scores_gemma":[0.9995484,0.000121741505,0.00003392638,0.000045497112,0.0001970634,0.000053323365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070987025,0.00064665364,0.00030238298,0.00038715507,0.00076511,0.0007850777,0.00095468934,0.0007959612,0.003603762],"category_scores_gemma":[0.0011213089,0.00032613872,0.0006158213,0.0005188425,0.00020970506,0.00080701784,0.00023200209,0.00082021183,0.0006756639],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071950315,0.0020324239,0.009004173,0.00048424205,0.0000794825,0.00021133208,0.0007543518,0.069041595,0.4652505,0.007329751,0.0037473447,0.44134527],"study_design_scores_gemma":[0.00050700235,0.0035824343,0.008477136,0.00004981156,0.00016154311,0.00018493582,0.00081080885,0.25151762,0.6766192,0.0028533246,0.055186447,0.0000497246],"about_ca_topic_score_codex":0.01234301,"about_ca_topic_score_gemma":0.015523573,"teacher_disagreement_score":0.01234301,"about_ca_system_score_codex":0.0012933403,"about_ca_system_score_gemma":0.002408144,"threshold_uncertainty_score":0.024542332},"labels":[],"label_agreement":null},{"id":"W7018140948","doi":"","title":"A constructive and a local search method applied to the examination timetabling problem","year":2013,"lang":"en","type":"other","venue":"OpenGrey (Institut de l'Information Scientifique et Technique)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constructive; Fuzzy logic; Benchmark (surveying); Heuristic; Set (abstract data type); Particle swarm optimization; Fuzzy set; Function (biology)","score_opus":0.05283706823284654,"score_gpt":0.35296799498433523,"score_spread":0.30013092675148867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018140948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006412077,0.00026166925,0.9882979,0.00015978841,0.00007794731,0.00013364527,0.000028813045,0.0001842603,0.0044438383],"genre_scores_gemma":[0.14238776,0.0005383357,0.8510617,0.0001737938,0.00008904752,0.0005402935,0.000120781675,0.00015971548,0.0049284846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988387,0.00052160275,0.00004468186,0.00015410795,0.0003555287,0.00008539275],"domain_scores_gemma":[0.99811804,0.0012867609,0.00013088455,0.00009433368,0.0002884343,0.000081636346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021474273,0.0010326692,0.0010912253,0.0017347431,0.00084052887,0.0011359672,0.0017040807,0.001364911,0.003894708],"category_scores_gemma":[0.004477317,0.0005151883,0.0018096623,0.0017822057,0.0011414314,0.0011393668,0.0012130608,0.0017171794,0.0005890794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011693266,0.00020729905,0.00056300726,0.00040747685,0.00008683318,0.00019147484,0.00027650874,0.7219846,0.006956185,0.07529101,0.0037299916,0.1901887],"study_design_scores_gemma":[0.000027132337,0.000119574965,0.00012380925,0.000027789063,0.000022651913,0.0000587857,0.000031415497,0.98948574,0.0015023844,0.0055131027,0.003072855,0.000014718896],"about_ca_topic_score_codex":0.003950074,"about_ca_topic_score_gemma":0.0038119163,"teacher_disagreement_score":0.003950074,"about_ca_system_score_codex":0.0013675034,"about_ca_system_score_gemma":0.0020763276,"threshold_uncertainty_score":0.0130290985},"labels":[],"label_agreement":null},{"id":"W7019998617","doi":"","title":"Integer and Stochastic Programming Approaches to Scheduling Nursing Staff at Long-term Care Homes","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Nurse scheduling problem; Integer programming; Absenteeism; Job shop scheduling; Health care; Set (abstract data type)","score_opus":0.15586047935479877,"score_gpt":0.4177076087423192,"score_spread":0.2618471293875204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019998617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032918572,0.00099912,0.95544875,0.0011780204,0.00012255712,0.00014063455,0.00022586013,0.000096557866,0.008869987],"genre_scores_gemma":[0.5735491,0.0032898916,0.41001034,0.00034448958,0.00036354415,0.00072800275,0.00045995635,0.00013329742,0.011121363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998429,0.0009340234,0.000056788587,0.00018108907,0.00021868754,0.00018045929],"domain_scores_gemma":[0.9931462,0.005903624,0.0004329795,0.00006932853,0.00023783244,0.00021008786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029641858,0.0015714497,0.0010223566,0.0009133583,0.0008589661,0.0018800363,0.0015799309,0.0014890175,0.003956072],"category_scores_gemma":[0.0068625207,0.00085637096,0.0012132626,0.002077996,0.0012607235,0.0012465982,0.0009335921,0.002468806,0.0002547255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017740631,0.000046204037,0.00017850664,0.00005304361,0.000024464587,0.000029335286,0.000052619074,0.9711249,0.00011458479,0.02434112,0.0003632959,0.003654148],"study_design_scores_gemma":[0.000015213038,0.000026284544,0.000111997906,0.000011809604,0.000009754484,0.0000056847457,0.00004476245,0.98273325,0.00007148192,0.016326446,0.0006370725,0.0000063767607],"about_ca_topic_score_codex":0.024800502,"about_ca_topic_score_gemma":0.024975214,"teacher_disagreement_score":0.024800502,"about_ca_system_score_codex":0.0035400265,"about_ca_system_score_gemma":0.0034872647,"threshold_uncertainty_score":0.049312294},"labels":[],"label_agreement":null},{"id":"W7046218543","doi":"","title":"Construction négociée par la triade de formation en stage d'un savoir-enseigner les mathématiques au primaire","year":2011,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Filter (signal processing); Limiting; Nucleofection","score_opus":0.01936433664801759,"score_gpt":0.2025092531100463,"score_spread":0.1831449164620287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7046218543","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13086824,0.0018542103,0.21169046,0.01584175,0.0012645387,0.0003650168,0.00025393028,0.0006583982,0.6372035],"genre_scores_gemma":[0.6008748,0.0013211241,0.074250534,0.0011291861,0.00015332505,0.0004933922,0.00029851726,0.0006018126,0.32087728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99381256,0.002937467,0.00016261436,0.0011940037,0.001178377,0.0007149876],"domain_scores_gemma":[0.99469525,0.0010217199,0.0005128696,0.0011327541,0.0011335387,0.0015038187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048508784,0.0008069609,0.00052062393,0.0009912981,0.0065890914,0.01140331,0.002007004,0.002568073,0.034172874],"category_scores_gemma":[0.007835552,0.0005641599,0.0009959751,0.0009998146,0.013609789,0.009677589,0.010285189,0.005417506,0.006059314],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056509034,0.000060815975,0.0020636602,0.00012223308,0.000009817306,0.00023208372,0.05113746,0.00044846334,0.0018906515,0.9146485,0.0037417465,0.025588052],"study_design_scores_gemma":[0.00002793029,0.00019483567,0.005860389,0.0003902591,0.000017228502,0.000366707,0.04018243,0.0020925435,0.003361154,0.18184973,0.7655963,0.00006045209],"about_ca_topic_score_codex":0.012986361,"about_ca_topic_score_gemma":0.021238524,"teacher_disagreement_score":0.034172874,"about_ca_system_score_codex":0.00745254,"about_ca_system_score_gemma":0.012618548,"threshold_uncertainty_score":0.11431962},"labels":[],"label_agreement":null},{"id":"W7084107687","doi":"10.64628/aam.qadw7fj7p","title":"$Trump and $Melania crypto tokens illustrate the risks posed by trendy meme coins","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Set (abstract data type); Cryptography; Identification (biology); Digital signature","score_opus":0.15937092851175524,"score_gpt":0.4322015815002005,"score_spread":0.2728306529884452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084107687","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16958459,0.0018811879,0.20742221,0.11962202,0.007562658,0.00033951126,0.0010931588,0.0032781682,0.4892165],"genre_scores_gemma":[0.72208905,0.0008030015,0.10107557,0.0068161427,0.00048320022,0.00035874144,0.00030075363,0.0010231935,0.16705033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811244,0.00077798584,0.000057173835,0.00014471804,0.00062583963,0.00028175625],"domain_scores_gemma":[0.9922386,0.004696349,0.00042337604,0.001094342,0.001110974,0.00043650414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476788,0.000429687,0.0004765343,0.0011337881,0.0030468453,0.002993505,0.001244797,0.0021665413,0.039195966],"category_scores_gemma":[0.018544879,0.000296939,0.00040488772,0.0016847493,0.0024897915,0.005130182,0.0025267992,0.0026775696,0.005799894],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006005844,0.00010592344,0.0015305958,0.00010271506,0.000017807899,0.0004914322,0.0006918636,0.015008497,0.0014234179,0.77735233,0.10632135,0.096353434],"study_design_scores_gemma":[0.00013849155,0.00023750712,0.0012138637,0.00019096913,0.000027587957,0.00042526185,0.0019344839,0.09623778,0.005344193,0.47209123,0.422046,0.000112733374],"about_ca_topic_score_codex":0.006770671,"about_ca_topic_score_gemma":0.013426178,"teacher_disagreement_score":0.039195966,"about_ca_system_score_codex":0.0021772461,"about_ca_system_score_gemma":0.0023859956,"threshold_uncertainty_score":0.13112354},"labels":[],"label_agreement":null},{"id":"W7096816927","doi":"","title":"An Examination of Ressourcing . . .","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Staffing; Work (physics); Scheduling (production processes); Simple (philosophy); Linear programming","score_opus":0.155437204799048,"score_gpt":0.4131548542238493,"score_spread":0.2577176494248013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096816927","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022792988,0.018952565,0.040589284,0.08002394,0.001183013,0.00008927254,0.00034274606,0.0002210174,0.8358052],"genre_scores_gemma":[0.64819247,0.03565013,0.0318699,0.013339367,0.0010008488,0.00017404108,0.0004931044,0.00043930116,0.26884085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973133,0.0009845485,0.00006822913,0.00022753802,0.00093164505,0.00047471188],"domain_scores_gemma":[0.99680066,0.0013099839,0.00031609507,0.00029846418,0.0010695194,0.00020524533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032488788,0.00038088975,0.00029867433,0.0022598945,0.0028321946,0.005282519,0.0017746675,0.0017311919,0.014778407],"category_scores_gemma":[0.005930701,0.00022675045,0.0005673676,0.0048647714,0.0051948335,0.0063261515,0.0018665699,0.002587257,0.0018956457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009735307,0.000028266384,0.0006479935,0.00009094269,0.0000049986816,0.00008385331,0.0018337086,0.0019258445,0.000112494316,0.9219742,0.023402609,0.049885396],"study_design_scores_gemma":[0.0000046466666,0.00003956392,0.002441606,0.00033461888,0.000005829593,0.00015012354,0.0079077,0.0059989314,0.0004267695,0.28528866,0.6973775,0.000023997418],"about_ca_topic_score_codex":0.035043314,"about_ca_topic_score_gemma":0.03772625,"teacher_disagreement_score":0.035043314,"about_ca_system_score_codex":0.008319975,"about_ca_system_score_gemma":0.0060710134,"threshold_uncertainty_score":0.069678664},"labels":[],"label_agreement":null},{"id":"W7097848615","doi":"","title":"Mechanical and Industrial Engineering, University of Toronto,","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Sequence (biology); Greedy algorithm; Heuristic; Course (navigation); Lagrangian relaxation","score_opus":0.152345916590037,"score_gpt":0.3071652572755479,"score_spread":0.1548193406855109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097848615","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018667,0.047846492,0.016431151,0.0081440965,0.003582562,0.00021241448,0.017402468,0.0021227282,0.88559115],"genre_scores_gemma":[0.035211448,0.014703042,0.009701306,0.00026369025,0.00019725147,0.00007254296,0.0041037356,0.00031339293,0.93543357],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989372,0.000054501004,0.000048148555,0.00026250404,0.00056400476,0.00013375275],"domain_scores_gemma":[0.99833703,0.0002840354,0.00007542909,0.00017228175,0.0008041716,0.00032703718],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059829035,0.0018120058,0.0007540416,0.0011296269,0.0020673021,0.0030553115,0.0008648163,0.0011439616,0.24816775],"category_scores_gemma":[0.0016509978,0.00074186147,0.00047237353,0.0027456186,0.0010902191,0.0009855494,0.0013156816,0.0011877131,0.07956085],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004083337,0.00012284382,0.005688261,0.0017739035,0.00006814999,0.0011322479,0.0016790065,0.0062170597,0.012124334,0.034236755,0.45781428,0.47873482],"study_design_scores_gemma":[0.000022146185,0.00006940886,0.0072066085,0.00016604619,0.000022899112,0.00017713476,0.00032265577,0.0020401536,0.0016345513,0.0019219106,0.98638606,0.000030341807],"about_ca_topic_score_codex":0.31724733,"about_ca_topic_score_gemma":0.48013255,"teacher_disagreement_score":0.75183225,"about_ca_system_score_codex":0.0072118533,"about_ca_system_score_gemma":0.008336697,"threshold_uncertainty_score":0.83020383},"labels":[],"label_agreement":null},{"id":"W7100191282","doi":"","title":"Deux Methodes de Recherche Locale pour Resoudre un Probleme d&amp;apos;Horaire du Personnel Infirmier dans un Etablissement Hospitalier","year":2010,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Adaptation (eye); Raising (metalworking); Context (archaeology)","score_opus":0.5195151309562687,"score_gpt":0.4979737239477433,"score_spread":0.02154140700852536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100191282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040237126,0.00022172088,0.9940572,0.0001780959,0.000047634006,0.000108656444,0.0000357954,0.0005754713,0.00075174135],"genre_scores_gemma":[0.0326569,0.00027622085,0.96253246,0.00008715847,0.000043252367,0.00036709258,0.00013645604,0.00032651448,0.003573955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.994187,0.0022692354,0.00040339166,0.0011645495,0.0015649504,0.00041078374],"domain_scores_gemma":[0.9881954,0.007054592,0.00083336054,0.0012804274,0.0023263562,0.00030991074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075091207,0.0025181905,0.0021264297,0.002633036,0.0015539962,0.0026406844,0.0025664053,0.0027866766,0.006896029],"category_scores_gemma":[0.015230474,0.0013221697,0.0032437427,0.0019843462,0.0018065106,0.0033400771,0.0025813142,0.0032758259,0.001972103],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053966977,0.00042973715,0.0040529273,0.0012960787,0.00029554634,0.00035811518,0.0019963863,0.30389833,0.030228373,0.03616252,0.006343646,0.61439866],"study_design_scores_gemma":[0.00021137492,0.00043278025,0.0018102915,0.00022278234,0.00021909575,0.0004296839,0.0007334373,0.9321646,0.029104177,0.013475974,0.021028332,0.00016740551],"about_ca_topic_score_codex":0.010003563,"about_ca_topic_score_gemma":0.013364539,"teacher_disagreement_score":0.010003563,"about_ca_system_score_codex":0.0015385388,"about_ca_system_score_gemma":0.0032747283,"threshold_uncertainty_score":0.03971255},"labels":[],"label_agreement":null},{"id":"W7100805697","doi":"","title":"Edmund K. Burke, Hana Rudov (Eds.)","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Implementation; Scheduling (production processes); Constraint programming; Constraint (computer-aided design); Tabu search; Nurse scheduling problem; Job shop scheduling","score_opus":0.09069715583726028,"score_gpt":0.37592842204652477,"score_spread":0.2852312662092645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100805697","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073895575,0.5913017,0.07530731,0.038292013,0.01047556,0.00008522656,0.0012351457,0.0007215449,0.275192],"genre_scores_gemma":[0.038806014,0.5924343,0.06392902,0.0024166314,0.0027792426,0.00007571671,0.0012460006,0.00021058119,0.29810253],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996164,0.000059571183,0.000020287838,0.000100502075,0.00015425528,0.000049085636],"domain_scores_gemma":[0.9987326,0.00073080603,0.000088955836,0.0000638644,0.00019480374,0.00018897942],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008794089,0.0012280523,0.00097606296,0.0011537216,0.00070017943,0.002334806,0.0012492868,0.0015452,0.06671647],"category_scores_gemma":[0.001602111,0.00050987554,0.0004676295,0.0036085444,0.00071822724,0.0025592148,0.00076271896,0.0014592939,0.039502326],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062959596,0.00008827512,0.00079677586,0.0008695176,0.000027181772,0.0002041306,0.00014617329,0.006951002,0.0006429478,0.021803224,0.28860053,0.67980725],"study_design_scores_gemma":[0.000013880027,0.00006152634,0.0017943651,0.0002991133,0.000029134559,0.00060115167,0.00039544873,0.0053945095,0.00066211086,0.01923224,0.97148657,0.000029890785],"about_ca_topic_score_codex":0.006103093,"about_ca_topic_score_gemma":0.017635316,"teacher_disagreement_score":0.9332835,"about_ca_system_score_codex":0.0008726498,"about_ca_system_score_gemma":0.0014379169,"threshold_uncertainty_score":0.22318882},"labels":[],"label_agreement":null},{"id":"W7105602842","doi":"10.1109/tsmc.2025.3629990","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Graph coloring; Greedy coloring; Heuristic; Greedy algorithm; Graph; Fractional coloring; Efficient algorithm; Edge coloring","score_opus":0.05214064452764151,"score_gpt":0.33105949602224705,"score_spread":0.27891885149460555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105602842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012971002,0.00085890986,0.9625847,0.00060279097,0.0004113532,0.00051293545,0.00068969553,0.009718226,0.011650523],"genre_scores_gemma":[0.09393799,0.0005059449,0.8923258,0.0005394675,0.00011983461,0.0005952847,0.0019842314,0.001417745,0.008573703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883336,0.00028590602,0.000044141143,0.00031582572,0.00025558253,0.00026525054],"domain_scores_gemma":[0.9989214,0.00048084493,0.00007105977,0.00026125065,0.00015923017,0.00010621441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008615945,0.0029623373,0.0018518885,0.0018569052,0.0017870808,0.0018326604,0.003433575,0.0021960563,0.013889501],"category_scores_gemma":[0.0026748981,0.0010163046,0.001986904,0.002603033,0.0011462916,0.00248167,0.0024606078,0.0020104789,0.0038329803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005763358,0.00052956544,0.0010367834,0.00067827984,0.00018459884,0.0003954787,0.00022787155,0.41947207,0.009583387,0.04011912,0.07223877,0.45495784],"study_design_scores_gemma":[0.00021159899,0.00006584623,0.00013593561,0.000023677485,0.0000375604,0.00013304754,0.00006354687,0.9611989,0.0025009015,0.02439596,0.011194632,0.000038303406],"about_ca_topic_score_codex":0.012477396,"about_ca_topic_score_gemma":0.018707406,"teacher_disagreement_score":0.013889501,"about_ca_system_score_codex":0.0021260139,"about_ca_system_score_gemma":0.004709499,"threshold_uncertainty_score":0.04646498},"labels":[],"label_agreement":null},{"id":"W7117487305","doi":"10.5220/0014361200004718","title":"Optimizing Workforce Planning in University Cleaning Services Using Integer Programming: A Cost-Reduction Approach","year":2025,"lang":"","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Workforce; Workforce planning; Reliability (semiconductor); Integer (computer science); Work (physics); Integer programming","score_opus":0.1369853909625058,"score_gpt":0.37957461933115805,"score_spread":0.24258922836865224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117487305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14718492,0.00089242466,0.82861364,0.001706024,0.00018150886,0.0005017428,0.0008017373,0.00047906893,0.019638859],"genre_scores_gemma":[0.72156847,0.0006598717,0.26923478,0.0002035639,0.00009119634,0.00047348626,0.0004938368,0.000210565,0.0070642657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985317,0.0007003745,0.00003739023,0.00014086036,0.00022661251,0.0003629791],"domain_scores_gemma":[0.99821484,0.001312721,0.0001392601,0.00005944093,0.00015940475,0.00011432065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020727334,0.0011466825,0.0018447979,0.0016660335,0.00086027826,0.0023028178,0.0016540247,0.0018987962,0.0056664525],"category_scores_gemma":[0.004784988,0.0012168607,0.001938086,0.0023412104,0.00058504095,0.0015042186,0.0011176298,0.0020310634,0.00037150658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005754801,0.00007436011,0.00029942612,0.000051269806,0.000020809024,0.000022673534,0.000021426844,0.9857525,0.0003196641,0.0025656782,0.000568144,0.010246528],"study_design_scores_gemma":[0.000008438479,0.000027606899,0.0001705718,0.0000063346897,0.000012839294,0.000005006437,0.000031424235,0.99729365,0.00023180537,0.0019820926,0.0002257844,0.000004532732],"about_ca_topic_score_codex":0.023249455,"about_ca_topic_score_gemma":0.020043788,"teacher_disagreement_score":0.023249455,"about_ca_system_score_codex":0.0024805532,"about_ca_system_score_gemma":0.0043033725,"threshold_uncertainty_score":0.04622823},"labels":[],"label_agreement":null},{"id":"W7133061668","doi":"","title":"Defining, modeling, and solving a real university course timetabling problem","year":2007,"lang":"","type":"dissertation","venue":"TSpace","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Continuation; Quality (philosophy); Benchmark (surveying); Course (navigation); Function (biology); Work (physics); Decomposition","score_opus":0.06029629721593238,"score_gpt":0.4073206259404286,"score_spread":0.34702432872449623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133061668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118598364,0.00046746604,0.86549354,0.0015800424,0.00007037028,0.0003232387,0.00041097152,0.00029709018,0.012759042],"genre_scores_gemma":[0.33966845,0.0006648328,0.6509621,0.00011032896,0.000056681016,0.0002887047,0.0006880334,0.00009962212,0.0074613523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869007,0.00048148332,0.00007926822,0.00031602205,0.00027974698,0.00015337016],"domain_scores_gemma":[0.99741346,0.0014326834,0.00036370958,0.00027256337,0.00036251385,0.0001551311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023127606,0.0006528333,0.00047382203,0.0007086429,0.0008119313,0.0024306956,0.0013515597,0.0011831856,0.0030878917],"category_scores_gemma":[0.005276406,0.0003670389,0.0008265072,0.0014953421,0.0010258562,0.0022645332,0.0008862815,0.001806324,0.00027833678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010713289,0.00039235468,0.0030692492,0.0003116801,0.000036593417,0.00017026263,0.00076538726,0.65285623,0.0035112484,0.24044669,0.006308505,0.092024624],"study_design_scores_gemma":[0.000030322999,0.00011720379,0.0011577368,0.000067269444,0.000025647643,0.00007858012,0.00056540687,0.92212874,0.003812939,0.054780085,0.017206045,0.000030066916],"about_ca_topic_score_codex":0.017873416,"about_ca_topic_score_gemma":0.018694876,"teacher_disagreement_score":0.017873416,"about_ca_system_score_codex":0.0043309573,"about_ca_system_score_gemma":0.004246839,"threshold_uncertainty_score":0.035538733},"labels":[],"label_agreement":null}]}