{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870646,0.00024407801,0.0031618949,0.0028441998,0.0023604191,0.000098436416,0.0000019832341,0.00011844649,0.0041059316],"genre_scores_gemma":[0.9951908,0.0000064403644,0.0042909556,0.00014015024,0.000023635956,0.000015387206,0.0000026947134,0.000011107382,0.00031883028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977942,0.00008507938,0.00046205625,0.00037137498,0.0009417069,0.00034556453],"domain_scores_gemma":[0.9986082,0.00029292345,0.00015320313,0.0005326176,0.0002256607,0.000187404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016608683,0.00012357946,0.00020466268,0.00018811492,0.00048867066,0.00034402544,0.0004879634,0.0000653782,0.00018626399],"category_scores_gemma":[0.0015315267,0.00010502419,0.00012476239,0.0007365701,0.000089543864,0.0003064869,0.000107661755,0.00019976593,0.0012414226],"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.0000072936255,0.0001597844,0.006794923,0.000001181096,0.000023651475,0.000011445242,0.0007792139,0.0060812877,0.00018376012,0.9813485,0.0014275016,0.0031814417],"study_design_scores_gemma":[0.00080738193,0.0000568861,0.0067340285,0.00002616608,0.000013749028,0.000006644151,0.00047243387,0.00039739377,0.00093434984,0.9875402,0.0028732845,0.00013752129],"about_ca_topic_score_codex":0.00020045762,"about_ca_topic_score_gemma":0.000037025296,"teacher_disagreement_score":0.008126188,"about_ca_system_score_codex":0.00016510149,"about_ca_system_score_gemma":0.0001582433,"threshold_uncertainty_score":0.9995362},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02749255,0.00019188259,0.96686137,0.003483907,0.0012981058,0.00042134794,0.000013819081,0.00004336615,0.00019363208],"genre_scores_gemma":[0.98056966,0.000009484424,0.017528765,0.00036859198,0.0006072121,0.000029281293,0.0000102410795,0.000016553427,0.0008601936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975572,0.000074844225,0.0005698994,0.00050324976,0.0007677261,0.0005270457],"domain_scores_gemma":[0.9952456,0.0029304842,0.0001406537,0.0009376345,0.0005133331,0.00023233087],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019386647,0.00019875947,0.00018583264,0.0001389388,0.0022685537,0.0016036746,0.001186836,0.00012776916,0.00008475345],"category_scores_gemma":[0.00078206364,0.000116383926,0.00016767724,0.00028718368,0.00009717483,0.0003153733,0.00011260542,0.00036336467,0.000103782186],"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.000008229532,0.0000033832382,0.00034823074,3.7154862e-7,0.000015067112,1.3032167e-7,0.00039728577,0.88098615,0.000003953254,0.009222246,0.00017890014,0.108836025],"study_design_scores_gemma":[0.0002330615,0.000011840327,0.00013500852,0.000008819872,0.000023648188,8.3744646e-7,0.000085084816,0.9463897,0.000004211006,0.025670448,0.027274754,0.00016258414],"about_ca_topic_score_codex":0.009758505,"about_ca_topic_score_gemma":0.061904352,"teacher_disagreement_score":0.95307714,"about_ca_system_score_codex":0.00004382175,"about_ca_system_score_gemma":0.00055294007,"threshold_uncertainty_score":0.99943274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32882094,0.0006516357,0.6636179,0.004979073,0.00006793114,0.0011151591,0.000041847405,0.00037760424,0.00032789868],"genre_scores_gemma":[0.5603959,0.000021730348,0.43748444,0.0006109844,0.000105995416,0.0006702746,0.0000051509824,0.000031477284,0.0006740905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514747,0.00021121313,0.0014040658,0.001073457,0.00095273263,0.001211075],"domain_scores_gemma":[0.9962926,0.0011054559,0.00038834338,0.0013333046,0.00047262842,0.0004076499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008525089,0.00037359225,0.0006356658,0.0013234328,0.00049610704,0.0005143484,0.0011761539,0.0003469893,0.00003087745],"category_scores_gemma":[0.0040245005,0.00034512117,0.0004221676,0.0021349776,0.00013527893,0.00081400474,0.00024034546,0.0005782119,0.00004347049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065871,0.0005198941,0.066408984,0.00001797622,0.000025883166,0.0000048028587,0.00075160235,0.8753684,0.0021490226,0.035669733,0.0009021455,0.017974975],"study_design_scores_gemma":[0.0009144506,0.00006461026,0.011249314,0.0000500445,0.000022118207,0.000014954783,0.00016218235,0.8960918,0.00084802334,0.08971918,0.0005148017,0.00034851316],"about_ca_topic_score_codex":0.0014357624,"about_ca_topic_score_gemma":0.008246635,"teacher_disagreement_score":0.23157494,"about_ca_system_score_codex":0.0006499932,"about_ca_system_score_gemma":0.0006068152,"threshold_uncertainty_score":0.9999001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01725946,0.00049272546,0.9750752,0.0008795013,0.0035864627,0.00035371384,0.00002353697,0.00011679945,0.0022126362],"genre_scores_gemma":[0.77076244,0.000019547657,0.22216804,0.0019093205,0.0011128498,0.000005460562,0.000011188336,0.00009000569,0.0039211214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916853,0.00013758075,0.0013735042,0.0023926678,0.0031863076,0.0012246697],"domain_scores_gemma":[0.9938343,0.0022854859,0.0008272791,0.0019641344,0.0005865093,0.0005022828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049010287,0.00073382014,0.0010378925,0.0016736436,0.0010211833,0.0009098904,0.0035248655,0.0005043264,0.00022420038],"category_scores_gemma":[0.0025511717,0.00060385675,0.0004461705,0.00092086714,0.001362955,0.0003343532,0.0016291598,0.0010159943,0.0005296284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026780193,0.000035707657,0.0023563185,0.000019138375,0.000041728883,0.00006889031,0.00078475784,0.8708227,0.00054809055,0.0006150006,0.00024938313,0.12443147],"study_design_scores_gemma":[0.00038925535,0.00006727486,0.00020023758,0.00046107997,0.000042353364,0.000114941635,5.759868e-7,0.966269,0.0005557084,0.021922532,0.009181884,0.00079511735],"about_ca_topic_score_codex":0.0009327439,"about_ca_topic_score_gemma":0.0026700792,"teacher_disagreement_score":0.753503,"about_ca_system_score_codex":0.0010549127,"about_ca_system_score_gemma":0.0010347714,"threshold_uncertainty_score":0.9996413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016574452,0.00068730465,0.9916102,0.0033571308,0.0013992892,0.00086066587,0.000015544216,0.000043541706,0.0018605258],"genre_scores_gemma":[0.57835853,0.000013308987,0.4163493,0.0028738119,0.0005102272,0.00007161403,0.0000018486196,0.000037164664,0.0017842376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520004,0.00004912268,0.0006739361,0.0013705068,0.0021063704,0.00060002157],"domain_scores_gemma":[0.99334216,0.004356149,0.00032354286,0.0011602148,0.0006034514,0.00021450735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048092585,0.00035860587,0.0004781196,0.0004909821,0.00069886394,0.00085161603,0.001745941,0.00018655545,0.000018673605],"category_scores_gemma":[0.0011916521,0.00021851764,0.00013915096,0.0004950613,0.0005234469,0.00016309237,0.00044003673,0.00041899615,0.000041572737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009158526,0.000009040705,0.000020567548,0.0000050589165,0.000008161191,0.0000012493911,0.0015038344,0.53157,0.000022250868,0.007241002,0.00017752564,0.4594321],"study_design_scores_gemma":[0.00014670115,0.00014972039,0.000029026629,0.00016496854,0.000016319666,0.000012441074,0.0000020825028,0.677664,0.00010167561,0.31233916,0.0091191735,0.0002547539],"about_ca_topic_score_codex":0.000034330988,"about_ca_topic_score_gemma":0.000110072826,"teacher_disagreement_score":0.5781928,"about_ca_system_score_codex":0.00032232143,"about_ca_system_score_gemma":0.00064783916,"threshold_uncertainty_score":0.8910891},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017054479,0.00030336456,0.0076351073,0.00067948335,0.000841382,0.00009434697,0.000041403233,0.00014689946,0.99024093],"genre_scores_gemma":[0.0064051375,0.0000636123,0.002622825,0.00043055604,0.0003037563,0.0000016773633,0.0000106116395,0.00002800827,0.9901338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99704117,0.000023377537,0.000623437,0.0006233795,0.0013888773,0.00029974224],"domain_scores_gemma":[0.9972736,0.00096221524,0.0002612394,0.00089936506,0.00039704202,0.00020653578],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016327604,0.00025409934,0.00044099477,0.00047996093,0.00016017116,0.00025648513,0.00074940943,0.00035445706,0.06356521],"category_scores_gemma":[0.0011802845,0.00018437047,0.0003395654,0.000116276344,0.0004508496,0.00008119653,0.00010095828,0.00038608006,0.026795331],"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.0000033079575,0.000010321615,0.00008181561,5.007076e-7,0.000047728332,0.000034862896,0.000020154235,0.000029482759,0.0000014016708,0.78451884,0.12315571,0.0920959],"study_design_scores_gemma":[0.00009727722,0.000013895911,0.00003919326,0.00002488772,0.000028116325,0.000044581793,0.000025799522,0.00004497789,0.0000032060511,0.3403113,0.65916145,0.00020533818],"about_ca_topic_score_codex":0.000011743383,"about_ca_topic_score_gemma":0.000025165582,"teacher_disagreement_score":0.53600574,"about_ca_system_score_codex":0.00003292326,"about_ca_system_score_gemma":0.0002140165,"threshold_uncertainty_score":0.9739624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10952911,0.0001760332,0.5489881,0.040110067,0.0011459658,0.0014793284,0.0002958412,0.000646499,0.29762906],"genre_scores_gemma":[0.9907678,0.000019619341,0.0052503897,0.0035257724,0.000031907963,0.0000134642805,0.000052282478,0.0000069978505,0.000331806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696577,0.000088210705,0.001330338,0.00017690702,0.001049709,0.000389053],"domain_scores_gemma":[0.9974512,0.0006107077,0.00045791862,0.00062061346,0.0006230647,0.00023653198],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013939379,0.00015453903,0.00028249848,0.0013713324,0.0002492295,0.0002902962,0.00051933806,0.00020171239,0.0007704473],"category_scores_gemma":[0.00387875,0.00012218078,0.0001687821,0.0018435033,0.00017145525,0.0012086222,0.00006057978,0.00026045777,0.0015703191],"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.000063932996,0.00046219502,0.011602913,0.00009970377,0.00010787316,0.000014818207,0.006947945,0.010806384,0.00048531237,0.27172628,0.54504806,0.15263459],"study_design_scores_gemma":[0.0017428658,0.0002641441,0.009959626,0.00024427837,0.00007140737,0.00009326717,0.0011047773,0.20723765,0.0013859016,0.01876422,0.7583854,0.0007464294],"about_ca_topic_score_codex":0.00073644286,"about_ca_topic_score_gemma":0.000774713,"teacher_disagreement_score":0.88123864,"about_ca_system_score_codex":0.000072537136,"about_ca_system_score_gemma":0.00004990089,"threshold_uncertainty_score":0.9992071},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024266921,0.00017123148,0.97050405,0.0019596017,0.0022628638,0.00029362232,0.000008017007,0.00010607595,0.024451887],"genre_scores_gemma":[0.19536252,0.0000072796406,0.7898507,0.0014826156,0.0012570532,0.0000110272085,0.000004460484,0.000048265978,0.0119760465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99334085,0.00007573047,0.00087105297,0.0017452538,0.003218495,0.00074861187],"domain_scores_gemma":[0.9951458,0.0021089436,0.0004499915,0.0016415172,0.00039699048,0.00025675196],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008365664,0.00045416082,0.0005986111,0.0012811872,0.0007955322,0.0010911227,0.0031128337,0.00048048884,0.0003348039],"category_scores_gemma":[0.0015258645,0.0003364383,0.00021944333,0.00052839186,0.0009995498,0.0003885887,0.00091097376,0.002458273,0.0005395932],"study_design_candidate":"design_other","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.000007215283,0.000083783925,0.00027053937,0.000009606613,0.000020187603,0.000038617654,0.0011404225,0.030271312,0.001328352,0.01892077,0.00013803196,0.94777113],"study_design_scores_gemma":[0.00022422409,0.00010395438,0.00010515643,0.00024309894,0.000021968692,0.000044296634,6.501689e-7,0.09052912,0.0011119053,0.87558657,0.031352505,0.00067656656],"about_ca_topic_score_codex":0.00006351451,"about_ca_topic_score_gemma":0.00015758858,"teacher_disagreement_score":0.9470946,"about_ca_system_score_codex":0.00019236306,"about_ca_system_score_gemma":0.0006852063,"threshold_uncertainty_score":0.9999458},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09158159,0.00015314996,0.89895546,0.00017043659,0.00034215418,0.00025957334,0.0000047838,0.0001751547,0.0083576795],"genre_scores_gemma":[0.5877857,0.0000014587854,0.40904686,0.000061419305,0.00019729066,0.000015022153,0.00000548679,0.000019880692,0.002866844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955851,0.000369312,0.00066248793,0.0006900687,0.002138706,0.000554371],"domain_scores_gemma":[0.9973931,0.0005359457,0.00028317023,0.00056742446,0.00085938897,0.00036097996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007379071,0.0002338974,0.00034416918,0.00043860456,0.00041204138,0.0006832237,0.00043685586,0.00010429096,0.00034374135],"category_scores_gemma":[0.0010925066,0.00015643568,0.00008327738,0.0013704496,0.00010773003,0.000899158,0.00013714698,0.00018836008,0.00034234446],"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.00008706114,0.0006110604,0.013842365,0.000009160075,0.00024323435,0.00007665596,0.0032255019,0.18488663,0.0027052378,0.005410266,0.0031383056,0.7857645],"study_design_scores_gemma":[0.0012628468,0.00021809601,0.0014988716,0.000048264035,0.00012128995,0.00011300602,0.0016359617,0.9816791,0.00340966,0.004418842,0.0051368778,0.00045722656],"about_ca_topic_score_codex":0.00025563868,"about_ca_topic_score_gemma":0.000030898547,"teacher_disagreement_score":0.79679245,"about_ca_system_score_codex":0.00017396733,"about_ca_system_score_gemma":0.00032781775,"threshold_uncertainty_score":0.6588342},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011988875,0.000488649,0.9914845,0.00039892178,0.0049639004,0.0004209218,0.000015796297,0.00008511357,0.00094327645],"genre_scores_gemma":[0.04796851,0.000038118033,0.94922936,0.0010601112,0.0010548099,0.0000062165263,0.000011706316,0.000055593275,0.00057560194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935619,0.00015138925,0.0017325858,0.0019140964,0.0017906269,0.000849395],"domain_scores_gemma":[0.9908949,0.0057261917,0.0008172381,0.0011638443,0.0011105913,0.00028720158],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012023601,0.00050164823,0.0009276791,0.001532766,0.00087018526,0.0012334161,0.001938029,0.00060688483,0.000097225835],"category_scores_gemma":[0.008318354,0.00043093337,0.00040926086,0.001555508,0.0010553366,0.00057374866,0.00030215617,0.0009660622,0.000022411012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008891899,0.000018361092,0.00027868408,0.0000042922866,0.000013620732,0.000004069028,0.00026840522,0.9023369,0.0000070752735,0.0021555617,0.000009995969,0.09489417],"study_design_scores_gemma":[0.00038391748,0.000094944124,0.000027322658,0.0001973398,0.00003851919,0.000028707094,0.0000038137898,0.91212344,0.00003036122,0.08373671,0.0028550152,0.0004798843],"about_ca_topic_score_codex":0.000011672747,"about_ca_topic_score_gemma":0.000025496422,"teacher_disagreement_score":0.09441429,"about_ca_system_score_codex":0.00020197705,"about_ca_system_score_gemma":0.0012975443,"threshold_uncertainty_score":0.9998143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8753591,0.00003943834,0.09382484,0.0011911734,0.0032974295,0.00029006414,0.0000035616977,0.0007048125,0.025289588],"genre_scores_gemma":[0.8507557,0.0000037582251,0.14689384,0.000042986845,0.00006453986,0.000008855647,0.0000034289785,0.000011510635,0.002215406],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973757,0.0000969649,0.00071942114,0.00047375946,0.0010514117,0.00028270262],"domain_scores_gemma":[0.9980882,0.00026905764,0.0003821229,0.0007368758,0.00044259074,0.000081183396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031409115,0.00013653867,0.00022133363,0.0003039302,0.0002575852,0.00015646126,0.0004930802,0.00017055908,0.0005871025],"category_scores_gemma":[0.0017466205,0.00010960844,0.00012882157,0.001151633,0.00011896829,0.00066316465,0.00011992937,0.00040062008,0.00035082805],"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.00017165781,0.0034073833,0.012429741,0.00035093914,0.00057505706,0.000053326632,0.0029141689,0.028674064,0.3963945,0.3623988,0.00457082,0.18805955],"study_design_scores_gemma":[0.00052641827,0.000081250764,0.015380147,0.000038685375,0.00008394912,0.000021584676,0.0010716781,0.95689726,0.006312469,0.017574081,0.0017533582,0.00025911402],"about_ca_topic_score_codex":0.00009364615,"about_ca_topic_score_gemma":0.00009909623,"teacher_disagreement_score":0.9282232,"about_ca_system_score_codex":0.00003658127,"about_ca_system_score_gemma":0.000067274144,"threshold_uncertainty_score":0.64283603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038113524,0.00043746814,0.9945918,0.0010083858,0.0018432831,0.00082578784,0.000033756292,0.00012839513,0.0007500105],"genre_scores_gemma":[0.15226191,0.000004391305,0.8436659,0.0010120133,0.0017280796,0.000040872415,0.00002837414,0.00004178482,0.0012167022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943934,0.00006129105,0.0010644302,0.001763331,0.001930454,0.00078707107],"domain_scores_gemma":[0.994267,0.0028060374,0.0004896956,0.0011293538,0.0010885596,0.0002193429],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0064913924,0.000448361,0.00066412485,0.0014610614,0.0007177531,0.0015298519,0.0016819036,0.00037414645,0.00014211531],"category_scores_gemma":[0.003065219,0.00038686654,0.00031597662,0.0009654584,0.0009555711,0.00035839522,0.00022141731,0.000577617,0.000099098295],"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.000007208322,0.000026042404,0.000085559295,0.000005826822,0.000009807116,0.0000049058453,0.00010599988,0.18724434,0.00026970895,0.0020819593,0.00009849887,0.81006014],"study_design_scores_gemma":[0.00046085272,0.00014503788,0.000045774796,0.00013528572,0.000034268218,0.000023250679,5.556881e-7,0.94043916,0.00097083655,0.037523486,0.019668534,0.00055295206],"about_ca_topic_score_codex":0.000016500986,"about_ca_topic_score_gemma":0.00020791945,"teacher_disagreement_score":0.8095072,"about_ca_system_score_codex":0.0002540626,"about_ca_system_score_gemma":0.0012948497,"threshold_uncertainty_score":0.9998583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3537956,0.012514847,0.6129236,0.013050901,0.0016407602,0.0003193409,0.000011535585,0.00012732069,0.0056161],"genre_scores_gemma":[0.9824814,0.00054300233,0.0016364759,0.000103539154,0.00037844703,0.000006960559,4.158443e-7,0.000014013776,0.014835738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996674,0.000083121384,0.00044314624,0.00024155289,0.00059317535,0.001964975],"domain_scores_gemma":[0.998669,0.00053600705,0.00017772472,0.00027742586,0.00023531288,0.000104508435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006850653,0.00010064956,0.0001771679,0.0002406869,0.00053128245,0.00029408713,0.00053796306,0.000051669438,0.0001466485],"category_scores_gemma":[0.0025457111,0.00007324244,0.0002092679,0.0004328056,0.000036963964,0.00023951533,0.000031504234,0.00077796157,0.0002823958],"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.00013308109,0.00024173956,0.0023475923,0.0000036584727,0.00024994064,0.000008978903,0.0014076355,0.0024073364,0.0021549203,0.35577995,0.007845534,0.62741965],"study_design_scores_gemma":[0.0010592459,0.00034556745,0.0002851848,0.000014855518,0.000034765304,0.000840724,0.0018568526,0.02241471,0.00011501748,0.9039864,0.06882747,0.00021919748],"about_ca_topic_score_codex":0.000009277863,"about_ca_topic_score_gemma":0.00014104821,"teacher_disagreement_score":0.62868583,"about_ca_system_score_codex":0.00023777755,"about_ca_system_score_gemma":0.00033942919,"threshold_uncertainty_score":0.40862486},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23519924,0.0007065097,0.7583492,0.0045198305,0.000902534,0.00015551042,0.0000044318535,0.000008678099,0.0001541036],"genre_scores_gemma":[0.94599986,0.000024743738,0.051627405,0.000075183205,0.0020258732,0.0000052520913,3.7733926e-7,0.000012020638,0.00022930946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938561,0.0010205818,0.0012722381,0.00021688649,0.002775335,0.00085887144],"domain_scores_gemma":[0.99332166,0.002503491,0.00045336768,0.0005052228,0.002850089,0.00036618917],"candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.041357085,0.00010740725,0.00023115368,0.0007156473,0.0016347825,0.00050355727,0.0010033132,0.00007672705,0.00013768373],"category_scores_gemma":[0.028210219,0.00006526514,0.00017529937,0.0032403106,0.00023508772,0.0006748062,0.00020778566,0.00083422684,0.0005240302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020729419,0.0005664155,0.0020497462,0.00000817432,0.00006966031,0.000010233125,0.0113099655,0.6774558,0.046523463,0.073685914,0.004684244,0.18342912],"study_design_scores_gemma":[0.000028648485,0.00016430498,0.00021573047,0.000085196996,0.000024118714,0.00009426683,0.010492075,0.93171835,0.015713567,0.029008066,0.012282667,0.00017301738],"about_ca_topic_score_codex":0.00006345896,"about_ca_topic_score_gemma":0.00006441302,"teacher_disagreement_score":0.7108006,"about_ca_system_score_codex":0.00018482315,"about_ca_system_score_gemma":0.00035595143,"threshold_uncertainty_score":0.99966496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019634902,0.00053702673,0.97312176,0.001525406,0.0024515896,0.00035416623,0.000024385037,0.000101205886,0.019920979],"genre_scores_gemma":[0.49096993,0.00003934718,0.48476136,0.0023970678,0.002729338,0.000016517864,0.000043746524,0.000102623286,0.018940074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940014,0.00009317684,0.0012156462,0.0015950951,0.0022597383,0.0008349504],"domain_scores_gemma":[0.9946268,0.0030402082,0.00042427846,0.0012222867,0.00047512347,0.00021126962],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007073249,0.00040291317,0.0006069925,0.0035661233,0.00039266015,0.00052938215,0.0020442223,0.0005073755,0.00025284998],"category_scores_gemma":[0.0029240986,0.00035183498,0.0001917961,0.0022329146,0.0010314501,0.00041056072,0.00047365105,0.0010402226,0.0011044969],"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.00008648827,0.00013360009,0.00050632475,0.000009147277,0.00001847961,0.0001564371,0.0016941312,0.31695634,0.00048374062,0.005192925,0.0013284493,0.67343396],"study_design_scores_gemma":[0.00074363366,0.00018274461,0.0021232278,0.0003703524,0.000022193968,0.000080571575,0.0000019499523,0.73868185,0.00031102393,0.239909,0.016579794,0.0009936524],"about_ca_topic_score_codex":0.00008618248,"about_ca_topic_score_gemma":0.0005312253,"teacher_disagreement_score":0.6724403,"about_ca_system_score_codex":0.0004618691,"about_ca_system_score_gemma":0.00089355477,"threshold_uncertainty_score":0.99989337},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024565722,0.9014008,0.08475423,0.00038377615,0.00045756967,0.0046050716,0.000023852803,0.00007685536,0.008295387],"genre_scores_gemma":[0.0001257946,0.8216407,0.17494316,0.0003362918,0.00023471222,0.0020034334,0.00004429939,0.000039075716,0.0006325779],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918376,0.00046655408,0.0018761833,0.001599181,0.0028332353,0.0013872015],"domain_scores_gemma":[0.9966016,0.000659439,0.00074587687,0.0016461647,0.00017545382,0.00017147063],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.015923569,0.00042556232,0.0013412492,0.0012926826,0.0015038062,0.00069706875,0.0041332166,0.00011002599,0.000036703685],"category_scores_gemma":[0.0008894258,0.00026140653,0.00059783214,0.0082627935,0.00024030296,0.00029110475,0.00027868303,0.00047632464,0.00015050596],"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.0000014642948,0.000121348625,0.0000016231133,0.0042582084,0.000010537678,0.0000016542622,0.0014725568,0.00031896573,1.4348223e-9,0.012041085,0.0005311917,0.98124135],"study_design_scores_gemma":[0.00012533448,0.000059714923,0.0000061835167,0.0020987678,0.00012706949,0.000007475376,0.0069242897,0.003778561,1.0601705e-8,0.0031254222,0.9834281,0.00031903497],"about_ca_topic_score_codex":0.000017550052,"about_ca_topic_score_gemma":0.000012186417,"teacher_disagreement_score":0.9828969,"about_ca_system_score_codex":0.00034134206,"about_ca_system_score_gemma":0.000616664,"threshold_uncertainty_score":0.9999838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065434835,0.0011316423,0.9924485,0.0010434055,0.0016673815,0.00043664352,0.000006139404,0.00006366024,0.002548262],"genre_scores_gemma":[0.21610813,0.00008327656,0.77973557,0.0012799404,0.0016353279,0.000011238366,0.0000021735561,0.00005555181,0.001088777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942126,0.00014224998,0.000956043,0.0014226781,0.0024224808,0.0008439161],"domain_scores_gemma":[0.9938053,0.0032472964,0.00053335365,0.0017166473,0.0005682801,0.00012911795],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0054748203,0.00046246775,0.00049910235,0.00052015035,0.0017006893,0.0014522949,0.004137556,0.00026088156,0.00008784919],"category_scores_gemma":[0.00083397335,0.00024716658,0.0002472939,0.0015521839,0.0016762647,0.00022774917,0.0007200135,0.0011909915,0.000076248616],"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.0000017048399,0.000008736386,0.00001840949,0.000002084448,0.000010274837,0.000011632141,0.0010284495,0.35897496,0.00016512016,0.00057708076,0.00001023522,0.6391913],"study_design_scores_gemma":[0.00010965384,0.000032779826,0.000099028315,0.00018988962,0.000027928761,0.000118127624,0.0000044328494,0.77768135,0.00039790114,0.21948871,0.0015109249,0.0003392605],"about_ca_topic_score_codex":0.00008500624,"about_ca_topic_score_gemma":0.00014507325,"teacher_disagreement_score":0.63885206,"about_ca_system_score_codex":0.00018465234,"about_ca_system_score_gemma":0.0007278982,"threshold_uncertainty_score":0.99999803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64636683,0.001133833,0.026182285,0.10239196,0.00021437922,0.0014739155,0.000074163865,0.00007020686,0.22209245],"genre_scores_gemma":[0.96752226,0.000028551,0.01317305,0.00062737596,0.00021498784,0.00011596701,0.0000030787735,0.0000093917015,0.018305354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967026,0.0004983289,0.00039593343,0.00034313856,0.0016278354,0.00043215873],"domain_scores_gemma":[0.99702215,0.00039366708,0.000023030523,0.0008006614,0.0016319815,0.00012849573],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0064030867,0.00007600397,0.0001523457,0.0004444477,0.0009457579,0.00057574926,0.0010044993,0.000037295235,0.00015741446],"category_scores_gemma":[0.0022176497,0.000046073415,0.00009142129,0.0027399403,0.0001498418,0.00025731119,0.00023364373,0.00025743764,0.0011593903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016031301,0.0007952433,0.00023297087,0.0000073755045,0.00006087266,0.0000013727465,0.00834316,0.57974267,0.0061451634,0.06517621,0.26707414,0.0724048],"study_design_scores_gemma":[0.00020940998,0.00022755635,0.0022598077,0.000028121707,0.0000053643084,0.0000069919483,0.0021030724,0.8385104,0.005655509,0.0043297266,0.14644557,0.0002184578],"about_ca_topic_score_codex":0.00021632489,"about_ca_topic_score_gemma":0.0000673682,"teacher_disagreement_score":0.32115543,"about_ca_system_score_codex":0.000009151213,"about_ca_system_score_gemma":0.000057891986,"threshold_uncertainty_score":0.99961835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039179556,0.00028000394,0.9556984,0.0018596292,0.00016236435,0.0011796437,0.000007063247,0.000050082206,0.0015832972],"genre_scores_gemma":[0.6656803,0.0000036836805,0.33293417,0.00016338019,0.0001532398,0.000078759986,0.000006167538,0.0000061872493,0.00097414345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780804,0.00018586022,0.00060672086,0.00034854506,0.0007813557,0.00026949233],"domain_scores_gemma":[0.99705297,0.0012528909,0.00020664382,0.00054763566,0.0008809974,0.00005889111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005188949,0.00012198457,0.00018201812,0.00019487324,0.000553306,0.00033349844,0.0006004687,0.0000564286,0.0000119285205],"category_scores_gemma":[0.0036479142,0.0000585556,0.00010992982,0.0015298072,0.000061102786,0.000105592146,0.000029994828,0.00009769611,0.000026426891],"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.00001504766,0.00024066078,0.000117524716,0.0000046396794,0.00003486061,7.8949434e-8,0.0018524087,0.15673912,0.0045680595,0.017032279,0.0037138895,0.81568146],"study_design_scores_gemma":[0.00030542104,0.00020280629,0.008222265,0.00000782008,0.00011090471,0.000009456582,0.0011261294,0.9653182,0.0014497509,0.005002099,0.01808549,0.00015964391],"about_ca_topic_score_codex":0.000026076623,"about_ca_topic_score_gemma":0.000015894437,"teacher_disagreement_score":0.8155218,"about_ca_system_score_codex":0.000019468707,"about_ca_system_score_gemma":0.000065603796,"threshold_uncertainty_score":0.43671575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22642845,0.07211649,0.35626814,0.07367889,0.009585759,0.00036880723,0.00005619751,0.00042986588,0.26106742],"genre_scores_gemma":[0.6758475,0.0008241038,0.16423556,0.00093364104,0.0005232117,0.000010906427,0.000001926541,0.00001902263,0.15760414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695444,0.00014347698,0.00061336294,0.0006078041,0.00093432446,0.00074658706],"domain_scores_gemma":[0.99772906,0.00073448406,0.00014106075,0.000615811,0.00043662442,0.00034297185],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021782867,0.00022570508,0.00031650704,0.00024337287,0.0007098784,0.00052337063,0.00076960254,0.00020353746,0.005340441],"category_scores_gemma":[0.0027171283,0.00017873656,0.00023542732,0.0017247283,0.0008936426,0.00073903165,0.0001265421,0.00028534187,0.010693919],"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.000018946075,0.0005142156,0.0053788596,0.000022695629,0.00008836416,0.000029424595,0.0015983533,0.020105429,0.00023425782,0.6828957,0.0077786995,0.28133503],"study_design_scores_gemma":[0.00080194446,0.0001452091,0.007768242,0.0001920219,0.000072391944,0.00009406187,0.0021858674,0.0012786784,0.0025644787,0.812679,0.17181095,0.00040712528],"about_ca_topic_score_codex":0.00389853,"about_ca_topic_score_gemma":0.0015668287,"teacher_disagreement_score":0.44941905,"about_ca_system_score_codex":0.00017370957,"about_ca_system_score_gemma":0.00081526866,"threshold_uncertainty_score":0.9955688},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290302,0.009721262,0.23217568,0.025664423,0.00051375234,0.0009737027,0.000096629956,0.0006462249,0.0011781431],"genre_scores_gemma":[0.86841816,0.0011041494,0.11590215,0.0009669647,0.00035558562,0.00017224421,0.000033091837,0.00010325912,0.012944388],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9941138,0.00092816364,0.0008961554,0.0009741997,0.0009938211,0.0020938816],"domain_scores_gemma":[0.9941428,0.0020118114,0.0004879346,0.0011456205,0.0010471996,0.0011646769],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002089878,0.00071432313,0.0007029118,0.0009927712,0.0015492521,0.0013969768,0.0014073721,0.0008026791,0.0008795177],"category_scores_gemma":[0.0040884074,0.00073044276,0.00048396693,0.0020071068,0.0009955725,0.0020670663,0.00046242232,0.0008933199,0.0007228576],"study_design_candidate":"observational","study_design_consensus":"observational","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.000109635876,0.00086836104,0.7379437,0.00009823205,0.0003126458,0.00018862744,0.0058693844,0.02751148,0.002964658,0.07118764,0.022464167,0.13048147],"study_design_scores_gemma":[0.0015689505,0.00056023756,0.58306044,0.0008573071,0.00040667254,0.00025281226,0.010957183,0.31853175,0.0052479804,0.06593568,0.011254622,0.0013663499],"about_ca_topic_score_codex":0.08443688,"about_ca_topic_score_gemma":0.012953601,"teacher_disagreement_score":0.29102027,"about_ca_system_score_codex":0.002163027,"about_ca_system_score_gemma":0.0019601006,"threshold_uncertainty_score":0.9997506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.457661,0.00010941205,0.52721626,0.00029155376,0.00027167596,0.00027126534,0.0000021627259,0.00015405403,0.014022584],"genre_scores_gemma":[0.8748193,0.0000015556827,0.12262029,0.00006555953,0.00018907926,0.000011158417,0.0000041454996,0.000022615617,0.0022662897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945732,0.0007569002,0.00073273235,0.0007140145,0.0025688813,0.0006542815],"domain_scores_gemma":[0.99686563,0.0010029739,0.00023232878,0.0005763756,0.00092958595,0.00039313093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018923672,0.00020683737,0.00032698383,0.00052292494,0.00050334685,0.00082742976,0.00047911349,0.00010271828,0.00026358545],"category_scores_gemma":[0.0020323882,0.00014236708,0.000082101775,0.0015324731,0.00011498437,0.0008784209,0.00018917119,0.00027991922,0.00035624675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016747792,0.00078387983,0.046585824,0.000018966535,0.00021489484,0.000056033205,0.0073273974,0.7361702,0.018841695,0.013743572,0.0015731044,0.17451699],"study_design_scores_gemma":[0.0013628912,0.0002619628,0.0027653917,0.000083258754,0.000089136745,0.00007809346,0.0057197874,0.97547543,0.009010357,0.0028333624,0.0018258141,0.00049449794],"about_ca_topic_score_codex":0.00026356385,"about_ca_topic_score_gemma":0.0000316007,"teacher_disagreement_score":0.41715828,"about_ca_system_score_codex":0.0002032216,"about_ca_system_score_gemma":0.00042186375,"threshold_uncertainty_score":0.7978924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036208633,0.0025887545,0.95527166,0.00022837071,0.002065982,0.00067707564,0.000046531273,0.0021849927,0.0007280053],"genre_scores_gemma":[0.66267496,0.00006612916,0.33631235,0.000023292805,0.00002825846,0.00012794908,0.000002238299,0.000023996434,0.000740828],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99572676,0.000077764285,0.0013629646,0.0009975022,0.0011589685,0.00067601254],"domain_scores_gemma":[0.9939581,0.0026497256,0.00044807617,0.0018091713,0.0010157259,0.000119214994],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004652892,0.00032449534,0.0005908012,0.0010742574,0.0004913231,0.00028892822,0.0024238203,0.00036818383,0.00016598265],"category_scores_gemma":[0.0153224,0.00022678946,0.00046514036,0.0016672466,0.00028477318,0.0002671936,0.00046884757,0.00029443367,0.0024643946],"study_design_candidate":"design_other","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.00016597821,0.00052411866,0.0020234936,0.000012344741,0.0001204404,0.000027140317,0.0005018577,0.00039440446,0.0010098993,0.01797056,0.006274626,0.97097516],"study_design_scores_gemma":[0.00233211,0.00086615194,0.0038581695,0.00059793907,0.0004060386,0.00025160698,0.06618607,0.11125417,0.37940717,0.28097486,0.15192613,0.0019395811],"about_ca_topic_score_codex":0.000031260523,"about_ca_topic_score_gemma":0.000016396769,"teacher_disagreement_score":0.96903557,"about_ca_system_score_codex":0.000110022025,"about_ca_system_score_gemma":0.000104284256,"threshold_uncertainty_score":0.9983123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753852,0.00012910173,0.00020795336,0.01547363,0.00407508,0.00035036472,0.000029755514,0.00008446213,0.0042644646],"genre_scores_gemma":[0.9908697,0.0000011833483,0.0051162406,0.00036070636,0.00034229626,0.000037345195,0.0000025912343,0.00002289833,0.0032470094],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973422,0.000016821823,0.00050577655,0.0003176701,0.0013898888,0.0004276206],"domain_scores_gemma":[0.9957959,0.00021267029,0.00044637022,0.0002303842,0.002624729,0.0006899466],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0034932834,0.00015133173,0.00023192364,0.0005755514,0.00026236192,0.00051433675,0.0009545946,0.00012741778,0.000018546529],"category_scores_gemma":[0.018345209,0.000132912,0.00011302057,0.0018417113,0.000015337113,0.00034875615,0.00008580501,0.00024666538,0.0001106205],"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.0000035574785,0.0001326774,0.8805803,0.000018333245,0.00009729667,1.0194735e-7,0.0040094615,0.054716375,0.0006164697,0.013019316,0.045176085,0.0016300371],"study_design_scores_gemma":[0.00091068784,0.00008668606,0.82751936,0.0005564966,0.00026363967,0.000010487218,0.038495727,0.024446696,0.005232146,0.0047727865,0.09653173,0.0011735457],"about_ca_topic_score_codex":0.004936324,"about_ca_topic_score_gemma":0.0045584682,"teacher_disagreement_score":0.053060915,"about_ca_system_score_codex":0.0019842335,"about_ca_system_score_gemma":0.0018142208,"threshold_uncertainty_score":0.9899237},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10531407,0.0008143988,0.24789861,0.082170695,0.0015518884,0.000495192,0.000011788507,0.0005382361,0.56120515],"genre_scores_gemma":[0.92825305,0.000014954047,0.06330851,0.00063457404,0.00019870678,0.000015560048,0.0000011757635,0.000007608671,0.007565848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971927,0.00006383053,0.00046409643,0.00033416096,0.0016251553,0.00032009403],"domain_scores_gemma":[0.9974856,0.001291721,0.0001149498,0.00028500627,0.0007218895,0.00010082895],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0049354383,0.0000970794,0.00011318668,0.00022884311,0.00097127137,0.0005856174,0.0007425556,0.00005719356,0.00013863483],"category_scores_gemma":[0.0052247713,0.000052010117,0.00012451799,0.0009770888,0.00013958842,0.00021992254,0.00009148459,0.00017899535,0.0022826497],"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.000009161411,0.00006413293,0.0007046574,5.730439e-7,0.000025917398,9.24595e-7,0.0001562968,0.091380514,0.0003158892,0.897302,0.0042787786,0.0057611936],"study_design_scores_gemma":[0.00047233712,0.000029037918,0.0021511011,0.000009388535,0.0000066150706,0.000016867263,0.00036055225,0.004929828,0.00075045746,0.8990183,0.09210608,0.00014942742],"about_ca_topic_score_codex":0.00006902405,"about_ca_topic_score_gemma":0.00013993922,"teacher_disagreement_score":0.822939,"about_ca_system_score_codex":0.00006795071,"about_ca_system_score_gemma":0.00043115197,"threshold_uncertainty_score":0.9984942},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5618409,0.00074921764,0.42964745,0.00022232803,0.0066749686,0.00011172796,0.0000013173569,0.0002744444,0.0004776264],"genre_scores_gemma":[0.96904546,0.0000012851879,0.028457679,0.00004090234,0.002232368,0.00000902119,0.0000031099187,0.000019715486,0.00019046756],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975962,0.00009222218,0.0006093067,0.0003429958,0.0006933529,0.0006659371],"domain_scores_gemma":[0.9969353,0.0020904203,0.00016756878,0.00039724068,0.00008461452,0.00032485972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022117204,0.00024190647,0.00037042776,0.0004147441,0.00027108617,0.00042776638,0.0007284794,0.00019950648,0.000040881554],"category_scores_gemma":[0.003428799,0.0001953346,0.00015028984,0.0012716927,0.00004748685,0.0005147335,0.00019992265,0.0006356153,0.00010709754],"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.00003728445,0.00009339904,0.3957836,0.0000071861828,0.00013635593,0.000009480392,0.0073935776,0.33520594,0.00056683,0.007025265,0.007941735,0.24579936],"study_design_scores_gemma":[0.0021003466,0.00016173391,0.050354637,0.0015290525,0.000105710555,0.000056444045,0.0049876906,0.8650782,0.0008797102,0.0012632355,0.07174351,0.0017397392],"about_ca_topic_score_codex":0.000037164304,"about_ca_topic_score_gemma":6.6916215e-7,"teacher_disagreement_score":0.52987224,"about_ca_system_score_codex":0.00008272477,"about_ca_system_score_gemma":0.000059919,"threshold_uncertainty_score":0.7965514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02985914,0.00008697966,0.95192724,0.003100041,0.00021523221,0.00024247292,0.000011372664,0.000100150486,0.014457392],"genre_scores_gemma":[0.9613537,0.0000025276574,0.03091184,0.00008902003,0.000071334216,0.00004246834,0.0000034049363,0.0000046770597,0.0075209807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989229,0.000047678204,0.00026497967,0.0003059569,0.0002991836,0.00015928884],"domain_scores_gemma":[0.9960521,0.0031872871,0.00007420218,0.00032164785,0.0002848734,0.00007990561],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002041107,0.00005779911,0.000103640574,0.00019601763,0.0003268859,0.00017186425,0.00015541314,0.00003748986,0.000055354838],"category_scores_gemma":[0.011696525,0.000041150663,0.000058347756,0.00050933805,0.00007921488,0.00017452873,0.000030597635,0.000041118423,0.000091115806],"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.00001340037,0.00023936287,0.2171592,0.000011513359,0.000029592615,1.2757948e-7,0.00059498893,0.004925994,0.003590496,0.6938574,0.04917519,0.030402731],"study_design_scores_gemma":[0.0004645243,0.00009530344,0.06615497,0.000006379351,0.00002035329,0.0000054733086,0.00027619084,0.10225242,0.0001723363,0.80497617,0.025455894,0.000119996934],"about_ca_topic_score_codex":0.00007956601,"about_ca_topic_score_gemma":0.00009159352,"teacher_disagreement_score":0.9314946,"about_ca_system_score_codex":0.0000071268496,"about_ca_system_score_gemma":0.00001910128,"threshold_uncertainty_score":0.9966284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85600317,0.006363909,0.02516305,0.06186296,0.00030369277,0.0006772426,0.000035782057,0.00013577378,0.049454413],"genre_scores_gemma":[0.9918921,0.00025997998,0.005277226,0.0000861486,0.000036855687,0.000010487862,0.0000013460485,0.0000054439747,0.0024303945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952851,0.0023893907,0.00051268126,0.00021416506,0.0013358027,0.00026284374],"domain_scores_gemma":[0.97248256,0.021816771,0.00008113558,0.00069183,0.0048405672,0.00008711739],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04875991,0.00005474465,0.00015743767,0.00036542158,0.00093510223,0.00032657152,0.000521877,0.00004551227,0.000060273967],"category_scores_gemma":[0.11818548,0.00003204013,0.00004989374,0.0014394613,0.0005854965,0.0003569231,0.00015404905,0.00021025099,0.000085671214],"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.00012136886,0.00023540875,0.00028694933,0.0000072140706,0.000115409595,6.8755975e-7,0.0015460479,0.014760665,0.0074197995,0.85637236,0.013943176,0.10519094],"study_design_scores_gemma":[0.00045572838,0.00044489594,0.009492444,0.000057092067,0.000029108342,0.000021776994,0.007121614,0.74844545,0.022822905,0.09521177,0.11571142,0.00018581486],"about_ca_topic_score_codex":0.00013404989,"about_ca_topic_score_gemma":0.000034034965,"teacher_disagreement_score":0.76116055,"about_ca_system_score_codex":0.0000028331742,"about_ca_system_score_gemma":0.00017088768,"threshold_uncertainty_score":0.97950184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05806725,0.000096921045,0.9367973,0.0028487055,0.00006489315,0.0015444887,0.000020598543,0.00002173913,0.0005381074],"genre_scores_gemma":[0.35664192,0.0000117059735,0.6409079,0.000015556976,0.00008339339,0.0006855933,0.0000074958193,0.000012012323,0.0016344759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697447,0.00021347063,0.00073695544,0.0002469427,0.0015009916,0.00032714324],"domain_scores_gemma":[0.9936688,0.0025915136,0.00007437898,0.0007880247,0.0027779173,0.00009939879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011360094,0.00008547569,0.00018244974,0.00028717285,0.0010189303,0.0010277329,0.00083341467,0.000054130393,0.00036357838],"category_scores_gemma":[0.0031134584,0.00004921268,0.00008642717,0.0009400326,0.00017422154,0.00048657163,0.00006686601,0.00019257728,0.00025439425],"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.0000074936456,0.0020270548,0.000081630205,0.00008069906,0.00015407175,3.7611758e-7,0.020601,0.2561401,0.03183889,0.16385964,0.008830124,0.5163789],"study_design_scores_gemma":[0.0001467367,0.00008616108,0.00007728326,0.000019889105,0.000009270664,0.000002107752,0.00478518,0.937607,0.0028907822,0.053944606,0.00037388055,0.000057118672],"about_ca_topic_score_codex":0.00014998228,"about_ca_topic_score_gemma":0.000040058276,"teacher_disagreement_score":0.6814669,"about_ca_system_score_codex":0.00003376762,"about_ca_system_score_gemma":0.00016115665,"threshold_uncertainty_score":0.9910452},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67239547,0.00007562595,0.3192404,0.007052083,0.00005110439,0.00020034568,0.000021196951,0.000019066843,0.00094472006],"genre_scores_gemma":[0.8423582,0.000012045471,0.15697049,0.00029269466,0.000067205525,0.000016920108,0.000005438509,0.000011827034,0.00026521023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964086,0.00022269365,0.00061030244,0.00045048166,0.0017651698,0.0005427523],"domain_scores_gemma":[0.99544495,0.000364481,0.000037409154,0.0006504758,0.0032309757,0.0002717135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006244564,0.00010659804,0.00021886859,0.0012821709,0.001030118,0.0004509245,0.0006662147,0.00008441778,0.00009896809],"category_scores_gemma":[0.0043516974,0.00009361802,0.00012416646,0.0025725004,0.00012856435,0.000531127,0.00018767113,0.0002940376,0.00030459824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001479589,0.00009692363,0.000069489106,0.0000014698529,0.000013399751,0.0000010843428,0.00060342933,0.9481431,0.030311564,0.019530669,0.00035296148,0.0008611192],"study_design_scores_gemma":[0.00027079726,0.00012605007,0.0004973335,0.00005492832,0.0000057894636,0.000008230406,0.001292204,0.90586704,0.040830296,0.050783448,0.00010534393,0.00015852839],"about_ca_topic_score_codex":0.00084519223,"about_ca_topic_score_gemma":0.00035187736,"teacher_disagreement_score":0.1699627,"about_ca_system_score_codex":0.000060041064,"about_ca_system_score_gemma":0.0007583489,"threshold_uncertainty_score":0.79229385},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921502,0.0012088153,0.00026963855,0.0017675173,0.002663614,0.00011606003,0.000047855032,0.000010628647,0.0017656917],"genre_scores_gemma":[0.99662036,0.00005417665,0.0014302746,0.0002541692,0.00012474174,0.00008220411,0.000012686394,0.0000051711413,0.0014162008],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9974022,0.0002651639,0.0010734685,0.00021517529,0.00077870773,0.00026527027],"domain_scores_gemma":[0.99570787,0.0022419102,0.00043175745,0.00024187265,0.0012947022,0.00008190688],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0046738596,0.000102390426,0.00031154492,0.000813212,0.000059132846,0.000017361755,0.0003361432,0.000044073724,0.00021772465],"category_scores_gemma":[0.02227007,0.00008656452,0.000059519287,0.0007402339,0.00016807581,0.000386084,0.00008157087,0.0001265155,0.000060851704],"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.000038508868,0.0008638525,0.96277076,0.000009401829,0.00008592388,7.480982e-8,0.01169972,0.00310286,0.00012781036,0.019045083,0.0008814952,0.0013745347],"study_design_scores_gemma":[0.00028843633,0.000014534234,0.96094143,0.00007588328,0.0000031869172,9.697262e-7,0.009411137,0.000032841133,0.00028628617,0.020404289,0.008451366,0.00008966443],"about_ca_topic_score_codex":0.00020960318,"about_ca_topic_score_gemma":0.00010332978,"teacher_disagreement_score":0.017596211,"about_ca_system_score_codex":0.00029931357,"about_ca_system_score_gemma":0.0006229067,"threshold_uncertainty_score":0.9859658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006502611,0.00016162606,0.993755,0.0030613046,0.00026063868,0.0010323446,0.00002136403,0.00006178504,0.000995675],"genre_scores_gemma":[0.44008416,0.0000056551144,0.55904675,0.00023933426,0.00011251658,0.0000424902,0.000064036016,0.00001159991,0.00039348035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980841,0.000058681413,0.0005429601,0.00043278153,0.0005174792,0.0003639922],"domain_scores_gemma":[0.99812144,0.00077023235,0.0002721612,0.0003461842,0.00041537572,0.0000746087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002574597,0.00015008745,0.00020716534,0.00011021366,0.0009957278,0.0006207232,0.00043003136,0.00007782656,0.000018197565],"category_scores_gemma":[0.0010434126,0.00009651772,0.00023310333,0.000531185,0.00005241294,0.00021081543,0.000022644123,0.00009353835,0.0000021974686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005616245,0.00004765323,0.000022359709,0.0000028649436,0.000022530014,5.6471173e-8,0.0006428819,0.98621666,0.000027368696,0.0026231217,0.00079646695,0.009541853],"study_design_scores_gemma":[0.0006663783,0.000118635755,0.00010554013,0.00001293053,0.000060713184,0.0000019781967,0.0013260252,0.9915622,0.00003316566,0.0049662525,0.0010059975,0.00014018324],"about_ca_topic_score_codex":0.000007874716,"about_ca_topic_score_gemma":0.0000020740738,"teacher_disagreement_score":0.43943387,"about_ca_system_score_codex":0.000047352132,"about_ca_system_score_gemma":0.000070915936,"threshold_uncertainty_score":0.76584345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59866035,0.00032190603,0.39968047,0.0008391433,0.00018916615,0.0002094231,0.0000031286957,0.000011481157,0.0000849346],"genre_scores_gemma":[0.65429896,0.0000037983862,0.3453481,0.000051853942,0.00012910264,0.000014882043,2.0125415e-7,0.000010246267,0.00014283709],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972938,0.00008385304,0.001154952,0.00021982206,0.0009081771,0.00033941268],"domain_scores_gemma":[0.995294,0.0027976579,0.00074413564,0.00026105685,0.00058548315,0.00031771103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040087276,0.00014970482,0.00055082847,0.00047953211,0.0001881489,0.00039508328,0.00037603988,0.00006120719,0.00012357852],"category_scores_gemma":[0.006271995,0.00010709119,0.0002067744,0.0006201622,0.000099818484,0.00041738912,0.00008477992,0.00021343344,0.000030009087],"study_design_candidate":"design_other","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.0015381295,0.0033686976,0.007361898,0.00038180783,0.0010214222,0.000037810532,0.016029252,0.07929142,0.056262627,0.029809717,0.0038059338,0.80109125],"study_design_scores_gemma":[0.020278275,0.006476349,0.005465054,0.005208527,0.0013193667,0.00043407103,0.06826536,0.10583691,0.053718504,0.7231247,0.0076450733,0.0022278489],"about_ca_topic_score_codex":0.000006851694,"about_ca_topic_score_gemma":6.542574e-7,"teacher_disagreement_score":0.7988634,"about_ca_system_score_codex":0.000037695016,"about_ca_system_score_gemma":0.00011102872,"threshold_uncertainty_score":0.7508617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14713539,0.00043968242,0.65964466,0.0061726067,0.01074809,0.0016544933,0.00014601355,0.00023805228,0.173821],"genre_scores_gemma":[0.98177457,0.0000083693585,0.015124447,0.0011324544,0.0010130819,0.000015532918,0.0000053992785,0.000023349581,0.0009027949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99578696,0.00003123491,0.0012381129,0.00022453202,0.0017088414,0.0010103029],"domain_scores_gemma":[0.9952375,0.0018439571,0.00060977,0.0006679184,0.00065149745,0.0009893356],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011528761,0.00024009864,0.00039823868,0.0008415975,0.00202481,0.0012675398,0.001144488,0.00019885931,0.00009427508],"category_scores_gemma":[0.0026675004,0.00012863512,0.00037994407,0.0010450255,0.000102883605,0.00038797266,0.00006071559,0.0006980872,0.0011319881],"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.00040909302,0.00018707474,0.0073609906,0.00002368416,0.0004788453,0.000019226269,0.002361416,0.16275816,0.000069431866,0.61319125,0.044261064,0.16887976],"study_design_scores_gemma":[0.002613117,0.0002983762,0.0035235318,0.00014725747,0.00035282128,0.0007640495,0.008663065,0.09188632,0.00050120597,0.0335631,0.8567866,0.00090056064],"about_ca_topic_score_codex":0.00040368355,"about_ca_topic_score_gemma":0.003741525,"teacher_disagreement_score":0.8346392,"about_ca_system_score_codex":0.00054380717,"about_ca_system_score_gemma":0.0009213132,"threshold_uncertainty_score":0.9997692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9773891,0.00016829878,0.0194301,0.0010041533,0.001625442,0.0001021176,0.0000033527606,0.000010258478,0.00026717104],"genre_scores_gemma":[0.9944921,0.000027457054,0.0051575946,0.000016837763,0.00025625495,0.000004252862,0.0000013293611,0.000008589672,0.00003554726],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970645,0.00015659009,0.0012859025,0.00024195488,0.0010869865,0.0001640753],"domain_scores_gemma":[0.9957545,0.00020522703,0.0008225208,0.00017140385,0.0029342093,0.00011218017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033309355,0.00012384962,0.00023112292,0.0009243036,0.00010575604,0.00034880004,0.00047778548,0.000037376292,0.00020145348],"category_scores_gemma":[0.0046960935,0.00010186982,0.0000685918,0.00084165914,0.000045095196,0.0013971082,0.00007494593,0.00019921063,0.000009832384],"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.00018232287,0.0016333623,0.9402908,0.000003618988,0.00015898634,0.0063435244,0.005421499,0.001571315,0.00020103675,0.0026760777,0.00003655939,0.041480877],"study_design_scores_gemma":[0.004524159,0.0007737916,0.8756915,0.0001380675,0.00010072751,0.017896248,0.04797073,0.018583816,0.00025105203,0.03332827,0.00020034591,0.00054131926],"about_ca_topic_score_codex":0.0002515811,"about_ca_topic_score_gemma":0.0012682425,"teacher_disagreement_score":0.06459934,"about_ca_system_score_codex":0.000053373664,"about_ca_system_score_gemma":0.0003110141,"threshold_uncertainty_score":0.5622002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4726388,0.00039526325,0.5255452,0.000559464,0.0006202413,0.000112172245,0.0000032683392,0.00004938782,0.00007622094],"genre_scores_gemma":[0.6775396,0.000016798604,0.32171187,0.00009384073,0.00046162648,0.0000044726144,6.8930404e-7,0.000042103304,0.00012901993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99374115,0.00072340237,0.0017311008,0.00070972793,0.0022250072,0.000869593],"domain_scores_gemma":[0.991842,0.0030544908,0.0021929254,0.000790297,0.0015147435,0.0006055986],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.015524314,0.0004459977,0.0010516816,0.0009522442,0.0007858636,0.0009086903,0.0012834673,0.00015486505,0.00008282761],"category_scores_gemma":[0.01847734,0.00031225232,0.0004662379,0.0012017116,0.00025989514,0.001285568,0.00018054704,0.0013899539,0.00017293899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003107397,0.0014089439,0.0690902,0.00008617756,0.00044955008,0.00016670501,0.0025068147,0.8726691,0.018984867,0.0007831559,0.000077122284,0.033466615],"study_design_scores_gemma":[0.0043441188,0.0005357807,0.035051204,0.0009186555,0.00025253618,0.0005576601,0.00067904283,0.94940346,0.0034917474,0.0028008244,0.0011601427,0.0008048392],"about_ca_topic_score_codex":0.00005757919,"about_ca_topic_score_gemma":0.000044811743,"teacher_disagreement_score":0.20490079,"about_ca_system_score_codex":0.00013055018,"about_ca_system_score_gemma":0.00046676616,"threshold_uncertainty_score":0.99993294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98889315,0.0026123114,0.0059949537,0.000043094697,0.0020183052,0.00021714473,0.0000031826391,0.000029850302,0.00018798515],"genre_scores_gemma":[0.9980682,0.000025346184,0.00037270723,0.0000027460662,0.00023033908,9.287289e-7,3.6432503e-8,0.0000098541805,0.0012898535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995871,0.00016212842,0.0009403567,0.00034432812,0.0022809776,0.00040119962],"domain_scores_gemma":[0.9963967,0.0005601121,0.00059435994,0.00041747777,0.0015782292,0.00045310205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012877941,0.00016625144,0.00056965515,0.0013019731,0.0010272451,0.00043532488,0.00066541083,0.000057363388,0.0000030916276],"category_scores_gemma":[0.0015170607,0.0001248557,0.00009550962,0.0025299445,0.0002016025,0.0010561461,0.0001426184,0.00023489958,0.00002036429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008270195,0.00079957425,0.12788117,0.00016377946,0.0005654082,0.08335192,0.03263684,0.728054,0.01908446,0.0021296176,0.003725653,0.0015248923],"study_design_scores_gemma":[0.0016850209,0.0005178157,0.007681063,0.00036996827,0.00016527007,0.34960118,0.10856927,0.5144212,0.000035852856,0.0000035459943,0.016451553,0.0004982154],"about_ca_topic_score_codex":0.0003914301,"about_ca_topic_score_gemma":0.0000071251266,"teacher_disagreement_score":0.26624927,"about_ca_system_score_codex":0.00022960299,"about_ca_system_score_gemma":0.000590231,"threshold_uncertainty_score":0.79008424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07331515,0.0000606582,0.92104757,0.0001115303,0.00030603574,0.00034829264,0.000010799296,0.0001368496,0.00466314],"genre_scores_gemma":[0.31238806,0.0000020001296,0.6865918,0.0000770343,0.00007216671,0.00007678864,0.0000019771574,0.000009973911,0.0007801817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775064,0.000107788386,0.0004971986,0.00056781946,0.0006234234,0.0004531557],"domain_scores_gemma":[0.9982885,0.00050829357,0.00009336954,0.00056138344,0.000282107,0.0002663326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019657435,0.00013265038,0.00021442847,0.0002906618,0.00035911903,0.00014896004,0.00067292276,0.00008121432,0.0003650749],"category_scores_gemma":[0.00033394844,0.00009286804,0.00016231132,0.0006283757,0.0001309897,0.00011645061,0.00005833216,0.00011901403,0.0002427271],"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.00016918239,0.0024321955,0.006728495,0.00001010115,0.0001387995,0.000019564004,0.0048706597,0.07045781,0.00046465013,0.17506766,0.003166916,0.736474],"study_design_scores_gemma":[0.00075257855,0.0004431885,0.014475306,0.0000070626743,0.000032978907,0.000015335501,0.00040711366,0.8007578,0.00040067465,0.17973685,0.002679215,0.00029184463],"about_ca_topic_score_codex":0.00008012343,"about_ca_topic_score_gemma":0.000016076001,"teacher_disagreement_score":0.73618215,"about_ca_system_score_codex":0.0000136837525,"about_ca_system_score_gemma":0.000080198566,"threshold_uncertainty_score":0.3997314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51647997,0.0002018354,0.48124784,0.0004803266,0.00015461218,0.00016144254,0.00010828289,0.000051020972,0.001114679],"genre_scores_gemma":[0.92946947,0.00018379981,0.07008627,0.000014285408,0.000031604694,0.0000045250963,0.00004137777,0.000008658678,0.0001600101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860436,0.000045769884,0.00046604374,0.00030822924,0.00040148915,0.00017413007],"domain_scores_gemma":[0.9987611,0.00048371346,0.0002304427,0.00023506406,0.00020053587,0.00008910615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066689134,0.000103699625,0.0001909567,0.0002660585,0.000538885,0.0000953307,0.00011192445,0.00006464822,0.000013819199],"category_scores_gemma":[0.001486432,0.00008878815,0.000046707104,0.0006802664,0.00016245642,0.0004699276,0.00007687978,0.00007021131,0.0000020511352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060536546,0.000016034006,0.026291508,0.000006062977,0.000023374598,0.0000022816619,0.0036987092,0.96661186,0.00004936731,0.0024276685,0.00013719249,0.0006754046],"study_design_scores_gemma":[0.00080689794,0.000067017965,0.027573975,0.00003283606,0.00002427132,0.000026393605,0.0005708608,0.9685028,0.00018671199,0.0018128171,0.00024153639,0.00015386232],"about_ca_topic_score_codex":0.00008590375,"about_ca_topic_score_gemma":0.000024048064,"teacher_disagreement_score":0.4129895,"about_ca_system_score_codex":0.000011883963,"about_ca_system_score_gemma":0.000030359779,"threshold_uncertainty_score":0.41447225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113098346,0.00041108465,0.8681722,0.0009884197,0.00027581677,0.0003648154,0.000017419025,0.00012343378,0.016548423],"genre_scores_gemma":[0.66505307,0.00009179959,0.3333602,0.0000727994,0.00006777324,0.000022690889,0.00004435941,0.000018389534,0.0012689638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709046,0.00012725196,0.00062836165,0.0005519423,0.0012093614,0.00039263946],"domain_scores_gemma":[0.99839634,0.0002366873,0.00034786685,0.00043099982,0.00043350144,0.0001545899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649213,0.00020518925,0.0002869747,0.0002319628,0.0008845376,0.00028130054,0.00041006596,0.00008384445,0.00038959953],"category_scores_gemma":[0.00048921525,0.00013985147,0.00009913357,0.0012382598,0.00015415408,0.0007035015,0.00004716985,0.00017250571,0.00004635176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004564511,0.000049003167,0.0070408788,0.0000029204637,0.000028848985,0.000009457528,0.0016052956,0.98868215,0.00007449938,0.0004701262,0.00049992686,0.0014912495],"study_design_scores_gemma":[0.0013107071,0.00021476808,0.0040686536,0.00016620908,0.000067443936,0.00008633085,0.0025900921,0.98538876,0.0006078221,0.0022928263,0.0026050506,0.0006013445],"about_ca_topic_score_codex":0.00006235853,"about_ca_topic_score_gemma":0.000044976096,"teacher_disagreement_score":0.5519547,"about_ca_system_score_codex":0.0000752917,"about_ca_system_score_gemma":0.00019293846,"threshold_uncertainty_score":0.6803237},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77761036,0.00007688257,0.18130648,0.005323484,0.0011402165,0.0005299342,0.000026722768,0.000035718786,0.033950184],"genre_scores_gemma":[0.9322856,0.0000013581532,0.06724488,0.00017591949,0.000116195544,0.000007226409,2.3065753e-7,0.000003948577,0.00016460454],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99673384,0.00065068604,0.0003568406,0.0003614798,0.0015040128,0.00039312508],"domain_scores_gemma":[0.9981789,0.00078004244,0.00016056818,0.00042373466,0.00035372635,0.00010302179],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.016169012,0.00008213096,0.0001656933,0.00014163941,0.0014586909,0.00012422324,0.0015236551,0.00004817597,0.00011631096],"category_scores_gemma":[0.0018409898,0.000043228745,0.00009498066,0.002931093,0.0015730332,0.00019526847,0.00026181346,0.00016035953,0.000058544545],"study_design_candidate":"design_other","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.000028316135,0.000111447094,0.0016878647,0.0000016644198,0.000021839247,0.000003748755,0.123579115,0.00004491091,0.05511185,0.02383321,0.000486105,0.7950899],"study_design_scores_gemma":[0.0014665907,0.0005135516,0.46698934,0.00008190503,0.00023132152,0.00009330523,0.19307043,0.054005604,0.11828622,0.15452167,0.009623316,0.0011167224],"about_ca_topic_score_codex":0.0003588304,"about_ca_topic_score_gemma":0.00001669681,"teacher_disagreement_score":0.7939732,"about_ca_system_score_codex":0.00005547672,"about_ca_system_score_gemma":0.00035489927,"threshold_uncertainty_score":0.9998413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33567291,0.000024433133,0.64733285,0.009068237,0.0070085614,0.0004203413,0.00011566476,0.00008199896,0.00027497852],"genre_scores_gemma":[0.82876146,6.1684284e-7,0.16817626,0.000056901597,0.0029037357,0.000011617153,0.000012356311,0.00001737044,0.00005969096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715775,0.000052966716,0.0012571028,0.0002151277,0.0010777012,0.00023933625],"domain_scores_gemma":[0.9940462,0.0029480457,0.00066016294,0.0001291204,0.002083642,0.00013280495],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0031875481,0.00014547718,0.00028638417,0.0010036312,0.000148253,0.00047505007,0.0008801034,0.00016778393,0.000041137813],"category_scores_gemma":[0.014725283,0.00012804256,0.00027413957,0.00060686417,0.00007807377,0.00029511497,0.000056653225,0.00073059544,0.000013013138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015463034,0.00015879073,0.0002855672,0.0000018957744,0.00025832775,0.000015512247,0.00047936628,0.9303149,0.011947666,0.022989323,0.0040058596,0.029388137],"study_design_scores_gemma":[0.003614469,0.00043601348,0.0002829865,0.00021773748,0.00014797434,0.00061421463,0.00087024504,0.8462711,0.004146438,0.024221648,0.11863241,0.00054475944],"about_ca_topic_score_codex":0.000012609881,"about_ca_topic_score_gemma":0.000007769978,"teacher_disagreement_score":0.4930885,"about_ca_system_score_codex":0.000060650604,"about_ca_system_score_gemma":0.0007105437,"threshold_uncertainty_score":0.9935741},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70953065,0.0010718363,0.2889585,0.000038584716,0.00023898813,0.00008646156,0.0000044989747,0.000034014323,0.00003648728],"genre_scores_gemma":[0.60127294,0.000018683124,0.3986235,0.000003816908,0.000034785626,0.0000014386198,0.0000011383387,0.000006386836,0.000037296384],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99622786,0.0008506675,0.0014312457,0.00021383434,0.0010336108,0.00024278657],"domain_scores_gemma":[0.9881303,0.0076015363,0.0009470918,0.00017841077,0.0030298592,0.000112817805],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.036726363,0.000118893164,0.00058188324,0.00082326087,0.00033963576,0.00008506514,0.00037507614,0.00009741856,0.000005790455],"category_scores_gemma":[0.020990724,0.0000865691,0.00010876595,0.0009525205,0.00011365271,0.0003388513,0.00007337021,0.00018892116,0.0000048217066],"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.0012483421,0.0006440849,0.26330608,0.00064069,0.0016493978,0.00010109034,0.021346599,0.3018977,0.064666316,0.0030372306,0.0005954766,0.34086698],"study_design_scores_gemma":[0.0011773324,0.00018575651,0.70555,0.0002488349,0.000060887436,0.00042970633,0.0033298044,0.26956695,0.01901112,0.00014128239,0.00010481899,0.00019346892],"about_ca_topic_score_codex":0.00003107317,"about_ca_topic_score_gemma":0.0000052045,"teacher_disagreement_score":0.44224393,"about_ca_system_score_codex":0.00004754702,"about_ca_system_score_gemma":0.0004776266,"threshold_uncertainty_score":0.99189293},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54823506,0.00030986432,0.09144304,0.09449985,0.018310254,0.0033793855,0.00008745565,0.00035945643,0.24337563],"genre_scores_gemma":[0.93268824,0.00010905995,0.0044851853,0.002208115,0.055839296,0.00003326179,0.0000136082635,0.000032463675,0.0045907553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.994532,0.00003824823,0.0015974877,0.0004021412,0.002629297,0.0008008169],"domain_scores_gemma":[0.9969658,0.00036559624,0.00072941167,0.0010355565,0.00036282404,0.00054075714],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007576582,0.000308009,0.00047349586,0.0012815321,0.0009947052,0.00046225067,0.00084799074,0.0001662841,0.001090768],"category_scores_gemma":[0.0012127317,0.00019218076,0.00023207656,0.0032573303,0.00009940255,0.00039153532,0.00012669845,0.0011524025,0.0016238267],"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.00021253472,0.0006846769,0.008204288,0.000004027089,0.000072033385,0.000008660581,0.0014938674,0.63039017,0.00001402704,0.07056223,0.12044005,0.16791345],"study_design_scores_gemma":[0.00031200785,0.00007418229,0.0055340957,0.000025458217,0.0000612679,0.000048391288,0.0014985593,0.0030721917,0.000112163965,0.0057787085,0.9832009,0.00028208503],"about_ca_topic_score_codex":0.0000027718888,"about_ca_topic_score_gemma":0.000012852975,"teacher_disagreement_score":0.86276084,"about_ca_system_score_codex":0.0002620844,"about_ca_system_score_gemma":0.00018766898,"threshold_uncertainty_score":0.9998224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8149536,0.00020413841,0.13143247,0.002185524,0.0011104879,0.0009261905,0.000074846146,0.0000840162,0.049028687],"genre_scores_gemma":[0.9978182,0.000008939294,0.00049655937,0.00007777456,0.00013630712,0.00003679676,0.00002367542,0.000003854674,0.0013978992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950013,0.001010588,0.0011304275,0.00015844805,0.0024134784,0.00028573215],"domain_scores_gemma":[0.99167186,0.004563746,0.00023794513,0.00032613493,0.0030699817,0.00013032858],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.043456577,0.00008864363,0.00020552086,0.00093461305,0.00070161186,0.00094535743,0.0002831749,0.00010373622,0.00008198228],"category_scores_gemma":[0.027463153,0.00006604713,0.000052119347,0.0011208827,0.00014232306,0.0019865432,0.00009207654,0.00022997905,0.0004053537],"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.0008388841,0.000069590526,0.013201414,0.0000781297,0.00007523713,4.065586e-7,0.0089285085,0.036754474,0.0033437673,0.79125965,0.025068687,0.120381236],"study_design_scores_gemma":[0.0007983562,0.0003464931,0.042633988,0.00007332836,0.000004444049,0.00002392295,0.0035282648,0.43811676,0.00080252474,0.0010401853,0.5124487,0.0001830401],"about_ca_topic_score_codex":0.00022835695,"about_ca_topic_score_gemma":0.00000615693,"teacher_disagreement_score":0.7902195,"about_ca_system_score_codex":0.000057919347,"about_ca_system_score_gemma":0.0003381471,"threshold_uncertainty_score":0.98496276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24154739,0.00014393953,0.61949486,0.088338785,0.001425024,0.00030888195,0.0002574071,0.00069078495,0.047792897],"genre_scores_gemma":[0.9904636,0.0000042600645,0.0053476086,0.0010188045,0.000060901562,0.0000058240057,0.000003463574,0.000005473827,0.0030900214],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980139,0.00011415472,0.00046161198,0.0004404965,0.00062920625,0.0003405904],"domain_scores_gemma":[0.99820715,0.0006398785,0.00007699153,0.0006369815,0.0002251732,0.00021383338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001435258,0.00012779373,0.00021795601,0.00022936672,0.00055317173,0.00017573006,0.00037215996,0.000090112364,0.0019958029],"category_scores_gemma":[0.00061377883,0.00010689384,0.00021727048,0.0010056794,0.00019663438,0.00018889408,0.0000025472243,0.00026912268,0.00021961317],"study_design_candidate":"design_other","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.00019986717,0.002025625,0.0027996253,0.000005767068,0.00021105792,0.00004256961,0.009275695,0.0527327,0.0048240563,0.049893137,0.013167544,0.8648223],"study_design_scores_gemma":[0.0029504076,0.00065495895,0.09935578,0.00004782202,0.0003390247,0.00026103348,0.0064889425,0.03701965,0.0072443453,0.7341139,0.11000536,0.0015188184],"about_ca_topic_score_codex":0.000078411285,"about_ca_topic_score_gemma":0.00022162624,"teacher_disagreement_score":0.86330354,"about_ca_system_score_codex":0.000039493232,"about_ca_system_score_gemma":0.00020799515,"threshold_uncertainty_score":0.9989165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07014537,0.000049679238,0.87812865,0.00029674548,0.00018187103,0.00052280416,0.000034358796,0.00013787087,0.050502647],"genre_scores_gemma":[0.4043876,0.000008348636,0.59232736,0.000059575053,0.00010315726,0.000115422066,0.000008253447,0.000027419946,0.002962887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976411,0.000019932995,0.0005253265,0.0004051259,0.0009282799,0.00048024365],"domain_scores_gemma":[0.9966094,0.0021164801,0.00015300927,0.0007259352,0.00024231206,0.00015286311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023857502,0.0001646921,0.0003680015,0.00022680595,0.0006482891,0.0001404642,0.0006051722,0.00009284918,0.00012697931],"category_scores_gemma":[0.00094937644,0.0001268516,0.00014307101,0.0010010934,0.00015761235,0.00010510798,0.000116494426,0.00015350318,0.00039378888],"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.000018658498,0.00009304906,0.00010393354,0.000027786682,0.00003709651,0.0000015486114,0.0017438454,0.0031174659,0.003218621,0.9874534,0.003940298,0.00024428172],"study_design_scores_gemma":[0.0011439467,0.00007641261,0.00018455819,0.000036632417,0.000079943995,0.000039414794,0.004212244,0.04518653,0.014518467,0.9177732,0.01622245,0.00052620814],"about_ca_topic_score_codex":0.000008701495,"about_ca_topic_score_gemma":0.000001462221,"teacher_disagreement_score":0.33424222,"about_ca_system_score_codex":0.000025077172,"about_ca_system_score_gemma":0.00011848483,"threshold_uncertainty_score":0.5172858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54339343,0.00030346046,0.4532,0.0023653975,0.00034535816,0.0002336111,0.000034054683,0.0000041312346,0.00012050738],"genre_scores_gemma":[0.863834,0.000027427433,0.13528146,0.000056649948,0.0005319071,0.000016403143,0.000009270092,0.000007834355,0.00023501008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585307,0.00018845289,0.0009353332,0.00016616954,0.0025962116,0.0002607468],"domain_scores_gemma":[0.98886347,0.0028689564,0.00035455637,0.00012303857,0.0076178005,0.00017215063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012728431,0.00008256577,0.00018058365,0.00049307675,0.00019789946,0.0002790815,0.00042432948,0.000044756245,0.00010137801],"category_scores_gemma":[0.006206504,0.000064786036,0.00010363507,0.00029202036,0.00011906513,0.0010148026,0.00010167818,0.00022178475,0.000010225051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045513432,0.0009545829,0.008500022,0.0000146734255,0.00036950022,0.0000046875393,0.0016993751,0.57768744,0.03333216,0.0379057,0.00072854926,0.33834815],"study_design_scores_gemma":[0.0013397252,0.0003921398,0.0031112519,0.00006961919,0.0000190705,0.000049695078,0.0005908001,0.9250169,0.044802684,0.021132907,0.0033612445,0.000114002534],"about_ca_topic_score_codex":0.000023289334,"about_ca_topic_score_gemma":0.0000017363606,"teacher_disagreement_score":0.3473294,"about_ca_system_score_codex":0.00013058734,"about_ca_system_score_gemma":0.00039151736,"threshold_uncertainty_score":0.7430213},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66454816,0.00039827896,0.33252838,0.0012011778,0.00032462683,0.0003008701,0.000018947703,0.00006713056,0.0006124316],"genre_scores_gemma":[0.94157755,0.000010286851,0.057462655,0.000029548719,0.00033011212,0.00004424182,0.000010190065,0.000013504294,0.0005218933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619484,0.000653937,0.0005176909,0.00065425434,0.0012756548,0.00070360175],"domain_scores_gemma":[0.99630135,0.001677396,0.000040708845,0.00056338,0.0012233083,0.00019385693],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004676559,0.00014151454,0.00023765999,0.0009962049,0.0029164455,0.001280026,0.00046794783,0.00008747549,0.00005267847],"category_scores_gemma":[0.0022925485,0.0001265008,0.00008536682,0.002568219,0.00056538003,0.00048861624,0.0003949373,0.00047848697,0.000144434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099121404,0.0008671938,0.012630163,0.000014941647,0.00015683609,0.00007665722,0.0019496258,0.6473322,0.045540318,0.26707894,0.016616715,0.007637321],"study_design_scores_gemma":[0.0004068034,0.00006776687,0.005601181,0.000032636257,0.000013824145,0.000040913998,0.00037678567,0.98166484,0.0004448028,0.0080351485,0.0031304352,0.00018486133],"about_ca_topic_score_codex":0.001893067,"about_ca_topic_score_gemma":0.00040893664,"teacher_disagreement_score":0.33433267,"about_ca_system_score_codex":0.00012186947,"about_ca_system_score_gemma":0.00039655087,"threshold_uncertainty_score":0.99975675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27862653,0.0023362034,0.71430933,0.0035380393,0.0006949996,0.0004341082,0.00000878358,0.00003124144,0.000020772153],"genre_scores_gemma":[0.5221273,0.00006444089,0.47707027,0.00015449959,0.000371939,0.000026446458,3.1151825e-7,0.000021725677,0.0001630609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960868,0.00024301485,0.0013364782,0.00048832124,0.0011945035,0.0006509316],"domain_scores_gemma":[0.991362,0.004849638,0.0013759714,0.000520061,0.0015162186,0.00037614297],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008342076,0.00030849676,0.000658904,0.0004481731,0.00096821727,0.0010530934,0.0010782481,0.00018795495,0.00008138086],"category_scores_gemma":[0.0064126723,0.000186733,0.0004959452,0.000870564,0.00022512318,0.0013449469,0.00018494761,0.00088906137,0.00010901749],"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.00012994664,0.0010167649,0.012978632,0.0000578084,0.0007716415,0.000014938847,0.0040865564,0.069347784,0.023188757,0.0007900653,0.00036245497,0.88725466],"study_design_scores_gemma":[0.0027537912,0.00015798588,0.029568864,0.00015705504,0.0001657193,0.00014475161,0.0012997683,0.9562534,0.001068847,0.006372206,0.001688396,0.00036921352],"about_ca_topic_score_codex":0.00014022354,"about_ca_topic_score_gemma":0.000014692722,"teacher_disagreement_score":0.8869056,"about_ca_system_score_codex":0.00007114117,"about_ca_system_score_gemma":0.00029153065,"threshold_uncertainty_score":0.9999839},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9032939,0.0008867996,0.090328135,0.0048305755,0.00030629392,0.00009991124,0.0000029830876,0.000040626837,0.00021075767],"genre_scores_gemma":[0.86498606,0.000054870274,0.13429138,0.00015351179,0.0004528054,0.0000013024452,0.0000011089543,0.0000135094915,0.00004545806],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964786,0.00014991594,0.0013271456,0.0003766002,0.0012583875,0.0004093298],"domain_scores_gemma":[0.99600786,0.0013144107,0.0010803503,0.00038815348,0.0008686542,0.00034056616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033435852,0.00022510217,0.00047744034,0.00075334735,0.0005948014,0.00067845377,0.00045437334,0.0001503469,0.000041670046],"category_scores_gemma":[0.0042571207,0.00015869483,0.00017228843,0.0018551993,0.000096422074,0.0009957225,0.000041915217,0.0007144985,0.000025489007],"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.0011952658,0.00067650515,0.55396414,0.000013247607,0.00033306374,0.00016366488,0.0033789456,0.30266678,0.008939964,0.008434857,0.0004283353,0.119805224],"study_design_scores_gemma":[0.004291771,0.0012803597,0.89145,0.0007251615,0.00037081641,0.0011729536,0.0040728278,0.048867606,0.00192269,0.043836575,0.0011430307,0.0008662391],"about_ca_topic_score_codex":0.00002545592,"about_ca_topic_score_gemma":0.000024400026,"teacher_disagreement_score":0.33748582,"about_ca_system_score_codex":0.0000635885,"about_ca_system_score_gemma":0.0002481439,"threshold_uncertainty_score":0.6542345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21041334,0.00013082087,0.76080275,0.00070202723,0.0005680108,0.0003698759,0.00009005038,0.00014732388,0.026775805],"genre_scores_gemma":[0.9581317,3.682452e-7,0.0393394,0.00025160346,0.0002943797,0.00003572844,0.00008549787,0.00001021348,0.0018511415],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976955,0.00018174891,0.0004759617,0.00049556675,0.0008233452,0.00032785136],"domain_scores_gemma":[0.9985287,0.00033372722,0.00014652289,0.00054523646,0.00033326304,0.000112557405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209596,0.00013277949,0.00021407621,0.00022686132,0.00031968532,0.00037210318,0.00037659748,0.000067213936,0.0007473651],"category_scores_gemma":[0.0012219861,0.00011605958,0.00013564032,0.0005533834,0.00042508217,0.00014335183,0.000029730307,0.00012447646,0.00060006534],"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.000059491846,0.0017396618,0.026458533,0.000016400105,0.00010868599,0.000102895974,0.00025577992,0.13118212,0.027384577,0.07884658,0.37898356,0.35486174],"study_design_scores_gemma":[0.0018890473,0.000045415552,0.009145286,0.000015686006,0.000056426637,0.00009594134,0.00023052587,0.9210145,0.010457207,0.01707996,0.039431583,0.0005384018],"about_ca_topic_score_codex":0.00004439566,"about_ca_topic_score_gemma":0.00001625745,"teacher_disagreement_score":0.7898324,"about_ca_system_score_codex":0.000041510262,"about_ca_system_score_gemma":0.00024904183,"threshold_uncertainty_score":0.8183124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94822955,0.0007121553,0.03633823,0.0030271262,0.000106501415,0.00028244848,0.000027560058,0.000061019913,0.011215427],"genre_scores_gemma":[0.99213034,0.000035323144,0.0069181644,0.00005674646,0.000022685697,0.000019079218,0.000002933209,0.000018719784,0.00079601194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698144,0.00020278776,0.0008942774,0.00030081597,0.0009751466,0.0006455052],"domain_scores_gemma":[0.99218553,0.006743626,0.00015119546,0.0007772512,0.00007869318,0.00006370394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032774133,0.00017489179,0.00038999593,0.00011055303,0.00019776844,0.000121399185,0.00089325354,0.000088203466,0.0030492665],"category_scores_gemma":[0.0067441408,0.00010826535,0.00018044632,0.0011958651,0.0003863859,0.00015051792,0.000053890784,0.00036441622,0.00041589703],"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.000051680217,0.0016005256,0.0069656014,0.00021304446,0.00022013161,0.0000073505275,0.015692431,0.004700354,0.0023660124,0.94006234,0.0053105704,0.022809982],"study_design_scores_gemma":[0.0002645508,0.000055133496,0.00029516514,0.0000918405,0.00005329661,0.000026609963,0.00048736497,0.050328128,0.0018398189,0.945773,0.00058628933,0.00019877752],"about_ca_topic_score_codex":0.0000323194,"about_ca_topic_score_gemma":0.000056543628,"teacher_disagreement_score":0.045627777,"about_ca_system_score_codex":0.00005791998,"about_ca_system_score_gemma":0.000104957966,"threshold_uncertainty_score":0.9978621},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018560043,0.00021882926,0.97603256,0.0031052819,0.00024294786,0.0003870149,0.000029403296,0.00013833772,0.0012855893],"genre_scores_gemma":[0.734951,0.000001088194,0.25492108,0.00037506176,0.0002460186,0.00006927696,0.000017370146,0.00001285119,0.009406254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977249,0.00008444495,0.00050451886,0.00045573857,0.0008092837,0.00042110946],"domain_scores_gemma":[0.99761796,0.00096207426,0.00015137644,0.00071444863,0.0004621624,0.00009198169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004360153,0.00014193305,0.00017858746,0.00014343504,0.0008371261,0.00044776232,0.0006272298,0.000075268785,0.00017421372],"category_scores_gemma":[0.0003512171,0.000081072314,0.00020158506,0.00053875236,0.00008701685,0.0002925372,0.00002965548,0.00010042565,0.00011979177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015488686,0.00016344403,0.00026318568,8.267339e-7,0.000009348116,1.9148611e-7,0.00003470174,0.964958,0.0021610253,0.01376765,0.013231529,0.0053945896],"study_design_scores_gemma":[0.00031624504,0.00002923011,0.00096673897,0.0000029028743,0.000058827234,0.0000015194097,0.0000389541,0.9661349,0.00041929452,0.028033504,0.003870407,0.0001274746],"about_ca_topic_score_codex":0.0004338327,"about_ca_topic_score_gemma":0.00037914613,"teacher_disagreement_score":0.7211115,"about_ca_system_score_codex":0.000031250558,"about_ca_system_score_gemma":0.00023310736,"threshold_uncertainty_score":0.6438582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33063737,0.00018817719,0.6639196,0.0024773248,0.0020279877,0.000038329003,0.00000397799,0.000020412219,0.00068679685],"genre_scores_gemma":[0.6993208,0.000023490746,0.29920274,0.0005922838,0.0007484897,3.5252978e-7,4.0064793e-7,0.000005273936,0.00010615806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968409,0.00005954896,0.001056728,0.00014061858,0.0017426048,0.00015962103],"domain_scores_gemma":[0.99655735,0.00056405517,0.0008402707,0.00023606754,0.0016850833,0.0001171423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018947314,0.00011462852,0.00028804856,0.000651905,0.00007557114,0.0004210133,0.0013552402,0.000047499878,0.000060232098],"category_scores_gemma":[0.0007348604,0.00008380541,0.00027327018,0.00042950906,0.000043400905,0.00034484328,0.000056977926,0.00019908485,0.00005261307],"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.0002511294,0.0037697447,0.0049092416,0.000017431374,0.0014562181,0.0009487429,0.009989869,0.09105106,0.0055101276,0.46394733,0.09812565,0.32002345],"study_design_scores_gemma":[0.0016007567,0.00037906042,0.0064643915,0.00029966587,0.000054888464,0.0013335824,0.0002255802,0.09784247,0.0017119775,0.873055,0.016692502,0.0003401295],"about_ca_topic_score_codex":5.569103e-7,"about_ca_topic_score_gemma":9.0250694e-7,"teacher_disagreement_score":0.40910766,"about_ca_system_score_codex":0.000041415602,"about_ca_system_score_gemma":0.00009829578,"threshold_uncertainty_score":0.4059841},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9099647,0.003619267,0.059417278,0.02317481,0.0020453641,0.0009001203,0.00020933527,0.000014299554,0.00065487303],"genre_scores_gemma":[0.933432,0.00010999599,0.06330845,0.0005172439,0.0006241677,0.000022845252,0.0000034360332,0.000009726046,0.0019721368],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99458295,0.00035190518,0.00054963405,0.00017303608,0.004059451,0.00028301417],"domain_scores_gemma":[0.99272954,0.0016816282,0.00021495218,0.0002770625,0.0049563674,0.00014043332],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005632114,0.00007654205,0.00017375356,0.00009074653,0.0018056072,0.0002518363,0.0008219169,0.00006363025,0.00009263937],"category_scores_gemma":[0.0013123485,0.00004022374,0.000525247,0.0006321571,0.00019649825,0.0003073126,0.00017469248,0.00042108734,0.000026031948],"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.00024198828,0.0013991531,0.019376118,0.000060147406,0.0009396566,0.000027002809,0.08583694,0.07956588,0.006723623,0.0044799815,0.65221256,0.14913698],"study_design_scores_gemma":[0.005501955,0.0021751474,0.05175472,0.0003252509,0.00009174396,0.00060966425,0.07378464,0.29921043,0.008990126,0.04314557,0.5137364,0.0006743142],"about_ca_topic_score_codex":0.00001616787,"about_ca_topic_score_gemma":0.0000036968343,"teacher_disagreement_score":0.21964456,"about_ca_system_score_codex":0.00023241118,"about_ca_system_score_gemma":0.0010133189,"threshold_uncertainty_score":0.9994939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5381215,0.00041765775,0.4545266,0.0050842646,0.000057659476,0.00042854005,0.000051302803,0.000029900637,0.0012825588],"genre_scores_gemma":[0.8569268,0.00003993144,0.13796853,0.00016062926,0.00012326862,0.00006824881,0.000019100968,0.000021393624,0.0046721296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995428,0.00023366555,0.0008020245,0.00057328417,0.00214836,0.00081466173],"domain_scores_gemma":[0.9925229,0.0022737544,0.00007156963,0.0008491664,0.0040102024,0.00027241078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019247152,0.00015180945,0.00033417626,0.0011183814,0.00112312,0.00038459213,0.000833695,0.0001300765,0.00011716156],"category_scores_gemma":[0.0059442567,0.00011215732,0.00017777605,0.0020776629,0.0003473075,0.0005734775,0.00012699305,0.00035232608,0.00007403952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048591555,0.00041838287,0.0017536373,0.000013498625,0.00009120254,0.000006852765,0.0015052251,0.8560443,0.007485126,0.12192159,0.004873767,0.0054004784],"study_design_scores_gemma":[0.0007110577,0.00033473133,0.0015285567,0.00004133175,0.000012299867,0.0000060166044,0.0010231193,0.96106523,0.011446575,0.021980466,0.0016423059,0.00020833118],"about_ca_topic_score_codex":0.0002529607,"about_ca_topic_score_gemma":0.00067190855,"teacher_disagreement_score":0.31880525,"about_ca_system_score_codex":0.000023350392,"about_ca_system_score_gemma":0.00068086135,"threshold_uncertainty_score":0.8638245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90681154,0.00004332753,0.05659807,0.0026696941,0.0001579672,0.0002320353,0.000001374831,0.00009630936,0.0333897],"genre_scores_gemma":[0.97926897,7.069501e-7,0.009464488,0.0001494938,0.00002871893,0.000020266214,0.0000013787106,0.00000626253,0.011059703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824333,0.000120730256,0.0003965621,0.00031661254,0.0005813115,0.00034144954],"domain_scores_gemma":[0.9988835,0.00037787028,0.00003055488,0.0003282825,0.0002646695,0.00011513568],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015799943,0.00007955196,0.00014507964,0.0003369967,0.000086590786,0.00044291743,0.00036085307,0.00005610713,0.0030426707],"category_scores_gemma":[0.0003645364,0.00005413266,0.000042336967,0.0012081665,0.00007533321,0.00039340433,0.000064111635,0.00016122684,0.0071717845],"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.00005430703,0.00070849835,0.1932428,0.00001458814,0.000039786966,0.00004355811,0.0063714725,0.12794492,0.013583896,0.0211094,0.027934236,0.6089525],"study_design_scores_gemma":[0.0010678804,0.00010059374,0.11431133,0.00006297566,0.000004701266,0.00002747363,0.0055876304,0.841466,0.003327027,0.028959133,0.0046787797,0.000406482],"about_ca_topic_score_codex":0.0010356975,"about_ca_topic_score_gemma":0.00013661376,"teacher_disagreement_score":0.71352106,"about_ca_system_score_codex":0.000030217956,"about_ca_system_score_gemma":0.000060627175,"threshold_uncertainty_score":0.99786866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122179,0.00013321913,0.47458643,0.010750152,0.00018579068,0.00038466247,0.000028390512,0.000032432723,0.001681063],"genre_scores_gemma":[0.91938764,0.000012751317,0.07907131,0.00006619742,0.00015425356,0.00003575851,0.0000042219053,0.0000096732865,0.0012581957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727297,0.000102084734,0.0005465678,0.00027406454,0.0013046667,0.0004996376],"domain_scores_gemma":[0.9931601,0.0032837312,0.000025830755,0.00045303398,0.0029495019,0.00012776782],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.023138763,0.00006818064,0.00016296034,0.00068935985,0.00037195976,0.00032987166,0.00035020345,0.000069380905,0.00012377098],"category_scores_gemma":[0.047116287,0.000055615335,0.000107201755,0.0012979152,0.000088942645,0.0003982256,0.0001203915,0.00023259166,0.00009915904],"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.0005002341,0.0010657737,0.0016476227,0.00006815128,0.00022488281,0.00003285061,0.003887956,0.22363366,0.10206939,0.48773938,0.043294016,0.13583608],"study_design_scores_gemma":[0.0008038867,0.00070363306,0.017366443,0.00008783826,0.00001417231,0.000042311836,0.0017739729,0.6597208,0.16980982,0.009299179,0.13994558,0.00043238516],"about_ca_topic_score_codex":0.00007297985,"about_ca_topic_score_gemma":0.00005042401,"teacher_disagreement_score":0.4784402,"about_ca_system_score_codex":0.000014786668,"about_ca_system_score_gemma":0.00030524007,"threshold_uncertainty_score":0.96091026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765429,0.0073573454,0.0078182295,0.004043338,0.0017037719,0.00010470273,0.000031740798,0.00001694237,0.0023810237],"genre_scores_gemma":[0.97164816,0.000052120424,0.027790338,0.00015520093,0.00013224475,0.0000017387218,4.8110525e-7,0.000011636988,0.00020810337],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970111,0.00018737084,0.0010040652,0.000165842,0.0013621342,0.0002694821],"domain_scores_gemma":[0.99633455,0.0022257778,0.00045819452,0.0005025909,0.0003313383,0.00014755919],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017478202,0.00013716237,0.00034386182,0.00014424986,0.00026301472,0.00013376948,0.0012987566,0.00006768869,0.0013359702],"category_scores_gemma":[0.004250277,0.00008328106,0.00030382868,0.0006254622,0.0003920424,0.00034607158,0.00014532835,0.00028743994,0.00011473765],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021195188,0.011240258,0.02212589,0.000044196346,0.0014222931,0.00031110627,0.046457786,0.0011737533,0.27093452,0.0436167,0.54193676,0.0605248],"study_design_scores_gemma":[0.0069784806,0.0026613711,0.0035213646,0.00056239654,0.0006837907,0.0066946764,0.06967038,0.13163975,0.50646836,0.24908017,0.020167293,0.0018719499],"about_ca_topic_score_codex":0.000011866794,"about_ca_topic_score_gemma":3.9853416e-7,"teacher_disagreement_score":0.52176946,"about_ca_system_score_codex":0.000045811055,"about_ca_system_score_gemma":0.000028110224,"threshold_uncertainty_score":0.9995769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005798877,0.00030461693,0.9818675,0.0008086698,0.00014252747,0.001290795,0.0000032971743,0.00007908534,0.00970463],"genre_scores_gemma":[0.67647064,0.00002889733,0.320985,0.00025152994,0.00010573366,0.0014088836,0.0000019524266,0.0000125449415,0.0007348361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975631,0.000052407653,0.00059238565,0.0005976345,0.00068886846,0.0005055673],"domain_scores_gemma":[0.9957431,0.0029835543,0.00014192986,0.00074723957,0.00024348406,0.00014069754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016778151,0.00016957885,0.00022668816,0.0001448124,0.00058064214,0.00041194455,0.0013848926,0.000089369765,0.0002362849],"category_scores_gemma":[0.00068329147,0.00009891683,0.00015997693,0.00094694155,0.0003202099,0.00009222441,0.0001443698,0.00026408434,0.0009524596],"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.00006331847,0.00024037682,0.0007708362,0.000014934335,0.00010275981,4.971132e-7,0.0014782444,0.1948697,0.0009190308,0.4231521,0.00960881,0.36877942],"study_design_scores_gemma":[0.0001481356,0.00006888848,0.0023812559,0.0000058896267,0.000036991994,0.000010120381,0.0014821581,0.27451533,0.0009737658,0.7105296,0.009551469,0.00029635624],"about_ca_topic_score_codex":0.00007839876,"about_ca_topic_score_gemma":0.0000045934858,"teacher_disagreement_score":0.67067176,"about_ca_system_score_codex":0.000017098973,"about_ca_system_score_gemma":0.0000661117,"threshold_uncertainty_score":0.9998254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47783914,0.0032924553,0.40030843,0.005181866,0.012796743,0.0072496845,0.0007460373,0.00027226083,0.09231337],"genre_scores_gemma":[0.9936129,0.00002514823,0.0017084361,0.0002542663,0.00025962555,0.0002748071,0.000016961258,0.000006021234,0.0038418504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678993,0.00013616038,0.00080610154,0.00019015808,0.0017023374,0.000375315],"domain_scores_gemma":[0.9940148,0.002418747,0.00015253405,0.00038538576,0.0028897321,0.00013882227],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0110832425,0.00011887311,0.00017777305,0.00046258158,0.0015373663,0.001410824,0.00051946804,0.00011319138,0.00022535972],"category_scores_gemma":[0.0054397616,0.00006919001,0.00009391732,0.0005643178,0.00022912637,0.0025478143,0.00013183463,0.00029417136,0.00042754042],"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.0006134648,0.0001468179,0.015293342,0.0001758685,0.00032627367,0.0000015068645,0.12843136,0.015660215,0.0000710272,0.5422411,0.26660728,0.03043172],"study_design_scores_gemma":[0.0010469274,0.00014411283,0.00626567,0.00006321162,0.000014314666,0.000022817047,0.069310516,0.5053274,0.00012660318,0.004359424,0.4130651,0.00025389998],"about_ca_topic_score_codex":0.00056360563,"about_ca_topic_score_gemma":0.00013930854,"teacher_disagreement_score":0.5378817,"about_ca_system_score_codex":0.00004892975,"about_ca_system_score_gemma":0.00031924588,"threshold_uncertainty_score":0.9997625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755048,0.001425616,0.0018411912,0.000074824995,0.0054685767,0.00069347,0.0026934121,0.00043402484,0.01186406],"genre_scores_gemma":[0.9234398,0.00012893259,0.041930728,0.00047079794,0.002042811,0.000045511897,0.0026638333,0.00029565935,0.028981902],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9878221,0.0021104414,0.002737109,0.0037797561,0.0020969012,0.0014536546],"domain_scores_gemma":[0.9821879,0.0075471005,0.0018112479,0.0072847893,0.0005396495,0.00062930584],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.016188724,0.0010723732,0.0019889015,0.0016558699,0.001034351,0.0027835756,0.005824593,0.00094388955,0.013797938],"category_scores_gemma":[0.010297227,0.0010838927,0.00042992763,0.0013345138,0.0007341438,0.0013365743,0.004064205,0.0018131157,0.01480113],"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.000069621616,0.00018656146,0.95715195,0.000011602722,0.0004914978,0.000047833008,0.00029558575,0.0066195447,0.00013951657,0.0000098031,0.029937947,0.0050385543],"study_design_scores_gemma":[0.0025698307,0.00011095558,0.51282495,0.0020351433,0.0010606189,0.00027463623,0.0002570292,0.41267213,0.000085619715,0.0023419799,0.06049892,0.005268195],"about_ca_topic_score_codex":0.0012423208,"about_ca_topic_score_gemma":0.00031714997,"teacher_disagreement_score":0.444327,"about_ca_system_score_codex":0.0004877489,"about_ca_system_score_gemma":0.0018639358,"threshold_uncertainty_score":0.9995544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30631742,0.0012259467,0.616005,0.0072757383,0.0024209574,0.0007545295,0.000007616924,0.00032395747,0.06566882],"genre_scores_gemma":[0.9524275,0.000007611663,0.044423196,0.00018535549,0.00023886962,0.00002379933,0.0000025802472,0.000011592061,0.0026795133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974496,0.00046090197,0.0004969537,0.00039096118,0.00085356075,0.00034801854],"domain_scores_gemma":[0.9966566,0.002372963,0.00015700208,0.00054254016,0.00020913008,0.00006177108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011749337,0.00011321987,0.00019973991,0.00032909494,0.0003246334,0.0003436709,0.00064643426,0.00006876666,0.000121201316],"category_scores_gemma":[0.0042346204,0.0000698477,0.00007785315,0.0014674653,0.00007949491,0.00030084816,0.000099539306,0.0002388616,0.00067488843],"study_design_candidate":"design_other","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.0000026822559,0.00007277647,0.0030446122,0.0000018808183,0.0000116087895,0.0000030272033,0.0012202421,0.005909008,0.0003537591,0.00694014,0.0007525209,0.9816877],"study_design_scores_gemma":[0.00060938497,0.00005526282,0.07359337,0.000037106875,0.00002291152,0.000033906646,0.0007832567,0.813231,0.00055962784,0.077094026,0.03370072,0.00027943487],"about_ca_topic_score_codex":0.00014949992,"about_ca_topic_score_gemma":0.00005560352,"teacher_disagreement_score":0.9814083,"about_ca_system_score_codex":0.000031762127,"about_ca_system_score_gemma":0.000043202537,"threshold_uncertainty_score":0.86745507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39306194,0.00032017764,0.3292792,0.27269036,0.001431216,0.0004877127,0.000013382817,0.0000125531515,0.0027034443],"genre_scores_gemma":[0.52473694,0.0000348015,0.45826966,0.0017189424,0.0010288447,0.000009110457,8.8244644e-7,0.000008363224,0.014192427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934753,0.00167938,0.0006612882,0.00019602705,0.0036829505,0.0003050134],"domain_scores_gemma":[0.99123967,0.00507632,0.00021223383,0.00034234193,0.0029333355,0.0001961227],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.040024072,0.000074573894,0.00019557003,0.00016687386,0.0009038438,0.00043216904,0.001147183,0.00007699962,0.0007049175],"category_scores_gemma":[0.028452665,0.000041680025,0.00034704435,0.0011797182,0.00016221846,0.00047496444,0.00025880002,0.0006202765,0.00035918975],"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.00015065592,0.00031107754,0.001488771,0.0000021500252,0.0001991224,0.0000018306891,0.00455216,0.38178653,0.027388128,0.009895213,0.5449278,0.029296584],"study_design_scores_gemma":[0.0021951366,0.0006029644,0.022470923,0.00011537723,0.00006137767,0.00024956808,0.0059834095,0.1495544,0.013299689,0.05787882,0.7472354,0.00035289943],"about_ca_topic_score_codex":0.000010266669,"about_ca_topic_score_gemma":0.000006926565,"teacher_disagreement_score":0.27097142,"about_ca_system_score_codex":0.00033078017,"about_ca_system_score_gemma":0.00081906613,"threshold_uncertainty_score":0.98849726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9204231,0.00018244643,0.020342441,0.024008762,0.0020650174,0.0006843698,0.00020132688,0.00007903675,0.032013487],"genre_scores_gemma":[0.97455007,0.000051222676,0.0015322403,0.00024210001,0.00039651906,0.000043790486,0.000060140374,0.0000114752975,0.023112444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99658006,0.0002910393,0.00077449204,0.00020626205,0.0015000601,0.0006480861],"domain_scores_gemma":[0.9954801,0.0011356708,0.00017409209,0.00028205465,0.002464608,0.00046345973],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013496345,0.00016263542,0.00023817015,0.0006971426,0.0016654463,0.0017197472,0.00034074302,0.00036238335,0.00014617202],"category_scores_gemma":[0.0032693679,0.00015524802,0.00008782852,0.0007715469,0.0004980429,0.0038350283,0.00012449473,0.0009045192,0.0005823097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015336125,0.000096827294,0.07808198,0.00013414206,0.00008532545,0.000009605318,0.015692174,0.02560157,0.00036893968,0.8345017,0.032904103,0.012370282],"study_design_scores_gemma":[0.0010587305,0.00012330928,0.028515162,0.00009951301,0.000014669883,0.0003429359,0.027696133,0.17722988,0.00013907677,0.00065211504,0.7638875,0.00024098228],"about_ca_topic_score_codex":0.27328154,"about_ca_topic_score_gemma":0.038349967,"teacher_disagreement_score":0.83384955,"about_ca_system_score_codex":0.0009771129,"about_ca_system_score_gemma":0.032069184,"threshold_uncertainty_score":0.99963427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499448,0.003959549,0.00021817115,0.041347373,0.0005829955,0.0005448491,0.000046378336,0.00026051968,0.0030953945],"genre_scores_gemma":[0.98553675,0.00003774537,0.005594687,0.0004890041,0.00057765795,0.000039479222,0.000012366973,0.000023244038,0.0076890816],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959952,0.00053335377,0.0010008025,0.00081531017,0.0009099982,0.00074529665],"domain_scores_gemma":[0.99723613,0.0012969075,0.0002513754,0.0006277342,0.00016754014,0.0004202952],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002236126,0.0002537339,0.0005254684,0.0004688005,0.00031308367,0.00037431484,0.0005143918,0.00021770386,0.0011216182],"category_scores_gemma":[0.00042528898,0.00018740454,0.000085762375,0.0015170486,0.00019157637,0.0004861063,0.0000150516935,0.00038888716,0.0025924158],"study_design_candidate":"design_other","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.00042767831,0.00028740233,0.0036765777,0.000013383489,0.000012931168,0.000010165055,0.007550083,0.000050109193,0.00005416388,0.00067432417,0.012737003,0.9745062],"study_design_scores_gemma":[0.0075022164,0.011587838,0.28536406,0.0037684191,0.00015163636,0.00047644842,0.0139725525,0.033608116,0.00011947584,0.063879125,0.5759972,0.0035729224],"about_ca_topic_score_codex":0.00014503428,"about_ca_topic_score_gemma":0.00080977194,"teacher_disagreement_score":0.97093326,"about_ca_system_score_codex":0.00009433783,"about_ca_system_score_gemma":0.0003513964,"threshold_uncertainty_score":0.9997915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99245536,0.000053557436,0.002930211,0.0017652021,0.0021157404,0.00018713097,0.000003055603,0.0000097571,0.00047995296],"genre_scores_gemma":[0.94659007,0.0000055221417,0.052888937,0.00002165501,0.00025094283,0.000004526591,8.1756596e-8,0.000011694979,0.0002265464],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99680805,0.00012827893,0.0013909558,0.0002092491,0.001224544,0.00023890074],"domain_scores_gemma":[0.9962219,0.00053633755,0.0014438491,0.00039571364,0.0012681388,0.00013407659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005766149,0.00013414933,0.00045520897,0.00049814483,0.00020037124,0.00010635722,0.0008254613,0.00009392847,0.00004715607],"category_scores_gemma":[0.005955035,0.00008226244,0.00030402778,0.0012435963,0.00015183758,0.00043826443,0.00014129482,0.000698678,0.000008816471],"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.00064997614,0.00037525815,0.01042961,0.00006224938,0.00015773017,0.0000035621545,0.0058874064,0.24770564,0.7139635,0.013262618,0.0002557983,0.007246619],"study_design_scores_gemma":[0.00335749,0.004163201,0.029776225,0.0044384613,0.00036838712,0.0011791902,0.0115376795,0.008917186,0.8166237,0.11367146,0.0051823417,0.00078466866],"about_ca_topic_score_codex":0.000021005812,"about_ca_topic_score_gemma":0.000028093027,"teacher_disagreement_score":0.23878846,"about_ca_system_score_codex":0.000039994553,"about_ca_system_score_gemma":0.00026179833,"threshold_uncertainty_score":0.7129163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034468777,0.00006911933,0.97989404,0.00015541022,0.00019051414,0.0008304022,0.000024733225,0.00011606528,0.015272811],"genre_scores_gemma":[0.24562995,0.0000026454604,0.7532822,0.000100590754,0.00024197818,0.0001452662,0.0000050305816,0.000028658236,0.00056369096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757683,0.000018306739,0.0006624858,0.000397826,0.0008604507,0.000484105],"domain_scores_gemma":[0.9944824,0.003994441,0.0002883657,0.00086271553,0.00023031165,0.00014177592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072868573,0.0001835951,0.0002923771,0.00014080569,0.00062059273,0.0002495441,0.0008976869,0.0000908585,0.00004605902],"category_scores_gemma":[0.00041742812,0.000107377266,0.00014944181,0.0005755151,0.00015241264,0.00014451215,0.000084511594,0.00017704774,0.00014844371],"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.00005950692,0.00026224292,0.000008882084,0.000018463581,0.00014169411,0.0000026181497,0.00723332,0.0036441467,0.0020630884,0.49117312,0.0012174166,0.49417552],"study_design_scores_gemma":[0.00066181336,0.0001394234,0.00013005687,0.00002185906,0.00015095189,0.000010179473,0.029109744,0.45284173,0.0058446387,0.50703526,0.0036692773,0.00038509598],"about_ca_topic_score_codex":0.000008271144,"about_ca_topic_score_gemma":0.000016416034,"teacher_disagreement_score":0.49379042,"about_ca_system_score_codex":0.00003319283,"about_ca_system_score_gemma":0.000056461973,"threshold_uncertainty_score":0.47731602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06557914,0.0004059875,0.9314085,0.0016102633,0.0002479519,0.00043639145,0.00003427382,0.000028847822,0.0002486258],"genre_scores_gemma":[0.6215419,0.000010622408,0.37755874,0.00003077658,0.0000847902,0.000051089723,0.000015191413,0.0000094836605,0.0006974062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941718,0.002748713,0.0006888993,0.00054182834,0.0012687626,0.0005800097],"domain_scores_gemma":[0.9819053,0.012602226,0.00003065868,0.0007641717,0.0044928654,0.00020481495],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.039879594,0.00010616906,0.00031109323,0.0011785221,0.0009291568,0.00044488668,0.0011562237,0.000089183995,0.000100853766],"category_scores_gemma":[0.0070916475,0.00008799877,0.00013264119,0.0036125993,0.00050903397,0.00029384947,0.0003210583,0.00036937295,0.00014073655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004800273,0.00019323637,0.0008828058,0.0000056345475,0.000044599674,4.172672e-7,0.0006966123,0.5652843,0.0010560912,0.008909879,0.005769648,0.41710877],"study_design_scores_gemma":[0.00039704988,0.00015478293,0.010033529,0.000014371358,0.0000042607967,0.000002526248,0.0003638064,0.9777556,0.0040609217,0.00075428217,0.006355638,0.000103220365],"about_ca_topic_score_codex":0.0010058384,"about_ca_topic_score_gemma":0.001109309,"teacher_disagreement_score":0.55596274,"about_ca_system_score_codex":0.00009347255,"about_ca_system_score_gemma":0.0006432793,"threshold_uncertainty_score":0.98864603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97679365,0.0010139205,0.016718306,0.0039614257,0.00056220905,0.00008423186,0.0000027574326,0.000025689607,0.00083778583],"genre_scores_gemma":[0.73790324,0.000070114096,0.26169577,0.00010859952,0.00016760602,0.0000019872211,3.852445e-7,0.000011913703,0.00004037876],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697506,0.00016657855,0.001424268,0.00025623554,0.0008248177,0.00035300988],"domain_scores_gemma":[0.9958924,0.0017222341,0.0008028629,0.0006372695,0.00071614987,0.00022906758],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008151364,0.00015973426,0.00048290132,0.0011686316,0.0003237729,0.00034736376,0.0010789493,0.0001708755,0.0000826231],"category_scores_gemma":[0.009680001,0.00012737258,0.00016720731,0.0014181917,0.00022281107,0.0005679548,0.00017023187,0.0017567949,0.000040421808],"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.00023384303,0.0015518448,0.38623616,0.000031710093,0.00024494212,0.00014886167,0.0059521785,0.11143682,0.3066009,0.043411028,0.0004813028,0.14367041],"study_design_scores_gemma":[0.008308561,0.0006385964,0.341214,0.0012219386,0.00035705446,0.0042730174,0.021293843,0.38228106,0.009554072,0.19701944,0.031776186,0.002062232],"about_ca_topic_score_codex":0.000036772508,"about_ca_topic_score_gemma":0.00022266021,"teacher_disagreement_score":0.29704684,"about_ca_system_score_codex":0.00003436124,"about_ca_system_score_gemma":0.00027066708,"threshold_uncertainty_score":0.9986619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997708,0.00014174367,0.11261544,0.01405232,0.0005043216,0.00036739136,0.00017210974,0.00003653323,0.07233939],"genre_scores_gemma":[0.99258393,0.00014648776,0.001346375,0.0005656031,0.000079381985,2.1447892e-7,0.0000016556371,0.0000065621825,0.0052697756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544394,0.000043729153,0.0008596446,0.00016775134,0.0032366926,0.00024825794],"domain_scores_gemma":[0.9971145,0.0009128871,0.0005803638,0.00049929606,0.0005019848,0.00039101345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003647815,0.00012988567,0.00044978486,0.0004374246,0.00050677045,0.0000111422505,0.0011083311,0.000120550176,0.00057514507],"category_scores_gemma":[0.0022865033,0.00007238093,0.00015906608,0.0011465163,0.00058391155,0.00010329696,0.0001816414,0.00037331265,0.00015618962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013834896,0.00026954393,0.0047558444,0.0000107563665,0.00032301722,0.00017841998,0.0039446037,0.47790298,0.00063980586,0.030379847,0.47533226,0.0048794267],"study_design_scores_gemma":[0.01681441,0.002201421,0.06826694,0.00090819097,0.0006888191,0.0015301178,0.016611086,0.68514913,0.00529411,0.115604736,0.0855213,0.0014097517],"about_ca_topic_score_codex":0.000036648573,"about_ca_topic_score_gemma":0.0000625197,"teacher_disagreement_score":0.38981095,"about_ca_system_score_codex":0.00011259639,"about_ca_system_score_gemma":0.00047815233,"threshold_uncertainty_score":0.6297435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74533695,0.0013908828,0.24711654,0.0012537265,0.00074144104,0.0023678034,0.00008446305,0.000015429918,0.0016927378],"genre_scores_gemma":[0.99173266,0.000033588334,0.00513567,0.00001155023,0.00028543096,0.00005212611,0.000008505144,0.000023671328,0.0027168286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922675,0.0029130797,0.0014752267,0.00026986355,0.002768817,0.0003055214],"domain_scores_gemma":[0.9713786,0.015866823,0.0005029555,0.00033672884,0.011798408,0.00011647582],"candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.040930383,0.00011536237,0.0003159582,0.00086091156,0.0016426486,0.00035279134,0.0009463626,0.000023524852,0.000030761228],"category_scores_gemma":[0.034982268,0.00007153116,0.00014712095,0.0013354644,0.00024253069,0.00032004857,0.00007077714,0.0003650107,0.000035611072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013520704,0.010533805,0.00535516,0.00013558539,0.0013289381,0.0001487145,0.028928969,0.7525313,0.0064999396,0.0720631,0.10026826,0.02085416],"study_design_scores_gemma":[0.023397537,0.017045066,0.19839124,0.00046804015,0.00052588526,0.0015521012,0.044292394,0.6537189,0.00042168782,0.009786323,0.04955902,0.00084184477],"about_ca_topic_score_codex":0.000015173041,"about_ca_topic_score_gemma":0.0000039329816,"teacher_disagreement_score":0.24639565,"about_ca_system_score_codex":0.00006377721,"about_ca_system_score_gemma":0.00049821305,"threshold_uncertainty_score":0.9996571},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30540788,0.00035605882,0.69273955,0.000434628,0.000935868,0.00004816628,0.0000028217476,0.000007652616,0.00006736395],"genre_scores_gemma":[0.89394444,0.00007541371,0.1055327,0.000038862276,0.00017822506,7.966134e-7,9.941687e-7,0.0000079089505,0.00022067444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781036,0.00007752681,0.0008582685,0.00018052384,0.0009308079,0.00014253156],"domain_scores_gemma":[0.99664676,0.001408541,0.00096712605,0.00011940096,0.0008093911,0.00004875815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042664893,0.000100415105,0.00019670896,0.00019652619,0.00026017922,0.00013005576,0.00080080214,0.00002908604,0.00003319278],"category_scores_gemma":[0.0008282478,0.00006357759,0.00018956857,0.00013452505,0.000029805824,0.000121568126,0.00023931793,0.00021735714,0.0000031392049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000752642,0.00007715729,0.02414179,0.000011329858,0.00024026782,0.0000023693017,0.0013888475,0.6738263,0.000022450853,0.00073440216,0.00005669826,0.29942316],"study_design_scores_gemma":[0.00048777706,0.000088844856,0.013877139,0.00016616542,0.000050708837,0.000021393149,0.0005041122,0.9791562,0.0000061811456,0.00406859,0.0015054148,0.000067503235],"about_ca_topic_score_codex":0.000010135633,"about_ca_topic_score_gemma":0.0000044131243,"teacher_disagreement_score":0.58853656,"about_ca_system_score_codex":0.000015373353,"about_ca_system_score_gemma":0.000019561583,"threshold_uncertainty_score":0.25926188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14242291,0.000010290972,0.8510367,0.0014357303,0.0013206624,0.0006533838,0.0000051094835,0.00017915052,0.00293604],"genre_scores_gemma":[0.67554265,3.6231987e-7,0.32373068,0.00014850358,0.00005765951,0.000106192514,0.0000015237853,0.000009390258,0.00040305423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567413,0.000047257992,0.00047629056,0.0011159377,0.0018541312,0.00083222386],"domain_scores_gemma":[0.9972107,0.00080087956,0.00021873537,0.0011328271,0.00037934122,0.00025751194],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012104781,0.00019718311,0.00023022108,0.0008617947,0.0012863557,0.0013192334,0.0019919537,0.000065722015,0.000051758518],"category_scores_gemma":[0.003200499,0.00015560705,0.00018208199,0.0027268298,0.0007719342,0.0011880413,0.0003286212,0.00029805693,0.00012852633],"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.00007478391,0.00063287077,0.0054347487,0.000036353445,0.000034416742,0.000007812711,0.0005352593,0.19866318,0.003706163,0.36135194,0.00028593844,0.42923653],"study_design_scores_gemma":[0.00049113156,0.000037471407,0.002556298,0.000016470505,0.000026490312,8.0388753e-7,0.00029302578,0.9135158,0.001355224,0.07134202,0.010103603,0.00026164876],"about_ca_topic_score_codex":0.000049103353,"about_ca_topic_score_gemma":0.000085006155,"teacher_disagreement_score":0.71485263,"about_ca_system_score_codex":0.000049543884,"about_ca_system_score_gemma":0.00014066076,"threshold_uncertainty_score":0.9997175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07009879,0.000910058,0.9139338,0.0046898723,0.0013562383,0.002057807,0.0000063785446,0.00019980999,0.006747242],"genre_scores_gemma":[0.97346884,0.0000030001258,0.025068244,0.00010847661,0.00015916947,0.00045193546,4.6695848e-7,0.0000100364605,0.00072982523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965368,0.00004723445,0.0004524922,0.00047234903,0.0014556956,0.0010354124],"domain_scores_gemma":[0.9943879,0.004115987,0.00020766888,0.0008179125,0.00027202844,0.00019850422],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017022647,0.00014805388,0.00016213472,0.00012994355,0.0048134527,0.0011398868,0.0019498938,0.00004306356,0.0000086055],"category_scores_gemma":[0.0020169464,0.00007050791,0.00009404547,0.0018198221,0.0016134497,0.000407809,0.0002407879,0.00018778362,0.000096714655],"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.000088263834,0.00024010864,0.0028617075,0.00001078141,0.00004006796,4.772647e-7,0.008153475,0.009324754,0.07453035,0.31155872,0.0011472576,0.59204406],"study_design_scores_gemma":[0.00063345244,0.000086464795,0.0032704156,0.000019027277,0.000066366025,0.000016540524,0.007524651,0.81246966,0.003607021,0.11809082,0.053745136,0.00047042422],"about_ca_topic_score_codex":0.000013042218,"about_ca_topic_score_gemma":0.000024815528,"teacher_disagreement_score":0.9033701,"about_ca_system_score_codex":0.000066508364,"about_ca_system_score_gemma":0.00037469348,"threshold_uncertainty_score":0.999897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86151934,0.00014709515,0.13252002,0.002282662,0.00019583036,0.0004219373,0.00020661888,0.00012594218,0.0025805708],"genre_scores_gemma":[0.9373224,0.0000019484494,0.05565111,0.00020326316,0.00011669081,0.0000052848104,0.000015446976,0.000020113208,0.006663772],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9954702,0.0019307082,0.00047041057,0.00070057786,0.0010347825,0.00039328428],"domain_scores_gemma":[0.99505097,0.0027086078,0.00024053385,0.00066710816,0.0009954526,0.00033730583],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.006180437,0.00022406295,0.00037036615,0.00034135315,0.0016877394,0.0001519107,0.0008457699,0.00009625704,0.00008186614],"category_scores_gemma":[0.001653476,0.00016426573,0.00008565121,0.002534189,0.00049353315,0.0006014482,0.00007635499,0.00026302037,0.00034684432],"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.00024016679,0.0006549179,0.00021805974,0.000005523039,0.00014777917,0.000017338922,0.8206585,0.001244277,0.0007802603,0.1707893,0.0029822867,0.0022615562],"study_design_scores_gemma":[0.001175023,0.0006853732,0.0029996806,0.00001030191,0.0000953663,0.00011698877,0.93026173,0.037066888,0.000054806562,0.025260461,0.0017601093,0.00051329785],"about_ca_topic_score_codex":0.00018289557,"about_ca_topic_score_gemma":0.000045071698,"teacher_disagreement_score":0.14552884,"about_ca_system_score_codex":0.000059854872,"about_ca_system_score_gemma":0.00043372007,"threshold_uncertainty_score":0.9996119},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18541539,0.00030941906,0.8101721,0.00065201573,0.00017607269,0.0003789696,0.000020464493,0.00009225885,0.0027833541],"genre_scores_gemma":[0.89234155,0.0000018761864,0.10737904,0.00007600151,0.000084510655,0.00001630598,0.000006678756,0.000007953951,0.000086063905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997906,0.00004386234,0.0007028264,0.00035945675,0.000511193,0.00047664886],"domain_scores_gemma":[0.99843985,0.000490514,0.00021294825,0.00034980386,0.00039185607,0.000115039875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981561,0.00014231884,0.00031159693,0.00027089944,0.00020593012,0.00015464851,0.00045798454,0.00010074877,0.00009256523],"category_scores_gemma":[0.003595156,0.0001124824,0.00021121776,0.00045316925,0.00018005687,0.0003485569,0.000040503077,0.00015904407,0.000029282488],"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.00005636922,0.0002212206,0.0010885248,0.000025256702,0.00005655521,0.000003246879,0.0028053462,0.120963275,0.0014555653,0.06072131,0.000062211606,0.8125411],"study_design_scores_gemma":[0.0012005272,0.00025225847,0.000538392,0.00023635171,0.00006111921,0.00002319041,0.004644737,0.8763239,0.0011249208,0.11451566,0.0006922449,0.00038671296],"about_ca_topic_score_codex":0.00001108804,"about_ca_topic_score_gemma":0.0000072916796,"teacher_disagreement_score":0.8121544,"about_ca_system_score_codex":0.000016433902,"about_ca_system_score_gemma":0.00013954846,"threshold_uncertainty_score":0.4586899},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02640713,0.00013826678,0.9706741,0.00026051182,0.0002055509,0.0005572266,0.0000033272904,0.00019075388,0.0015631488],"genre_scores_gemma":[0.5911811,0.0000013120805,0.40817276,0.00031712095,0.00022618922,0.0000128543825,0.0000070943433,0.000008530847,0.0000730495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976247,0.00006827168,0.0006521283,0.00046218222,0.00073368836,0.00045903792],"domain_scores_gemma":[0.9950691,0.0036340412,0.00030025246,0.0005706441,0.0003229044,0.000103060935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004479494,0.00016724541,0.00023416993,0.00021980947,0.0010968028,0.00059523224,0.0008263479,0.00008534907,0.000017453678],"category_scores_gemma":[0.0007445361,0.000114379625,0.000102318576,0.00094504957,0.000061461804,0.0001771263,0.000052034673,0.0001764438,0.00008943262],"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.0000038004798,0.00003869501,0.000021433261,0.000001059911,0.000010459702,1.9776985e-7,0.0006348235,0.04576768,0.00046054172,0.0024579158,0.00014296488,0.95046043],"study_design_scores_gemma":[0.0004379926,0.00008651848,0.01574749,0.000008254669,0.000034594814,0.000006219914,0.0005962658,0.95530623,0.00026109302,0.024424814,0.002909826,0.0001806896],"about_ca_topic_score_codex":0.0000098534965,"about_ca_topic_score_gemma":0.000002558463,"teacher_disagreement_score":0.9502797,"about_ca_system_score_codex":0.000034723158,"about_ca_system_score_gemma":0.00011193684,"threshold_uncertainty_score":0.84358305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17940465,0.00029752773,0.810928,0.007153873,0.00038608117,0.00016489571,0.00001729905,0.000019529012,0.001628159],"genre_scores_gemma":[0.82637906,0.000010800616,0.17253879,0.0003983489,0.000431015,0.0000010694079,3.9198082e-7,0.000009277434,0.00023122979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628466,0.0003782233,0.00081726577,0.0002734967,0.0017427953,0.0005035283],"domain_scores_gemma":[0.99695206,0.0008886278,0.0004449131,0.00052964117,0.0008574288,0.0003273056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009224104,0.0001617027,0.00039788272,0.00036871718,0.0005179791,0.00049931154,0.0011586557,0.0000895255,0.000036239944],"category_scores_gemma":[0.006663387,0.00009269667,0.00025242375,0.0012070901,0.00004827049,0.00023271343,0.00010607902,0.0008436884,0.00014207882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010947016,0.0142629435,0.036235023,0.000053164575,0.0005749553,0.00026293387,0.028995601,0.65706784,0.0025257273,0.089671746,0.02818794,0.14106745],"study_design_scores_gemma":[0.0045766556,0.0017131103,0.32465515,0.00021201672,0.00032864252,0.00076395774,0.0047986954,0.5611724,0.00095640036,0.049787395,0.049977485,0.0010580997],"about_ca_topic_score_codex":0.000010612099,"about_ca_topic_score_gemma":0.000006871497,"teacher_disagreement_score":0.64697444,"about_ca_system_score_codex":0.00005731526,"about_ca_system_score_gemma":0.0003039978,"threshold_uncertainty_score":0.7977178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8251731,0.0057434305,0.09060845,0.05524174,0.010301841,0.0003003775,0.0000015320312,0.000044524622,0.012585016],"genre_scores_gemma":[0.99743474,0.000109851855,0.0007987284,0.000107155865,0.0010995833,0.0000032816836,9.107965e-8,0.000007422263,0.00043914362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99201185,0.0009920035,0.0017971493,0.00016596746,0.004703622,0.00032940257],"domain_scores_gemma":[0.9922649,0.0054190313,0.0008995408,0.00036138526,0.00049361464,0.0005614852],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.049126875,0.00009433622,0.0004166659,0.0002381483,0.00022280902,0.00037152748,0.0013888394,0.00016367974,0.000056414945],"category_scores_gemma":[0.043190714,0.000045205277,0.00015651292,0.00071396946,0.00014099723,0.00015199394,0.00003493596,0.0006626006,0.00013571189],"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.00042878714,0.0010394672,0.17769733,0.00012356622,0.00040485026,0.00030263886,0.0051125875,0.08639692,0.00031087006,0.4620361,0.099541135,0.16660576],"study_design_scores_gemma":[0.0044045425,0.00048111664,0.024611812,0.0023388453,0.000070142974,0.00096987555,0.014132071,0.64097,0.00001960711,0.024050534,0.28751466,0.00043681898],"about_ca_topic_score_codex":0.0001888926,"about_ca_topic_score_gemma":0.000030874693,"teacher_disagreement_score":0.55457306,"about_ca_system_score_codex":0.00005172741,"about_ca_system_score_gemma":0.00050624,"threshold_uncertainty_score":0.979124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91881835,0.00016303988,0.06492106,0.003156189,0.00029267717,0.0003083823,0.0000038299486,0.00013615217,0.012200315],"genre_scores_gemma":[0.9527654,0.00002157139,0.044005483,0.00056622375,0.0004146681,0.000009457419,0.0000020796917,0.00002418027,0.002190942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99609095,0.000033940225,0.0012120534,0.00033154042,0.0016936241,0.0006379015],"domain_scores_gemma":[0.99767613,0.000573519,0.0005748761,0.0004601492,0.0003923207,0.0003230275],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031801,0.00027564447,0.00046770225,0.0012823576,0.00034945796,0.0012734355,0.0007605846,0.00014068154,0.00012495121],"category_scores_gemma":[0.001083889,0.00016364349,0.00016878234,0.0016744854,0.00015690667,0.00068003987,0.00007047864,0.0011007371,0.00046636406],"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.00038397862,0.00044361386,0.01358321,0.000006046897,0.00014031226,0.000048035934,0.0023146432,0.649346,0.000049007394,0.023721661,0.0010998376,0.30886367],"study_design_scores_gemma":[0.00880402,0.0017282836,0.015326518,0.0009384746,0.00029089316,0.00050705636,0.02464764,0.17602873,0.0021794417,0.022292627,0.74435985,0.0028964859],"about_ca_topic_score_codex":0.0001211154,"about_ca_topic_score_gemma":0.0029847538,"teacher_disagreement_score":0.74325997,"about_ca_system_score_codex":0.00028426916,"about_ca_system_score_gemma":0.00042554116,"threshold_uncertainty_score":0.9997633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5689337,0.000056545883,0.42631838,0.0025827775,0.00015131183,0.0006097385,0.000008922621,0.000033302775,0.0013053187],"genre_scores_gemma":[0.99507546,0.0000025085872,0.0012625438,0.00020649991,0.000065652,0.00004784886,0.000009168051,0.000009435776,0.0033208597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975404,0.00022435057,0.000750531,0.0003229516,0.0009282574,0.00023350908],"domain_scores_gemma":[0.99791265,0.0006741269,0.00019326524,0.000849112,0.00026068088,0.00011014624],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010563763,0.00015517494,0.0002106083,0.0003456317,0.00025317393,0.000104906554,0.00068008073,0.00004920944,0.0018345659],"category_scores_gemma":[0.00033139891,0.00010135105,0.00013037045,0.00048429234,0.00010292908,0.00026326356,0.00024873528,0.00009927648,0.00095272216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016731126,0.00003717858,0.0019422394,0.0000030437843,0.00002833742,1.8326159e-7,0.003641842,0.9838837,0.00017682841,0.0008807443,0.00045455515,0.008934654],"study_design_scores_gemma":[0.00027933388,0.0000933327,0.078220285,0.000044194247,0.000030679043,2.0419448e-7,0.002937175,0.8945199,0.000083691055,0.009591446,0.014044974,0.00015476477],"about_ca_topic_score_codex":0.00012053722,"about_ca_topic_score_gemma":0.00001985084,"teacher_disagreement_score":0.42614177,"about_ca_system_score_codex":0.000038270773,"about_ca_system_score_gemma":0.0000111524505,"threshold_uncertainty_score":0.9998252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96223867,0.0006807685,0.0044476376,0.029242264,0.0012014604,0.00065905834,0.000007944306,0.00013697578,0.0013852101],"genre_scores_gemma":[0.98954,0.0000028731672,0.0054309634,0.003617115,0.00029752436,0.000030579566,7.925593e-7,0.000019438392,0.0010607305],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9947776,0.00094576465,0.00069194136,0.0009425726,0.001696971,0.00094514375],"domain_scores_gemma":[0.99574447,0.0025064575,0.00030348144,0.0007900215,0.00030688927,0.00034869954],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0077868486,0.00024268193,0.00038711945,0.00050180254,0.005123542,0.00033366217,0.000899224,0.00007774272,0.00004996317],"category_scores_gemma":[0.003889561,0.00015913861,0.00014663402,0.0028180697,0.0010884543,0.00032079962,0.00007170323,0.00043555864,0.00055598124],"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.00019419102,0.0014973885,0.02067113,0.000012204087,0.00012279223,0.0012750762,0.8812139,0.01389079,0.00043638787,0.0012882693,0.01330942,0.06608842],"study_design_scores_gemma":[0.0016795222,0.0025369138,0.012111032,0.00027946415,0.00008099576,0.0072667636,0.953036,0.01585488,0.0007761225,0.0038647654,0.001635746,0.0008778087],"about_ca_topic_score_codex":0.00039671382,"about_ca_topic_score_gemma":0.00031851264,"teacher_disagreement_score":0.071822055,"about_ca_system_score_codex":0.0003423877,"about_ca_system_score_gemma":0.00056869164,"threshold_uncertainty_score":0.99617165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50320137,0.00054294936,0.26220563,0.00991085,0.000561496,0.00065960706,0.000016791706,0.0004776057,0.22242373],"genre_scores_gemma":[0.8647265,0.000009541193,0.120452985,0.001028995,0.00022943103,0.000015812926,0.0000015408068,0.00001330485,0.013521921],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774814,0.00004840182,0.00050917844,0.0005465819,0.00076968595,0.0003780096],"domain_scores_gemma":[0.9980245,0.0008729178,0.00008163461,0.00052365585,0.00020587581,0.00029140626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023787466,0.00014767311,0.0002701633,0.00034862847,0.00028363575,0.00039307022,0.00040162954,0.00007792319,0.0005071162],"category_scores_gemma":[0.0017445541,0.00010763515,0.00005150213,0.0009811727,0.00006659242,0.00014809644,0.0001641277,0.00015174322,0.0031786992],"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.000058703252,0.00044315754,0.007967252,0.0000112263,0.00008263481,0.0000031985078,0.0020540422,0.081076495,0.015352401,0.099221356,0.07134332,0.7223862],"study_design_scores_gemma":[0.0006773082,0.00006948314,0.009401295,0.000013693763,0.000051019022,0.000030963463,0.00052604906,0.04801794,0.0018126648,0.012365222,0.92654043,0.0004939132],"about_ca_topic_score_codex":0.0000231551,"about_ca_topic_score_gemma":0.000047792557,"teacher_disagreement_score":0.85519713,"about_ca_system_score_codex":0.000021091157,"about_ca_system_score_gemma":0.000049670045,"threshold_uncertainty_score":0.99759746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024372334,0.00015271392,0.97320247,0.00065830816,0.00015776162,0.0005584947,0.0000010662937,0.00008158553,0.0008152532],"genre_scores_gemma":[0.5862747,0.0000016299379,0.41310278,0.00041157668,0.000177036,0.0000031806007,3.9515393e-7,0.00000610425,0.00002260572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722457,0.0000828118,0.001028242,0.00030971295,0.0007325514,0.000622094],"domain_scores_gemma":[0.9961501,0.0022608624,0.0006578389,0.00018495308,0.00048517683,0.00026112207],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010784554,0.00020036747,0.00039466057,0.00042696286,0.0011896761,0.0017416615,0.00039070527,0.00009186714,0.000004010488],"category_scores_gemma":[0.0031390341,0.00013490251,0.00018472035,0.0004408229,0.0000850566,0.00045639573,0.000032334796,0.00049814914,0.0000060667553],"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.00009947037,0.000076243596,0.00045597085,0.0000062735194,0.00004511992,0.000007576872,0.0011262174,0.16124053,0.00017966755,0.005791992,0.00016369284,0.8308072],"study_design_scores_gemma":[0.0020072637,0.00067140907,0.0005224711,0.00016545248,0.00003055352,0.0007198384,0.00096118724,0.974057,0.00009490721,0.018913522,0.0015902526,0.00026610243],"about_ca_topic_score_codex":0.0000022627692,"about_ca_topic_score_gemma":1.6910438e-7,"teacher_disagreement_score":0.83054113,"about_ca_system_score_codex":0.00005988466,"about_ca_system_score_gemma":0.0001938131,"threshold_uncertainty_score":0.99929464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96181744,0.000042617667,0.010682855,0.0002991838,0.00039974254,0.00014575024,0.0000013935901,0.000089495086,0.026521523],"genre_scores_gemma":[0.98981184,7.941075e-7,0.0061408533,0.00030054888,0.00013822273,0.0000029878893,9.165998e-7,0.000008225307,0.0035956216],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99717563,0.00023089234,0.0006632023,0.00050448044,0.001044916,0.00038089938],"domain_scores_gemma":[0.9970909,0.001753011,0.00006638637,0.0006928085,0.00019419836,0.00020270633],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010229854,0.00011115956,0.00023646303,0.0005244653,0.00014834949,0.00014746063,0.00057142373,0.000070184484,0.0006349073],"category_scores_gemma":[0.004704158,0.000077920595,0.00005766161,0.0012622566,0.00006790302,0.00020549662,0.00008484685,0.00022735266,0.00097332016],"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.000049738726,0.0020714237,0.92960477,4.8523293e-7,0.000011092619,0.000065933586,0.0031453632,0.00067651283,0.00005068367,0.00041283737,0.0030050213,0.06090613],"study_design_scores_gemma":[0.00087011827,0.00031329674,0.9589319,0.0000027031413,0.000013924547,0.00001137192,0.022008425,0.0060427785,0.00015495117,0.0069975173,0.0044256137,0.00022738443],"about_ca_topic_score_codex":0.00026035728,"about_ca_topic_score_gemma":0.0018761471,"teacher_disagreement_score":0.060678747,"about_ca_system_score_codex":0.00003351301,"about_ca_system_score_gemma":0.000078567406,"threshold_uncertainty_score":0.99980456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01079683,0.0011192939,0.97479457,0.0003343944,0.0005544801,0.00029108836,0.0000085619295,0.000060920618,0.012039845],"genre_scores_gemma":[0.8700588,0.00009839558,0.11946062,0.00042370002,0.0006033455,0.000008110575,0.000009979896,0.000049287442,0.0092877885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947435,0.00010067425,0.0005383355,0.0015415255,0.0024759548,0.00060001266],"domain_scores_gemma":[0.9957634,0.002051891,0.0002438155,0.0010601728,0.0006661041,0.00021459236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005185723,0.00039178345,0.0005461943,0.0016389848,0.00047405806,0.0009965026,0.001415683,0.00025743,0.00022968806],"category_scores_gemma":[0.0006163543,0.0002770051,0.00007405121,0.001264525,0.0014899917,0.0005219871,0.00049306185,0.0006900054,0.00010644444],"study_design_candidate":"design_other","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.000012652668,0.000029242805,0.000682322,0.000010289531,0.000014985255,0.000071291666,0.0010083297,0.034346797,0.00008872408,0.0013169649,0.000022645736,0.9623957],"study_design_scores_gemma":[0.0018210651,0.0010236304,0.018097024,0.0013548394,0.0001502968,0.001133861,0.000019869063,0.73716277,0.005078076,0.22783214,0.0034348161,0.0028916353],"about_ca_topic_score_codex":0.000026344469,"about_ca_topic_score_gemma":0.00009139616,"teacher_disagreement_score":0.9595041,"about_ca_system_score_codex":0.00011915178,"about_ca_system_score_gemma":0.00045232615,"threshold_uncertainty_score":0.99996823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97688764,0.0006311102,0.013101341,0.0020861835,0.00008143968,0.00018861711,0.000032100696,0.00032229233,0.0066692755],"genre_scores_gemma":[0.96401995,0.00029243415,0.032546256,0.0016436685,0.0001432811,0.000020386902,0.000013884007,0.000025928932,0.0012941974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959813,0.0014136668,0.00095526304,0.0007844832,0.00019284443,0.00067245157],"domain_scores_gemma":[0.990853,0.0070469016,0.00034828563,0.0009637406,0.0003688045,0.00041924205],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006887722,0.00036605942,0.0006940473,0.00053908356,0.00044250238,0.0010390708,0.00091599784,0.00025540064,0.00031753376],"category_scores_gemma":[0.0092401635,0.00030460517,0.00038591857,0.00065776566,0.0006377996,0.0008241456,0.00013229344,0.00034590508,0.00026193095],"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.000523502,0.0023949652,0.34937093,0.000052483538,0.0005673968,0.000118305696,0.01918177,0.037243098,0.008723993,0.21569115,0.010262892,0.35586953],"study_design_scores_gemma":[0.00089943537,0.00015688679,0.33073086,0.00008774252,0.00006544465,0.000064234795,0.00060305273,0.005649337,0.012099566,0.6405885,0.008566168,0.00048878504],"about_ca_topic_score_codex":0.001065129,"about_ca_topic_score_gemma":0.0006361389,"teacher_disagreement_score":0.42489734,"about_ca_system_score_codex":0.00023620954,"about_ca_system_score_gemma":0.0004089385,"threshold_uncertainty_score":0.999998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04916585,0.00017709116,0.93892074,0.004243594,0.0012332847,0.00036553337,0.000013056061,0.00007516156,0.005805676],"genre_scores_gemma":[0.96329206,0.000027194541,0.033179376,0.0011014058,0.0009831865,0.000015376374,0.0000022566114,0.000026271993,0.0013728844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641776,0.0000140870825,0.0010843718,0.00029579166,0.0015754071,0.00061257416],"domain_scores_gemma":[0.996137,0.0016656915,0.000714791,0.0005881665,0.0006200866,0.00027422357],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005136106,0.0002446452,0.00035299858,0.0004313235,0.0013770169,0.0012610875,0.001079975,0.00013854133,0.00004736632],"category_scores_gemma":[0.004260197,0.00012982074,0.0004170998,0.0009087439,0.00013809201,0.0003511576,0.00009073596,0.0007903745,0.00029297464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020753691,0.00011064497,0.00021099007,0.0000053425365,0.00018482695,0.000007651002,0.0005999362,0.79740214,0.00047418484,0.09525928,0.0014289015,0.10410857],"study_design_scores_gemma":[0.0074057174,0.0006713706,0.0019250397,0.00015449733,0.00056536024,0.00035200556,0.0076421937,0.4341283,0.0034922662,0.39848688,0.14397557,0.0012008039],"about_ca_topic_score_codex":0.00001852247,"about_ca_topic_score_gemma":0.000017778315,"teacher_disagreement_score":0.9141262,"about_ca_system_score_codex":0.00021044708,"about_ca_system_score_gemma":0.00047413944,"threshold_uncertainty_score":0.99992305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01076601,0.00010922188,0.9749966,0.00030443375,0.0123637095,0.00013061885,0.0000018798827,0.000019416495,0.001308056],"genre_scores_gemma":[0.26508647,0.000005536499,0.7334011,0.000033684588,0.0012135232,0.0000049376454,0.0000030651688,0.000015763917,0.0002358985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976034,0.0002922441,0.0010138782,0.00018091981,0.0006975906,0.00021194931],"domain_scores_gemma":[0.99354255,0.0033699754,0.0010589691,0.00019636669,0.0017535819,0.000078549456],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0075489692,0.00010967111,0.00032705616,0.000575002,0.00031964763,0.00028723638,0.00035592305,0.00009644851,0.00003728111],"category_scores_gemma":[0.010938686,0.00008581145,0.00026461747,0.0010173403,0.00003632853,0.0003830212,0.000025415493,0.00017136463,0.0000052576365],"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.00014034424,0.00013896957,0.00019220672,0.0000017306845,0.000017984183,8.227966e-7,0.000040708037,0.8464494,0.00017023171,0.14803931,0.002546395,0.0022619062],"study_design_scores_gemma":[0.0028913664,0.00053743564,0.00019320175,0.000046103214,0.000088449415,0.000013531141,0.000081673905,0.21973047,0.00275106,0.7626322,0.010852305,0.00018220839],"about_ca_topic_score_codex":0.0000049125206,"about_ca_topic_score_gemma":1.6499777e-7,"teacher_disagreement_score":0.62671894,"about_ca_system_score_codex":0.00006737349,"about_ca_system_score_gemma":0.00012556667,"threshold_uncertainty_score":0.9973926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26220605,0.00036856008,0.6819375,0.025466742,0.013715521,0.002706644,0.00005208631,0.0004383866,0.013108476],"genre_scores_gemma":[0.87296027,0.000008605538,0.120076686,0.0031219667,0.00069995574,0.00039439055,0.000019574323,0.00003987581,0.0026786916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918823,0.00009188586,0.0010163197,0.0020394078,0.0033969625,0.0015731067],"domain_scores_gemma":[0.9957012,0.0005288525,0.0006617565,0.0024388728,0.00025034262,0.00041898843],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013296754,0.00047423178,0.0005811991,0.0018843953,0.0012882226,0.0022759195,0.004811795,0.00014928648,0.00015467129],"category_scores_gemma":[0.0011577541,0.00040518702,0.00043424004,0.002396752,0.0010820591,0.0006930762,0.0017888611,0.00057679426,0.0010160778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004349327,0.0012468839,0.027562404,0.0007904191,0.0007017386,0.00009306111,0.0055447444,0.5888449,0.0043936693,0.19665687,0.109087646,0.064642765],"study_design_scores_gemma":[0.010353176,0.00022187516,0.07485523,0.001765885,0.0028865288,0.000050390598,0.009814763,0.49955,0.002616168,0.20478548,0.18477648,0.008324021],"about_ca_topic_score_codex":0.00006867855,"about_ca_topic_score_gemma":0.000005834564,"teacher_disagreement_score":0.6107542,"about_ca_system_score_codex":0.00028954152,"about_ca_system_score_gemma":0.00009378228,"threshold_uncertainty_score":0.99984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4213476,0.000035137728,0.55997485,0.0034961635,0.00049715146,0.0005944826,0.000014094234,0.00020068452,0.013839859],"genre_scores_gemma":[0.9916754,6.624482e-7,0.002458705,0.00075689395,0.00022320004,0.000036186455,0.00003831785,0.000020199472,0.004790448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968548,0.00024100591,0.0008520849,0.0006371772,0.00089056534,0.0005243655],"domain_scores_gemma":[0.99537486,0.0018962477,0.00029890757,0.0007001444,0.0013126945,0.00041713894],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016127465,0.00022171771,0.00027345793,0.00067590806,0.0006746518,0.0013357528,0.0006180166,0.00016464596,0.004972373],"category_scores_gemma":[0.007179061,0.0001994473,0.00012246972,0.00079122203,0.00006825408,0.0014113614,0.000062307794,0.0002567151,0.0030799282],"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.00000825685,0.0000110374895,0.005436268,0.0000020813025,0.00001624189,6.7122295e-7,0.0022136702,0.92176473,0.00020260163,0.0014157285,0.0005543955,0.0683743],"study_design_scores_gemma":[0.00026250348,0.000023970637,0.019430997,0.000045572007,0.000013606268,0.0000013120842,0.0015115605,0.9524544,0.00003669033,0.008887886,0.017086959,0.0002445794],"about_ca_topic_score_codex":0.008319583,"about_ca_topic_score_gemma":0.0067035914,"teacher_disagreement_score":0.5703278,"about_ca_system_score_codex":0.00020227242,"about_ca_system_score_gemma":0.0005175114,"threshold_uncertainty_score":0.99970096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86403537,0.000001986593,0.1232127,0.0069581824,0.0008939461,0.000090388996,0.000009105919,0.00005582474,0.0047425036],"genre_scores_gemma":[0.9864545,1.8386021e-7,0.0124806,0.0005118573,0.00018644174,0.0000050213384,0.0000042165298,0.000006644753,0.0003505772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973224,0.00012795757,0.00074229616,0.00040333395,0.001046255,0.00035779772],"domain_scores_gemma":[0.99821687,0.0010817387,0.00011554952,0.00021706453,0.00025232107,0.000116465555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004328119,0.000114303635,0.00018919026,0.00027003445,0.00037316864,0.00023246331,0.00039158855,0.000340597,0.004633378],"category_scores_gemma":[0.003695731,0.00009186834,0.00013065615,0.0006852498,0.0005073128,0.0001324405,0.00009658388,0.0011934412,0.0007039422],"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.000011492033,0.00018619961,0.023292385,7.535482e-7,0.0000071157087,0.0000068478853,0.0007823524,0.0015100469,0.0026018494,0.89725673,0.00038672684,0.07395751],"study_design_scores_gemma":[0.00013966575,0.000024824752,0.22060157,0.000008932876,0.000010383958,0.000025602876,0.002317817,0.037217308,0.0017350496,0.73747915,0.00016399642,0.00027566755],"about_ca_topic_score_codex":0.00008268687,"about_ca_topic_score_gemma":0.000985376,"teacher_disagreement_score":0.19730918,"about_ca_system_score_codex":0.000029121871,"about_ca_system_score_gemma":0.00020080578,"threshold_uncertainty_score":0.9962765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56888187,0.0002826487,0.37769938,0.0015025212,0.0007966475,0.00032452244,0.000007266598,0.0013179614,0.04918719],"genre_scores_gemma":[0.93252003,0.0000014672748,0.060573984,0.00022366541,0.00007264151,0.0000073616357,9.80918e-7,0.000006928941,0.0065929256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763244,0.00009205526,0.00058592076,0.0004183624,0.00091727957,0.0003539557],"domain_scores_gemma":[0.9985111,0.0003370203,0.00015207836,0.000599969,0.00023069953,0.00016916811],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002005373,0.00013612455,0.00023783621,0.00022377241,0.00028587738,0.0005169783,0.00047694007,0.000071583316,0.000069630405],"category_scores_gemma":[0.001066747,0.00009611193,0.00011711288,0.0005746776,0.000020484342,0.0002693237,0.00003428204,0.000114936774,0.0008484605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016823677,0.0005864125,0.0020031496,0.000008143097,0.00005394969,0.000017653001,0.004144283,0.89297086,0.0047729034,0.04553322,0.010360625,0.03953197],"study_design_scores_gemma":[0.00021543252,0.00003103475,0.0018962695,0.000016793052,0.000012226109,0.000015086642,0.00050052756,0.9944025,0.00014225865,0.0020797027,0.000553989,0.00013417365],"about_ca_topic_score_codex":0.000024774206,"about_ca_topic_score_gemma":0.0000023329503,"teacher_disagreement_score":0.36363816,"about_ca_system_score_codex":0.000045576307,"about_ca_system_score_gemma":0.00007909438,"threshold_uncertainty_score":0.9999295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5688283,0.00025098445,0.42832822,0.0016096297,0.00030308522,0.00036971117,0.000046356367,0.00015188266,0.000111868256],"genre_scores_gemma":[0.8539669,0.0000013238867,0.14552279,0.00015310112,0.00014807418,0.000020506732,0.000016385015,0.000015936057,0.00015501236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731016,0.00012678062,0.00076776376,0.0005369487,0.0008160164,0.00044231242],"domain_scores_gemma":[0.9967401,0.0011659345,0.0002921137,0.00081850094,0.0007925852,0.00019076887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023462775,0.00019258677,0.00040870308,0.00038796352,0.00024199046,0.00016817683,0.0007151978,0.000115068455,0.000036653873],"category_scores_gemma":[0.005340534,0.0001441332,0.00024927684,0.00093294,0.00013231626,0.00021659069,0.000020796624,0.00018384325,0.000052857966],"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.0015433242,0.00681782,0.023923008,0.00011925654,0.0003198326,0.000026956155,0.0044451733,0.18028252,0.014396338,0.031335197,0.003938768,0.7328518],"study_design_scores_gemma":[0.0063665826,0.018431248,0.029576477,0.00058178435,0.0004589438,0.0000201205,0.00620231,0.75494605,0.043709505,0.10512605,0.032569475,0.002011424],"about_ca_topic_score_codex":0.00002228296,"about_ca_topic_score_gemma":0.000029388404,"teacher_disagreement_score":0.7308404,"about_ca_system_score_codex":0.000020210915,"about_ca_system_score_gemma":0.00021435092,"threshold_uncertainty_score":0.63935035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81011826,0.00084975304,0.087714694,0.0011119811,0.0023810957,0.0030516842,0.00095713563,0.00029264318,0.09352273],"genre_scores_gemma":[0.38852048,0.00008212325,0.35081986,0.00031110586,0.00017791161,0.0000013816191,0.001271086,0.00011907616,0.25869697],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927451,0.000840238,0.000822774,0.0020669918,0.00251707,0.0010077994],"domain_scores_gemma":[0.99251425,0.00093108695,0.0013432307,0.0020578585,0.002193523,0.0009600483],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012287999,0.00066332665,0.0016165806,0.002192838,0.0017863337,0.0007687419,0.0075444533,0.0009726472,0.0006368797],"category_scores_gemma":[0.002210964,0.00080041355,0.00074148166,0.004576975,0.0002832088,0.002204687,0.00096481096,0.0019853828,0.0017276822],"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.035479628,0.03577838,0.018347856,0.0011810355,0.0074412026,0.003198092,0.07332648,0.008809332,0.04191089,0.032339185,0.17250486,0.5696831],"study_design_scores_gemma":[0.029386558,0.0012095295,0.24193725,0.0019941856,0.004581637,0.00015559711,0.17583409,0.012181503,0.00403698,0.002106598,0.51923525,0.0073408443],"about_ca_topic_score_codex":0.0025459677,"about_ca_topic_score_gemma":0.0009276192,"teacher_disagreement_score":0.5623422,"about_ca_system_score_codex":0.00029715517,"about_ca_system_score_gemma":0.0012538258,"threshold_uncertainty_score":0.9995132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78034884,0.00021579418,0.07969042,0.0005248959,0.00019131406,0.00043041658,0.000029047062,0.00017799178,0.1383913],"genre_scores_gemma":[0.926365,0.000014707911,0.07286002,0.0001324611,0.000024790392,0.000013182728,0.0000065766385,0.000012711744,0.00057051785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718904,0.000025134503,0.0009821632,0.0003504987,0.0011059283,0.00034725125],"domain_scores_gemma":[0.99776196,0.0006158704,0.0004645546,0.000790631,0.00019476871,0.00017223804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014667688,0.00019109018,0.00051038724,0.00029244917,0.00012898301,0.0001146773,0.00078404456,0.000093774965,0.00018984171],"category_scores_gemma":[0.0006887948,0.00013805293,0.00023399518,0.0009076077,0.00014902213,0.000099154255,0.0000996299,0.00016391907,0.00026087617],"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.00003233055,0.00022124438,0.00006882348,0.00002150417,0.00003848669,0.0000015501947,0.0021438205,0.00005800288,0.005953041,0.98647577,0.0009443324,0.004041127],"study_design_scores_gemma":[0.00053092017,0.00014620648,0.00060622056,0.00008268637,0.00006934831,0.0000060972648,0.0025474932,0.0054257005,0.010013995,0.97839147,0.0019110068,0.00026882754],"about_ca_topic_score_codex":0.0000021409005,"about_ca_topic_score_gemma":8.715058e-7,"teacher_disagreement_score":0.14601621,"about_ca_system_score_codex":0.000019795518,"about_ca_system_score_gemma":0.00005463902,"threshold_uncertainty_score":0.56296355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9527883,0.0012778128,0.003652865,0.011591793,0.009718809,0.00029403198,0.000008651086,0.00014858907,0.020519163],"genre_scores_gemma":[0.977086,0.00005076328,0.0025245226,0.0007956255,0.0007063115,0.00025848756,0.000021044076,0.000013849466,0.018543417],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9961303,0.00025568125,0.00062137557,0.00054694596,0.002221436,0.00022425299],"domain_scores_gemma":[0.99268705,0.0009719939,0.00039050606,0.00038404157,0.005479483,0.00008695584],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037924678,0.00017410496,0.00025155937,0.00048697728,0.00034207723,0.00044442227,0.0010357483,0.00005850691,0.0001896334],"category_scores_gemma":[0.018328846,0.00013761409,0.00009591318,0.0006938329,0.00021245463,0.0004943996,0.00016510379,0.0001348988,0.0008742625],"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.000058469966,0.0017073256,0.31015322,0.000026353626,0.0005738531,0.0000013457258,0.015071748,0.0002972973,0.00004546136,0.0496473,0.023039786,0.5993779],"study_design_scores_gemma":[0.0012950073,0.00020710765,0.43323806,0.00023412213,0.00010973092,0.000049996786,0.039044026,0.0039725606,0.0007896112,0.26676178,0.25353742,0.00076059386],"about_ca_topic_score_codex":0.000021550451,"about_ca_topic_score_gemma":0.00001358066,"teacher_disagreement_score":0.59861726,"about_ca_system_score_codex":0.00013299116,"about_ca_system_score_gemma":0.00022007486,"threshold_uncertainty_score":0.9999037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3193139,0.00017030809,0.6667663,0.000100297635,0.000022203745,0.00049833674,0.000008716459,0.00002365966,0.013096278],"genre_scores_gemma":[0.88844544,0.000023962828,0.1113811,0.00003429882,0.000019252917,0.00007199496,0.0000034262505,0.0000064088895,0.000014099292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825335,0.00002505309,0.0006821543,0.00022039509,0.0006207698,0.00019826568],"domain_scores_gemma":[0.9965389,0.0025598619,0.00036664933,0.00041090354,0.00008281303,0.00004088155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00394904,0.0001093885,0.00023545962,0.00029314635,0.00016229744,0.00008914273,0.00041262462,0.00005344138,0.000008190863],"category_scores_gemma":[0.0005169943,0.0000695119,0.000042358,0.0015865138,0.0001956813,0.00011722907,0.000052845437,0.00011991196,0.00001730943],"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.000016313039,0.00014006658,0.0006853297,0.000055163557,0.000018241153,9.33213e-7,0.009903337,0.0036444305,0.0006051722,0.968258,0.00004495956,0.016628003],"study_design_scores_gemma":[0.0004304367,0.000028600743,0.006226002,0.000058315803,0.00005292488,0.000007743879,0.03631516,0.014600449,0.001960698,0.93951136,0.0006022948,0.00020600342],"about_ca_topic_score_codex":0.000010038621,"about_ca_topic_score_gemma":0.000039286002,"teacher_disagreement_score":0.56913155,"about_ca_system_score_codex":0.000013065895,"about_ca_system_score_gemma":0.000025139288,"threshold_uncertainty_score":0.28346133},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875684,0.0009937603,0.117614575,0.0037062683,0.00032377013,0.00077190605,0.0000025976615,0.00007719054,0.0008259094],"genre_scores_gemma":[0.9549091,0.000020366466,0.044266157,0.00012411393,0.000045924386,0.0001413558,0.0000065580775,0.000014238286,0.00047220284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954668,0.0017741746,0.00048855064,0.00052146666,0.0011615602,0.0005873989],"domain_scores_gemma":[0.99373335,0.0043519265,0.000043381697,0.00068551075,0.0010038433,0.00018202071],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008376407,0.0001380201,0.0001841961,0.0004616318,0.0027045642,0.0038953803,0.00078167144,0.00006492172,0.0001449263],"category_scores_gemma":[0.0013300941,0.00008704107,0.000066895176,0.0013971925,0.0004975916,0.00051171536,0.00047206992,0.00061061996,0.00031497143],"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.000025365132,0.0002859871,0.0004979159,0.000011715023,0.000120236116,0.00001435339,0.02018215,0.27483276,0.00210488,0.23202965,0.0018034799,0.46809152],"study_design_scores_gemma":[0.00022192163,0.0001374772,0.000643906,0.000051645624,0.0000069236785,0.000020902658,0.021265926,0.95625997,0.000062053274,0.02024423,0.0009274565,0.00015759759],"about_ca_topic_score_codex":0.00041896067,"about_ca_topic_score_gemma":0.00012574422,"teacher_disagreement_score":0.6814272,"about_ca_system_score_codex":0.00006185122,"about_ca_system_score_gemma":0.00020220655,"threshold_uncertainty_score":0.9985938},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262122,0.00010580626,0.06789692,0.0021009792,0.002928691,0.00005621444,0.0000017521625,0.000027299095,0.00067016913],"genre_scores_gemma":[0.7848146,0.0000019593901,0.2138383,0.00019220608,0.00086258724,0.0000014381551,1.4513827e-7,0.0000138187415,0.0002749685],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99684143,0.000117100324,0.00096282864,0.0002527531,0.001439608,0.00038625972],"domain_scores_gemma":[0.9949363,0.002943565,0.000663276,0.00040301788,0.0006487409,0.00040513012],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0069853985,0.00015358406,0.0004073207,0.0007755109,0.0003453556,0.0005725837,0.0008889349,0.00012370232,0.00022868044],"category_scores_gemma":[0.020972518,0.00011319377,0.00027774475,0.0013317956,0.00007338542,0.0006737477,0.00011335608,0.0010131974,0.00022975897],"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.0005790757,0.00051902805,0.36437717,0.00001056334,0.00028223233,0.00014133072,0.0072658057,0.13492005,0.3309528,0.0030329416,0.006227393,0.1516916],"study_design_scores_gemma":[0.008798974,0.0015955117,0.5163179,0.0017517408,0.0005805509,0.0012084589,0.033490658,0.04351254,0.15528123,0.07732868,0.15629305,0.0038406698],"about_ca_topic_score_codex":0.00000692434,"about_ca_topic_score_gemma":0.000019506275,"teacher_disagreement_score":0.17567156,"about_ca_system_score_codex":0.000030113444,"about_ca_system_score_gemma":0.00022356903,"threshold_uncertainty_score":0.9872742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1074565,0.00007480537,0.87649673,0.0002510548,0.000182301,0.00036599464,0.000008704814,0.000025428102,0.015138506],"genre_scores_gemma":[0.93029755,0.000008537456,0.0692406,0.000013111152,0.00012946039,0.000046777146,0.00001141217,0.000010336823,0.00024221571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951508,0.0009537408,0.00087610085,0.0003133277,0.0020811185,0.0006249236],"domain_scores_gemma":[0.99616283,0.0018114413,0.00011498667,0.00046817065,0.0011952751,0.00024731073],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.022879917,0.000105725754,0.0002191609,0.0011654712,0.0003841535,0.00020719082,0.00059488206,0.00009797835,0.00024983598],"category_scores_gemma":[0.0053283153,0.00008764745,0.00008012047,0.0035579766,0.00021910167,0.0006706964,0.00007613059,0.00021021055,0.0008687313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075745374,0.0008528483,0.00041052588,0.00002161531,0.000019802206,3.1916736e-7,0.01553079,0.33622804,0.0055962102,0.3321677,0.00019350291,0.3089029],"study_design_scores_gemma":[0.00006227086,0.00028846334,0.0020319414,0.000045645622,0.000025359057,0.000010596261,0.024536192,0.770238,0.08391998,0.11565549,0.0028116445,0.00037443658],"about_ca_topic_score_codex":0.00006695772,"about_ca_topic_score_gemma":0.000009048499,"teacher_disagreement_score":0.82284105,"about_ca_system_score_codex":0.000065826396,"about_ca_system_score_gemma":0.000098416705,"threshold_uncertainty_score":0.9999092},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033998907,0.0011072805,0.9602224,0.0031082304,0.00015022268,0.0008618025,0.000009526401,0.000023227505,0.0005183953],"genre_scores_gemma":[0.8491857,0.000004688611,0.15042707,0.000018478268,0.000038275903,0.0001108083,0.000003164417,0.0000054049024,0.00020642928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997465,0.00030457947,0.0005028369,0.00033122022,0.0010649102,0.00033142304],"domain_scores_gemma":[0.9938935,0.0030086131,0.000042539952,0.0004386151,0.0024695382,0.00014719163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009320334,0.000079943755,0.00020633504,0.00032886467,0.0007578011,0.0006626508,0.00064990413,0.000047723202,0.0000060862653],"category_scores_gemma":[0.0027125506,0.0000482766,0.00005869566,0.0010656412,0.000699233,0.00023262842,0.00023879726,0.00024877596,0.000014277092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024261506,0.00023734581,0.00077205396,0.000008796561,0.000023928249,3.6061178e-7,0.009296818,0.6928493,0.00010440865,0.14704007,0.0066969236,0.14294575],"study_design_scores_gemma":[0.0002800417,0.00017976845,0.000059260266,0.000018817234,0.000007091282,0.000005110079,0.006485306,0.9775959,0.00011446128,0.0120737525,0.0031222468,0.000058224552],"about_ca_topic_score_codex":0.00017008901,"about_ca_topic_score_gemma":0.00011003453,"teacher_disagreement_score":0.8151868,"about_ca_system_score_codex":0.00003535118,"about_ca_system_score_gemma":0.00048752033,"threshold_uncertainty_score":0.6389957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014375981,0.00064205896,0.99345964,0.003699779,0.0003021772,0.00024436248,0.00012357204,0.000012549204,0.00007826622],"genre_scores_gemma":[0.7184071,0.000136233,0.28029555,0.00021946084,0.0005111721,0.00005883926,0.000008868072,0.000008791813,0.00035400342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976112,0.00006680163,0.0009516991,0.00024866094,0.0009686971,0.00015290431],"domain_scores_gemma":[0.9894255,0.0065944064,0.0006446794,0.00020010318,0.003025019,0.000110340865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024487118,0.00011959802,0.00020437324,0.00033412044,0.00028077132,0.0002762821,0.0010932048,0.00003251413,0.000058701695],"category_scores_gemma":[0.0023510347,0.000062369254,0.0002035277,0.0002997335,0.00023278933,0.000299443,0.000079326186,0.000119965865,0.000036161804],"study_design_candidate":"design_other","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.00012405832,0.0006878806,0.00027847194,0.0000029156106,0.000447408,0.0000027995839,0.00015408108,0.14866105,0.00043799248,0.08432412,0.0017893878,0.76308984],"study_design_scores_gemma":[0.0014262178,0.00013946163,0.0013648564,0.000037240054,0.00018753916,0.00055901957,0.000555074,0.5415437,0.001359015,0.35652775,0.09604318,0.00025696828],"about_ca_topic_score_codex":0.0000032863084,"about_ca_topic_score_gemma":5.832017e-7,"teacher_disagreement_score":0.7628329,"about_ca_system_score_codex":0.000034972272,"about_ca_system_score_gemma":0.0001582206,"threshold_uncertainty_score":0.28145778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9281507,0.00018740786,0.01943398,0.041130345,0.0007418452,0.0018195116,0.000015881118,0.00006919323,0.008451121],"genre_scores_gemma":[0.99369526,0.00003161124,0.0046129148,0.00025184616,0.000120113735,0.000114016104,2.195593e-7,0.000012044925,0.0011619801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974605,0.000030195635,0.00082662725,0.0004819787,0.0007963798,0.00040433236],"domain_scores_gemma":[0.9966299,0.00105977,0.0005289364,0.00028548206,0.0013867524,0.0001091595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029265408,0.00019371543,0.00029327185,0.00011317051,0.0005999285,0.0008506442,0.0012554667,0.000076773795,0.0001881357],"category_scores_gemma":[0.0037147428,0.00010081332,0.0001536334,0.00056639273,0.0003891908,0.00030883454,0.0001863323,0.00027347624,0.00010749212],"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.0000758365,0.00016276221,0.0016344785,0.000036312496,0.000052000658,9.329069e-8,0.005456363,0.00041786465,0.053522605,0.6070935,0.002842549,0.3287056],"study_design_scores_gemma":[0.000052623076,0.00018470017,0.0014523687,0.00021866141,0.000040388855,0.0000066741163,0.009397188,0.091032535,0.1111726,0.7852665,0.0009505036,0.00022524629],"about_ca_topic_score_codex":0.00010995864,"about_ca_topic_score_gemma":0.000017332914,"teacher_disagreement_score":0.32848036,"about_ca_system_score_codex":0.000027166414,"about_ca_system_score_gemma":0.00008699684,"threshold_uncertainty_score":0.8202781},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31241128,0.0006813185,0.66362256,0.0035904378,0.00012303892,0.00023246068,0.00003631654,0.00018186714,0.019120703],"genre_scores_gemma":[0.7968093,0.00036698312,0.19335338,0.00034425806,0.00013845522,0.00006597585,0.00003563835,0.00002956829,0.008856397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942598,0.0030177557,0.000708932,0.0005253872,0.0005639049,0.00092426786],"domain_scores_gemma":[0.99661714,0.0019154607,0.0003359357,0.00047538913,0.00033085045,0.0003252001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.017376717,0.0002645274,0.00025518783,0.0003752955,0.00047203415,0.0003977072,0.00045314763,0.0005441083,0.00038539065],"category_scores_gemma":[0.003320908,0.0002582841,0.00016601576,0.00052586256,0.0002083181,0.00088037003,0.000043686698,0.00048431006,0.00024292746],"study_design_candidate":"theoretical_or_conceptual","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.0003223201,0.0014304962,0.09882602,0.00015178499,0.0001547198,0.000026991422,0.11537155,0.086314514,0.018213827,0.5729573,0.02051493,0.085715555],"study_design_scores_gemma":[0.00061275094,0.00008756123,0.13179177,0.00013747305,0.00015075812,0.00021439974,0.006857356,0.64661485,0.0063127102,0.19994828,0.006930678,0.00034142425],"about_ca_topic_score_codex":0.008586398,"about_ca_topic_score_gemma":0.0017801945,"teacher_disagreement_score":0.56030035,"about_ca_system_score_codex":0.00053985644,"about_ca_system_score_gemma":0.0019109849,"threshold_uncertainty_score":0.99998695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720858,0.0010358142,0.9562862,0.023339361,0.0010065874,0.00055519724,0.000021921182,0.000013575905,0.0005327459],"genre_scores_gemma":[0.71760297,0.00020599867,0.2459994,0.000108247164,0.0011782068,0.000084337786,8.9044414e-7,0.000031837848,0.03478813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956002,0.0004151323,0.0008300725,0.0002650208,0.0023820654,0.0005075039],"domain_scores_gemma":[0.98747736,0.007513165,0.000115853145,0.00053206016,0.0040781004,0.00028347212],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.016233312,0.00010441852,0.00023350798,0.0006858569,0.0014354526,0.0007783741,0.0012881593,0.000066188164,0.00041013764],"category_scores_gemma":[0.008308467,0.00004581175,0.00022121474,0.0014596896,0.0001903418,0.00032638002,0.00014165632,0.0003738455,0.00028476777],"study_design_candidate":"design_other","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.00007724647,0.00019573618,0.00016606708,0.0000022286417,0.00014751405,0.000010215084,0.0011009641,0.042946063,0.005860399,0.010405322,0.07905678,0.8600315],"study_design_scores_gemma":[0.005770057,0.0016735498,0.002478295,0.00034051892,0.00011722046,0.00033916757,0.0038314224,0.5618801,0.0058548083,0.02268905,0.39458254,0.0004432419],"about_ca_topic_score_codex":0.00007024465,"about_ca_topic_score_gemma":0.000070393784,"teacher_disagreement_score":0.8595882,"about_ca_system_score_codex":0.00014512363,"about_ca_system_score_gemma":0.0015887513,"threshold_uncertainty_score":0.9998645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064784597,0.0011447384,0.98441035,0.0003403391,0.0056339847,0.0004707447,0.000023366712,0.00013770122,0.007190923],"genre_scores_gemma":[0.62934256,0.000017007806,0.3600071,0.00047756254,0.0022759542,0.00006114747,0.000017276858,0.000077366145,0.0077240313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951235,0.000035755103,0.0009748912,0.0014814693,0.0017116551,0.0006727255],"domain_scores_gemma":[0.9956099,0.0015491899,0.0005457182,0.0012201868,0.0008787722,0.00019622405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003282236,0.00040454065,0.00061453186,0.0011585166,0.0005816843,0.00069834903,0.0028972316,0.0003236039,0.000189621],"category_scores_gemma":[0.0005111419,0.00030593158,0.00023911927,0.0007608325,0.00028557048,0.00041720143,0.0004650096,0.00044242223,0.00053813815],"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.000026210824,0.00004431268,0.0011756667,0.00027742228,0.000059586466,0.00003048776,0.0027021118,0.37743428,0.0002179865,0.034904733,0.00085601385,0.5822712],"study_design_scores_gemma":[0.00023849269,0.000103262224,0.0002524422,0.00069510133,0.000027335145,0.000033749562,0.0000063214575,0.70606834,0.00024744731,0.28141046,0.010269734,0.0006472914],"about_ca_topic_score_codex":0.000043460324,"about_ca_topic_score_gemma":0.000035521258,"teacher_disagreement_score":0.6286947,"about_ca_system_score_codex":0.00015178983,"about_ca_system_score_gemma":0.0002827678,"threshold_uncertainty_score":0.99993926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16554676,0.00028723897,0.8332273,0.00023887928,0.00007387061,0.0002096014,0.000012780538,0.000038547405,0.00036505572],"genre_scores_gemma":[0.73718554,0.000011561515,0.26235434,0.000054892633,0.000019278705,0.000018395789,1.9984246e-7,0.000011362447,0.00034442294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960938,0.00006212313,0.0006524543,0.0008662269,0.001785902,0.0005394661],"domain_scores_gemma":[0.99708647,0.0010473334,0.00038285274,0.0008460737,0.00046299916,0.00017429168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058701783,0.00020632264,0.00037659748,0.00034186227,0.0010059169,0.000325986,0.0011990939,0.00006745591,0.000009269675],"category_scores_gemma":[0.0020859952,0.00010495156,0.00012140342,0.0011988317,0.0013610786,0.0006401831,0.00039591605,0.00014777543,0.000012462071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007718421,0.000025911808,0.00006775628,0.0000016554621,0.000018521694,1.5819688e-7,0.0010099843,0.8017664,0.18200804,0.005133684,0.0000033173844,0.009956868],"study_design_scores_gemma":[0.00025940355,0.000004868651,0.00009370594,0.000013644536,0.00011886516,0.00000323375,0.00018829835,0.89151096,0.0039496054,0.10371754,0.0000017248823,0.0001381657],"about_ca_topic_score_codex":0.000025024756,"about_ca_topic_score_gemma":0.0000074185027,"teacher_disagreement_score":0.57163876,"about_ca_system_score_codex":0.000055850167,"about_ca_system_score_gemma":0.00034238922,"threshold_uncertainty_score":0.7736801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26854366,0.09200557,0.57202005,0.0469508,0.0051402184,0.0005219042,0.000084907966,0.0007270221,0.014005849],"genre_scores_gemma":[0.52679425,0.0023332553,0.44468805,0.0007553246,0.0017994769,0.000014672229,0.000003346272,0.00013334729,0.023478277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99099857,0.0018525051,0.0023887511,0.00088559435,0.0019666688,0.001907931],"domain_scores_gemma":[0.9935213,0.0012027217,0.0014851963,0.0009198702,0.001584359,0.001286568],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008802083,0.000710579,0.0010829376,0.0008305528,0.0023542258,0.003262119,0.001892177,0.00047366356,0.00051471044],"category_scores_gemma":[0.009773668,0.0006399606,0.00085158244,0.0020624923,0.00095095305,0.0016744722,0.00031080094,0.0017428669,0.0039151306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098037446,0.0018180776,0.003395476,0.00031684808,0.0007091992,0.0023370115,0.0055429996,0.20258316,0.0026712504,0.1820352,0.027101848,0.5713909],"study_design_scores_gemma":[0.003282146,0.0005542444,0.05124247,0.0033698194,0.0003998377,0.027336411,0.0015199794,0.049742635,0.0011669827,0.82860017,0.031519458,0.0012658442],"about_ca_topic_score_codex":0.0013703579,"about_ca_topic_score_gemma":0.00011930095,"teacher_disagreement_score":0.64656496,"about_ca_system_score_codex":0.0011731619,"about_ca_system_score_gemma":0.0075712735,"threshold_uncertainty_score":0.9996052},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5115796,0.00008067006,0.48564863,0.0014723148,0.00064826495,0.00008292182,0.0000044138615,0.000039828235,0.00044336464],"genre_scores_gemma":[0.96682847,0.00001276938,0.03107443,0.00049135846,0.00063541695,0.0000017580933,2.6990423e-7,0.000013382164,0.0009421428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974956,0.00007677125,0.000747911,0.00029876968,0.00086695555,0.00051400706],"domain_scores_gemma":[0.9907363,0.0075797704,0.00058799423,0.00024887212,0.0005632632,0.0002837663],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006466838,0.00017632249,0.00034110344,0.0003704564,0.0009833942,0.00058190717,0.00043929496,0.00008989891,0.000084368745],"category_scores_gemma":[0.016126942,0.00009346228,0.0002626052,0.00036063572,0.00010078806,0.00066835555,0.00009992692,0.00031113048,0.00012860916],"study_design_candidate":"design_other","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.00028970034,0.00008439391,0.011131685,0.000007986353,0.000106714,0.0000072003468,0.001115529,0.007569947,0.0027139282,0.01202979,0.00073989364,0.96420324],"study_design_scores_gemma":[0.023246184,0.0014799923,0.06777325,0.0019221336,0.00015568858,0.0015954005,0.0024425127,0.5044488,0.0067198207,0.14817536,0.23967089,0.0023699838],"about_ca_topic_score_codex":0.000004270763,"about_ca_topic_score_gemma":0.0000016223693,"teacher_disagreement_score":0.96183324,"about_ca_system_score_codex":0.00008357281,"about_ca_system_score_gemma":0.00014515477,"threshold_uncertainty_score":0.9921606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76783437,0.046141017,0.18140867,0.0013776217,0.002984513,0.00010665416,0.00000492402,0.000035400684,0.00010682716],"genre_scores_gemma":[0.9941979,0.000104462975,0.0053078625,0.00002447709,0.00033502115,0.0000011677745,1.9102673e-7,0.000009753425,0.00001914049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789965,0.0000998267,0.0008573813,0.00012284833,0.0006410336,0.00037927215],"domain_scores_gemma":[0.99860144,0.00049675733,0.0002538057,0.00014172819,0.00016109816,0.00034516273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004644382,0.00010630566,0.00037644382,0.000344075,0.0000667452,0.00010136212,0.00023014324,0.00006877459,0.000018445626],"category_scores_gemma":[0.0018158342,0.0000782366,0.00008974872,0.00043896862,0.000009828822,0.00030023232,0.000051198796,0.00037511127,0.000007312893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007933174,0.00039334866,0.0042222133,0.00026343597,0.0001322163,0.000045549426,0.0054875854,0.83316785,0.004753473,0.1229002,0.00042522143,0.028129553],"study_design_scores_gemma":[0.0053535765,0.0014386064,0.008038952,0.003004891,0.00011363266,0.002127316,0.032447938,0.84583247,0.0017072065,0.004212957,0.094238356,0.0014841172],"about_ca_topic_score_codex":0.000013623954,"about_ca_topic_score_gemma":0.000014489767,"teacher_disagreement_score":0.22636355,"about_ca_system_score_codex":0.000068648034,"about_ca_system_score_gemma":0.00007395573,"threshold_uncertainty_score":0.31903958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05170989,0.00081037683,0.86579263,0.004708968,0.00037413233,0.00036482327,0.000009444328,0.00039425585,0.07583549],"genre_scores_gemma":[0.7881505,0.0000047742383,0.14932019,0.00038714657,0.0004477102,0.00003424856,0.0000059081513,0.000028908913,0.06162062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684477,0.00015721291,0.0005040039,0.00055159297,0.0014100979,0.00053233124],"domain_scores_gemma":[0.9971258,0.0013543641,0.00019447414,0.00081030966,0.00042610423,0.00008892487],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004189429,0.00019429835,0.00026134445,0.00024734615,0.00083889335,0.0007904369,0.00082991924,0.00007052116,0.0007320002],"category_scores_gemma":[0.0003984166,0.00009125673,0.00012408987,0.0017218827,0.00018659845,0.00039229591,0.000113693786,0.00025401704,0.0010784587],"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.00006696878,0.0011460093,0.02560062,0.000015776981,0.00037464077,0.00006559278,0.0019495779,0.21760862,0.0060614687,0.0906362,0.22582133,0.43065318],"study_design_scores_gemma":[0.001907465,0.00025433715,0.034099143,0.00007400222,0.00021885347,0.00025310484,0.0025662165,0.51310503,0.0032371727,0.06576516,0.37725303,0.001266479],"about_ca_topic_score_codex":0.00075038214,"about_ca_topic_score_gemma":0.0002902942,"teacher_disagreement_score":0.7364406,"about_ca_system_score_codex":0.000024109851,"about_ca_system_score_gemma":0.000109247725,"threshold_uncertainty_score":0.9996993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20429562,0.0014783522,0.7890742,0.0028003866,0.00020363358,0.00074506697,0.0001308534,0.0009120247,0.00035986342],"genre_scores_gemma":[0.740323,0.000043304914,0.25072268,0.0020571023,0.0001587052,0.0005290952,0.000029658757,0.00007656296,0.0060598687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492866,0.00021182567,0.0011611094,0.0010234433,0.0012987568,0.0013761955],"domain_scores_gemma":[0.99466497,0.0022243375,0.00048007752,0.001551891,0.00048624413,0.00059246225],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0033056373,0.00048341966,0.00073362724,0.0010863902,0.0013114419,0.0004029811,0.0013812274,0.00044708315,0.00003379221],"category_scores_gemma":[0.003953398,0.00043193394,0.0005624763,0.0016694831,0.00026312645,0.0006884177,0.00023956926,0.000521798,0.00007255236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034220167,0.00023633303,0.050708704,0.000005490291,0.000058973485,0.000020061783,0.0016504679,0.9155098,0.00048839825,0.012927792,0.01493497,0.003116796],"study_design_scores_gemma":[0.00140663,0.000085226464,0.019199803,0.000052970005,0.000042333682,0.00008202394,0.00038882805,0.9388495,0.0011528017,0.03633905,0.0018628186,0.00053800736],"about_ca_topic_score_codex":0.0013389852,"about_ca_topic_score_gemma":0.00049573655,"teacher_disagreement_score":0.53835154,"about_ca_system_score_codex":0.00027600682,"about_ca_system_score_gemma":0.00066468306,"threshold_uncertainty_score":0.99998873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011490323,0.00013337881,0.99641335,0.0006245475,0.000027633565,0.0010625662,0.00005053036,0.00008777824,0.00045119433],"genre_scores_gemma":[0.067287825,0.000007991494,0.9318103,0.000108857064,0.00013484931,0.00034970458,0.000058291556,0.000009039252,0.0002331189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845004,0.00005335569,0.00055185915,0.0004034831,0.00033023546,0.00021104727],"domain_scores_gemma":[0.9981363,0.00039083132,0.00029162364,0.00036333318,0.00074762356,0.00007030075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012293002,0.0001165491,0.00021256974,0.00029255112,0.00026819448,0.00011523148,0.0004530473,0.00007442979,0.000015714653],"category_scores_gemma":[0.000012217744,0.00010813173,0.00013118927,0.0011480204,0.00005572844,0.00019155396,0.000027753726,0.000070281196,0.000022409931],"study_design_candidate":"design_other","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.000002651879,0.0002925482,0.000057026078,0.0000039814195,0.000016787379,7.326022e-8,0.00026367375,0.053581435,0.0013518841,0.0049766786,0.0011247835,0.9383285],"study_design_scores_gemma":[0.0015028773,0.00024866877,0.008147091,0.00004251416,0.00013028919,0.000014818639,0.00022151344,0.8390645,0.0052964124,0.06437205,0.08050834,0.0004509403],"about_ca_topic_score_codex":0.0000046020814,"about_ca_topic_score_gemma":0.0000016186071,"teacher_disagreement_score":0.93787754,"about_ca_system_score_codex":0.00002557593,"about_ca_system_score_gemma":0.000059378926,"threshold_uncertainty_score":0.44094843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008596136,0.00015777454,0.99423385,0.0027001186,0.000058167683,0.000953422,0.000025059802,0.00017969623,0.0008322861],"genre_scores_gemma":[0.011548811,0.000004166748,0.98567504,0.00028090595,0.0004458103,0.0005972308,0.000017701681,0.000016389475,0.0014139327],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983095,0.000016418726,0.00046584816,0.0005602511,0.00031450574,0.00033349867],"domain_scores_gemma":[0.99855113,0.00035537628,0.00013513019,0.00047841633,0.00029595732,0.00018399298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890597,0.00013495592,0.00019208956,0.00026292127,0.00048381538,0.0003087776,0.0007701759,0.00007107069,0.00002589584],"category_scores_gemma":[0.000011149328,0.00011801654,0.00018244967,0.0011486758,0.000045619636,0.0001554188,0.00009689254,0.00010640722,0.00056069944],"study_design_candidate":"design_other","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.000009665069,0.00024382918,0.00024333816,0.0000087298495,0.000065313245,6.929391e-7,0.0007058613,0.022020387,0.004602368,0.15530111,0.02309288,0.7937058],"study_design_scores_gemma":[0.0006490158,0.00002791921,0.00033195657,0.000008137011,0.000018155042,0.000016990889,0.00003768996,0.00053009484,0.002394221,0.38118896,0.6146392,0.00015761281],"about_ca_topic_score_codex":0.0000684319,"about_ca_topic_score_gemma":0.000015799435,"teacher_disagreement_score":0.7935482,"about_ca_system_score_codex":0.000051265954,"about_ca_system_score_gemma":0.00020723556,"threshold_uncertainty_score":0.7206844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026135135,0.000105581035,0.96361977,0.00049768144,0.00006891057,0.0004925908,0.000049629733,0.00013726894,0.008893444],"genre_scores_gemma":[0.68737817,0.0000010842542,0.3112945,0.00008911105,0.00020113809,0.00015734347,0.000010808335,0.000016582131,0.0008512598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963433,0.00050948956,0.0006892529,0.0007702082,0.0012637703,0.00042394],"domain_scores_gemma":[0.99479353,0.0030302824,0.00022582116,0.001203949,0.0005930815,0.00015333237],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004148819,0.00016784675,0.00031123092,0.0008076338,0.001736594,0.00017211188,0.0011599123,0.00011727912,0.00003502443],"category_scores_gemma":[0.00005388519,0.00013755525,0.00017092274,0.0015787416,0.00028673452,0.00009499618,0.00008660672,0.00065486104,0.0009796214],"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.00008277423,0.0027857667,0.006249762,0.00010757914,0.00012654066,0.000039756647,0.0026469661,0.07056519,0.009353993,0.1604026,0.08482993,0.66280913],"study_design_scores_gemma":[0.0012064526,0.00025207974,0.028392788,0.0004496008,0.000028925111,0.000057977344,0.000811375,0.31738445,0.007886165,0.0037427568,0.63915455,0.000632868],"about_ca_topic_score_codex":0.000025411364,"about_ca_topic_score_gemma":0.0000023509879,"teacher_disagreement_score":0.6621763,"about_ca_system_score_codex":0.0001294397,"about_ca_system_score_gemma":0.00022394606,"threshold_uncertainty_score":0.99979824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7873464,0.000010790375,0.20851266,0.000103699495,0.00009405754,0.000030548938,0.00008974578,0.000010180832,0.0038018639],"genre_scores_gemma":[0.99098223,0.0000057655284,0.0075785085,0.000019023906,0.0000335895,1.9679058e-9,0.0000059726776,0.0000046546593,0.0013702607],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968474,0.00086986925,0.0005435465,0.00030588565,0.0010901227,0.0003431639],"domain_scores_gemma":[0.99564344,0.0021452964,0.0006448645,0.00035754842,0.00081989996,0.00038895925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007990895,0.0001363684,0.00059639773,0.0033135635,0.00026717468,0.000028516073,0.00094539544,0.00014167828,0.00029075227],"category_scores_gemma":[0.0004628508,0.00013599325,0.0003129865,0.0031263456,0.00032655126,0.00084414496,0.0001346817,0.0005608713,0.000010992324],"study_design_candidate":"observational","study_design_consensus":"observational","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.008423338,0.0040508513,0.4506417,0.00002083496,0.0039215693,0.010256999,0.044564307,0.13514584,0.0005845486,0.2877021,0.004916984,0.049770918],"study_design_scores_gemma":[0.0021866737,0.0006263519,0.58003116,0.00002562642,0.0012044371,0.000051674455,0.38629347,0.0072279023,0.000045169167,0.0017487165,0.020266399,0.0002924129],"about_ca_topic_score_codex":0.0073470715,"about_ca_topic_score_gemma":0.005454191,"teacher_disagreement_score":0.34172916,"about_ca_system_score_codex":0.00055245846,"about_ca_system_score_gemma":0.0006691714,"threshold_uncertainty_score":0.9992631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6493373,0.0000338276,0.32940242,0.012893344,0.0052056145,0.00048190163,0.000058839134,0.00016552763,0.0024212173],"genre_scores_gemma":[0.9190699,3.023096e-7,0.07110951,0.00055548415,0.00059352804,0.0002224195,0.00002709387,0.00002035864,0.008401396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773806,0.000057465404,0.0006226153,0.00056844467,0.00059448986,0.00041891768],"domain_scores_gemma":[0.99680114,0.0007136617,0.00023935831,0.0008161367,0.0011914714,0.0002382285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013813457,0.00017379095,0.00023298191,0.0003418442,0.000373048,0.0004318034,0.0005901326,0.00013755797,0.00025464455],"category_scores_gemma":[0.0013430577,0.00014767674,0.00019396014,0.00041117222,0.0000844644,0.00049354706,0.000007654677,0.0002665827,0.0009023504],"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.000067932146,0.0010901357,0.0008204945,0.000017379862,0.000053433952,3.369483e-7,0.07551456,0.0006443389,0.00478138,0.21822645,0.21806552,0.48071805],"study_design_scores_gemma":[0.0007714006,0.0003814231,0.0010464676,0.00002587377,0.000051209474,0.000014590939,0.037078675,0.50501364,0.00010284566,0.4138906,0.041134145,0.00048912567],"about_ca_topic_score_codex":0.000044086628,"about_ca_topic_score_gemma":0.00031211652,"teacher_disagreement_score":0.5043693,"about_ca_system_score_codex":0.000019759045,"about_ca_system_score_gemma":0.0008426457,"threshold_uncertainty_score":0.99987555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039911587,0.00024576808,0.9938282,0.0006832264,0.000019720708,0.00082415034,0.000016551276,0.000045242272,0.0003460341],"genre_scores_gemma":[0.35529223,0.000027943806,0.6437937,0.000056087003,0.000053988948,0.0005454174,0.000008874816,0.00000963897,0.00021209253],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784577,0.000102217746,0.0008496084,0.0004552633,0.00046157136,0.00028555485],"domain_scores_gemma":[0.9978718,0.0008221519,0.00030495052,0.0006371354,0.00029122303,0.00007271839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015702979,0.00012703062,0.00020660993,0.00020028518,0.0005242396,0.00007866309,0.00084455276,0.0000686304,0.000008573415],"category_scores_gemma":[0.000014964436,0.000091145324,0.000110884044,0.0011299668,0.00029321478,0.00009951608,0.0001225368,0.00018454612,0.00019557645],"study_design_candidate":"design_other","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.0000023573969,0.00035350435,0.0047926945,0.0000027443386,0.000017892206,6.899069e-7,0.0005131818,0.0034773587,0.0037061155,0.0058455267,0.0004691948,0.98081875],"study_design_scores_gemma":[0.0015322819,0.000045775312,0.06379322,0.00003389421,0.000025820882,0.00012080629,0.0006625055,0.26205665,0.0072277063,0.025221273,0.6387603,0.0005197622],"about_ca_topic_score_codex":0.00007173248,"about_ca_topic_score_gemma":0.00004438194,"teacher_disagreement_score":0.980299,"about_ca_system_score_codex":0.00006091193,"about_ca_system_score_gemma":0.00012069307,"threshold_uncertainty_score":0.40320802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10894018,0.0014579168,0.54984033,0.042012397,0.0058859647,0.0024363222,0.0002866568,0.00033642666,0.2888038],"genre_scores_gemma":[0.96083593,0.0000065574027,0.024858307,0.00014362489,0.00020817455,0.000044025157,0.0000100874395,0.000017609707,0.013875651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99602395,0.0007730832,0.00084225996,0.0004249871,0.001527776,0.00040796952],"domain_scores_gemma":[0.9953688,0.0024737194,0.0004927484,0.0012175667,0.00037853917,0.00006863056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006314729,0.0001715003,0.00027334873,0.00011987704,0.001081504,0.00039879774,0.0013174171,0.00009940932,0.00013725323],"category_scores_gemma":[0.0010946871,0.00008559738,0.00028108916,0.0012095285,0.000289032,0.00017245312,0.00021149601,0.00027814505,0.00019226338],"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.00008325453,0.00057189143,0.021471478,0.000014772375,0.00013849136,0.0000050593185,0.0007504734,0.032372046,0.010175208,0.8556908,0.04651659,0.032209955],"study_design_scores_gemma":[0.0011602301,0.00010966268,0.08348913,0.000092374365,0.00014913667,0.000040542476,0.0010183228,0.017929658,0.016017755,0.33400738,0.54551846,0.00046733598],"about_ca_topic_score_codex":0.00065797626,"about_ca_topic_score_gemma":0.0006553493,"teacher_disagreement_score":0.8518958,"about_ca_system_score_codex":0.00005956186,"about_ca_system_score_gemma":0.00014483892,"threshold_uncertainty_score":0.83181643},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99289495,0.0019390888,0.00087584445,0.00035373328,0.00023337555,0.00020651212,0.000011875589,0.000021410011,0.0034632338],"genre_scores_gemma":[0.94469213,0.00011457234,0.05431184,0.000030475296,0.000017234126,0.000026088039,2.1896778e-7,0.0000070339443,0.0008004289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982958,0.00006544838,0.00070246815,0.00020832063,0.0005233256,0.0002046458],"domain_scores_gemma":[0.9933813,0.005655233,0.00021726833,0.00035807773,0.00034475705,0.000043363663],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0022769596,0.00010662299,0.0004738458,0.00036430452,0.0001377188,0.000041443967,0.00027051548,0.000044104745,0.00009592988],"category_scores_gemma":[0.011360172,0.00007582964,0.00004738824,0.001088325,0.00036813912,0.0001224637,0.0002767986,0.00009452952,0.00006488038],"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.000014919757,0.0010533093,0.08834979,0.0006263002,0.00061980996,0.000019883233,0.061089225,0.00042775337,0.00069273496,0.79322755,0.04364604,0.010232661],"study_design_scores_gemma":[0.0005565959,0.00006916606,0.007316463,0.00020866022,0.000027858247,0.000014586952,0.0918999,0.0072096894,0.00024294798,0.8918794,0.00038932185,0.00018543942],"about_ca_topic_score_codex":0.000020505293,"about_ca_topic_score_gemma":0.000021084436,"teacher_disagreement_score":0.0986518,"about_ca_system_score_codex":0.000017474484,"about_ca_system_score_gemma":0.00002576812,"threshold_uncertainty_score":0.99696755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907805,0.000059174192,0.835831,0.0010345236,0.00085896463,0.0018409984,0.00043533416,0.0003461086,0.0005158513],"genre_scores_gemma":[0.71848524,0.0000029215157,0.2799593,0.00076948514,0.00015256034,0.00020596705,0.00017341928,0.000039715425,0.00021142699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945021,0.00009852086,0.0019436579,0.0006649941,0.0013531699,0.0014375022],"domain_scores_gemma":[0.9950434,0.0012200506,0.00093378534,0.0012444895,0.0011110029,0.00044729462],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046173306,0.000597994,0.0008811416,0.0007885497,0.0011002581,0.0014680765,0.0014604861,0.0004092014,0.000027782668],"category_scores_gemma":[0.0030749822,0.0004889956,0.0008795797,0.0010321795,0.00021091782,0.0024162175,0.0001475845,0.00064964785,0.0001369336],"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.002878674,0.0077477535,0.01222299,0.00079085404,0.0007975397,0.0000132719215,0.022484683,0.2936362,0.0005890147,0.07439606,0.004159884,0.5802831],"study_design_scores_gemma":[0.0039221346,0.00038555442,0.0008884577,0.0001305745,0.00007733374,0.000008195722,0.0008931029,0.967423,0.00078162464,0.014411982,0.010443842,0.00063417637],"about_ca_topic_score_codex":0.000032264412,"about_ca_topic_score_gemma":0.00003983734,"teacher_disagreement_score":0.6737868,"about_ca_system_score_codex":0.00017718364,"about_ca_system_score_gemma":0.0002914026,"threshold_uncertainty_score":0.99975616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8621327,0.003957971,0.082200386,0.004264209,0.0017701322,0.0040772404,0.0003199003,0.00015123517,0.041126218],"genre_scores_gemma":[0.9958736,0.00007262361,0.0013711285,0.00014170897,0.00008739254,0.00021642912,0.00004162802,0.0000071848253,0.0021883338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694246,0.00019449356,0.0009022404,0.00022762046,0.0013268222,0.0004063352],"domain_scores_gemma":[0.99559045,0.002022201,0.00013583897,0.00027042223,0.0018044157,0.00017667029],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011880897,0.00012975084,0.00022413649,0.00063829246,0.0010515408,0.0023264084,0.00022607365,0.00012679993,0.000030163455],"category_scores_gemma":[0.008901316,0.00009966025,0.000049615108,0.00041915575,0.00010824006,0.0022926396,0.000100721816,0.00025319075,0.00010536538],"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.0002897292,0.000084352614,0.01175211,0.00042913822,0.0001675578,0.000002958042,0.03094153,0.019241503,0.001227231,0.86929536,0.018917011,0.04765155],"study_design_scores_gemma":[0.0014685447,0.00016697616,0.004748019,0.00012275453,0.0000072655375,0.00008575618,0.010294846,0.116533324,0.00038107613,0.0015790677,0.8643288,0.00028358397],"about_ca_topic_score_codex":0.00018422211,"about_ca_topic_score_gemma":0.000027358652,"teacher_disagreement_score":0.86771625,"about_ca_system_score_codex":0.000049487477,"about_ca_system_score_gemma":0.0002902188,"threshold_uncertainty_score":0.9994471},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95624614,0.0011688003,0.031433478,0.0023239183,0.0018621571,0.0007801195,0.00001976238,0.00025843206,0.005907172],"genre_scores_gemma":[0.9716679,0.00013801467,0.023965333,0.00019942252,0.0008376075,0.00006287998,0.0000024200633,0.000030948013,0.0030954992],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937581,0.00072081323,0.00056919776,0.00066078163,0.0030565257,0.0012346001],"domain_scores_gemma":[0.9951009,0.0016742646,0.00013460068,0.0010428376,0.0017873334,0.00026005576],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.02195689,0.00019934462,0.0002900826,0.00018292648,0.003123558,0.0007505939,0.0019238816,0.00014647814,0.0003452012],"category_scores_gemma":[0.0030377102,0.00011538078,0.00047651163,0.0034542223,0.001033291,0.0007287816,0.0006948358,0.0013241862,0.0004023314],"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.0003059941,0.001212089,0.077920154,0.0001543667,0.001940638,0.000080778045,0.39203888,0.023031855,0.06247867,0.056154266,0.3480347,0.03664761],"study_design_scores_gemma":[0.0015861205,0.00033925934,0.019169152,0.0002235407,0.00011959614,0.000106366686,0.061200198,0.678165,0.009417321,0.20180415,0.026734397,0.0011348837],"about_ca_topic_score_codex":0.001298926,"about_ca_topic_score_gemma":0.000029110695,"teacher_disagreement_score":0.6551332,"about_ca_system_score_codex":0.00016117831,"about_ca_system_score_gemma":0.00031700154,"threshold_uncertainty_score":0.99817425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84573907,0.0013620009,0.11049713,0.010814251,0.0018253789,0.0009233814,0.00007127826,0.0001436424,0.02862388],"genre_scores_gemma":[0.97431886,0.000073079435,0.018847562,0.00016264681,0.00029336187,0.00007807041,0.0000073586034,0.000016755841,0.0062023127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99571943,0.0008692051,0.0011366681,0.00048059644,0.0013034265,0.00049064786],"domain_scores_gemma":[0.9941364,0.00408748,0.00036081273,0.00083786866,0.0004164007,0.00016103749],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.009989577,0.00014087617,0.00035594343,0.000118267926,0.0005601488,0.00018095704,0.0008665544,0.00013648313,0.0003583668],"category_scores_gemma":[0.026011247,0.00008865171,0.00022791895,0.0006723726,0.00046232835,0.00026029718,0.00026477585,0.0005091487,0.00023468175],"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.000054264874,0.0013205619,0.31161416,0.000013812932,0.0002253605,0.0000120864015,0.0020602683,0.3509003,0.000003198406,0.023642002,0.047393486,0.2627605],"study_design_scores_gemma":[0.001753009,0.0001374787,0.46622196,0.000024518946,0.0001538983,0.000014402903,0.0010669378,0.45872504,0.00018611921,0.004986471,0.06617043,0.00055973546],"about_ca_topic_score_codex":0.00012429043,"about_ca_topic_score_gemma":0.000027394273,"teacher_disagreement_score":0.26220077,"about_ca_system_score_codex":0.000030178804,"about_ca_system_score_gemma":0.000034352735,"threshold_uncertainty_score":0.98219305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061414007,0.000041305375,0.9350226,0.0005593383,0.00014043605,0.00067417906,0.00003376076,0.00017811233,0.0019362883],"genre_scores_gemma":[0.561452,0.0000062172517,0.43747234,0.00004730522,0.00009022215,0.00039272863,0.0000026808166,0.00002688481,0.00050962274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975175,0.00001811151,0.00077387184,0.00056268123,0.0006741271,0.0004537095],"domain_scores_gemma":[0.9961846,0.0021539626,0.00036480807,0.0008963744,0.0002495274,0.00015074668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024623838,0.0002101998,0.0003713353,0.0002605821,0.000363409,0.00017143798,0.00069452345,0.000119097385,0.000037134283],"category_scores_gemma":[0.002208347,0.0001270118,0.00021078705,0.00061586994,0.0001221357,0.00016166693,0.00010954395,0.00008926365,0.00056627364],"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.000043935626,0.00021393674,0.0004980716,0.000063368556,0.00008672447,4.9658706e-7,0.0012313311,0.0009940466,0.11593556,0.84042436,0.00042999507,0.04007818],"study_design_scores_gemma":[0.0024839484,0.00004821503,0.0007529712,0.00011033155,0.00013088887,0.000006559266,0.0018859747,0.07674291,0.015223366,0.89640665,0.005532903,0.0006752678],"about_ca_topic_score_codex":0.0000030211418,"about_ca_topic_score_gemma":0.000008540007,"teacher_disagreement_score":0.50003797,"about_ca_system_score_codex":0.000040790892,"about_ca_system_score_gemma":0.00005186037,"threshold_uncertainty_score":0.72784907},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041079154,0.0009325843,0.75576586,0.0013036195,0.026689867,0.005717229,0.0026171657,0.0007397472,0.20582315],"genre_scores_gemma":[0.0011687967,0.00033970727,0.44814143,0.0005327658,0.0028046994,0.0020001652,0.0011408604,0.00049416156,0.54337746],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98871005,0.00009031255,0.0024100642,0.0023376138,0.004180655,0.0022713032],"domain_scores_gemma":[0.9910916,0.001956219,0.0011523992,0.0036056128,0.0011906365,0.0010035223],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0053371363,0.0013142818,0.0025112128,0.001508222,0.0015370888,0.0010770926,0.003606358,0.0013378704,0.00041625416],"category_scores_gemma":[0.0027879986,0.0010895903,0.0008875322,0.0035753527,0.0004634278,0.00021938716,0.00092688703,0.0018080358,0.0032321014],"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.000074190284,0.00015473357,0.000003848651,0.000275925,0.00020979831,0.000009766768,0.001677743,0.0009395234,0.00023618276,0.17774709,0.81839955,0.00027165076],"study_design_scores_gemma":[0.00092560635,0.00020219268,0.000012004468,0.0003640534,0.00039608835,0.000050011902,0.0031790277,0.016785877,0.0005766098,0.08820568,0.8876293,0.001673567],"about_ca_topic_score_codex":0.000093353,"about_ca_topic_score_gemma":0.000038976694,"teacher_disagreement_score":0.33755428,"about_ca_system_score_codex":0.0002587116,"about_ca_system_score_gemma":0.0013137987,"threshold_uncertainty_score":0.99996084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015240618,0.0013754023,0.9805965,0.0023990634,0.0024477583,0.0002742117,0.000016582992,0.00013623819,0.012601837],"genre_scores_gemma":[0.5721406,0.000038624545,0.4200548,0.00087386934,0.0012434452,0.000011533043,0.000004433633,0.00006569586,0.00556703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939837,0.00006678906,0.0009032957,0.0017268732,0.0023492866,0.0009700887],"domain_scores_gemma":[0.9951987,0.002320096,0.00047574792,0.0011840133,0.00053438434,0.00028700274],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004403902,0.00046678245,0.00064123323,0.001018924,0.00055367907,0.0011845947,0.0022034603,0.00036594307,0.00020139907],"category_scores_gemma":[0.0017423625,0.00032917058,0.0002126745,0.00092664897,0.0022877106,0.00037982277,0.00032487154,0.0007919709,0.00029613235],"study_design_candidate":"design_other","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.000003926333,0.000018429284,0.00007575784,0.000002353315,0.0000064658548,0.00001476449,0.00032171622,0.0015357485,0.00021241959,0.0033279685,0.00013917152,0.99434125],"study_design_scores_gemma":[0.0006403807,0.00017630668,0.0000858484,0.0047508813,0.00003890942,0.00019551111,0.000005320365,0.07981122,0.0013256699,0.88980556,0.021645764,0.0015186464],"about_ca_topic_score_codex":0.0000068478994,"about_ca_topic_score_gemma":0.000018975821,"teacher_disagreement_score":0.99282265,"about_ca_system_score_codex":0.00039643853,"about_ca_system_score_gemma":0.00072328775,"threshold_uncertainty_score":0.999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01220423,0.00004645655,0.9621993,0.02363894,0.0002444868,0.00030002758,0.000997519,0.000019197723,0.0003498792],"genre_scores_gemma":[0.9587317,0.000053182583,0.038449656,0.000113808725,0.000038272738,0.000088467175,0.0007612575,0.000016505965,0.0017471294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99388635,0.0008473979,0.0012046816,0.0007687581,0.0029448553,0.00034797235],"domain_scores_gemma":[0.992581,0.004622026,0.00013543454,0.000722324,0.001839986,0.000099228164],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010930033,0.00014050367,0.00024445567,0.0016011858,0.00015448028,0.0001514425,0.0014592685,0.00014094968,0.0043469914],"category_scores_gemma":[0.0059024217,0.00010851354,0.00007993538,0.0019059819,0.0002110117,0.001050217,0.00006053194,0.00034822605,0.000076641445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029145458,0.0011680666,0.00685856,0.0000052429486,0.000057012872,0.000004464081,0.00017259906,0.9615055,0.010393105,0.0006749824,0.0027805553,0.016088478],"study_design_scores_gemma":[0.0013414024,0.00005116451,0.003444403,0.00005657625,0.000005474061,0.0000053573376,0.00022053652,0.9863543,0.0017957704,0.0015890952,0.005015293,0.000120608616],"about_ca_topic_score_codex":0.00045078358,"about_ca_topic_score_gemma":0.0011970676,"teacher_disagreement_score":0.9465275,"about_ca_system_score_codex":0.00047124145,"about_ca_system_score_gemma":0.0010276134,"threshold_uncertainty_score":0.9965632},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50307727,0.00010224671,0.48734787,0.0053811567,0.000096946445,0.0006070536,0.000024833429,0.00006512397,0.0032974947],"genre_scores_gemma":[0.9359637,0.0000062880636,0.06204889,0.000088858185,0.000103799364,0.00015097138,0.000013321529,0.000014647686,0.0016095405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945573,0.0012829785,0.00065840245,0.0006329925,0.002296481,0.00057180255],"domain_scores_gemma":[0.9920013,0.0011257426,0.000051280556,0.0009871033,0.00551904,0.00031552924],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.021116633,0.00012201692,0.00024027846,0.0017930907,0.0006395049,0.0005795826,0.0010128841,0.00009013369,0.00023621783],"category_scores_gemma":[0.016039463,0.00007422035,0.00010540348,0.0038454959,0.00022821476,0.00084506086,0.00010468766,0.00020591465,0.0005595528],"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.000045741155,0.0030831317,0.003664922,0.0000135141445,0.000054354867,0.000002441661,0.0016795391,0.079700805,0.040205967,0.048721593,0.0060509653,0.81677705],"study_design_scores_gemma":[0.0014946732,0.0018446307,0.029973717,0.00031601038,0.000028921058,0.000013275826,0.006496466,0.80578005,0.09988887,0.0048056613,0.04836996,0.0009877894],"about_ca_topic_score_codex":0.00024163551,"about_ca_topic_score_gemma":0.000059898393,"teacher_disagreement_score":0.8157892,"about_ca_system_score_codex":0.000029133296,"about_ca_system_score_gemma":0.00033346566,"threshold_uncertainty_score":0.99224883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.473916,0.001709068,0.5196256,0.0036406384,0.00079144724,0.00021409972,0.000012679924,0.000021608706,0.00006886231],"genre_scores_gemma":[0.92369974,0.00002063933,0.0746345,0.0003346107,0.0011732903,0.000007813597,0.0000019376878,0.00001935921,0.00010809007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968243,0.00017614376,0.0012118219,0.000265957,0.0011445633,0.00037717615],"domain_scores_gemma":[0.99273634,0.0031417215,0.0012290293,0.00035229858,0.0023730919,0.00016751006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010821166,0.0001875557,0.00040849674,0.00027938792,0.0008221906,0.0006350215,0.0005653633,0.00010110379,0.00007240088],"category_scores_gemma":[0.0030547145,0.00011081122,0.00025888172,0.0005970697,0.00019849409,0.000678789,0.000057999754,0.00031230552,0.000023894227],"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.0007576361,0.0016753904,0.2912318,0.00017949002,0.001431771,0.000028231401,0.010425704,0.20264925,0.005878251,0.015774164,0.009299406,0.4606689],"study_design_scores_gemma":[0.003177694,0.00074081443,0.01651383,0.00038957785,0.0007520184,0.00014970677,0.0069934977,0.9379912,0.0018640152,0.023747372,0.0072363624,0.00044393298],"about_ca_topic_score_codex":0.00003546619,"about_ca_topic_score_gemma":0.000021933194,"teacher_disagreement_score":0.7353419,"about_ca_system_score_codex":0.000031675227,"about_ca_system_score_gemma":0.00035045217,"threshold_uncertainty_score":0.6323709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07067696,0.00069022784,0.9118166,0.012312028,0.004036172,0.00014496209,0.000073290415,0.000024250552,0.00022552986],"genre_scores_gemma":[0.9391239,0.00008846346,0.058886703,0.00022016051,0.00091971236,0.0000022123284,0.0000014015344,0.000015837013,0.000741609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635875,0.00016377961,0.0012877387,0.0002014316,0.0017463589,0.00024191313],"domain_scores_gemma":[0.98052084,0.012165661,0.001110337,0.00028173503,0.005803005,0.0001184143],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0071593598,0.00013519911,0.00028232284,0.0003979785,0.00019999457,0.00032328733,0.0015638631,0.000069724454,0.00014314553],"category_scores_gemma":[0.033492252,0.00006158485,0.00032974465,0.00037470835,0.00013852531,0.0003051463,0.00007531747,0.00019495098,0.00006099596],"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.0015753931,0.000517161,0.010604353,0.000011154712,0.004266797,0.00013320147,0.0013584386,0.58192265,0.020861045,0.06311371,0.026609292,0.2890268],"study_design_scores_gemma":[0.0074041546,0.00050527364,0.0040937685,0.00050602015,0.00079659384,0.0005438767,0.0012435035,0.27745432,0.0077398084,0.4290588,0.26999417,0.0006597042],"about_ca_topic_score_codex":0.0000061787237,"about_ca_topic_score_gemma":0.0000023052546,"teacher_disagreement_score":0.86844695,"about_ca_system_score_codex":0.00007310171,"about_ca_system_score_gemma":0.00019856782,"threshold_uncertainty_score":0.9746491},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13824245,0.00004047299,0.8465894,0.0023710853,0.0005264267,0.00009911553,0.000011703864,0.00013837127,0.011981005],"genre_scores_gemma":[0.9835127,9.3428105e-7,0.008639976,0.0001838373,0.000092529874,0.000013545353,3.516532e-7,0.0000053754584,0.0075507206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978872,0.00012092751,0.00039520953,0.0005038315,0.00075833546,0.00033449355],"domain_scores_gemma":[0.99743134,0.0012430673,0.00005638028,0.00067718374,0.00034940435,0.00024265243],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031351575,0.00009647776,0.00016119255,0.00032654038,0.00022112137,0.000087764995,0.0004580631,0.00006483735,0.0014360365],"category_scores_gemma":[0.0052861124,0.000050478146,0.00012897611,0.0012368241,0.00012707793,0.00026378312,0.00011735744,0.00005858081,0.0062422315],"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.00010551582,0.0002601133,0.05681754,0.0000025192421,0.00004244548,0.0000037276773,0.00031000076,0.0014923946,0.014704536,0.35267103,0.10532636,0.46826383],"study_design_scores_gemma":[0.0012902158,0.0002948179,0.21731366,0.00008822636,0.000038981198,0.000020804508,0.0015730188,0.005743591,0.009943513,0.6512981,0.11155213,0.0008429127],"about_ca_topic_score_codex":0.000109795496,"about_ca_topic_score_gemma":0.00011215811,"teacher_disagreement_score":0.8452703,"about_ca_system_score_codex":0.00009815239,"about_ca_system_score_gemma":0.00008040694,"threshold_uncertainty_score":0.9994768},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43561915,0.007175809,0.044654954,0.061269037,0.03152593,0.00876465,0.0018598519,0.000032029006,0.4090986],"genre_scores_gemma":[0.31086853,0.00039355436,0.13169292,0.00019470675,0.0007742958,0.0005019495,0.0008161357,0.0001005477,0.55465734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914556,0.0005796816,0.0022918314,0.00197644,0.0025118566,0.0011845574],"domain_scores_gemma":[0.9942785,0.0011107983,0.0013714506,0.001566293,0.001095471,0.0005774966],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006602633,0.00078033365,0.001118653,0.0005232057,0.0014788602,0.0022699304,0.0037160919,0.00053179445,0.100791104],"category_scores_gemma":[0.0015256046,0.0005942926,0.00044541073,0.00093711336,0.00014731378,0.0005920659,0.00076616684,0.00043379917,0.061089326],"study_design_candidate":"design_other","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.00016848108,0.00084050855,0.0015643158,0.000026869384,0.0006428467,0.000047498248,0.005110287,0.0001450475,0.0017715791,0.002786211,0.007421709,0.97947466],"study_design_scores_gemma":[0.004109743,0.00039544492,0.0052833064,0.0028758505,0.0009841608,0.000027316657,0.012799207,0.0020205316,0.063362285,0.016630774,0.8894481,0.002063245],"about_ca_topic_score_codex":0.00049022754,"about_ca_topic_score_gemma":0.0004461314,"teacher_disagreement_score":0.9774114,"about_ca_system_score_codex":0.0008358371,"about_ca_system_score_gemma":0.002675753,"threshold_uncertainty_score":0.99982107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027573738,0.00064843526,0.90235543,0.06394708,0.0016368678,0.001892166,0.00015304449,0.000095576506,0.001697665],"genre_scores_gemma":[0.7045999,0.000102538805,0.2790226,0.0002873483,0.0009357455,0.00045067558,0.000045643865,0.00003164206,0.014523872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965742,0.00032018352,0.00045574462,0.0005895284,0.0014229108,0.00063740794],"domain_scores_gemma":[0.9918041,0.0035192096,0.00006399083,0.00209228,0.0023534473,0.00016697794],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009985016,0.00012773044,0.0002162465,0.00042734697,0.009532701,0.0045578983,0.0032799044,0.00008434274,0.00009587462],"category_scores_gemma":[0.0053482074,0.00007849387,0.00017235584,0.00078674534,0.00067238347,0.00053619954,0.0005790771,0.00045698578,0.0003308162],"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.00006163321,0.0010101203,0.0018144175,0.000013108821,0.00023131123,0.000011162351,0.0016778273,0.22725229,0.00048956677,0.06021303,0.20576528,0.50146025],"study_design_scores_gemma":[0.0005362971,0.00013320227,0.0044541513,0.000019764406,0.000012283034,0.0000071073614,0.00053138804,0.86037093,0.00015323017,0.023358213,0.11028502,0.00013843963],"about_ca_topic_score_codex":0.00072782073,"about_ca_topic_score_gemma":0.001028682,"teacher_disagreement_score":0.6770262,"about_ca_system_score_codex":0.000050028153,"about_ca_system_score_gemma":0.00041557377,"threshold_uncertainty_score":0.99647546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9629328,0.00024206,0.000812109,0.026634509,0.0032965827,0.0004788256,0.000024237246,0.00007375492,0.0055050766],"genre_scores_gemma":[0.98782796,0.0000056129074,0.009617204,0.00013560167,0.00017249952,0.000022886934,0.0000010587199,0.000014922958,0.0022022373],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99841297,0.00001406498,0.0003679039,0.0002681114,0.0006331814,0.00030379227],"domain_scores_gemma":[0.99585897,0.00022181074,0.0008996319,0.0002635184,0.0025365711,0.00021952216],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0031095094,0.00012828496,0.00019317713,0.00032514374,0.0009666842,0.0008448999,0.00078231754,0.00013364226,0.000020878626],"category_scores_gemma":[0.030189948,0.0001078723,0.00005944244,0.0007019958,0.00006038054,0.0005430302,0.000068284055,0.00024901735,0.000020609526],"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.00000259483,0.00009729088,0.89365023,0.0000316325,0.00013294464,1.11869944e-7,0.0015501089,0.00350177,0.0011266965,0.05806959,0.03697656,0.0048604906],"study_design_scores_gemma":[0.00029786502,0.000019327756,0.93676466,0.0001712556,0.00007023356,0.0000057721363,0.0012217865,0.03967484,0.0014108527,0.006189062,0.013823839,0.0003504831],"about_ca_topic_score_codex":0.00555047,"about_ca_topic_score_gemma":0.0016788384,"teacher_disagreement_score":0.05188053,"about_ca_system_score_codex":0.00055977167,"about_ca_system_score_gemma":0.0011293152,"threshold_uncertainty_score":0.9779792},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03534413,0.014259794,0.9289347,0.012400858,0.0038882366,0.0013177537,0.00017996553,0.0007112916,0.0029632954],"genre_scores_gemma":[0.16901506,0.00013904404,0.79476506,0.0014405536,0.0010977145,0.00088569976,0.00003854297,0.00013205923,0.03248627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928064,0.0009311846,0.0017111195,0.0014224343,0.0009649208,0.0021639494],"domain_scores_gemma":[0.98900616,0.0072042374,0.00076737977,0.0016980028,0.00077930366,0.00054489454],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011999381,0.0006909979,0.0009305646,0.0016233618,0.0016741935,0.0012213053,0.0013931076,0.00077560946,0.00020053718],"category_scores_gemma":[0.0076328036,0.00069738773,0.0009281732,0.0032596092,0.00041779215,0.00067825714,0.00031839788,0.00091261836,0.00019088131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00017773542,0.0007722457,0.005783703,0.00005101259,0.00009993051,0.000022519469,0.0001942357,0.033994567,0.0034023162,0.7253216,0.023974124,0.20620605],"study_design_scores_gemma":[0.0012603003,0.0004515126,0.0065501845,0.00028572849,0.00024595755,0.00009051529,0.00026287002,0.3749766,0.016322669,0.44754273,0.15099744,0.0010134943],"about_ca_topic_score_codex":0.012790478,"about_ca_topic_score_gemma":0.0017710422,"teacher_disagreement_score":0.34098202,"about_ca_system_score_codex":0.00071772153,"about_ca_system_score_gemma":0.00066094165,"threshold_uncertainty_score":0.9998155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6215019,0.000058067668,0.37721518,0.00040156962,0.00033509854,0.00025965855,0.000027307296,0.000049320322,0.00015184825],"genre_scores_gemma":[0.9116194,0.000010839135,0.087927416,0.00012714083,0.000018645736,0.000019582983,0.000019358384,0.000007801208,0.00024979195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969315,0.000036195055,0.00053093425,0.00070229464,0.0014632455,0.00033581382],"domain_scores_gemma":[0.99785495,0.000533067,0.00020096911,0.00033706284,0.0009114992,0.00016244127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039878082,0.00013349038,0.0002123036,0.00036948547,0.00039478004,0.00037724414,0.0004647998,0.000060915245,0.0002459434],"category_scores_gemma":[0.0006804277,0.00010679189,0.00007026202,0.001764732,0.00028232782,0.0010294646,0.00000960759,0.000099061865,0.00008840985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001362411,0.00009930668,0.054110963,0.000017319077,0.000018780505,0.000001477825,0.0028510902,0.90369713,0.011927984,0.014406025,0.00007015198,0.0126635395],"study_design_scores_gemma":[0.0014534973,0.00014614644,0.12718454,0.000052631178,0.000042536372,0.0000018965069,0.001796292,0.8571542,0.002390213,0.00851646,0.0008817773,0.00037982207],"about_ca_topic_score_codex":0.000050031605,"about_ca_topic_score_gemma":0.000041467247,"teacher_disagreement_score":0.29011747,"about_ca_system_score_codex":0.00008132043,"about_ca_system_score_gemma":0.00054530863,"threshold_uncertainty_score":0.4354847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9203332,0.00068230124,0.051871013,0.0024895244,0.0023615463,0.0018104799,0.00039209763,0.000020873218,0.020038942],"genre_scores_gemma":[0.799487,0.00006380177,0.09738764,0.000053051353,0.0005944777,0.000083778374,0.002573499,0.00008755654,0.09966922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934578,0.0009682878,0.0014808712,0.0017170741,0.0015237617,0.00085222174],"domain_scores_gemma":[0.99489677,0.0013873067,0.0013296657,0.00085258856,0.0011756781,0.00035798675],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0032395788,0.0007731816,0.0008911589,0.00058984704,0.0014766376,0.0022093465,0.0018657034,0.0008067433,0.007821164],"category_scores_gemma":[0.0020824005,0.00075364445,0.00047722104,0.0011913602,0.00018523901,0.0011214768,0.00019759842,0.00065468723,0.0046078702],"study_design_candidate":"design_other","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.00062067655,0.0024828694,0.008420439,0.000091480695,0.00053752755,0.00011255936,0.17937325,0.068783246,0.029499993,0.0021711285,0.004412212,0.7034946],"study_design_scores_gemma":[0.0064141173,0.00080087327,0.056621823,0.0032170967,0.0024699222,0.00019916706,0.30841494,0.33219504,0.2589026,0.0071595577,0.018675921,0.004928926],"about_ca_topic_score_codex":0.0066542435,"about_ca_topic_score_gemma":0.0061000464,"teacher_disagreement_score":0.69856566,"about_ca_system_score_codex":0.00046415985,"about_ca_system_score_gemma":0.0013799008,"threshold_uncertainty_score":0.99996054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75615245,0.000569371,0.23669043,0.0013099072,0.0010768255,0.0001263354,0.000009715416,0.00031525,0.0037497175],"genre_scores_gemma":[0.87290186,0.000018648741,0.12090712,0.0002821499,0.00054870546,0.000017950117,0.0000055133005,0.000023796409,0.0052942857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682575,0.0002776203,0.0006699153,0.0006599586,0.0009806275,0.0005861004],"domain_scores_gemma":[0.9978586,0.00063391525,0.00021680287,0.00076857995,0.00024062427,0.00028149787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024988474,0.00023022633,0.00038148928,0.00042380052,0.0009427649,0.00045926834,0.0007802098,0.00023293975,0.0001545162],"category_scores_gemma":[0.002009187,0.00018439493,0.00026873703,0.0012366632,0.00024254405,0.0002733586,0.000074403346,0.00041862833,0.0013880013],"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.00017562087,0.00053231005,0.17489709,0.000038266837,0.0003061196,0.0006420359,0.008952261,0.03342293,0.0023830459,0.7228302,0.0047768666,0.051043276],"study_design_scores_gemma":[0.0055182567,0.00018794979,0.091296874,0.00017829014,0.00023793144,0.0009862686,0.011558622,0.6535919,0.0010126458,0.03138129,0.20187466,0.0021753686],"about_ca_topic_score_codex":0.00023498274,"about_ca_topic_score_gemma":0.000057215937,"teacher_disagreement_score":0.69144887,"about_ca_system_score_codex":0.00016234902,"about_ca_system_score_gemma":0.000097036806,"threshold_uncertainty_score":0.9993895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32045946,0.0017845989,0.5920852,0.045778733,0.00018081206,0.0016837014,0.00002015074,0.00034414453,0.037663195],"genre_scores_gemma":[0.9605695,0.00001872271,0.02823659,0.0008824303,0.000095238625,0.000016639142,0.0000012293641,0.00000836091,0.01017126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857914,0.000044072156,0.00029110874,0.00037370922,0.00042810655,0.0002838411],"domain_scores_gemma":[0.99732333,0.0019774968,0.00009022045,0.00032940612,0.00017693664,0.0001026288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022168423,0.00012318588,0.00019795724,0.000079748264,0.00053059706,0.0003226349,0.00029944195,0.000050978862,0.00008077698],"category_scores_gemma":[0.0005638228,0.000058968362,0.000056148754,0.0004305586,0.00010778998,0.0001698073,0.00002604863,0.000112090616,0.00008786026],"study_design_candidate":"design_other","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.0007281134,0.0004326376,0.008821463,0.000024717403,0.00037902044,0.00000695964,0.007062953,0.01339351,0.007643567,0.18980573,0.023510903,0.7481904],"study_design_scores_gemma":[0.006574472,0.0017300737,0.11991738,0.00016334912,0.0005156281,0.0003495608,0.00200837,0.36404735,0.0032458766,0.39050552,0.109399796,0.0015426058],"about_ca_topic_score_codex":0.000018010562,"about_ca_topic_score_gemma":0.000026042808,"teacher_disagreement_score":0.74664783,"about_ca_system_score_codex":0.000006977489,"about_ca_system_score_gemma":0.00005391125,"threshold_uncertainty_score":0.4080977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098609164,0.0013892429,0.8626083,0.003997883,0.0013034582,0.00045527407,0.0007571747,0.000059295216,0.030820176],"genre_scores_gemma":[0.2514687,0.00035130794,0.5752309,0.0000872653,0.0003177199,0.0000012010256,0.00009629142,0.000040939627,0.17240568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99705225,0.00036503072,0.00030603007,0.0006978688,0.0007677266,0.0008110744],"domain_scores_gemma":[0.99646086,0.0017901771,0.00022771645,0.00066636223,0.0006031522,0.00025173835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018373593,0.00023344674,0.00049077644,0.0007182443,0.0012902443,0.00008401841,0.0011452285,0.00017417048,0.0006134241],"category_scores_gemma":[0.00022934134,0.00029665,0.00042062634,0.0015332772,0.00088177127,0.0004350532,0.0003652792,0.0002833568,0.00023559724],"study_design_candidate":"theoretical_or_conceptual","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.00037037244,0.0005635641,0.0067936294,0.000110678084,0.00029481231,0.00003958272,0.0027923782,0.05253371,0.0075067766,0.8519416,0.0652275,0.011825405],"study_design_scores_gemma":[0.0033251888,0.0005814473,0.014144627,0.00025764474,0.0005063089,0.000017875318,0.01290301,0.24677593,0.0016788208,0.25400075,0.46499875,0.0008096481],"about_ca_topic_score_codex":0.0119160535,"about_ca_topic_score_gemma":0.002425255,"teacher_disagreement_score":0.59794086,"about_ca_system_score_codex":0.000109930246,"about_ca_system_score_gemma":0.0006554084,"threshold_uncertainty_score":0.99994856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61029714,0.00066075614,0.37800074,0.009923071,0.00006887934,0.0003407123,0.00002512526,0.00044381636,0.0002397886],"genre_scores_gemma":[0.79749554,0.00005513394,0.20103592,0.0005601235,0.00022988734,0.00015917767,0.000012104037,0.000037786398,0.00041431407],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964339,0.00019686112,0.000882329,0.0007981841,0.00093036867,0.0007583528],"domain_scores_gemma":[0.9966149,0.0011395467,0.00038152633,0.0011039278,0.0003139422,0.00044617025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021370333,0.00033626123,0.00040047755,0.00084016,0.00089946255,0.0008716968,0.0005748448,0.00028202843,0.00007465161],"category_scores_gemma":[0.001944205,0.00027376303,0.00013249886,0.0022987141,0.00016637768,0.0008329901,0.00017206167,0.0005671831,0.00008789712],"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.00023068587,0.00031835638,0.82370585,0.0000057308876,0.00008484011,0.00001836457,0.00080660236,0.06644812,0.0015245788,0.020922415,0.0016138351,0.084320635],"study_design_scores_gemma":[0.0010668844,0.00015784356,0.70375234,0.00007449706,0.00008257183,0.00016165212,0.0004491027,0.2803641,0.0018507098,0.0072704502,0.004150584,0.0006192377],"about_ca_topic_score_codex":0.004182208,"about_ca_topic_score_gemma":0.0090717515,"teacher_disagreement_score":0.21391599,"about_ca_system_score_codex":0.00022059062,"about_ca_system_score_gemma":0.00026343137,"threshold_uncertainty_score":0.99997145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013796095,0.0022112746,0.9784248,0.0027296483,0.0002750898,0.0010927501,0.000052931995,0.00043274398,0.0009847082],"genre_scores_gemma":[0.4013171,0.00018266006,0.5941227,0.0011031266,0.0001825074,0.0011924857,0.000003858005,0.000050812716,0.0018447441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968483,0.00016397644,0.0007476625,0.00068472716,0.0007093399,0.0008459967],"domain_scores_gemma":[0.99592036,0.0019069738,0.0003391462,0.001104689,0.00042031918,0.00030850118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005227475,0.0002993444,0.0003953925,0.00054244604,0.001033915,0.00046254095,0.0011893082,0.00022073364,0.00007277195],"category_scores_gemma":[0.0014377971,0.00020528215,0.0002874138,0.0014350916,0.00024474203,0.00042774287,0.00027731273,0.00039906986,0.000035177527],"study_design_candidate":"design_other","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.00023598887,0.00064578454,0.04461705,0.000030438729,0.0003781101,0.000023949895,0.0039474354,0.007170283,0.0013354913,0.15905471,0.013235483,0.76932526],"study_design_scores_gemma":[0.0013196467,0.00035083253,0.0888991,0.00006436646,0.00020677478,0.0002096861,0.0010080002,0.70392084,0.0037581697,0.18398128,0.015443282,0.00083801907],"about_ca_topic_score_codex":0.004130335,"about_ca_topic_score_gemma":0.0009694291,"teacher_disagreement_score":0.7684873,"about_ca_system_score_codex":0.000095460324,"about_ca_system_score_gemma":0.00019085727,"threshold_uncertainty_score":0.8371163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03796949,0.00010692832,0.9579964,0.0011972659,0.000108640445,0.0016169432,0.0000021235085,0.00014083911,0.00086132623],"genre_scores_gemma":[0.5531111,1.321097e-7,0.44645113,0.00007646673,0.00003868052,0.00015692574,0.000008814191,0.000012490471,0.00014427905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977126,0.00012007449,0.0006007347,0.00046376005,0.0007703848,0.00033241164],"domain_scores_gemma":[0.99246675,0.006464712,0.0002535549,0.00032379484,0.0003975519,0.00009364764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038517814,0.00015861735,0.00027362644,0.00015473731,0.0004079153,0.0006601935,0.0003272981,0.000079720085,0.00003170396],"category_scores_gemma":[0.0025866255,0.00009954677,0.00014498625,0.00071051467,0.000116183306,0.00017044165,0.000025000463,0.00016574193,0.0001626943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006955005,0.0005027994,0.001846114,0.00028438185,0.00007881199,2.9590296e-7,0.0023533064,0.5921149,0.0001186174,0.08387021,0.00013719015,0.3186238],"study_design_scores_gemma":[0.0005491513,0.00006476489,0.00029810565,0.000035285542,0.000041609313,0.0000042817915,0.0007592711,0.9079281,0.000025882933,0.089779295,0.0003883564,0.00012591404],"about_ca_topic_score_codex":0.000004685643,"about_ca_topic_score_gemma":4.405537e-7,"teacher_disagreement_score":0.5151416,"about_ca_system_score_codex":0.000027580732,"about_ca_system_score_gemma":0.00007676028,"threshold_uncertainty_score":0.6366261},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96871203,0.00041285626,0.02153397,0.0004905667,0.00012646875,0.0008332528,0.0030612822,0.00006409697,0.004765504],"genre_scores_gemma":[0.9465253,0.00007149718,0.0126986345,0.000018290359,0.00006891233,3.7869776e-7,0.00006207698,0.000042493495,0.04051243],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9935557,0.00065071223,0.00056293496,0.0010884878,0.0030932592,0.0010488747],"domain_scores_gemma":[0.99202776,0.002031305,0.00069583,0.0012658571,0.003355231,0.0006240318],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0058163223,0.00036065202,0.0008807116,0.0013518976,0.0020958683,0.000059356647,0.0023698064,0.00034407,0.009007494],"category_scores_gemma":[0.0017869482,0.00040977504,0.0008631471,0.0017540016,0.002263446,0.00036052003,0.0006682969,0.00064442225,0.0032993986],"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.031809516,0.020275168,0.27548277,0.0011293127,0.010371425,0.011097267,0.35913733,0.028366936,0.09162595,0.005518355,0.103555225,0.061630763],"study_design_scores_gemma":[0.014944475,0.001315012,0.014507964,0.00041647514,0.0009376939,0.00020158538,0.87977296,0.053867325,0.00045356946,0.004649569,0.027059207,0.0018741381],"about_ca_topic_score_codex":0.0038990402,"about_ca_topic_score_gemma":0.0011453439,"teacher_disagreement_score":0.52063566,"about_ca_system_score_codex":0.00009657114,"about_ca_system_score_gemma":0.0008818678,"threshold_uncertainty_score":0.99983543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1026244,0.0016017042,0.80509114,0.011150464,0.000664077,0.0012328312,0.00018099634,0.00042280546,0.07703158],"genre_scores_gemma":[0.51959443,0.00015118848,0.45460117,0.000096538046,0.000080398364,0.00025781224,0.00015475479,0.00007161159,0.024992079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886422,0.0059348987,0.0013343458,0.0017575994,0.0014951568,0.0008357644],"domain_scores_gemma":[0.9778554,0.007853328,0.00085905375,0.0041182637,0.008894427,0.00041952493],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.039902538,0.00046716456,0.0007332655,0.00072952296,0.0010144007,0.0015073965,0.0038097105,0.0005379793,0.0004334458],"category_scores_gemma":[0.014150084,0.00043540585,0.00065039704,0.0011313005,0.00041726598,0.000255261,0.0023316562,0.0011503561,0.0004098968],"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.00009676773,0.0015853056,0.011492247,0.00033830586,0.00043405461,0.000007325442,0.033219416,0.0047987634,0.0030580005,0.8001521,0.00705329,0.1377644],"study_design_scores_gemma":[0.0027956062,0.0000034288178,0.008401113,0.004804642,0.000373061,0.000040657225,0.0015507098,0.2620377,0.06909668,0.58489186,0.06337915,0.0026254365],"about_ca_topic_score_codex":0.0015259014,"about_ca_topic_score_gemma":0.0009626339,"teacher_disagreement_score":0.41697004,"about_ca_system_score_codex":0.00012740029,"about_ca_system_score_gemma":0.0011104124,"threshold_uncertainty_score":0.9998098},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93015546,0.0006592627,0.025484793,0.014111929,0.00084281707,0.00084951316,0.000026388425,0.00006204863,0.027807813],"genre_scores_gemma":[0.9936449,0.000036552057,0.000995191,0.000002493002,0.000081570484,0.00005126949,0.000004326735,0.000006295636,0.005177422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9968995,0.00020288493,0.00038021553,0.00026752806,0.001852735,0.00039715657],"domain_scores_gemma":[0.9974053,0.0012753449,0.00010447927,0.0009654773,0.00019347918,0.000055915425],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.019413507,0.00007771912,0.00012423808,0.0002591888,0.0013338334,0.0006782016,0.0013659716,0.000031325606,0.000021881358],"category_scores_gemma":[0.0050997264,0.000054310687,0.00005805274,0.0003790806,0.00015211455,0.00018407808,0.0004399117,0.00036432742,0.000047870886],"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.000092256,0.00033303106,0.032703318,0.000050126288,0.00017046818,0.00003480756,0.0008012148,0.13487676,0.00034434992,0.74339706,0.029257916,0.0579387],"study_design_scores_gemma":[0.00061748934,0.000045492674,0.64744127,0.000117523414,0.0000110952515,8.9944825e-7,0.0013859321,0.10951622,0.00015556079,0.008066054,0.23249897,0.0001434877],"about_ca_topic_score_codex":0.00009322307,"about_ca_topic_score_gemma":0.000041706033,"teacher_disagreement_score":0.735331,"about_ca_system_score_codex":0.000079781435,"about_ca_system_score_gemma":0.000026489673,"threshold_uncertainty_score":0.9999663},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099385574,0.0031705112,0.8926074,0.001851782,0.0004336925,0.0009858327,0.00037155225,0.000575025,0.0006186199],"genre_scores_gemma":[0.7058454,0.000015623415,0.29101047,0.00090988143,0.00027311002,0.00078693795,0.000081934326,0.000048201895,0.0010284049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958428,0.00016660447,0.0009778099,0.0008077742,0.0012782053,0.0009267621],"domain_scores_gemma":[0.996817,0.0006393439,0.0004199273,0.001184866,0.00064987974,0.00028901003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014746679,0.00035364964,0.00047469232,0.00068437797,0.00067177584,0.0006959031,0.000868826,0.0002683421,0.00006407314],"category_scores_gemma":[0.00021262829,0.00029916217,0.00039119172,0.001030477,0.00008638296,0.00036956585,0.00021925961,0.00025170058,0.00008862579],"study_design_candidate":"design_other","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.00011920934,0.00093555095,0.054184478,0.00005738293,0.000116634386,0.00005260773,0.0017483337,0.035184577,0.0028712247,0.025890741,0.019413188,0.8594261],"study_design_scores_gemma":[0.0020606057,0.0007073467,0.05795088,0.00011740785,0.00015535988,0.00009101391,0.0038436728,0.74213356,0.013764718,0.0868389,0.09092927,0.0014072903],"about_ca_topic_score_codex":0.0072514764,"about_ca_topic_score_gemma":0.0021130857,"teacher_disagreement_score":0.85801876,"about_ca_system_score_codex":0.00042417282,"about_ca_system_score_gemma":0.00023262201,"threshold_uncertainty_score":0.99994606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039077494,0.0005411139,0.9876083,0.0015819985,0.004559248,0.0008031736,0.0001430192,0.00011400336,0.00074138417],"genre_scores_gemma":[0.6776449,0.000013300263,0.31715825,0.0007664358,0.00085667125,0.00004826104,0.00002103557,0.00005261333,0.00343856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405944,0.000083687235,0.00091253663,0.0021141632,0.0019526768,0.0008774865],"domain_scores_gemma":[0.99132955,0.0042565074,0.0009959099,0.0021076626,0.0009845672,0.0003258072],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034402881,0.0005979392,0.00087756896,0.0010275178,0.0018837368,0.0012356434,0.0027320567,0.00050359976,0.00016041342],"category_scores_gemma":[0.0063827527,0.000502347,0.00035799632,0.00037910146,0.0016685501,0.00033614214,0.0005687003,0.000792516,0.00013229216],"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.00006444992,0.000037986665,0.0037144404,0.000041908483,0.000042194362,0.000029966339,0.0010211327,0.43444115,0.00032959538,0.0015243861,0.0002437708,0.558509],"study_design_scores_gemma":[0.0016415981,0.00023642738,0.0036292777,0.0009511056,0.00007788519,0.00003702005,0.0000023458422,0.8531281,0.0014790605,0.1267323,0.0107986685,0.001286208],"about_ca_topic_score_codex":0.00021323022,"about_ca_topic_score_gemma":0.0031843125,"teacher_disagreement_score":0.6737371,"about_ca_system_score_codex":0.0005978983,"about_ca_system_score_gemma":0.0018943397,"threshold_uncertainty_score":0.99980116},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706724,0.00016121325,0.00001985074,0.0008091154,0.0012141021,0.00014644055,0.000039470942,0.00007005316,0.02686733],"genre_scores_gemma":[0.16676939,0.00008278378,0.0012534406,0.0000057489747,0.00004671585,2.8698406e-7,0.000078891775,0.000016010621,0.83174676],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99780035,0.00008646143,0.00025076373,0.00062451593,0.0008922863,0.00034564044],"domain_scores_gemma":[0.99709594,0.00024229099,0.000867292,0.001049856,0.00058885064,0.00015577825],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012067928,0.0002236148,0.0005799382,0.00079592573,0.00094104564,0.00018456815,0.0017196785,0.0003528273,0.0011572059],"category_scores_gemma":[0.00065799773,0.00023392338,0.0004099397,0.00032617885,0.00016929202,0.00041527813,0.00006888897,0.000355423,0.00075984886],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.0022299704,0.0008646696,0.017761651,0.00066313235,0.002098841,0.00056477945,0.60413796,0.0013906804,0.020316109,0.016929494,0.10751591,0.22552678],"study_design_scores_gemma":[0.0032073809,0.00046155468,0.127114,0.0013965832,0.0011303495,0.000020901976,0.69576406,0.00082934496,0.012533941,0.050698776,0.104381636,0.002461458],"about_ca_topic_score_codex":0.027172921,"about_ca_topic_score_gemma":0.04615829,"teacher_disagreement_score":0.8048794,"about_ca_system_score_codex":0.000042325337,"about_ca_system_score_gemma":0.00017813864,"threshold_uncertainty_score":0.99975586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4814123,0.00015126546,0.51675755,0.0008912738,0.0005614262,0.00013955933,0.000012610913,0.000022450224,0.000051580995],"genre_scores_gemma":[0.62626743,0.000013047313,0.373048,0.00005852903,0.000465734,0.0000071320833,5.9858274e-7,0.000026512287,0.000112996204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599284,0.00013226486,0.0013616906,0.0005547717,0.0013056551,0.000652752],"domain_scores_gemma":[0.9931182,0.0006936149,0.0027284517,0.0013631404,0.0015889064,0.0005076687],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010861659,0.00029106202,0.0007703706,0.0005207385,0.002009607,0.0019771012,0.0025247398,0.0002269457,0.000023491591],"category_scores_gemma":[0.011162671,0.0002250424,0.00060107355,0.0002403164,0.00019142465,0.0028714477,0.00016012779,0.00070056284,0.000032021555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019740811,0.00049937394,0.013589417,0.000021331754,0.00012089432,0.000008822314,0.0011690732,0.9397789,0.024627708,0.002360597,0.000036576614,0.01758987],"study_design_scores_gemma":[0.0015331557,0.00017216023,0.010076586,0.00011258578,0.00008330742,0.000039339015,0.0002482904,0.96306455,0.0016620854,0.022611665,0.00012117566,0.00027512448],"about_ca_topic_score_codex":0.00004769717,"about_ca_topic_score_gemma":0.000062670915,"teacher_disagreement_score":0.14485514,"about_ca_system_score_codex":0.00008654884,"about_ca_system_score_gemma":0.0005294409,"threshold_uncertainty_score":0.99928963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8833275,0.000034973287,0.06063426,0.017618963,0.0034809345,0.00089045975,0.000064195454,0.00012308225,0.033825636],"genre_scores_gemma":[0.97902244,0.000010180099,0.017379668,0.0006693776,0.0003975545,0.000024359628,3.9857258e-7,0.000014604915,0.0024814208],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99652624,0.000041646363,0.00087548344,0.0006986742,0.0013509309,0.0005070142],"domain_scores_gemma":[0.99551654,0.00024515754,0.0005198378,0.00043967454,0.0030465855,0.00023218838],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021160648,0.00023039026,0.00035754588,0.00032325403,0.0004903308,0.00048447624,0.0021097916,0.0000987287,0.00063579],"category_scores_gemma":[0.00532637,0.00015432615,0.00016457323,0.0019200309,0.00045480338,0.00025895215,0.00033473028,0.00027458253,0.0020840592],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003269747,0.00040623,0.00076424866,0.0000068343775,0.00007353012,0.0000011818931,0.005219575,0.00018570494,0.09660148,0.3160953,0.01043232,0.5698866],"study_design_scores_gemma":[0.000042626074,0.00046210716,0.00048515497,0.00015942196,0.000022687376,0.0000053426215,0.0018289421,0.026943438,0.6097608,0.3582017,0.0018184554,0.00026930223],"about_ca_topic_score_codex":0.00005400847,"about_ca_topic_score_gemma":0.000019020197,"teacher_disagreement_score":0.56961733,"about_ca_system_score_codex":0.00006029255,"about_ca_system_score_gemma":0.00014354319,"threshold_uncertainty_score":0.9986929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1211918,0.00041094725,0.86093634,0.015285229,0.00033260524,0.0012617522,0.00003212216,0.00005555462,0.00049365254],"genre_scores_gemma":[0.96793306,0.00004396944,0.027370308,0.00021662879,0.00056442496,0.00019847252,0.000016745,0.000021773683,0.0036346111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946166,0.0010399168,0.000530589,0.00079604186,0.0021367532,0.000880061],"domain_scores_gemma":[0.99092925,0.0047320686,0.00001885856,0.0009463052,0.0030788705,0.00029464628],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013680166,0.00016224697,0.00023082698,0.000633623,0.0039112465,0.002438316,0.0012453066,0.00010500142,0.00020648027],"category_scores_gemma":[0.00096153805,0.000102327875,0.000086657696,0.0022279038,0.0015329679,0.0003300446,0.00062966195,0.0005576305,0.00060965266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002611889,0.0006508688,0.0025580972,0.00003217002,0.0003033118,0.0000108807435,0.011570691,0.4169377,0.0075282822,0.062201902,0.084464684,0.41348022],"study_design_scores_gemma":[0.0005611586,0.00041242474,0.0021120836,0.000030424966,0.000008887657,0.000014603617,0.0013786157,0.9735604,0.0024002527,0.0008870799,0.018489173,0.00014490096],"about_ca_topic_score_codex":0.00044642235,"about_ca_topic_score_gemma":0.00028926713,"teacher_disagreement_score":0.84674126,"about_ca_system_score_codex":0.0001240239,"about_ca_system_score_gemma":0.00059529126,"threshold_uncertainty_score":0.99859726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914894,0.00024359468,0.0017937695,0.0010661901,0.0007768347,0.00050348684,0.000026806578,0.000011232565,0.0040886695],"genre_scores_gemma":[0.978765,0.000004718883,0.020513304,0.00015958052,0.00035403896,0.000022616105,0.0000013731875,0.000013855381,0.00016550285],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9932476,0.0010329712,0.0023049116,0.001041773,0.00079541106,0.0015772763],"domain_scores_gemma":[0.99426275,0.001467883,0.0008725502,0.00043453864,0.001558225,0.0014040299],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.022756603,0.0003906108,0.0006726822,0.0032082712,0.002939366,0.002250347,0.0018972105,0.0001808691,0.00021024296],"category_scores_gemma":[0.016186291,0.00034760367,0.00016363553,0.0092231585,0.006340852,0.002767568,0.0000453841,0.00067644607,0.000021774593],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010376185,0.00044449483,0.7968763,0.000015698562,0.000036007597,0.01604888,0.12820895,0.034399204,0.0002748152,0.01751935,0.000055083838,0.006017414],"study_design_scores_gemma":[0.001826653,0.01627719,0.10222813,0.00079129654,0.00007258585,0.031659484,0.7161184,0.09284721,0.000717671,0.035831574,0.0003927577,0.0012370427],"about_ca_topic_score_codex":0.03694288,"about_ca_topic_score_gemma":0.96035725,"teacher_disagreement_score":0.9234144,"about_ca_system_score_codex":0.001273755,"about_ca_system_score_gemma":0.020732405,"threshold_uncertainty_score":0.9998976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1402757,0.00005924889,0.8567043,0.0009802051,0.00077530014,0.00015565028,0.000008044993,0.000022598548,0.0010189507],"genre_scores_gemma":[0.8961364,0.00006587549,0.10313701,0.00020401248,0.00013440449,0.0000070524966,0.0000012075989,0.000009905244,0.0003041202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668485,0.000013451908,0.0005675129,0.00040458114,0.0019362011,0.00039341513],"domain_scores_gemma":[0.9978879,0.00013969846,0.00016711385,0.00021066054,0.0014131692,0.00018143133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059782104,0.00015152761,0.00019312343,0.0014345304,0.0002735229,0.0007486104,0.00095205137,0.000032172396,0.000011822537],"category_scores_gemma":[0.0002853285,0.00012489725,0.000064217376,0.0009051134,0.00027240926,0.0008040581,0.000414079,0.00012726484,0.00000855666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024756667,0.00034170976,0.0009381785,0.00006722978,0.0006293904,0.000039893745,0.0017609266,0.79696625,0.0030671624,0.13181248,0.0008401693,0.063289024],"study_design_scores_gemma":[0.0011973337,0.00009934725,0.002702837,0.00010998638,0.000049460057,0.000023420784,0.0012841255,0.9894682,0.00033095028,0.0020917894,0.0024988065,0.00014375465],"about_ca_topic_score_codex":0.0000022695149,"about_ca_topic_score_gemma":0.0000011246774,"teacher_disagreement_score":0.7558607,"about_ca_system_score_codex":0.00011766976,"about_ca_system_score_gemma":0.000042057356,"threshold_uncertainty_score":0.72188675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94317424,0.00002936103,0.04625537,0.0014651484,0.0018700483,0.00078354665,0.000044444267,0.00071574346,0.0056621],"genre_scores_gemma":[0.9876683,0.0000026335654,0.011472158,0.000087754575,0.00036821127,0.00004307652,0.000001307954,0.000024605524,0.00033198216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967399,0.00004377184,0.0010803794,0.0007521197,0.00088349625,0.00050031446],"domain_scores_gemma":[0.99238926,0.00063168054,0.0006987756,0.00056521094,0.0055634202,0.00015164688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034620264,0.00026015972,0.00045432698,0.00038128128,0.00071992114,0.0007657585,0.0023797692,0.00014162484,0.000115839015],"category_scores_gemma":[0.0068198172,0.00017111177,0.00019855819,0.0019137854,0.00057411933,0.0004179431,0.00015759491,0.00018084605,0.0004221128],"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.0004935127,0.00041587974,0.0019229571,0.00009008755,0.000072290655,4.1868674e-7,0.0018480474,0.00066953077,0.1948991,0.7351452,0.001128061,0.06331489],"study_design_scores_gemma":[0.000056856803,0.00040062866,0.0009243893,0.00029202257,0.000066266795,0.000009380229,0.00284813,0.33078402,0.575803,0.0882059,0.00030411652,0.0003053235],"about_ca_topic_score_codex":0.00008759189,"about_ca_topic_score_gemma":0.000039496153,"teacher_disagreement_score":0.64693934,"about_ca_system_score_codex":0.00004549775,"about_ca_system_score_gemma":0.00020475133,"threshold_uncertainty_score":0.8164451},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8658714,0.00062887504,0.124899566,0.004992055,0.002361262,0.00010527366,0.000005945031,0.000012457507,0.0011231621],"genre_scores_gemma":[0.9566378,0.000010917649,0.042395614,0.000057242058,0.0005697821,8.824769e-7,3.564647e-7,0.000009717122,0.00031771508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979684,0.0001794287,0.0007914215,0.0001398352,0.00069296616,0.00022796064],"domain_scores_gemma":[0.99390537,0.0027234058,0.0013667585,0.00029657848,0.0016136013,0.00009428198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003916616,0.00008284525,0.00030028328,0.00024610542,0.00047998878,0.00012544876,0.0005552301,0.000024053606,0.000024726656],"category_scores_gemma":[0.0053231963,0.000050677972,0.00020389917,0.0008416504,0.0010142033,0.0002176702,0.000011619028,0.00012678772,0.00002700434],"study_design_candidate":"design_other","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.00035968795,0.0001240253,0.00094918796,0.0000010328732,0.00006980046,4.568956e-7,0.00261893,0.0006931643,0.0056750644,0.0013378869,0.0052492046,0.98292154],"study_design_scores_gemma":[0.005737462,0.018195648,0.05926132,0.0030403228,0.0014076867,0.0011687427,0.11320606,0.21931049,0.06463739,0.38991833,0.12253745,0.001579088],"about_ca_topic_score_codex":0.000005211995,"about_ca_topic_score_gemma":9.897856e-7,"teacher_disagreement_score":0.9813425,"about_ca_system_score_codex":0.00005066273,"about_ca_system_score_gemma":0.00023946374,"threshold_uncertainty_score":0.63727474},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19464223,0.00037721542,0.80272424,0.001173415,0.00019278236,0.00061125634,0.000016283102,0.00006799048,0.00019457974],"genre_scores_gemma":[0.84712577,0.000012031353,0.15191492,0.00006337061,0.0002095029,0.000118807286,0.000001785353,0.000028835413,0.0005249691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713826,0.000121230856,0.00066217594,0.0005105704,0.00067217415,0.0008956105],"domain_scores_gemma":[0.9913447,0.0070267026,0.000324536,0.00093887374,0.0002878807,0.00007729918],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005308014,0.00023276532,0.00038758424,0.00018852795,0.00054880517,0.00031196646,0.0010133228,0.000071634495,0.00010994169],"category_scores_gemma":[0.0148967225,0.00014533252,0.00020254347,0.00068064174,0.00028581644,0.00017706059,0.00015720342,0.0003874722,0.0001914912],"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.00087202335,0.0047344263,0.0067901164,0.00058566825,0.0013210562,0.000027234883,0.025090264,0.05509478,0.012323891,0.66665167,0.004307596,0.22220124],"study_design_scores_gemma":[0.0005540203,0.0001448976,0.00021151952,0.00005606969,0.000049606926,0.000016208516,0.00020088708,0.68895954,0.0034368918,0.3048906,0.0012614818,0.00021826763],"about_ca_topic_score_codex":0.000054238866,"about_ca_topic_score_gemma":0.0003660504,"teacher_disagreement_score":0.6524835,"about_ca_system_score_codex":0.00013034293,"about_ca_system_score_gemma":0.00029450533,"threshold_uncertainty_score":0.9934012},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20199995,0.00008222078,0.7915831,0.0009379845,0.0027034993,0.00030375642,0.000012267344,0.0004010864,0.001976118],"genre_scores_gemma":[0.951033,0.0000061957085,0.048279505,0.00040830762,0.00023411507,0.000012667268,0.0000017120178,0.0000030521007,0.000021451835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975664,0.000048341873,0.0006944295,0.00028161253,0.0009843732,0.00042482806],"domain_scores_gemma":[0.99555236,0.0010521879,0.0003329229,0.0004641647,0.002424572,0.0001737729],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007438605,0.00012102226,0.0001746327,0.00036295416,0.0032501197,0.0031515067,0.0009042686,0.0000392329,0.0000043376117],"category_scores_gemma":[0.0020079163,0.000072691764,0.00005628811,0.0013900091,0.001059156,0.0042134547,0.00021778487,0.000081741506,0.00023746563],"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.0000822459,0.000028327795,0.0037417843,0.00005204385,0.000043997046,5.927355e-7,0.005817811,0.009817631,0.00070206047,0.6857531,0.007973191,0.2859872],"study_design_scores_gemma":[0.00026919434,0.00006971499,0.005776297,0.000046841713,0.0000061751107,0.000026675663,0.001098089,0.96935356,0.00082125457,0.0007864538,0.021632351,0.00011340956],"about_ca_topic_score_codex":0.00001128119,"about_ca_topic_score_gemma":0.000003276117,"teacher_disagreement_score":0.9595359,"about_ca_system_score_codex":0.000052335858,"about_ca_system_score_gemma":0.0005242424,"threshold_uncertainty_score":0.99804753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045248568,0.00006664322,0.9407977,0.0005188224,0.00021615945,0.00044210587,0.000011078522,0.00021163106,0.012487303],"genre_scores_gemma":[0.58530754,3.008096e-7,0.41386703,0.00038340446,0.00006832036,0.00002514005,7.4598495e-7,0.000014878477,0.00033266132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415195,0.00010383338,0.00067994645,0.0016359676,0.0024232534,0.0010050354],"domain_scores_gemma":[0.99544114,0.0011028145,0.00026174882,0.0014426003,0.0011909417,0.0005607829],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0133691905,0.00030672195,0.0005936409,0.0007607211,0.0015185189,0.0009573218,0.0021577894,0.000051761534,0.00020695783],"category_scores_gemma":[0.0022571299,0.0001955994,0.00012415797,0.0042769206,0.0013281368,0.00037428466,0.0004052689,0.00024040115,0.0009491954],"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.00033707914,0.00027639535,0.00019546325,0.0000107001615,0.00039769182,0.000020737927,0.0065254136,0.39208135,0.45151925,0.03346332,0.0018287041,0.11334388],"study_design_scores_gemma":[0.00031660864,0.00016614981,0.00022125205,0.000010285208,0.00023260896,0.000020923693,0.00013123023,0.7992118,0.048810665,0.14726633,0.0031655815,0.0004465707],"about_ca_topic_score_codex":0.00005787492,"about_ca_topic_score_gemma":0.0000157349,"teacher_disagreement_score":0.540059,"about_ca_system_score_codex":0.00007883309,"about_ca_system_score_gemma":0.00047244556,"threshold_uncertainty_score":0.9998287},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01409229,0.0011326323,0.060806356,0.000104826264,0.001708611,0.0013490845,0.00079664576,0.00023802224,0.91977155],"genre_scores_gemma":[0.012056542,0.0004940075,0.7208085,0.000025636526,0.00046198213,0.000026057853,0.000011704195,0.00017842093,0.26593715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994236,0.000010645293,0.0022678939,0.000780188,0.002166168,0.0005390961],"domain_scores_gemma":[0.9936146,0.0018923662,0.0021279196,0.0005951045,0.0016026744,0.00016733428],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0042797113,0.0005192361,0.0012365375,0.0012281749,0.00014218967,0.0003176399,0.0012729357,0.00041140686,0.0014130354],"category_scores_gemma":[0.0065442515,0.00046126306,0.00018668192,0.00034498813,0.00045008046,0.00019928942,0.00041601015,0.0006316174,0.0009721713],"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.000025361467,0.00015416235,0.0005837316,0.0007044349,0.00012295743,0.000025250654,0.0037092443,0.000036382553,0.000094705596,0.98161745,0.01036641,0.0025598884],"study_design_scores_gemma":[0.00026961387,0.00011125999,0.00012905816,0.0010233436,0.00017327078,0.000015099187,0.00048689148,0.0051352284,0.00021397942,0.95963186,0.03227597,0.00053443183],"about_ca_topic_score_codex":0.00001323197,"about_ca_topic_score_gemma":0.000024067176,"teacher_disagreement_score":0.6600022,"about_ca_system_score_codex":0.00013658391,"about_ca_system_score_gemma":0.00020675457,"threshold_uncertainty_score":0.9998057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102739,0.0013821269,0.12920217,0.035255928,0.0019816968,0.0024138393,0.00018870972,0.00007555301,0.019226108],"genre_scores_gemma":[0.9144445,0.000059343518,0.084021114,0.00022229599,0.0010168399,0.000017700837,0.000014812388,0.000044834054,0.00015856256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.986911,0.005260815,0.0015970322,0.00080194365,0.0047827926,0.00064643833],"domain_scores_gemma":[0.99130213,0.0032739697,0.00043758113,0.00056776014,0.00392152,0.0004970352],"candidate_categories":["metaresearch","scholarly_communication","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.056987878,0.00026294604,0.0005131877,0.0018588107,0.0009266098,0.0020088041,0.002895977,0.000076691635,0.00012939372],"category_scores_gemma":[0.011025819,0.00017092856,0.00027160256,0.002758609,0.00020333964,0.00040688715,0.0008653799,0.0042864946,0.00025133524],"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.0010196795,0.0009507697,0.012245886,0.00004282762,0.0006232131,0.0019946762,0.030818842,0.79966694,0.0077804606,0.009474957,0.03321407,0.10216769],"study_design_scores_gemma":[0.0062682126,0.01259412,0.42067385,0.0033568982,0.00022040594,0.0016834561,0.024067825,0.26010102,0.004920857,0.227697,0.035321508,0.0030948708],"about_ca_topic_score_codex":0.00008178836,"about_ca_topic_score_gemma":0.000028106853,"teacher_disagreement_score":0.5395659,"about_ca_system_score_codex":0.00019610809,"about_ca_system_score_gemma":0.0016168662,"threshold_uncertainty_score":0.9990272},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044611935,0.0000822333,0.9379456,0.0126009835,0.002020975,0.000983082,0.0000053857675,0.000115380186,0.0016344497],"genre_scores_gemma":[0.7084257,0.000011657388,0.28604794,0.00056850526,0.0011230796,0.00015360647,0.000018901042,0.000008367087,0.0036422561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810237,0.00012314052,0.0006424451,0.0005603258,0.000346069,0.0002256369],"domain_scores_gemma":[0.998402,0.00022414497,0.00009784508,0.00043432845,0.00075853657,0.00008314212],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004178929,0.0001029183,0.00014996956,0.00025208213,0.0014134595,0.0003956524,0.00015290148,0.000048702997,0.00008401706],"category_scores_gemma":[0.002647874,0.00008685595,0.00007916715,0.00079168996,0.00009098735,0.0003643686,0.000049188413,0.000074661984,0.00013247697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012766167,0.00037720526,0.008113957,0.000019993055,0.00012286202,3.8044146e-7,0.00038390385,0.44155863,0.00009162576,0.40837377,0.027596075,0.11323393],"study_design_scores_gemma":[0.00067602255,0.00017135378,0.011846401,0.000029380435,0.00010813816,0.0000021287253,0.00038930212,0.8842355,0.00010723371,0.026990702,0.0752346,0.0002092654],"about_ca_topic_score_codex":0.000005760852,"about_ca_topic_score_gemma":0.00011964733,"teacher_disagreement_score":0.66381377,"about_ca_system_score_codex":0.000022058912,"about_ca_system_score_gemma":0.000045461842,"threshold_uncertainty_score":0.9998866},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35710344,0.000029519508,0.007609003,0.0050380235,0.0014051433,0.00014828,0.0000062548966,0.00009878423,0.62856156],"genre_scores_gemma":[0.9111388,0.0000019040649,0.0020269768,0.000115380215,0.00008585506,0.000003923653,5.33257e-7,0.0000047095646,0.08662193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813986,0.000060542214,0.00029528124,0.00023964842,0.0011218541,0.00014279196],"domain_scores_gemma":[0.9983315,0.0002516946,0.00019248085,0.00016146964,0.000985992,0.00007689186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003459462,0.0000774428,0.00012632427,0.00013683166,0.00011591071,0.00016127051,0.0008748909,0.000046290435,0.0007486092],"category_scores_gemma":[0.005826094,0.000042376858,0.0000820338,0.00044420938,0.00014611859,0.00017606051,0.00014891585,0.00021181942,0.00046786675],"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.00006611631,0.00012845955,0.039688025,0.0000013458899,0.000049632472,4.6621398e-7,0.0020816498,0.0013637875,0.0008526997,0.91201335,0.02454074,0.019213751],"study_design_scores_gemma":[0.0011473297,0.00027814665,0.025572112,0.00008194447,0.00004394642,0.000024998797,0.018777883,0.26637894,0.0029487864,0.6062263,0.07815915,0.00036040306],"about_ca_topic_score_codex":0.000026580827,"about_ca_topic_score_gemma":0.000002061302,"teacher_disagreement_score":0.55403537,"about_ca_system_score_codex":0.000025842894,"about_ca_system_score_gemma":0.00012002601,"threshold_uncertainty_score":0.81967455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08073811,0.000027270318,0.9157385,0.0022039313,0.00051511487,0.0004990496,0.000061647486,0.000057597124,0.00015872416],"genre_scores_gemma":[0.7099619,0.0000018583297,0.2889912,0.00068457326,0.00009621201,0.000018407844,0.00011818391,0.000027086278,0.00010059409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971209,0.0002248159,0.0007416664,0.00042702258,0.0011597349,0.00032586357],"domain_scores_gemma":[0.9959865,0.0020501798,0.00035756073,0.00019572688,0.0012319117,0.00017809651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017757968,0.00020342272,0.000280719,0.0005347648,0.00050432084,0.00055834785,0.00031082722,0.000056005945,0.00024386737],"category_scores_gemma":[0.000542196,0.00015435946,0.00018752602,0.0006500126,0.000028873832,0.0003145209,0.000012879146,0.00025059644,0.00014791588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002722616,0.00019564466,0.002583174,0.000006806935,0.000045882804,0.0000036291685,0.0000895694,0.9944141,0.000006694566,0.0017822047,0.00024139827,0.00035862226],"study_design_scores_gemma":[0.0027509192,0.0010705931,0.001353801,0.0001262829,0.000039068564,0.00004526712,0.00005105884,0.9898967,0.000020035293,0.0036616873,0.0007863134,0.00019828412],"about_ca_topic_score_codex":6.309611e-7,"about_ca_topic_score_gemma":0.000001547893,"teacher_disagreement_score":0.62922376,"about_ca_system_score_codex":0.00011091642,"about_ca_system_score_gemma":0.00031117097,"threshold_uncertainty_score":0.6294596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28597933,0.00003355282,0.6773659,0.0007141181,0.0005743082,0.00037931243,0.00001968879,0.0002076879,0.03472611],"genre_scores_gemma":[0.99244636,6.947802e-7,0.0039349333,0.00047011473,0.00016805324,0.000015667847,0.000027158154,0.00002030095,0.0029167396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700654,0.0002410968,0.0008293605,0.0006393478,0.0007944969,0.00048916973],"domain_scores_gemma":[0.9965525,0.0011469316,0.00030714966,0.00069726363,0.00092708814,0.00036903817],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021012179,0.00021730662,0.00026669205,0.00070741924,0.0006279012,0.0005127652,0.0006518269,0.00016436675,0.0033220982],"category_scores_gemma":[0.005933665,0.0001999865,0.00012677726,0.0007774023,0.00007520749,0.00097485917,0.00006145507,0.00024743602,0.0010959437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061021365,0.000033358094,0.017332722,0.000003976465,0.000039049097,0.0000039772044,0.014688153,0.8802591,0.00016544259,0.006240693,0.0002795138,0.08089299],"study_design_scores_gemma":[0.00029043507,0.000036895497,0.021983469,0.000050582712,0.000022252678,0.0000018709178,0.0019358387,0.9536366,0.000085511085,0.009676855,0.012012628,0.00026709354],"about_ca_topic_score_codex":0.0051723155,"about_ca_topic_score_gemma":0.010167265,"teacher_disagreement_score":0.706467,"about_ca_system_score_codex":0.00017078509,"about_ca_system_score_gemma":0.0005506343,"threshold_uncertainty_score":0.99968183},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668454,0.00029404374,0.14826034,0.034404505,0.0021723944,0.0013915927,0.000026308642,0.0002227383,0.046382662],"genre_scores_gemma":[0.9970125,0.000027398593,0.0018534414,0.00037341626,0.00013095114,0.000027883183,4.3173216e-7,0.000019058425,0.00055490364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958597,0.00007258288,0.001150895,0.0006560107,0.001687967,0.00057288987],"domain_scores_gemma":[0.9959341,0.0012189045,0.0008780183,0.0005329557,0.0012972418,0.00013874713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006095417,0.0002788139,0.00038573632,0.00012689462,0.00094903837,0.00092864607,0.0026868698,0.000114462564,0.00023909313],"category_scores_gemma":[0.006539699,0.00015125595,0.0002542889,0.0010600332,0.00045094616,0.00030824213,0.00031754465,0.00056798576,0.0002592531],"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.00005975161,0.00018681619,0.0017286774,0.000014123385,0.000037432666,1.5299162e-7,0.002782484,0.000769748,0.050124332,0.5751255,0.0024404146,0.36673057],"study_design_scores_gemma":[0.000042676536,0.00015153529,0.0003487019,0.00035969896,0.000041521074,0.000005064247,0.002981109,0.18841012,0.1313747,0.6747609,0.0012368645,0.00028713836],"about_ca_topic_score_codex":0.00011489353,"about_ca_topic_score_gemma":0.000054213637,"teacher_disagreement_score":0.36644343,"about_ca_system_score_codex":0.000053047534,"about_ca_system_score_gemma":0.000105331164,"threshold_uncertainty_score":0.89549553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8148309,0.00030410851,0.18110965,0.0025346894,0.0005730367,0.00029781126,0.000020177558,0.000008802807,0.00032083513],"genre_scores_gemma":[0.9800393,0.00014818738,0.01911418,0.00020890991,0.00011573568,0.000006877951,0.000017563767,0.0000068038057,0.000342422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982866,0.000051411964,0.00055746833,0.00021153913,0.00076278456,0.00013022052],"domain_scores_gemma":[0.9984663,0.00018860209,0.00016284382,0.000111049434,0.0009986098,0.00007257558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928442,0.000089686575,0.00015313635,0.00043327405,0.00017680386,0.00076926587,0.00032813268,0.0000283692,0.00003401538],"category_scores_gemma":[0.00004093541,0.00006613155,0.00005019613,0.00018441661,0.000040449904,0.0006588452,0.00010208595,0.00009870649,0.000015417381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022453416,0.00021945656,0.010553072,0.0001417583,0.00060555123,0.00001664106,0.0027705606,0.85015327,0.0022629455,0.0621099,0.000104524086,0.07083781],"study_design_scores_gemma":[0.0017043297,0.00021092327,0.006749611,0.0003413566,0.00006782624,0.00010846816,0.007465489,0.9727731,0.00061560306,0.0047579696,0.005038443,0.00016693061],"about_ca_topic_score_codex":0.000041294545,"about_ca_topic_score_gemma":0.00004135714,"teacher_disagreement_score":0.16520844,"about_ca_system_score_codex":0.000038680857,"about_ca_system_score_gemma":0.000034454446,"threshold_uncertainty_score":0.74180484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003025325,0.011816777,0.96362126,0.0019752674,0.01720015,0.0017316039,0.00015885074,0.00010949779,0.00036128954],"genre_scores_gemma":[0.28619742,0.028338902,0.5460991,0.014778721,0.034052633,0.0030527557,0.01177866,0.0010414261,0.07466036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575454,0.0003582005,0.0012520965,0.0013514544,0.00037823553,0.0009054569],"domain_scores_gemma":[0.9962027,0.0017498804,0.000775263,0.00070308906,0.00041862414,0.0001504305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033414313,0.0005891374,0.0014687221,0.0006806432,0.00020383256,0.000105655046,0.00064780907,0.00089099584,0.000014068065],"category_scores_gemma":[0.0023429578,0.000417274,0.00016661562,0.0011080722,0.00039099806,0.00021774296,0.00015992715,0.0015899595,0.000012913874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092563516,0.00062525045,0.0028084859,0.00031138834,0.00023751565,0.000020950238,0.016216027,0.79779804,0.00053351896,0.006694466,0.12663549,0.04719322],"study_design_scores_gemma":[0.0018354454,0.00040607897,0.000028452128,0.0016824404,0.000040777675,0.0000045683732,0.001398558,0.9343575,0.00003278471,0.03497812,0.024642818,0.00059245445],"about_ca_topic_score_codex":0.00029430064,"about_ca_topic_score_gemma":0.000044533426,"teacher_disagreement_score":0.4175221,"about_ca_system_score_codex":0.000088137844,"about_ca_system_score_gemma":0.000387323,"threshold_uncertainty_score":0.9998279},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98068136,0.000027913808,0.0075219637,0.00287669,0.00052777276,0.00022166672,0.000027324382,0.000033139186,0.0080821505],"genre_scores_gemma":[0.9937511,0.000002148525,0.0021236665,0.00008422981,0.000038797727,5.7226947e-7,0.0000014829376,0.0000075763282,0.0039904346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754554,0.00029197687,0.00027031364,0.0003411762,0.0012927038,0.00025826026],"domain_scores_gemma":[0.9963817,0.0016073808,0.00043105855,0.0011286426,0.00036275256,0.000088477704],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021434915,0.00013347898,0.00024942917,0.0001655221,0.0008234058,0.000077224744,0.0016021222,0.00011559347,0.0009638319],"category_scores_gemma":[0.0017722634,0.00008399834,0.00031341286,0.0009620132,0.0006944127,0.00016963843,0.0002687723,0.0003884682,0.00018945188],"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.000024527382,0.00011715581,0.0047617126,0.0000026297002,0.000051371462,7.9282813e-7,0.0017207513,0.00089274155,0.0004377705,0.9883587,0.0035837565,0.000048117367],"study_design_scores_gemma":[0.00029507527,0.0000495352,0.01432106,0.000014660972,0.000043121214,0.000002714485,0.0045478274,0.0008474716,0.000045152858,0.97876203,0.0009738442,0.00009748653],"about_ca_topic_score_codex":0.00029824374,"about_ca_topic_score_gemma":0.00041073628,"teacher_disagreement_score":0.013069713,"about_ca_system_score_codex":0.000039239472,"about_ca_system_score_gemma":0.00016221653,"threshold_uncertainty_score":0.9999494},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013266963,0.00020346654,0.05703669,0.0014003362,0.000108325024,0.00026958596,0.000019338271,0.000059540038,0.9408895],"genre_scores_gemma":[0.0045787953,0.000009769421,0.05736114,0.00024525603,0.000058524314,0.000004700264,0.0000021398348,0.000022797805,0.9377169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960946,0.000029551162,0.0010935643,0.00052236556,0.0019807275,0.00027920702],"domain_scores_gemma":[0.9971175,0.00060269464,0.0005008956,0.0012551515,0.0004012663,0.00012245175],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001655917,0.0002786774,0.00058792083,0.00026948037,0.00017222871,0.0001143072,0.0012827681,0.00030975076,0.0017375089],"category_scores_gemma":[0.00048115305,0.00015465502,0.0005546299,0.00016948886,0.00020705265,0.00008461144,0.00021267244,0.00038382818,0.001567806],"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.0000034335446,0.000059802653,0.0000018896101,0.0000059111,0.000025876476,6.632726e-7,0.00006066312,0.0015524697,0.000006459088,0.97606087,0.013929666,0.008292321],"study_design_scores_gemma":[0.000103563485,0.000031942363,0.0000038289368,0.00009579282,0.00006996057,0.0000073992983,0.0000068620407,0.025164101,0.000033116034,0.93079334,0.04351537,0.00017471644],"about_ca_topic_score_codex":0.0000019389138,"about_ca_topic_score_gemma":0.0000034834568,"teacher_disagreement_score":0.045267493,"about_ca_system_score_codex":0.00003514707,"about_ca_system_score_gemma":0.00024837026,"threshold_uncertainty_score":0.9992096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98446405,0.000036301975,0.005324102,0.0011043348,0.005137205,0.000029617046,0.000012951303,0.0000041921253,0.0038872687],"genre_scores_gemma":[0.997208,6.615874e-7,0.0019016269,0.00009421714,0.00027675787,4.9616773e-7,4.1433603e-7,0.0000053105546,0.000512523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998763,0.000068112386,0.00058635673,0.00009802958,0.00032760235,0.00015688734],"domain_scores_gemma":[0.99756694,0.00033230553,0.00038134123,0.00028154603,0.0010981658,0.0003397112],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017466872,0.000059198257,0.0001549518,0.001300352,0.0001675818,0.00008080763,0.00023133821,0.00006299956,0.0013315409],"category_scores_gemma":[0.004391078,0.00004829467,0.00017163184,0.00083569373,0.00015459194,0.00021080989,0.0000073323677,0.0003663247,0.000091459675],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00018351788,0.00054452964,0.15014438,0.000022476537,0.0008674217,0.00058327895,0.053115226,0.014871046,0.15650867,0.071301855,0.3565362,0.1953214],"study_design_scores_gemma":[0.0027820626,0.0011941,0.37000534,0.0003066414,0.0004479797,0.015023137,0.039896134,0.008617112,0.01835357,0.108062744,0.43426478,0.0010463888],"about_ca_topic_score_codex":0.009565187,"about_ca_topic_score_gemma":0.25926384,"teacher_disagreement_score":0.24969867,"about_ca_system_score_codex":0.000037178987,"about_ca_system_score_gemma":0.0010008806,"threshold_uncertainty_score":0.9995814},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019527538,0.00033808293,0.8843338,0.0010994258,0.0006126534,0.0006693533,0.00004930981,0.00004816634,0.112653926],"genre_scores_gemma":[0.296627,0.003296567,0.65864754,0.0019001196,0.00028250867,0.000118478434,0.0003315228,0.000053196283,0.038743075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702084,0.0000432636,0.0011751028,0.00040936953,0.0010584596,0.00029293433],"domain_scores_gemma":[0.9936384,0.0019526753,0.00075349864,0.0019317339,0.0016243361,0.00009936646],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0055376454,0.00021512443,0.00034553139,0.0018470262,0.0008030868,0.0011237859,0.0026829778,0.00015124683,0.000014940787],"category_scores_gemma":[0.0006985692,0.00019659464,0.00009982036,0.00065813866,0.00060243625,0.00514544,0.00093547034,0.00042184003,0.00016482465],"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.0000059311506,0.000008565448,0.000017744616,0.0000061754704,0.0000048269467,3.3661774e-8,0.0012594713,0.42550257,5.3871497e-7,0.46828085,0.00023163606,0.10468165],"study_design_scores_gemma":[0.00023170843,0.000027622309,0.000017172297,0.0001518317,0.000006546894,0.0000029122948,0.00006098921,0.7924422,0.0000022760623,0.04755179,0.1593256,0.0001793553],"about_ca_topic_score_codex":0.0000174715,"about_ca_topic_score_gemma":0.00000841805,"teacher_disagreement_score":0.42072907,"about_ca_system_score_codex":0.00019616506,"about_ca_system_score_gemma":0.00054479454,"threshold_uncertainty_score":0.99991316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98851144,0.007315526,0.0008700911,0.0003358002,0.0017269055,0.00015892701,0.000024878307,0.000005398317,0.0010510075],"genre_scores_gemma":[0.9915311,0.0022081293,0.005788811,0.00028022975,0.00012738428,0.0000026240145,5.984998e-7,0.000009771939,0.000051405645],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9962239,0.00034962912,0.0024130412,0.00031348428,0.00036975415,0.00033013668],"domain_scores_gemma":[0.9958222,0.0018734378,0.0011751674,0.0005320503,0.00029513126,0.0003020197],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0048414473,0.00019002943,0.00118818,0.000206972,0.000039255003,0.00017364883,0.0008155663,0.00011410494,0.00012473004],"category_scores_gemma":[0.012583339,0.00014525253,0.00043849333,0.0006470062,0.00011448149,0.00047642854,0.00007466866,0.00036252025,0.00039580165],"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.00014232176,0.00011486522,0.9836399,0.000018886154,0.000028303239,0.000005903695,0.00009133789,0.0063630594,0.000006433015,0.0005998321,0.0027978912,0.006191299],"study_design_scores_gemma":[0.0012004334,0.0004243236,0.96676826,0.0009148849,0.00003663307,0.000049813516,0.00011971584,0.0013629678,0.000041451905,0.005511006,0.023225514,0.00034501936],"about_ca_topic_score_codex":0.000026962147,"about_ca_topic_score_gemma":0.00004779551,"teacher_disagreement_score":0.020427622,"about_ca_system_score_codex":0.0001435941,"about_ca_system_score_gemma":0.00022620369,"threshold_uncertainty_score":0.9957341},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19450678,0.0007080144,0.79031146,0.00932033,0.0002063369,0.0015858256,0.00050995353,0.00029701507,0.002554298],"genre_scores_gemma":[0.9711117,0.00018884608,0.026022412,0.000074675634,0.000045290533,0.0000011185667,0.00001446049,0.000026956995,0.0025145193],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9955843,0.00041000298,0.0008004276,0.0009872273,0.0015160952,0.0007019349],"domain_scores_gemma":[0.98934174,0.0066885,0.00099354,0.0012942732,0.0013230116,0.00035895366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004334188,0.0004123376,0.00095479126,0.0004933717,0.00095651794,0.00007520342,0.0022151966,0.0005561592,0.0008123677],"category_scores_gemma":[0.0016125177,0.00032093312,0.00068977044,0.0013133795,0.0016605483,0.0007274773,0.0007412855,0.00047691053,0.00010232516],"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.008261086,0.010960544,0.22102635,0.00095212145,0.0029043448,0.00039434497,0.0022834581,0.005073349,0.062595166,0.12880385,0.1522813,0.4044641],"study_design_scores_gemma":[0.049011685,0.0061291913,0.51453584,0.0043756086,0.010105675,0.00039594655,0.025020244,0.084482454,0.0057600564,0.07262424,0.22011757,0.007441472],"about_ca_topic_score_codex":0.00058925006,"about_ca_topic_score_gemma":0.00080883823,"teacher_disagreement_score":0.77660495,"about_ca_system_score_codex":0.00018945416,"about_ca_system_score_gemma":0.0004380331,"threshold_uncertainty_score":0.9999243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043463937,0.00007234671,0.9923757,0.0048432876,0.00030386978,0.0004025864,0.00004032675,0.00019098277,0.0013362982],"genre_scores_gemma":[0.43414328,0.0000072678486,0.56510204,0.0002867452,0.00017883716,0.00004034521,0.000016872427,0.0000125451115,0.00021204771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981114,0.00005374455,0.00051532354,0.00048495576,0.0005583252,0.00027621174],"domain_scores_gemma":[0.9984284,0.000716761,0.00017519493,0.00021361597,0.00028147828,0.00018454927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011908942,0.00012669478,0.00021382695,0.000109906665,0.00034113508,0.0003797786,0.00021838803,0.00007787287,0.0006217937],"category_scores_gemma":[0.0020782312,0.00009565469,0.00014456525,0.00060037855,0.000076049204,0.00040374222,0.000051163377,0.000106706415,0.00010668972],"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.00001710643,0.000031946325,0.0011991623,0.0000071246145,0.000052954347,0.0000010874381,0.000705199,0.2770215,0.0007548253,0.012413002,0.00456978,0.7032263],"study_design_scores_gemma":[0.00044437585,0.00010329399,0.00027283997,0.000007709422,0.000021259979,0.0000037844334,0.0005079824,0.98831165,0.00021585781,0.008023466,0.0019430079,0.00014479713],"about_ca_topic_score_codex":0.00009021851,"about_ca_topic_score_gemma":0.000045106415,"teacher_disagreement_score":0.7112901,"about_ca_system_score_codex":0.000026731712,"about_ca_system_score_gemma":0.000057030404,"threshold_uncertainty_score":0.68082047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5445073,0.00007680248,0.4547617,0.00010163026,0.00005820786,0.00017410598,0.000001932464,0.0000282834,0.0002900011],"genre_scores_gemma":[0.89023966,0.0000010937823,0.10958023,0.00007199049,0.00007765781,0.000008005689,0.0000088270435,0.000007382127,0.0000051293155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981254,0.00023476558,0.0004823317,0.0004655906,0.0004993718,0.0001925635],"domain_scores_gemma":[0.99907357,0.00034464998,0.00022829327,0.000088753215,0.0001717238,0.00009298978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016909617,0.00010778772,0.00020860446,0.00023798595,0.00018397949,0.000314917,0.00011245561,0.000056373545,0.000009533315],"category_scores_gemma":[0.0006646383,0.000098019045,0.00003210149,0.00095729745,0.000082129016,0.00041662413,0.000078101235,0.00013896002,0.000009975476],"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.000029635223,0.000082458326,0.0068550385,0.000023511524,0.00001954435,0.0000031127252,0.0061148745,0.3603891,0.009487055,0.0012286516,0.000015655822,0.6157514],"study_design_scores_gemma":[0.00056119176,0.000043303957,0.011994314,0.00002195613,0.000015965135,0.00000709343,0.0011730139,0.9817145,0.0006374269,0.0037050417,0.000014675498,0.00011154075],"about_ca_topic_score_codex":0.000031850184,"about_ca_topic_score_gemma":0.0000013959507,"teacher_disagreement_score":0.6213254,"about_ca_system_score_codex":0.000045115892,"about_ca_system_score_gemma":0.0000720867,"threshold_uncertainty_score":0.39971006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2856951,0.00069036195,0.7061342,0.0032274541,0.00046809108,0.001297011,0.00004861419,0.00024203332,0.00219716],"genre_scores_gemma":[0.94966745,0.000031083913,0.04947875,0.00030046204,0.00012912536,0.00019423488,0.000035483077,0.000027271588,0.00013614424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952745,0.00016797677,0.002148416,0.0006208803,0.0011532458,0.0006350238],"domain_scores_gemma":[0.9920788,0.004796733,0.0011424316,0.00076115684,0.00089856,0.00032231552],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026439985,0.00031462635,0.00073099096,0.0005786751,0.00037116944,0.00021425758,0.0013253462,0.00034641547,0.0000123259915],"category_scores_gemma":[0.040987033,0.00026690142,0.00028363126,0.0024249458,0.00028599447,0.00046957505,0.00021409066,0.0007422523,0.00008320125],"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.00043279707,0.0009736932,0.2058509,0.00050338515,0.00014680716,0.000014331355,0.003295856,0.18936504,0.0019571295,0.5143386,0.00067082106,0.082450636],"study_design_scores_gemma":[0.003956293,0.0014187034,0.16595322,0.0006037479,0.00020023443,0.0000740319,0.0030721866,0.6380248,0.0012311408,0.15255764,0.031783987,0.0011239843],"about_ca_topic_score_codex":0.000014288577,"about_ca_topic_score_gemma":0.000022580618,"teacher_disagreement_score":0.6639724,"about_ca_system_score_codex":0.00011692125,"about_ca_system_score_gemma":0.00034358582,"threshold_uncertainty_score":0.9999783},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39398092,0.004309774,0.5586332,0.040613893,0.0002433416,0.0007510007,0.00014804165,0.00059530215,0.0007245372],"genre_scores_gemma":[0.5996553,0.0010157835,0.3878156,0.0015809364,0.0003277885,0.0002738994,0.00004384097,0.000082115395,0.009204794],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921752,0.0028584837,0.0011806947,0.0011092309,0.0010293741,0.0016469813],"domain_scores_gemma":[0.9934253,0.0033079246,0.00074109953,0.0013342268,0.00055054657,0.00064088556],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012305884,0.00064955413,0.0007162815,0.0009876628,0.0007872272,0.0012547883,0.0013854078,0.0010528631,0.00031060728],"category_scores_gemma":[0.0062240255,0.00066317973,0.0004292585,0.00115094,0.00028496457,0.001062581,0.00025038974,0.0011722653,0.00026129492],"study_design_candidate":"simulation_or_modeling","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.0003185378,0.0012293953,0.40556183,0.0002341596,0.00023489098,0.000063807485,0.021670869,0.14642641,0.035262264,0.33575648,0.010846232,0.04239512],"study_design_scores_gemma":[0.00089592766,0.00030182686,0.19319311,0.00057799317,0.00022515771,0.0005385644,0.00888008,0.70630884,0.01544803,0.06289404,0.009628514,0.0011079102],"about_ca_topic_score_codex":0.056920655,"about_ca_topic_score_gemma":0.007823971,"teacher_disagreement_score":0.55988246,"about_ca_system_score_codex":0.0018886365,"about_ca_system_score_gemma":0.0032137434,"threshold_uncertainty_score":0.999782},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.371576,0.0008311809,0.027274858,0.051486116,0.0028596013,0.00092353416,0.00032128987,0.00026437914,0.54446304],"genre_scores_gemma":[0.99861157,0.0000014758244,0.00017185544,0.0008377549,0.00021346759,0.000009686834,7.200842e-7,0.0000059834388,0.00014749821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99681467,0.00008986018,0.00031624053,0.00056208175,0.0016301987,0.0005869411],"domain_scores_gemma":[0.99864244,0.00009970713,0.00008373912,0.00019321582,0.00016773478,0.00081318506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020725273,0.00010220593,0.00019241055,0.00015255819,0.0009212703,0.00030801393,0.00097199687,0.00007388151,0.00018680077],"category_scores_gemma":[0.0015338985,0.000094802155,0.000062350555,0.0032892204,0.00053487567,0.0002853695,0.00006816926,0.00013859896,0.00039343128],"study_design_candidate":"qualitative","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.00007061744,0.00014607086,0.07538792,0.00005964724,0.00003357105,0.0004382824,0.18372798,0.00079800916,0.0007381585,0.5743369,0.015438742,0.14882411],"study_design_scores_gemma":[0.0013796409,0.0001568884,0.02667447,0.000078460216,0.000021849486,0.000015548036,0.71825945,0.124929436,0.0002233461,0.0014664853,0.1257543,0.0010401239],"about_ca_topic_score_codex":0.0040129093,"about_ca_topic_score_gemma":0.037748117,"teacher_disagreement_score":0.62703556,"about_ca_system_score_codex":0.0011648039,"about_ca_system_score_gemma":0.0011899362,"threshold_uncertainty_score":0.9798105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002057168,0.0026311881,0.9810673,0.0019013275,0.0024181607,0.0005105109,0.000013797726,0.0001351935,0.00926535],"genre_scores_gemma":[0.70658785,0.000075110336,0.290183,0.0012279492,0.0007643405,0.000013821807,0.00000573513,0.000044578144,0.0010976264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922197,0.00012711488,0.00131977,0.002205873,0.0033195328,0.00080800796],"domain_scores_gemma":[0.994947,0.0023623263,0.0005213725,0.0012746279,0.00048734678,0.00040731832],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0053690406,0.0005546944,0.0009793662,0.0017064544,0.00035149377,0.0015256201,0.004008783,0.0003523455,0.00029807427],"category_scores_gemma":[0.0028001755,0.00044641097,0.00021787404,0.0021763677,0.00073621864,0.00059860485,0.001190885,0.0016414025,0.00062948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023334507,0.00011873609,0.0034599046,0.000013371192,0.000036096408,0.0001479157,0.0019801839,0.6299652,0.00011325847,0.003591584,0.00010602359,0.3604444],"study_design_scores_gemma":[0.0009936732,0.0002958974,0.0060011097,0.0010762316,0.00007229354,0.000054822736,0.000018915103,0.60253286,0.00039558925,0.38366482,0.0032368286,0.0016569294],"about_ca_topic_score_codex":0.000045885266,"about_ca_topic_score_gemma":0.00020720133,"teacher_disagreement_score":0.70453066,"about_ca_system_score_codex":0.0002589067,"about_ca_system_score_gemma":0.0013995756,"threshold_uncertainty_score":0.9997988},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058170892,0.0012052472,0.9368474,0.0025385928,0.00036761438,0.00042189503,0.00014874867,0.00007720836,0.00022239664],"genre_scores_gemma":[0.876876,0.00006352092,0.12146366,0.00024257146,0.0003368443,0.000015777727,0.0000091214015,0.000031241063,0.00096130004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698293,0.000120162105,0.000825036,0.00088292535,0.00059191854,0.000597039],"domain_scores_gemma":[0.9955856,0.0027429997,0.00019205904,0.000486185,0.00059960113,0.00039351793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026059402,0.00023147052,0.0004510191,0.0001785997,0.0008080711,0.00054090767,0.0005701727,0.000089182424,0.0005112163],"category_scores_gemma":[0.0044041355,0.00021248993,0.00017342398,0.0010185621,0.00053839665,0.00025832403,0.00016590353,0.00028166425,0.00069249544],"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.00007678137,0.00038153803,0.0036943248,0.00010627537,0.0001316258,0.000048261678,0.0062973592,0.4380839,0.0046506296,0.004285462,0.0011785178,0.54106534],"study_design_scores_gemma":[0.00012830245,0.00011875537,0.000038792445,0.00006950168,0.0000734284,0.000041445044,0.0050313026,0.9831331,0.005539424,0.0019577278,0.0036120636,0.00025619846],"about_ca_topic_score_codex":0.000068304755,"about_ca_topic_score_gemma":0.00000969597,"teacher_disagreement_score":0.8187051,"about_ca_system_score_codex":0.000029062325,"about_ca_system_score_gemma":0.00018050977,"threshold_uncertainty_score":0.8900859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099595435,0.00036108162,0.89566153,0.0024289754,0.00009019388,0.0012893623,0.000013555291,0.00011118339,0.00044869367],"genre_scores_gemma":[0.8628756,0.00001889051,0.13576873,0.00043421538,0.000065269836,0.0002470849,0.000001675512,0.000027931172,0.0005606477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736434,0.00014051131,0.0007351438,0.00039037614,0.00083733076,0.00053230807],"domain_scores_gemma":[0.9953512,0.0029770692,0.00036247092,0.0008483656,0.00032943478,0.00013149138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007312125,0.00020531239,0.00029430643,0.0002601072,0.0006458442,0.0002859524,0.00072556955,0.00016403756,0.00001313789],"category_scores_gemma":[0.0021719425,0.00011057991,0.00020705136,0.0008939802,0.00023505001,0.0001989577,0.00018201776,0.0002350212,0.0000031935072],"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.00012510487,0.00016030525,0.0032676244,0.000019750238,0.000046153385,0.0000010546033,0.0008154761,0.053068824,0.0008850165,0.9098235,0.00052021915,0.031266995],"study_design_scores_gemma":[0.00036476398,0.00009982627,0.0037084448,0.00006628,0.000056432265,0.000022955808,0.00028732693,0.5786528,0.0041007004,0.41178623,0.0006984357,0.00015581098],"about_ca_topic_score_codex":0.0002875972,"about_ca_topic_score_gemma":0.0004465689,"teacher_disagreement_score":0.7632801,"about_ca_system_score_codex":0.00009860087,"about_ca_system_score_gemma":0.00011525699,"threshold_uncertainty_score":0.49673766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01092307,0.001063541,0.98003,0.004496261,0.00013949291,0.00083048234,0.00002217251,0.0011285255,0.0013664615],"genre_scores_gemma":[0.36962268,0.00005000784,0.6297278,0.00029508784,0.000053158947,0.000080206024,0.000013391365,0.000023602126,0.00013409017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955312,0.00004280035,0.0010551477,0.0014511974,0.001379195,0.00054047967],"domain_scores_gemma":[0.9961972,0.0018797278,0.00032459517,0.00093831046,0.00043599264,0.00022414024],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021884318,0.00037277673,0.0005978683,0.0009541828,0.0004909605,0.00040316107,0.0014934227,0.00036874934,0.00004438122],"category_scores_gemma":[0.008783027,0.00027688872,0.00032429345,0.0020750952,0.00020865769,0.00024282743,0.0003676908,0.00052492187,0.00014546787],"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.00049437885,0.00029272045,0.0014446034,0.000036987647,0.00005396353,0.0000055372725,0.00032878938,0.41436383,0.00020523068,0.028948253,0.012344406,0.5414813],"study_design_scores_gemma":[0.0005942377,0.00023990196,0.000119990465,0.00007182781,0.00003890614,0.000015190655,0.005385155,0.42009485,0.0024560234,0.56275827,0.007794083,0.00043158035],"about_ca_topic_score_codex":0.000014754391,"about_ca_topic_score_gemma":5.028729e-7,"teacher_disagreement_score":0.5410497,"about_ca_system_score_codex":0.00005869633,"about_ca_system_score_gemma":0.00021873089,"threshold_uncertainty_score":0.99996835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8282679,0.0000067006563,0.1674843,0.0033687034,0.000045610974,0.0007589446,0.000004632897,0.00004024204,0.00002299148],"genre_scores_gemma":[0.99643224,0.000002023943,0.0032428075,0.00010855013,0.00002674892,0.000025902631,0.0000015246302,0.00000875018,0.00015145817],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998175,0.0001715978,0.00049326406,0.00035266747,0.00055000564,0.0002574631],"domain_scores_gemma":[0.9975148,0.0018436026,0.00017411089,0.0002409321,0.000104038954,0.00012254718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026543657,0.000113798735,0.0002640667,0.00020437293,0.00013226156,0.00006300468,0.0008637617,0.00007980859,0.000014494105],"category_scores_gemma":[0.0058570486,0.00007742992,0.00008153242,0.0019062383,0.000039475595,0.00011409771,0.0003003282,0.00032078565,0.000011491461],"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.00016245767,0.000036150333,0.6404352,0.00001159917,0.000021271078,6.322506e-7,0.004056776,0.34967917,0.0025297017,0.00023584113,0.000024510067,0.002806663],"study_design_scores_gemma":[0.0124218,0.00036764366,0.37001258,0.00031677834,0.00016802509,0.000018510198,0.1878705,0.36204937,0.006177277,0.00054462993,0.058806688,0.0012461938],"about_ca_topic_score_codex":0.0003768116,"about_ca_topic_score_gemma":0.00026822663,"teacher_disagreement_score":0.27042264,"about_ca_system_score_codex":0.00012641978,"about_ca_system_score_gemma":0.00012759923,"threshold_uncertainty_score":0.70118576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770745,0.00060488464,0.00005438751,0.008844958,0.00008992329,0.00010869545,0.000007856333,0.000008464751,0.013206315],"genre_scores_gemma":[0.9968685,0.000053483447,0.0021515633,0.000026658925,0.000047792124,0.00004833018,0.000008155953,0.0000061023293,0.0007894512],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99748,0.00045373465,0.0006588186,0.0005185127,0.00049520755,0.00039372846],"domain_scores_gemma":[0.9978553,0.00094583177,0.000080470025,0.00060248753,0.0003819987,0.00013390816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004873866,0.00007767412,0.00025844906,0.0011396122,0.00017040662,0.00048590542,0.00042135647,0.000054744425,0.0007829824],"category_scores_gemma":[0.0042561414,0.00006559059,0.000037786533,0.0026908594,0.00016252842,0.0006636863,0.00025405013,0.0004079429,0.000072337665],"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.000020912154,0.00012589792,0.9683579,0.000005584237,0.0000076128936,0.000020625484,0.0012139968,0.00015841851,0.00061396265,0.017570943,0.00030530334,0.011598847],"study_design_scores_gemma":[0.001658952,0.00009403842,0.47970703,0.00025401532,0.0000019351578,0.000007460397,0.034393955,0.0071333977,0.0059014536,0.35096925,0.11944702,0.0004314793],"about_ca_topic_score_codex":0.00082788616,"about_ca_topic_score_gemma":0.0071761203,"teacher_disagreement_score":0.48865086,"about_ca_system_score_codex":0.00012058753,"about_ca_system_score_gemma":0.00027878137,"threshold_uncertainty_score":0.8573108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6795154,0.00396672,0.31332514,0.0013175899,0.00052019826,0.00024363004,5.811793e-7,0.00006705844,0.0010436375],"genre_scores_gemma":[0.98590297,0.00027496996,0.009566732,0.00014842329,0.0006492312,0.000016927559,0.0000014439998,0.00003487014,0.0034044404],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944194,0.00024529028,0.00080512493,0.00048094583,0.00082182494,0.0032273945],"domain_scores_gemma":[0.99615407,0.002710456,0.00039446654,0.00032223834,0.00029116395,0.00012762377],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01913977,0.00021650428,0.00040015552,0.00076348253,0.0007427772,0.0005565114,0.00078366423,0.000139245,0.00004228251],"category_scores_gemma":[0.0084772045,0.00018413262,0.0002561194,0.0016285836,0.000042072294,0.0007137082,0.00007341156,0.001882959,0.00024642507],"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.00085722504,0.0004939309,0.21292521,0.00003162579,0.00046379137,0.00006310875,0.0015571114,0.17849626,0.008754214,0.14169465,0.00045613144,0.45420673],"study_design_scores_gemma":[0.0026596903,0.00020265896,0.0018129542,0.0002631822,0.00006150085,0.00075112795,0.001571559,0.16006078,0.00022873617,0.8290759,0.0027974807,0.0005144816],"about_ca_topic_score_codex":0.000052248255,"about_ca_topic_score_gemma":0.0002614173,"teacher_disagreement_score":0.6873812,"about_ca_system_score_codex":0.0007040901,"about_ca_system_score_gemma":0.0015794488,"threshold_uncertainty_score":0.99987483},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616244,0.0001685473,0.030260425,0.005420249,0.00004644249,0.00094316574,0.000027909633,0.000025292842,0.0014835799],"genre_scores_gemma":[0.97100717,0.000029260269,0.022400897,0.000033235447,0.000014996046,0.0010140177,0.000032020766,0.00001684126,0.005451552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599046,0.00058918144,0.00051541993,0.000698155,0.0016650633,0.00054175133],"domain_scores_gemma":[0.9975688,0.0003731877,0.000024527175,0.00081484043,0.001023451,0.00019522615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030055675,0.00012577753,0.0001977266,0.00081384165,0.0004987098,0.00042021842,0.0004646736,0.000056727287,0.00046577438],"category_scores_gemma":[0.0010404146,0.00009328038,0.000028061888,0.0056978,0.00007890751,0.00035201578,0.00011329981,0.00037351786,0.0004907508],"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.00008148993,0.0015049127,0.10567558,0.000008354422,0.000038730872,0.00007159794,0.0028338206,0.87444735,0.0026307213,0.007124347,0.00038591347,0.0051971646],"study_design_scores_gemma":[0.003813003,0.0006449915,0.34579656,0.00026086622,0.000030263,0.00002605071,0.033398096,0.5970035,0.0031274187,0.003537745,0.011326888,0.0010346029],"about_ca_topic_score_codex":0.00070801197,"about_ca_topic_score_gemma":0.119454056,"teacher_disagreement_score":0.27744383,"about_ca_system_score_codex":0.00031259278,"about_ca_system_score_gemma":0.00075013126,"threshold_uncertainty_score":0.8966136},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07008233,0.0019515444,0.9135186,0.01358021,0.00016873516,0.00023468261,2.9836445e-7,0.000042930777,0.00042066717],"genre_scores_gemma":[0.96835226,0.00012563316,0.029891359,0.0004556949,0.00017302643,0.000007500652,5.1525154e-7,0.000009072963,0.0009849188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964843,0.00073045626,0.00053856184,0.0002764777,0.00069048227,0.0012797408],"domain_scores_gemma":[0.99775803,0.0013333455,0.00022203707,0.0002430762,0.00031700789,0.00012649517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028525114,0.0001322459,0.00031802207,0.00028516984,0.0007603125,0.00066721445,0.00048725368,0.000055519136,0.00001540638],"category_scores_gemma":[0.004736982,0.00007309719,0.00014715752,0.00088690914,0.000075023265,0.00026035233,0.000046497942,0.0011245194,0.000041840172],"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.00064262556,0.0000647603,0.00063281,3.8576565e-7,0.000088031375,9.023149e-7,0.0012876434,0.0025004323,0.00012383105,0.55611,0.0001281416,0.43842041],"study_design_scores_gemma":[0.0063379584,0.0003633146,0.0003849202,0.000023419148,0.00007578694,0.00035178833,0.0042703887,0.0071120095,0.00011983114,0.9769935,0.0037931467,0.00017391746],"about_ca_topic_score_codex":0.00002114492,"about_ca_topic_score_gemma":0.000065050524,"teacher_disagreement_score":0.89826995,"about_ca_system_score_codex":0.0001292825,"about_ca_system_score_gemma":0.0006036441,"threshold_uncertainty_score":0.9886292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432424,0.0014645103,0.039074782,0.0007212524,0.0010492966,0.00030365257,0.000063291314,0.00002169731,0.014059121],"genre_scores_gemma":[0.9974898,0.00007967621,0.0017530859,0.00009520938,0.00008377417,0.000003300844,0.0000059909503,0.000010562981,0.0004785766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647975,0.00007697431,0.0009572504,0.00016645317,0.0020648413,0.00025472385],"domain_scores_gemma":[0.9971849,0.00044096168,0.0011930915,0.0006219572,0.0004700366,0.00008909954],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021329874,0.00014131816,0.00030756576,0.00013948226,0.0013013819,0.00015505953,0.0010618398,0.00005364784,0.0007062604],"category_scores_gemma":[0.0004984774,0.00007335527,0.00030127206,0.00075333554,0.00021736149,0.00017834084,0.00025514918,0.00044691426,0.000004946422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007923619,0.00007853279,0.005080554,0.0000052781525,0.000056267276,7.097838e-7,0.0023238068,0.9785236,0.00007993067,0.0021961546,0.00015256205,0.011423366],"study_design_scores_gemma":[0.008824462,0.0020298471,0.117467605,0.0010800678,0.0017928284,0.00063406373,0.25479302,0.5548309,0.02375463,0.024227586,0.008287432,0.002277572],"about_ca_topic_score_codex":0.00002305054,"about_ca_topic_score_gemma":0.000058020025,"teacher_disagreement_score":0.4236927,"about_ca_system_score_codex":0.0005341136,"about_ca_system_score_gemma":0.00028525243,"threshold_uncertainty_score":0.9999988},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98175246,0.00017768453,0.012908502,0.0017392138,0.00028459588,0.00079494546,0.00040503909,0.000008382605,0.0019291725],"genre_scores_gemma":[0.99745333,0.00002015916,0.001139291,0.000017134673,0.000034563447,0.000005601378,0.000014242723,0.00000146928,0.0013141779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831176,0.000044848715,0.0004072474,0.0000793349,0.0010382055,0.00011862759],"domain_scores_gemma":[0.9960761,0.0016146448,0.00015291524,0.00020063928,0.0018937793,0.00006193811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054526133,0.00005041868,0.00013455338,0.0002723038,0.000409984,0.00018781179,0.00021696571,0.00008033853,0.000052475578],"category_scores_gemma":[0.001955194,0.00003163476,0.000034510285,0.0002956198,0.00031654994,0.0008714244,0.000069250316,0.00017379834,0.000008316059],"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.00012537348,0.000017093822,0.0060281497,0.000071731745,0.00003233678,1.9393033e-7,0.0027819339,0.003359052,0.00024883164,0.9711222,0.0032815426,0.012931561],"study_design_scores_gemma":[0.0012681948,0.00010994827,0.1334793,0.000064500215,0.000015873284,0.000022644008,0.0360306,0.15433764,0.0006052608,0.0039268,0.6699835,0.0001557325],"about_ca_topic_score_codex":0.001593419,"about_ca_topic_score_gemma":0.0007908096,"teacher_disagreement_score":0.9671954,"about_ca_system_score_codex":0.000008964419,"about_ca_system_score_gemma":0.00036781523,"threshold_uncertainty_score":0.31533068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97257215,0.00004735036,0.02547651,0.0001441523,0.00023727096,0.00023311564,0.00008162515,0.000058014662,0.0011498265],"genre_scores_gemma":[0.97112757,0.000004135332,0.02606266,0.000031865227,0.00009002228,8.484268e-7,0.00001203673,0.000006407602,0.002664447],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984291,0.000073598945,0.00019154097,0.0003513564,0.0007121357,0.00024223058],"domain_scores_gemma":[0.9979298,0.0004942504,0.00019066207,0.00030821864,0.0009773996,0.0000996645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018844295,0.000028598031,0.0001932939,0.000074006755,0.00086255406,0.00037757392,0.0008045598,0.000067025394,0.00016665147],"category_scores_gemma":[0.0011559287,0.00009120462,0.00013995868,0.0005616608,0.00037340936,0.00026728286,0.00017369045,0.00007156938,0.0000833612],"study_design_candidate":"observational","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.000011917459,0.00013694084,0.107182,0.000005262419,0.000037565133,0.0000039702118,0.00031098194,0.000008275631,0.00003763024,0.00001678118,0.0063267504,0.8859219],"study_design_scores_gemma":[0.0007415561,0.00010854978,0.9840674,0.000069966314,0.00002923309,0.00001305483,0.002234576,0.0011981027,0.0000010811067,0.0032464007,0.008180645,0.00010947822],"about_ca_topic_score_codex":0.014978787,"about_ca_topic_score_gemma":0.08641522,"teacher_disagreement_score":0.88581246,"about_ca_system_score_codex":0.00003560431,"about_ca_system_score_gemma":0.00008731136,"threshold_uncertainty_score":0.99158055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18506481,0.0021702251,0.804883,0.0007555467,0.0003685151,0.00017709071,0.000007157989,0.0001921884,0.006381441],"genre_scores_gemma":[0.6589419,0.00004425802,0.34028965,0.000086680884,0.000051632735,0.0000053797135,0.0000037419154,0.000010958743,0.00056575873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980122,0.000053809268,0.00084131275,0.0001583563,0.0006469368,0.00028739762],"domain_scores_gemma":[0.9967833,0.0021639331,0.00023937135,0.0002760734,0.0004159848,0.00012134928],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0021001382,0.00013761071,0.00032144354,0.00027982076,0.00012091399,0.00019358392,0.00020128717,0.00012691642,0.000109394095],"category_scores_gemma":[0.017764699,0.00011811545,0.00007557842,0.0010582252,0.00003364161,0.00008480459,0.00006343729,0.00035400497,0.000065158776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039596507,0.00048484054,0.00144343,0.000488065,0.0002675445,0.000022268925,0.008320853,0.54391253,0.0038020047,0.17461824,0.009196332,0.2574043],"study_design_scores_gemma":[0.0003187075,0.00010223936,0.001925942,0.00019147269,0.000055194458,0.000105569874,0.00037038996,0.9663506,0.0019462927,0.0029501326,0.025390584,0.00029284979],"about_ca_topic_score_codex":0.0000060594944,"about_ca_topic_score_gemma":1.5766729e-7,"teacher_disagreement_score":0.47387713,"about_ca_system_score_codex":0.000021645797,"about_ca_system_score_gemma":0.000077074335,"threshold_uncertainty_score":0.9905091},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736189,0.00031545575,0.016733635,0.0055493806,0.00044884934,0.0003890023,0.0000067324368,0.000036296602,0.0029017527],"genre_scores_gemma":[0.96218425,0.00007204234,0.029107656,0.000031305517,0.00007278707,0.00003985445,0.000007701483,0.000007601318,0.00847678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99822664,0.00013725428,0.00042586136,0.00057328155,0.00046854027,0.0001684221],"domain_scores_gemma":[0.9990409,0.000024929192,0.00008591235,0.00044666513,0.0003731912,0.000028386019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116664,0.00010292704,0.00018484367,0.0002703184,0.00026930904,0.00009067483,0.0001114036,0.00002069824,0.00014496269],"category_scores_gemma":[0.0006671547,0.00008646466,0.000033375392,0.0015054281,0.00005275776,0.0004291208,0.0000846509,0.000084827094,0.000039708142],"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.00006997528,0.0022022033,0.05608256,0.000118158554,0.00034796845,0.00002354457,0.0029580272,0.81269896,0.025877468,0.014799296,0.0011789284,0.08364292],"study_design_scores_gemma":[0.0040759444,0.0004346863,0.577078,0.00065601064,0.0006882074,0.00013370492,0.011310665,0.18411848,0.18111907,0.02282167,0.01528469,0.0022788853],"about_ca_topic_score_codex":0.000013953236,"about_ca_topic_score_gemma":0.00018164761,"teacher_disagreement_score":0.62858045,"about_ca_system_score_codex":0.00002533346,"about_ca_system_score_gemma":0.000042070184,"threshold_uncertainty_score":0.35259265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917217,0.00079864636,0.0006171042,0.0054671466,0.00021108569,0.00030256464,0.0000026051548,0.0000024148164,0.00087674527],"genre_scores_gemma":[0.99585384,0.0001668864,0.002866978,0.00004773322,0.000079635814,0.000005197014,8.743302e-8,0.000006065704,0.00097354973],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99669677,0.00046365638,0.0006329927,0.00016823146,0.0017145526,0.00032379315],"domain_scores_gemma":[0.99413806,0.0043199016,0.0004112289,0.00038412973,0.0006962949,0.00005040141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02531221,0.000075681695,0.00023835395,0.00013032637,0.0004093394,0.0003470475,0.0009310829,0.000052655658,0.000021247119],"category_scores_gemma":[0.0017399032,0.00003541043,0.0003245654,0.00078945234,0.00026104518,0.00033427926,0.0002783365,0.00064787536,0.000003967493],"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.0009767318,0.0011668147,0.5764567,0.00055990467,0.0018058575,0.000020766114,0.08106852,0.08464838,0.026076222,0.070172384,0.09389731,0.063150406],"study_design_scores_gemma":[0.003946694,0.0010395398,0.24076056,0.0010482218,0.00011243786,0.00009301018,0.44106042,0.025822546,0.00310723,0.25897786,0.023669668,0.00036182578],"about_ca_topic_score_codex":0.000024399764,"about_ca_topic_score_gemma":0.000014837765,"teacher_disagreement_score":0.3599919,"about_ca_system_score_codex":0.0000608098,"about_ca_system_score_gemma":0.00022017545,"threshold_uncertainty_score":0.8772757},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76375836,0.00044139705,0.23252569,0.0015671264,0.00020996743,0.00006904564,0.0000087117505,0.00005517781,0.0013645381],"genre_scores_gemma":[0.4663688,0.000009675717,0.5284241,0.0002712071,0.00006922767,0.000005607097,0.0000020366535,0.000009010134,0.004840357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765617,0.0001480626,0.00037734848,0.00058080076,0.0008013185,0.0004362859],"domain_scores_gemma":[0.9979089,0.0007250923,0.000030421983,0.0005255356,0.0004717949,0.000338253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011186159,0.0001253266,0.00024315715,0.00024278105,0.00032086374,0.0005040684,0.00032009324,0.00006328524,0.00063134066],"category_scores_gemma":[0.0016933837,0.000100992,0.000067989335,0.0010221783,0.0000994679,0.0001301829,0.0002367183,0.000150848,0.000646405],"study_design_candidate":"design_other","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.000018853765,0.00023633328,0.016492741,0.0000047533367,0.000058742742,0.00027193254,0.001336663,0.010538367,0.005218605,0.0051955823,0.0012210481,0.9594064],"study_design_scores_gemma":[0.0013492745,0.00026357968,0.0711026,0.000057636695,0.000058737478,0.0005080715,0.0077517997,0.87792367,0.025232082,0.0044472343,0.010629953,0.00067534513],"about_ca_topic_score_codex":0.0000516343,"about_ca_topic_score_gemma":0.00002731896,"teacher_disagreement_score":0.95873106,"about_ca_system_score_codex":0.000015538273,"about_ca_system_score_gemma":0.00015669134,"threshold_uncertainty_score":0.8308444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77217555,0.023945693,0.19902714,0.0020168892,0.002315898,0.0003582128,0.000006467558,0.000038051465,0.00011610202],"genre_scores_gemma":[0.96338505,0.000042337477,0.036027934,0.000039671617,0.00040800736,0.000012300239,0.0000027304977,0.00002842234,0.000053540676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9973927,0.00012653541,0.00089707767,0.0003158846,0.0007415972,0.0005262148],"domain_scores_gemma":[0.9974235,0.0011074746,0.00033540855,0.00027229317,0.0006486804,0.00021263737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013037532,0.00018880505,0.0005111106,0.00086165505,0.00018876689,0.00015537988,0.00032562035,0.00010881413,0.000004535619],"category_scores_gemma":[0.00089538685,0.00017443219,0.000252334,0.0010186112,0.000027110427,0.00011193483,0.000029610082,0.0004832279,0.000002432618],"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.00008077016,0.000080631144,0.023345029,0.00017044021,0.000068191854,0.00035612332,0.0071232473,0.69349164,0.0001683485,0.0013139361,0.000082241815,0.27371937],"study_design_scores_gemma":[0.008072675,0.0010322034,0.61998713,0.0492071,0.0004232175,0.0019106381,0.047958612,0.25786105,0.0040476806,0.005971257,0.0018816573,0.0016467663],"about_ca_topic_score_codex":0.0000033172473,"about_ca_topic_score_gemma":0.000005705046,"teacher_disagreement_score":0.59664214,"about_ca_system_score_codex":0.0006391308,"about_ca_system_score_gemma":0.00015656135,"threshold_uncertainty_score":0.71131384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851761,0.00014232729,0.0010232875,0.00036106276,0.003245143,0.0001154933,0.000022000992,0.00005768928,0.009856914],"genre_scores_gemma":[0.99595267,0.000011271133,0.0034707487,0.00010460942,0.000020037525,0.0000023040548,0.000004586541,0.000011413397,0.00042236238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968685,0.00009437454,0.00096864015,0.00039525444,0.0012108734,0.00046238655],"domain_scores_gemma":[0.9961182,0.0019560347,0.00047171852,0.0006606277,0.000615548,0.00017791255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046210843,0.00017344263,0.00042908275,0.00046642244,0.00026354956,0.00010582268,0.00070541195,0.00012533422,0.000113328715],"category_scores_gemma":[0.0034759617,0.00014829634,0.00017227365,0.0012519246,0.00029664687,0.00022990124,0.0001445806,0.00026198677,0.00023322075],"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.000108981505,0.0004937586,0.32735318,0.000019431338,0.00020421535,0.00007266048,0.0015321365,0.0002368782,0.010877458,0.6254759,0.008486568,0.02513888],"study_design_scores_gemma":[0.0031582885,0.00030331616,0.028178578,0.00011444725,0.00010655985,0.00006414163,0.016193211,0.0016962748,0.07576853,0.86891097,0.004841515,0.0006641677],"about_ca_topic_score_codex":0.000101314625,"about_ca_topic_score_gemma":0.000015863845,"teacher_disagreement_score":0.2991746,"about_ca_system_score_codex":0.00006533903,"about_ca_system_score_gemma":0.00012829917,"threshold_uncertainty_score":0.60473496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033352748,0.000073683084,0.9613279,0.002699256,0.00012562102,0.00087252154,0.00005356137,0.000108809276,0.0013858699],"genre_scores_gemma":[0.69190973,0.0000013874752,0.30706698,0.00014998853,0.00004117538,0.00012674225,0.0000063643984,0.0000069810944,0.0006906211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762475,0.00014763212,0.0005446732,0.00049359276,0.00092135504,0.00026797017],"domain_scores_gemma":[0.9975288,0.00047157562,0.00019538534,0.0006921434,0.0009958526,0.00011624887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002310444,0.00013130717,0.0002081342,0.00024293292,0.00033070173,0.000061361505,0.0006285663,0.000039915438,0.000041044834],"category_scores_gemma":[0.0016364662,0.000077572906,0.000114998875,0.0018103836,0.0001566207,0.0002469001,0.000108824555,0.00015837414,0.0006629087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019554402,0.0039981976,0.008039261,0.000020823747,0.00035466216,0.000009058534,0.008675389,0.4605327,0.008682805,0.07999591,0.011739562,0.41775608],"study_design_scores_gemma":[0.0030101489,0.0005254056,0.09631767,0.00006620073,0.00011177267,0.00012385118,0.0047207405,0.4852293,0.028392805,0.36586717,0.014822899,0.0008120274],"about_ca_topic_score_codex":0.0008412986,"about_ca_topic_score_gemma":0.00010630823,"teacher_disagreement_score":0.658557,"about_ca_system_score_codex":0.00010484265,"about_ca_system_score_gemma":0.00022622151,"threshold_uncertainty_score":0.85205716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005983163,0.00083012995,0.9925289,0.0006916767,0.0009087156,0.0005674573,0.0000073924048,0.00011577748,0.0037516484],"genre_scores_gemma":[0.25531015,0.000008909886,0.7415598,0.0006001325,0.0010016568,0.000037292084,0.000019983201,0.000052653028,0.0014093948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415773,0.00011243746,0.0008858834,0.0020687866,0.0018832621,0.0008919165],"domain_scores_gemma":[0.9933529,0.0032674642,0.00051791966,0.0016269904,0.0010266555,0.0002080924],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008434647,0.00047065094,0.0006585843,0.0007731252,0.0014411822,0.0020714367,0.0034726188,0.0003556135,0.000051787345],"category_scores_gemma":[0.0026686704,0.00031670407,0.00031343315,0.001251592,0.00083421747,0.00047812163,0.0003385468,0.001431109,0.00002490019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005918723,0.000028789847,0.000113662136,0.000009747479,0.000012092632,0.0000036973677,0.00094508997,0.78095996,0.00032291675,0.010473122,0.000009385824,0.20711562],"study_design_scores_gemma":[0.0001836657,0.00010450905,0.000044804823,0.00014411501,0.000026137908,0.000047658177,0.00001907214,0.89858216,0.00031201835,0.09864862,0.0014618736,0.00042534282],"about_ca_topic_score_codex":0.00002380238,"about_ca_topic_score_gemma":0.000034967474,"teacher_disagreement_score":0.25471184,"about_ca_system_score_codex":0.00015462817,"about_ca_system_score_gemma":0.0009891621,"threshold_uncertainty_score":0.9999285},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059610535,0.00035645693,0.0033594545,0.04044406,0.006316318,0.0042156056,0.00040264803,0.00019928397,0.93874514],"genre_scores_gemma":[0.18136387,0.004754662,0.033457223,0.00031357232,0.0005759914,0.0016741693,0.00044985095,0.00010774083,0.7773029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9620379,0.00079420867,0.003382852,0.0050572148,0.025849864,0.0028779604],"domain_scores_gemma":[0.98108596,0.0008319023,0.00017032855,0.0035986626,0.013549634,0.0007635185],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch","sts","open_science","insufficient_payload"],"category_scores_codex":[0.049070086,0.00094397546,0.00090846885,0.024668321,0.007363386,0.016482513,0.016951278,0.0003742834,0.008361289],"category_scores_gemma":[0.012899669,0.0009242734,0.000332305,0.014354338,0.0133631015,0.012743978,0.010224816,0.0030865502,0.0024004336],"study_design_candidate":"theoretical_or_conceptual","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.000099784374,0.0004318749,0.00020223163,0.000027750433,0.00012006565,0.00033688446,0.00074827776,0.25186503,0.00043746244,0.7396385,0.0021551088,0.003937],"study_design_scores_gemma":[0.002713996,0.00035011582,0.005907955,0.0017666616,0.0000537637,0.00015784561,0.02119872,0.30027342,0.00096168433,0.086057685,0.5780784,0.0024797528],"about_ca_topic_score_codex":0.0012147536,"about_ca_topic_score_gemma":0.021143695,"teacher_disagreement_score":0.65358084,"about_ca_system_score_codex":0.005933845,"about_ca_system_score_gemma":0.0027628762,"threshold_uncertainty_score":0.9993208},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859022,0.00006514831,0.008481338,0.0006041754,0.0032134599,0.0003017387,0.00012624329,0.0001513613,0.0011543512],"genre_scores_gemma":[0.9820055,0.000009038814,0.001714648,0.0005420956,0.00014952151,0.00057998055,0.000016578166,0.000020137408,0.014962516],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721515,0.00009368807,0.00069282926,0.00044916468,0.001071697,0.00047749226],"domain_scores_gemma":[0.99818856,0.00040723447,0.00024521272,0.00057704997,0.0003028591,0.00027911455],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016558181,0.00012240448,0.00019814142,0.00036780778,0.003205596,0.0009835748,0.0003832874,0.00007095438,0.008540369],"category_scores_gemma":[0.0004943753,0.00016830562,0.00017025437,0.001894069,0.000074288306,0.0006671524,0.00002236463,0.00044945785,0.00059687276],"study_design_candidate":"design_other","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.00006728919,0.0036151486,0.013440105,0.000012242315,0.00010459195,0.00013948319,0.014158562,0.12550524,0.000049875678,0.00015358331,0.016041081,0.8267128],"study_design_scores_gemma":[0.0065322467,0.003890687,0.09786702,0.00008409856,0.0004919949,0.022918774,0.3735143,0.066518806,0.0004780317,0.04873909,0.37434626,0.0046186913],"about_ca_topic_score_codex":0.0051117307,"about_ca_topic_score_gemma":0.0050067757,"teacher_disagreement_score":0.8220941,"about_ca_system_score_codex":0.0010093381,"about_ca_system_score_gemma":0.00059019745,"threshold_uncertainty_score":0.9980921},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9483114,0.0017572517,0.042005677,0.004984284,0.0010181163,0.0005020114,0.0008943466,0.00008586981,0.0004410275],"genre_scores_gemma":[0.9967451,0.000004879253,0.0015112989,0.00041917106,0.000093815834,0.00014518776,0.00003451586,0.00001133128,0.0010347036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.998018,0.00034089165,0.00046460613,0.00034062812,0.0005929356,0.00024290782],"domain_scores_gemma":[0.99517125,0.0035844634,0.00024656652,0.0005860357,0.00029374275,0.00011792212],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029460099,0.00009257086,0.0001911131,0.00026509314,0.0018968298,0.00012050512,0.0005686159,0.00004146806,0.0006777499],"category_scores_gemma":[0.0048994627,0.000067236826,0.00019410826,0.0009041288,0.00017599999,0.00010820323,0.00019775354,0.00020772105,0.000020315729],"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.00023638835,0.00024546686,0.0029527382,0.000051123276,0.00018966982,0.00017780608,0.012788963,0.75778025,0.0014962131,0.18535352,0.035011686,0.003716168],"study_design_scores_gemma":[0.003479909,0.00043680827,0.0004634447,0.000014267803,0.00029746885,0.0016151521,0.40890723,0.027081702,0.00042697112,0.37562096,0.18113081,0.00052526605],"about_ca_topic_score_codex":0.00040128303,"about_ca_topic_score_gemma":0.00045533007,"teacher_disagreement_score":0.7306985,"about_ca_system_score_codex":0.00013087306,"about_ca_system_score_gemma":0.00064179226,"threshold_uncertainty_score":0.9994026},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010476939,0.0003061477,0.005938618,0.0011769115,0.0009696438,0.00008133634,0.000024108562,0.0001244729,0.9913683],"genre_scores_gemma":[0.0016271592,0.00008419475,0.0016582258,0.00062888034,0.0002814548,0.0000014903745,0.000012297711,0.000027297678,0.995679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997223,0.000019765179,0.00058224,0.0005971332,0.0012960932,0.00028173887],"domain_scores_gemma":[0.997802,0.00059157866,0.00020883222,0.00091024686,0.0002994882,0.00018782956],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011255561,0.00023002045,0.00037695956,0.00043006337,0.00014458958,0.00022021799,0.0007666355,0.00027691433,0.018065557],"category_scores_gemma":[0.0006507913,0.00016263206,0.0003481431,0.000099642966,0.00011619937,0.00007814403,0.0001244767,0.00032757793,0.021845756],"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.0000073963292,0.000015242456,0.000100935074,0.000001008214,0.00005569733,0.000033616245,0.00002917415,0.00007094574,0.0000026013556,0.541195,0.43558773,0.022900661],"study_design_scores_gemma":[0.00008485294,0.00001358048,0.00002690571,0.000018013077,0.000022420625,0.00001532419,0.000007947984,0.0001782731,0.0000021611495,0.14120781,0.8582487,0.00017399571],"about_ca_topic_score_codex":0.000050080413,"about_ca_topic_score_gemma":0.000075992626,"teacher_disagreement_score":0.42266098,"about_ca_system_score_codex":0.00004400515,"about_ca_system_score_gemma":0.000099284785,"threshold_uncertainty_score":0.9828321},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07067696,0.00069022784,0.9118166,0.012312028,0.004036172,0.00014496209,0.000073290415,0.000024250552,0.00022552986],"genre_scores_gemma":[0.9391239,0.00008846346,0.058886703,0.00022016051,0.00091971236,0.0000022123284,0.0000014015344,0.000015837013,0.000741609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635875,0.00016377961,0.0012877387,0.0002014316,0.0017463589,0.00024191313],"domain_scores_gemma":[0.98052084,0.012165661,0.001110337,0.00028173503,0.005803005,0.0001184143],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0071593598,0.00013519911,0.00028232284,0.0003979785,0.00019999457,0.00032328733,0.0015638631,0.000069724454,0.00014314553],"category_scores_gemma":[0.033492252,0.00006158485,0.00032974465,0.00037470835,0.00013852531,0.0003051463,0.00007531747,0.00019495098,0.00006099596],"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.0015753931,0.000517161,0.010604353,0.000011154712,0.004266797,0.00013320147,0.0013584386,0.58192265,0.020861045,0.06311371,0.026609292,0.2890268],"study_design_scores_gemma":[0.0074041546,0.00050527364,0.0040937685,0.00050602015,0.00079659384,0.0005438767,0.0012435035,0.27745432,0.0077398084,0.4290588,0.26999417,0.0006597042],"about_ca_topic_score_codex":0.0000061787237,"about_ca_topic_score_gemma":0.0000023052546,"teacher_disagreement_score":0.86844695,"about_ca_system_score_codex":0.00007310171,"about_ca_system_score_gemma":0.00019856782,"threshold_uncertainty_score":0.9746491},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045248568,0.00006664322,0.9407977,0.0005188224,0.00021615945,0.00044210587,0.000011078522,0.00021163106,0.012487303],"genre_scores_gemma":[0.58530754,3.008096e-7,0.41386703,0.00038340446,0.00006832036,0.00002514005,7.4598495e-7,0.000014878477,0.00033266132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415195,0.00010383338,0.00067994645,0.0016359676,0.0024232534,0.0010050354],"domain_scores_gemma":[0.99544114,0.0011028145,0.00026174882,0.0014426003,0.0011909417,0.0005607829],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0133691905,0.00030672195,0.0005936409,0.0007607211,0.0015185189,0.0009573218,0.0021577894,0.000051761534,0.00020695783],"category_scores_gemma":[0.0022571299,0.0001955994,0.00012415797,0.0042769206,0.0013281368,0.00037428466,0.0004052689,0.00024040115,0.0009491954],"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.00033707914,0.00027639535,0.00019546325,0.0000107001615,0.00039769182,0.000020737927,0.0065254136,0.39208135,0.45151925,0.03346332,0.0018287041,0.11334388],"study_design_scores_gemma":[0.00031660864,0.00016614981,0.00022125205,0.000010285208,0.00023260896,0.000020923693,0.00013123023,0.7992118,0.048810665,0.14726633,0.0031655815,0.0004465707],"about_ca_topic_score_codex":0.00005787492,"about_ca_topic_score_gemma":0.0000157349,"teacher_disagreement_score":0.540059,"about_ca_system_score_codex":0.00007883309,"about_ca_system_score_gemma":0.00047244556,"threshold_uncertainty_score":0.9998287},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075203698,0.0007767794,0.003943324,0.00013100136,0.0021447244,0.00006965737,0.0000201125,0.00028583946,0.99262106],"genre_scores_gemma":[0.00061356736,0.000008916804,0.0086010555,0.000074295065,0.0015965737,0.0000031906027,0.000009487945,0.00013037564,0.98896253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980084,0.000075420554,0.00025143614,0.00046108034,0.0010003151,0.00020335929],"domain_scores_gemma":[0.9985126,0.00015665828,0.00015283216,0.00089313055,0.0001987572,0.00008598268],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005435577,0.00013130967,0.00023032301,0.00056085805,0.0000899038,0.00023026625,0.0007473103,0.00023889223,0.15186232],"category_scores_gemma":[0.0013345311,0.00008861682,0.00014098187,0.00045267132,0.000116134426,0.000027188058,0.00011148072,0.000083773244,0.09237964],"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":[9.493886e-7,0.0000036874856,0.00009231464,0.0000011969511,0.000011871057,0.000001532109,0.000038267008,5.349739e-7,7.756371e-7,0.00094702514,0.997182,0.0017198247],"study_design_scores_gemma":[0.00007403773,0.000011679255,0.000053352393,0.000021098056,0.000016785873,0.0000015136237,0.00024483586,0.000014857667,0.00001767309,0.00204954,0.9973754,0.000119222816],"about_ca_topic_score_codex":0.0005656131,"about_ca_topic_score_gemma":0.00143172,"teacher_disagreement_score":0.05948268,"about_ca_system_score_codex":0.000013134276,"about_ca_system_score_gemma":0.00011930987,"threshold_uncertainty_score":0.90832704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97433543,0.00016693107,0.00016007324,0.017696103,0.002189726,0.0002721172,0.000019094587,0.00004699061,0.005113511],"genre_scores_gemma":[0.99265635,0.0000053957224,0.004746161,0.0001431335,0.00018223251,0.000021202417,0.000001321259,0.000014654204,0.002229543],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983879,0.000010837227,0.00037736015,0.00027017604,0.00064671814,0.00030705685],"domain_scores_gemma":[0.9958706,0.00016904804,0.0008975198,0.00026585843,0.0025698277,0.00022717842],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002578863,0.00012867013,0.0001953958,0.0003242515,0.00097024353,0.00083710015,0.00077246816,0.00013256275,0.00002238054],"category_scores_gemma":[0.02682013,0.00010789706,0.000064791566,0.00068557606,0.000061754945,0.000528296,0.000072366885,0.00025351936,0.000020336352],"study_design_candidate":"observational","study_design_consensus":"observational","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.0000013046366,0.000064299515,0.92185634,0.00002361071,0.00008354629,7.2533204e-8,0.0009646349,0.0007165799,0.00095354626,0.054522913,0.017583514,0.003229654],"study_design_scores_gemma":[0.00021805975,0.000012718221,0.9655821,0.00013436949,0.000052502553,0.0000043477075,0.0010353683,0.0135788545,0.0011139008,0.0049078967,0.013097632,0.00026227758],"about_ca_topic_score_codex":0.0070229233,"about_ca_topic_score_gemma":0.002941898,"teacher_disagreement_score":0.049615014,"about_ca_system_score_codex":0.000606815,"about_ca_system_score_gemma":0.0010725895,"threshold_uncertainty_score":0.9995894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523157,0.00008061927,0.0437824,0.0005555504,0.000712092,0.00009149756,0.000022165643,0.000006108449,0.0024338681],"genre_scores_gemma":[0.9918191,0.00011703224,0.006104122,0.000012253496,0.000069094036,0.0000024805895,2.8298706e-7,0.0000055072355,0.0018701331],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964934,0.000103056904,0.0011975134,0.00018568146,0.0018838412,0.00013652864],"domain_scores_gemma":[0.9959623,0.0006620709,0.0016865385,0.0002501921,0.0013705933,0.000068286325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020378723,0.00010001382,0.0002583486,0.0006485664,0.000037124893,0.000044729266,0.0012762927,0.000039509257,0.0003030916],"category_scores_gemma":[0.0011996556,0.00006453439,0.00018083771,0.00030791917,0.00020844869,0.00049830304,0.00014381055,0.00007312304,0.000025349067],"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.00094016845,0.0012031246,0.5587358,0.000045657314,0.00078468374,0.00031303157,0.0014768902,0.0011555419,0.013075962,0.01819943,0.0042572324,0.39981246],"study_design_scores_gemma":[0.003941468,0.0014031468,0.807948,0.0024060179,0.00022456968,0.0001163747,0.006916325,0.0024561766,0.12777926,0.04345866,0.00284233,0.0005076859],"about_ca_topic_score_codex":0.000029248158,"about_ca_topic_score_gemma":0.000018938319,"teacher_disagreement_score":0.39930478,"about_ca_system_score_codex":0.00004756532,"about_ca_system_score_gemma":0.0000721445,"threshold_uncertainty_score":0.33186403},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22490649,0.0004094972,0.7726607,0.00039244222,0.0004180352,0.00031395318,0.00003641661,0.00009280632,0.00076967344],"genre_scores_gemma":[0.45365638,0.000012709614,0.54558223,0.00006471852,0.00013326608,0.000053994947,0.000031763575,0.000016307335,0.00044859396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995249,0.00027340255,0.001211322,0.0013176454,0.0016124748,0.0003361608],"domain_scores_gemma":[0.9945184,0.00041186408,0.0004658387,0.0026539597,0.0016270124,0.00032295097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831756,0.00025512167,0.0006282452,0.0005826594,0.00013786094,0.0005191907,0.0015562142,0.0003233097,0.0004943319],"category_scores_gemma":[0.0018724039,0.00022121164,0.00026832893,0.001335636,0.000072336254,0.000119577264,0.00074843987,0.0004328602,0.00024768503],"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.0000072834932,0.00030928839,0.0011733867,0.000016559814,0.000060908224,0.0000035460914,0.00084052247,0.3586708,0.0020449893,0.00054879114,0.0001199969,0.6362039],"study_design_scores_gemma":[0.00016453394,0.00009507961,0.0046219183,0.00007070812,0.000079698424,0.000006717504,0.002547021,0.97508246,0.0030433636,0.012189551,0.0016669808,0.0004319892],"about_ca_topic_score_codex":0.0006087017,"about_ca_topic_score_gemma":0.000107450935,"teacher_disagreement_score":0.63577193,"about_ca_system_score_codex":0.000053505002,"about_ca_system_score_gemma":0.0005406231,"threshold_uncertainty_score":0.9020749},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6750367,0.00008413778,0.29475486,0.010919713,0.0008171635,0.0011835513,0.000067695575,0.0003344677,0.016801685],"genre_scores_gemma":[0.9882074,0.0000017066369,0.003421061,0.0009562904,0.00026022218,0.00006201645,0.0000824533,0.000032051325,0.0069767865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996199,0.00023997364,0.0010638009,0.00078786496,0.0009555132,0.0007538582],"domain_scores_gemma":[0.9947931,0.0016327815,0.00034320596,0.0010768962,0.0016096506,0.000544356],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013360503,0.0003118138,0.00037452113,0.0010944399,0.0011188918,0.0017434827,0.0009152015,0.00022828556,0.00857947],"category_scores_gemma":[0.004617799,0.0002808372,0.00017540611,0.00113632,0.00012119489,0.0019267664,0.0000998673,0.00037509523,0.005513953],"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.000010243972,0.000040371295,0.015075626,0.0000041238127,0.000057453828,0.0000014303716,0.003942274,0.9126183,0.00047237505,0.003473585,0.0072977953,0.057006415],"study_design_scores_gemma":[0.0003387466,0.00003030326,0.022731723,0.000056669967,0.000028583745,0.0000027862832,0.0019094594,0.9234249,0.00003349536,0.012145666,0.038940977,0.00035669724],"about_ca_topic_score_codex":0.023171505,"about_ca_topic_score_gemma":0.031465944,"teacher_disagreement_score":0.3131707,"about_ca_system_score_codex":0.00025165788,"about_ca_system_score_gemma":0.00078010577,"threshold_uncertainty_score":0.99996436},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02001409,0.019652007,0.11328462,0.0044125584,0.034823615,0.004535072,0.0003619194,0.00061205303,0.8023041],"genre_scores_gemma":[0.26291475,0.00037904608,0.0331196,0.0003134106,0.002770845,0.0005112987,0.00012543172,0.000110149704,0.6997555],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945455,0.00007352537,0.0012913896,0.00077824324,0.0025669446,0.0007443635],"domain_scores_gemma":[0.99535984,0.0017108114,0.0005619094,0.0011591805,0.0009981244,0.00021012765],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015152718,0.00029178703,0.0007162873,0.0007674175,0.00013530403,0.00027818457,0.0008651745,0.0004545662,0.0020807344],"category_scores_gemma":[0.010448391,0.00020338298,0.00045345095,0.0012274977,0.00004549538,0.00015859932,0.00016598543,0.00042003792,0.00059297646],"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.000038657956,0.00024501065,0.05213295,0.000020630065,0.00009809692,0.0000035434518,0.00013175153,0.00031107574,0.000009785342,0.00041895657,0.45249537,0.49409416],"study_design_scores_gemma":[0.00044313516,0.00007933205,0.012399619,0.00016882211,0.0001048734,0.000006077815,0.0002443041,0.00016521553,0.00007812442,0.0055418448,0.98024684,0.0005218066],"about_ca_topic_score_codex":0.00042202548,"about_ca_topic_score_gemma":0.00036736386,"teacher_disagreement_score":0.52775145,"about_ca_system_score_codex":0.00028829984,"about_ca_system_score_gemma":0.0011847966,"threshold_uncertainty_score":0.9988315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22490649,0.0004094972,0.7726607,0.00039244222,0.0004180352,0.00031395318,0.00003641661,0.00009280632,0.00076967344],"genre_scores_gemma":[0.45365638,0.000012709614,0.54558223,0.00006471852,0.00013326608,0.000053994947,0.000031763575,0.000016307335,0.00044859396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995249,0.00027340255,0.001211322,0.0013176454,0.0016124748,0.0003361608],"domain_scores_gemma":[0.9945184,0.00041186408,0.0004658387,0.0026539597,0.0016270124,0.00032295097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831756,0.00025512167,0.0006282452,0.0005826594,0.00013786094,0.0005191907,0.0015562142,0.0003233097,0.0004943319],"category_scores_gemma":[0.0018724039,0.00022121164,0.00026832893,0.001335636,0.000072336254,0.000119577264,0.00074843987,0.0004328602,0.00024768503],"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.0000072834932,0.00030928839,0.0011733867,0.000016559814,0.000060908224,0.0000035460914,0.00084052247,0.3586708,0.0020449893,0.00054879114,0.0001199969,0.6362039],"study_design_scores_gemma":[0.00016453394,0.00009507961,0.0046219183,0.00007070812,0.000079698424,0.000006717504,0.002547021,0.97508246,0.0030433636,0.012189551,0.0016669808,0.0004319892],"about_ca_topic_score_codex":0.0006087017,"about_ca_topic_score_gemma":0.000107450935,"teacher_disagreement_score":0.63577193,"about_ca_system_score_codex":0.000053505002,"about_ca_system_score_gemma":0.0005406231,"threshold_uncertainty_score":0.9020749},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4074819,0.0005657808,0.47981754,0.10770027,0.0016877133,0.0007821784,0.000014957651,0.00003380581,0.0019158554],"genre_scores_gemma":[0.9547358,0.000013096192,0.04393078,0.00018193733,0.0008500713,0.000042061267,6.510776e-7,0.000022764443,0.00022280947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.98952204,0.0015798205,0.001858452,0.000544825,0.005513966,0.000980873],"domain_scores_gemma":[0.988436,0.004505278,0.0005419374,0.0007164681,0.005336097,0.00046421654],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06261413,0.00017995738,0.00042765096,0.0019074926,0.0029300596,0.0013031068,0.0028919086,0.000060358827,0.00042885588],"category_scores_gemma":[0.037637614,0.00011979592,0.00019360203,0.012132966,0.00028895366,0.00033708473,0.001164584,0.0016110069,0.000422069],"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.00016940663,0.00019924353,0.0004252985,0.0000071015784,0.0000345171,0.000035268302,0.0042742835,0.83725774,0.0033746415,0.011839632,0.0011299811,0.14125286],"study_design_scores_gemma":[0.00020904515,0.0012847834,0.0033987442,0.00065871247,0.00009060104,0.0010522717,0.33589327,0.2877712,0.014341719,0.29454616,0.05958728,0.0011662265],"about_ca_topic_score_codex":0.00018649753,"about_ca_topic_score_gemma":0.00009266419,"teacher_disagreement_score":0.5494866,"about_ca_system_score_codex":0.0002666551,"about_ca_system_score_gemma":0.0014232991,"threshold_uncertainty_score":0.9997336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975629,0.0006487964,0.00041488052,0.00039084355,0.00027758145,0.00002503421,0.000009667859,0.000004857939,0.0006654307],"genre_scores_gemma":[0.9986997,0.000039445033,0.0009473349,0.000035691875,0.000103132224,5.6521867e-7,7.5982865e-7,0.000003068026,0.00017029366],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983633,0.0002864224,0.00040204191,0.00012580249,0.000677269,0.00014513759],"domain_scores_gemma":[0.9991244,0.00034112058,0.00030167087,0.00007045928,0.000079639656,0.00008267278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035340877,0.000069398084,0.00017651387,0.000477285,0.0005799739,0.00009170544,0.0002390863,0.000019636493,0.00006223322],"category_scores_gemma":[0.00030500835,0.00005460147,0.000042277698,0.00019714721,0.000051821564,0.00054735196,0.00013681702,0.0008301288,0.0000010212552],"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.000026360907,0.000050067938,0.97666293,0.0000034989082,0.0000115145585,0.0000144346695,0.0026832272,0.0075877737,0.000034274417,0.0042677987,0.00017314851,0.008484939],"study_design_scores_gemma":[0.0018803603,0.00030961508,0.8525426,0.00014313718,0.00004049318,0.00055383844,0.10039885,0.032680623,0.00002236932,0.0041616117,0.0069998703,0.0002666341],"about_ca_topic_score_codex":0.00007548612,"about_ca_topic_score_gemma":0.000023427328,"teacher_disagreement_score":0.12412037,"about_ca_system_score_codex":0.00006221296,"about_ca_system_score_gemma":0.00015039134,"threshold_uncertainty_score":0.4460749},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98532027,0.0085529685,0.004453831,0.0011282895,0.00031134117,0.00013168801,0.000007819293,0.000022350074,0.00007144707],"genre_scores_gemma":[0.9979938,0.0012541267,0.000119547214,0.00003895426,0.00015113252,0.00001792095,0.0000012175884,0.000011944563,0.00041133608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966332,0.0006012185,0.00057564594,0.0002289254,0.0008107365,0.0011503298],"domain_scores_gemma":[0.9984342,0.0005372149,0.00047200266,0.00035141953,0.00014134317,0.0000638227],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.012386103,0.00010879163,0.00018404763,0.00024795593,0.0017408647,0.00011256218,0.0005953355,0.000028358196,0.0001757983],"category_scores_gemma":[0.00064326596,0.00006951005,0.00019953042,0.00083314587,0.000053867432,0.00015760932,0.000096671516,0.0015004385,0.000010448144],"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.00049657683,0.00060792046,0.019753382,0.000002454961,0.0007186473,0.00015798926,0.0037803056,0.16741006,0.0033576202,0.12176256,0.00015431065,0.68179816],"study_design_scores_gemma":[0.0052649914,0.0015657912,0.0039788573,0.000010364149,0.0001391007,0.05026158,0.07475164,0.0202737,0.0020565337,0.8278602,0.0132525,0.0005847626],"about_ca_topic_score_codex":0.00008037436,"about_ca_topic_score_gemma":0.0002168291,"teacher_disagreement_score":0.7060976,"about_ca_system_score_codex":0.0006057424,"about_ca_system_score_gemma":0.0015999158,"threshold_uncertainty_score":0.99955875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002656741,0.00047023382,0.9478179,0.001933841,0.0015411143,0.00029542574,0.000044976598,0.000098721604,0.047532067],"genre_scores_gemma":[0.6717065,0.000020744734,0.30863678,0.004504644,0.0012460416,0.000027376944,0.000028174773,0.000094545016,0.013735171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935082,0.00012849788,0.0008387032,0.0017467154,0.0031354171,0.0006424251],"domain_scores_gemma":[0.9928433,0.0046423473,0.00045442508,0.0014793702,0.00036584528,0.00021474845],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005526299,0.00040015066,0.00061824167,0.0016134328,0.00073624053,0.000579536,0.0029035276,0.00021957507,0.0018779708],"category_scores_gemma":[0.0028743537,0.00032901263,0.00024748888,0.0014012046,0.0018381198,0.00024794025,0.001292994,0.0012437196,0.00024572926],"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.000018515138,0.00004070428,0.0001258778,0.00000419682,0.000021507776,0.0001232074,0.0018117797,0.28386372,0.000037285314,0.047496088,0.00033171964,0.66612536],"study_design_scores_gemma":[0.00032420468,0.00017297623,0.00015506112,0.00011567245,0.000020383928,0.00012753255,0.000004707819,0.21142441,0.00011605639,0.63294923,0.15387201,0.00071774115],"about_ca_topic_score_codex":0.000033835182,"about_ca_topic_score_gemma":0.0000540477,"teacher_disagreement_score":0.67144084,"about_ca_system_score_codex":0.0003338351,"about_ca_system_score_gemma":0.0009105184,"threshold_uncertainty_score":0.9999162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076299526,0.00006119822,0.9198722,0.0016252655,0.0016990453,0.00031702028,0.00003314509,0.00007213301,0.000020459704],"genre_scores_gemma":[0.74877346,4.846927e-7,0.2507113,0.000103740946,0.00023510694,0.000050571492,0.000011660476,0.0000060447674,0.000107633816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573416,0.00036380853,0.00054021145,0.0007910422,0.0021976954,0.0003730828],"domain_scores_gemma":[0.99553585,0.0016822777,0.0003588553,0.0009434494,0.001385937,0.00009364168],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01770018,0.00012625632,0.00021296281,0.0006419831,0.0020002895,0.00043449373,0.0020198417,0.000023916722,0.000093499984],"category_scores_gemma":[0.0013454235,0.000091346046,0.000090129775,0.004068346,0.00043395918,0.0007920165,0.00022507588,0.000196,0.0000074240065],"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.000008584255,0.00012226315,0.00009247586,0.0000022960135,0.0000073273886,2.3755993e-7,0.00085586065,0.27984488,0.0046575842,0.0010587143,0.00039683876,0.712953],"study_design_scores_gemma":[0.0002582361,0.00024812086,0.008212372,0.0000031893853,0.000017222294,0.0000074427403,0.00031288827,0.9842823,0.0024601552,0.0013988308,0.0026839068,0.00011530674],"about_ca_topic_score_codex":0.000045119526,"about_ca_topic_score_gemma":0.0000037447753,"teacher_disagreement_score":0.71283764,"about_ca_system_score_codex":0.00009630643,"about_ca_system_score_gemma":0.00036868354,"threshold_uncertainty_score":0.999299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037062,0.00012264542,0.2957313,0.000084742416,0.00015205552,0.00012421407,0.00001282431,0.000014951877,0.00005104879],"genre_scores_gemma":[0.96449846,0.000009373095,0.03526385,0.00005813958,0.000024982879,0.0000036373065,0.0000014270586,0.00001117361,0.00012892604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442446,0.0009875909,0.0011483724,0.000468509,0.0025367131,0.00043438177],"domain_scores_gemma":[0.99251485,0.0018990487,0.0012407228,0.00029123746,0.0036338568,0.0004202749],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.018802073,0.00020308114,0.0006208733,0.0013592101,0.0010823861,0.00042188558,0.0011626554,0.00004522298,0.0001671603],"category_scores_gemma":[0.008584342,0.00013400777,0.00014826177,0.0043072104,0.00028484446,0.00084680656,0.00012710223,0.0007580094,0.0000032469347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011059605,0.00020557517,0.00090716936,0.0000031920251,0.000026004756,0.000007510018,0.0025438743,0.9260796,0.05037339,0.00006423587,0.000018268449,0.018665262],"study_design_scores_gemma":[0.0024737155,0.007445087,0.0137974005,0.00028455505,0.00008730485,0.0001469626,0.029993135,0.90809965,0.03425958,0.0028846958,0.000032994478,0.00049492606],"about_ca_topic_score_codex":0.00006928354,"about_ca_topic_score_gemma":9.2338166e-7,"teacher_disagreement_score":0.2607923,"about_ca_system_score_codex":0.0001501287,"about_ca_system_score_gemma":0.002172451,"threshold_uncertainty_score":0.99976677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016608018,0.0000836838,0.97567105,0.0028753267,0.0008898654,0.00080244977,0.0006337077,0.000037239395,0.0023986287],"genre_scores_gemma":[0.84927005,0.0000136978115,0.14020011,0.00008900544,0.00012660588,0.0017587633,0.00048688785,0.000026226779,0.008028634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99263275,0.0006766975,0.000903142,0.00078132696,0.0045126756,0.0004934329],"domain_scores_gemma":[0.99031276,0.00587955,0.00010840718,0.000420958,0.0031223644,0.00015594406],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008360413,0.00015771305,0.0002124071,0.0022934396,0.002706242,0.00040124566,0.0012122258,0.00007828424,0.0047698715],"category_scores_gemma":[0.008849786,0.00015563291,0.00013211143,0.0035540632,0.0001675042,0.00047817637,0.00017879534,0.0007570366,0.00004628832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023099793,0.0005468605,0.00008092987,0.0000010188388,0.000034356086,0.0000013837416,0.0005822184,0.9881369,0.00009205978,0.0063132937,0.0004451163,0.003534848],"study_design_scores_gemma":[0.00096649723,0.00013290792,0.00007348897,0.000009725586,0.0000062665777,0.000025670657,0.0027541227,0.98705715,0.000043058102,0.00272371,0.006052264,0.00015511458],"about_ca_topic_score_codex":0.000098603356,"about_ca_topic_score_gemma":0.000089935354,"teacher_disagreement_score":0.835471,"about_ca_system_score_codex":0.00127207,"about_ca_system_score_gemma":0.0009900059,"threshold_uncertainty_score":0.9994991},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015450682,0.98301667,0.000011332268,0.0018021526,0.00084366,0.0012120279,0.0001053114,0.000029552602,0.012977742],"genre_scores_gemma":[0.00008164751,0.994865,0.0031222159,0.0013235986,0.0000785651,0.00019685247,0.000011293389,0.000018879851,0.000301928],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99306315,0.0007816887,0.0018355313,0.0010621655,0.0025434578,0.0007139787],"domain_scores_gemma":[0.9946032,0.0018559946,0.0017394803,0.0012869086,0.00017793101,0.0003364945],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.014970046,0.0003573269,0.001606537,0.0006792503,0.0020252222,0.00024076164,0.004846232,0.00014539532,0.0009565825],"category_scores_gemma":[0.0032217493,0.0001906949,0.0006612395,0.008581802,0.0007532806,0.0001001361,0.0004911711,0.00078051584,0.00015327275],"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":[6.920904e-7,0.000030412326,0.000026215312,0.015486953,0.000047608388,0.000001567547,0.000308806,0.00024009742,1.225038e-7,0.067124836,0.0058264364,0.91090626],"study_design_scores_gemma":[0.000026388472,0.000014108366,0.0000011602789,0.020478897,0.00014162078,0.000016496268,0.00032458146,0.00003022422,4.886665e-7,0.005067829,0.9736823,0.00021591983],"about_ca_topic_score_codex":0.012356286,"about_ca_topic_score_gemma":0.017322121,"teacher_disagreement_score":0.9678559,"about_ca_system_score_codex":0.00021966788,"about_ca_system_score_gemma":0.009921052,"threshold_uncertainty_score":0.99995667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16741197,0.00012112798,0.6776153,0.14037266,0.0006715249,0.0008716408,0.000055902212,0.00024416423,0.012635742],"genre_scores_gemma":[0.8841279,0.000002397941,0.10657827,0.0017837437,0.00008282068,0.00018596646,0.000004303996,0.000011138797,0.0072234175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973659,0.00016178809,0.00039603122,0.0005873427,0.0011312028,0.00035772118],"domain_scores_gemma":[0.998514,0.00051053485,0.00008416651,0.0003657214,0.00021532715,0.00031026572],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003145868,0.0001125444,0.00017838599,0.00030375583,0.00072536746,0.0003333003,0.00018648716,0.000040440107,0.0011062592],"category_scores_gemma":[0.0022116147,0.00009365717,0.00006145174,0.0013275311,0.000032237003,0.00031890124,0.00042474584,0.00020511812,0.00061983406],"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.00068681146,0.0020621195,0.006359672,0.00001838631,0.000091548216,0.00003548799,0.0067080376,0.03279856,0.04468507,0.17645046,0.6914904,0.038613427],"study_design_scores_gemma":[0.0012325747,0.0013326616,0.008411858,0.000035459765,0.00007127336,0.00032341658,0.0043201703,0.054776322,0.0009786687,0.034076683,0.8937311,0.0007098105],"about_ca_topic_score_codex":0.00019065881,"about_ca_topic_score_gemma":0.00030523475,"teacher_disagreement_score":0.716716,"about_ca_system_score_codex":0.00008821838,"about_ca_system_score_gemma":0.0001394447,"threshold_uncertainty_score":0.9998069},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99295795,0.00057126326,0.0005852817,0.0029589788,0.001120471,0.00022039397,0.00032707414,0.000062316,0.0011962532],"genre_scores_gemma":[0.9480098,0.000007715504,0.050441306,0.00065799913,0.00023446987,0.000029822271,0.000022005095,0.000018702607,0.00057819264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961639,0.0011208861,0.0008960723,0.0006098429,0.00080287503,0.00040640403],"domain_scores_gemma":[0.9962117,0.0017103845,0.00040269835,0.001234787,0.0002757111,0.00016471594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045535867,0.0001816203,0.00047154358,0.00023828821,0.0010546639,0.000062730614,0.0008744108,0.000078925485,0.0017256164],"category_scores_gemma":[0.0027044532,0.00011958406,0.00032866106,0.0011672414,0.0002741167,0.00012321745,0.00035065942,0.00054948137,0.00015731658],"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.0009986124,0.0025051248,0.0169761,0.000024054187,0.00084874895,0.006471164,0.024419447,0.35363102,0.0066068694,0.007645903,0.0005886749,0.5792843],"study_design_scores_gemma":[0.007598984,0.008595644,0.019265767,0.000048796897,0.0009823596,0.025940182,0.29278326,0.51465863,0.0011407608,0.03365009,0.09264193,0.0026935663],"about_ca_topic_score_codex":0.00022414577,"about_ca_topic_score_gemma":0.00016369276,"teacher_disagreement_score":0.5765907,"about_ca_system_score_codex":0.00004600939,"about_ca_system_score_gemma":0.00020242065,"threshold_uncertainty_score":0.99918693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075678374,0.00019644064,0.9755639,0.008605346,0.0020787844,0.0018228138,0.00034308937,0.00021704695,0.0036047285],"genre_scores_gemma":[0.8462817,0.000015317766,0.14913645,0.00072398246,0.00029327456,0.001306471,0.000104062674,0.00004425941,0.0020944702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943129,0.00045454077,0.001151417,0.0010962673,0.0023741305,0.0006107414],"domain_scores_gemma":[0.99413717,0.0037376564,0.0005665079,0.00063336163,0.0007569777,0.00016830738],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004667276,0.00035444184,0.0003984918,0.000458556,0.0032909913,0.00063668477,0.0012160221,0.00008926374,0.000654687],"category_scores_gemma":[0.00052854145,0.00027733436,0.0003607447,0.001847671,0.00048558603,0.00045566462,0.00013434548,0.0007147267,0.00012620664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018844071,0.00018226233,0.00024625895,0.000011763945,0.00008259191,0.0000018128457,0.0013255402,0.89412636,0.00029312965,0.091814265,0.001910696,0.009816894],"study_design_scores_gemma":[0.00026602412,0.0006198317,0.00025236065,0.000017478835,0.00006371675,0.00014056021,0.013580191,0.87178713,0.0005151385,0.10542453,0.006894098,0.00043896976],"about_ca_topic_score_codex":0.00009272057,"about_ca_topic_score_gemma":0.000026120368,"teacher_disagreement_score":0.8387139,"about_ca_system_score_codex":0.00028146297,"about_ca_system_score_gemma":0.00054866885,"threshold_uncertainty_score":0.9999679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20329161,0.0012868157,0.7897628,0.0049467334,0.0001843218,0.0002512186,0.000002989979,0.0001083177,0.00016522816],"genre_scores_gemma":[0.9956469,0.00053384516,0.0015709038,0.00007209639,0.00029353276,0.000020488898,0.0000020352015,0.000020680582,0.0018394965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601775,0.00015832075,0.0005092218,0.00034909457,0.00073321676,0.0022324177],"domain_scores_gemma":[0.99726194,0.0017679,0.00016453522,0.00026415123,0.00044338088,0.000098080796],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01936746,0.00013680564,0.00020310013,0.00034386184,0.0015609158,0.0005392628,0.00061438046,0.00008587484,0.000012210448],"category_scores_gemma":[0.0014668043,0.00008323271,0.00013207886,0.0017365741,0.00014005169,0.00021263892,0.000104668274,0.0014868039,0.000095371055],"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.00014198957,0.00005143633,0.00093709497,0.00000665368,0.0002870625,0.0000033788115,0.0014652851,0.06966735,0.008133479,0.28893834,0.00021195217,0.630156],"study_design_scores_gemma":[0.0012390492,0.00036914766,0.00069769187,0.000074389674,0.00007612783,0.00029650674,0.02422744,0.44605172,0.0027893241,0.5221899,0.0016608511,0.00032782208],"about_ca_topic_score_codex":0.00003342327,"about_ca_topic_score_gemma":0.00018388759,"teacher_disagreement_score":0.7923553,"about_ca_system_score_codex":0.00021269318,"about_ca_system_score_gemma":0.0014255457,"threshold_uncertainty_score":0.99973893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41998717,0.00052657473,0.5775335,0.0004646993,0.0004429664,0.00012286403,0.000004329245,0.00007841794,0.00083947286],"genre_scores_gemma":[0.88302255,0.000013476345,0.1161428,0.00045716405,0.0002621913,0.000001749291,9.732295e-7,0.00002111982,0.000077954006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646723,0.000042203148,0.0011084158,0.00036359008,0.0014400639,0.0005784887],"domain_scores_gemma":[0.99719703,0.0011824281,0.0004107397,0.0002684426,0.0005908237,0.0003505069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058515845,0.0002163156,0.0004173293,0.0010533731,0.0005168524,0.0009011379,0.00048815084,0.00008658995,0.000020687494],"category_scores_gemma":[0.0013883434,0.00013197707,0.00013869403,0.0023478651,0.0000678999,0.000499357,0.000119345976,0.0007863483,0.000115842704],"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.00009477432,0.00017519071,0.003227175,0.00007847109,0.00032436982,0.00010555479,0.012232958,0.22287156,0.0012582068,0.0055377944,0.0005153183,0.75357866],"study_design_scores_gemma":[0.0010666639,0.00065496657,0.005440661,0.0030464763,0.000060275182,0.0007800845,0.0024717394,0.9750239,0.00039368842,0.003808784,0.0068584243,0.0003943178],"about_ca_topic_score_codex":0.000017185748,"about_ca_topic_score_gemma":0.000002329741,"teacher_disagreement_score":0.7531843,"about_ca_system_score_codex":0.0000709731,"about_ca_system_score_gemma":0.0003440598,"threshold_uncertainty_score":0.8689693},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96533,0.0086027365,0.014634971,0.003126704,0.003006412,0.0013477004,0.0003344486,0.000570226,0.003046803],"genre_scores_gemma":[0.96717453,0.00045023023,0.017973954,0.000032169875,0.001032725,0.00008261502,0.000054141336,0.00010919967,0.013090433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98926044,0.0017801882,0.0009258197,0.0017599703,0.005001784,0.0012718114],"domain_scores_gemma":[0.9874952,0.0076731215,0.0002427661,0.0019917618,0.002082125,0.00051501853],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.028666148,0.00033809376,0.00071682595,0.0028577894,0.001221509,0.0023169979,0.0016055807,0.0005278858,0.00042409453],"category_scores_gemma":[0.028217131,0.00028150296,0.00029944416,0.0032846706,0.00035911382,0.00022442677,0.0042708535,0.0025859072,0.0018193218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057881436,0.0016655022,0.21334054,0.0027330143,0.001979852,0.0014722248,0.012875856,0.29206848,0.011428877,0.020759342,0.16421416,0.2768833],"study_design_scores_gemma":[0.00094836915,0.00018872136,0.06534683,0.0021814373,0.00014283531,0.000053252537,0.004943539,0.5274977,0.0006872585,0.3646317,0.031973284,0.0014050768],"about_ca_topic_score_codex":0.0016795386,"about_ca_topic_score_gemma":0.00011998817,"teacher_disagreement_score":0.34387237,"about_ca_system_score_codex":0.00017731,"about_ca_system_score_gemma":0.00093123433,"threshold_uncertainty_score":0.9999637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556123,0.0006490466,0.04137502,0.0009244258,0.0010107914,0.00028808176,0.00002345308,0.000044924738,0.00007195612],"genre_scores_gemma":[0.8590944,0.00011642699,0.14024934,0.00016633904,0.00024420157,0.000031956482,0.000020845806,0.000018187386,0.000058333786],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816084,0.000046279005,0.0006700433,0.00026241713,0.00059909566,0.0002613099],"domain_scores_gemma":[0.998159,0.0007783017,0.00031346915,0.0002520038,0.00027318942,0.00022404891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016610803,0.00013885772,0.00029587327,0.0007289487,0.0003178807,0.00018440068,0.0004287415,0.000075383374,0.00002813259],"category_scores_gemma":[0.0008465176,0.000118127144,0.000118642856,0.0010465912,0.0000810097,0.0002573864,0.00014771496,0.0001125958,0.000020752015],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027913274,0.0011163898,0.004097091,0.000038217117,0.0006083968,0.00012207325,0.022143818,0.37975618,0.5022487,0.0071744868,0.041840266,0.038063034],"study_design_scores_gemma":[0.013260954,0.0076004798,0.0077858777,0.00032853906,0.00035132933,0.0005486027,0.06585818,0.4566504,0.36227414,0.06073105,0.022489356,0.0021210827],"about_ca_topic_score_codex":0.000009490159,"about_ca_topic_score_gemma":0.0000012464529,"teacher_disagreement_score":0.13997456,"about_ca_system_score_codex":0.0000432359,"about_ca_system_score_gemma":0.000049762584,"threshold_uncertainty_score":0.48170853},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19085826,0.00003603466,0.7855503,0.009606624,0.00055712584,0.0009000292,0.000086285334,0.00016655237,0.01223878],"genre_scores_gemma":[0.95412046,0.0000073315055,0.03608081,0.00004251873,0.0001592635,0.0007621468,0.000056498215,0.000021982893,0.008748994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99290985,0.00041875907,0.0006650598,0.00084102835,0.004527937,0.00063739106],"domain_scores_gemma":[0.9941348,0.0027136065,0.00005200465,0.00042378716,0.00244993,0.00022590546],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008583586,0.00016910554,0.00021824859,0.0031814957,0.0006423566,0.0010641053,0.0012895238,0.000101808204,0.0006438409],"category_scores_gemma":[0.0048499554,0.00012987922,0.00008463616,0.006324872,0.00022951904,0.0006946705,0.00007895298,0.0008509014,0.0010879039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016151398,0.0003732241,0.00057040656,0.0000034787597,0.000054718603,0.000006431533,0.0015065894,0.97295576,0.0001127548,0.009886738,0.00031757122,0.014050834],"study_design_scores_gemma":[0.0009947212,0.0002986677,0.0040978626,0.00017897476,0.000009032015,0.00003836471,0.013207688,0.95609665,0.00017372116,0.012689224,0.011820475,0.00039460955],"about_ca_topic_score_codex":0.00045666762,"about_ca_topic_score_gemma":0.0008335019,"teacher_disagreement_score":0.7632622,"about_ca_system_score_codex":0.00026405873,"about_ca_system_score_gemma":0.00074013334,"threshold_uncertainty_score":0.9999729},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7768209,0.000042210748,0.11144666,0.0004010423,0.00022744424,0.000100584504,0.0000018728597,0.00002431705,0.110934995],"genre_scores_gemma":[0.973661,0.000004246314,0.010030152,0.00006776273,0.000010434419,0.0000018496996,0.0000012376631,0.000003625488,0.016219657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986174,0.000057268848,0.00042804063,0.00022647386,0.00053204637,0.00013873671],"domain_scores_gemma":[0.9987957,0.000584411,0.00011636535,0.00029748745,0.00017723118,0.000028839277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022736108,0.000051444822,0.00016119698,0.0003553288,0.000023561437,0.000034754466,0.00022489676,0.00004612497,0.00076774514],"category_scores_gemma":[0.0005620017,0.00003850746,0.000060765433,0.00092043297,0.000024233832,0.000226519,0.00003006215,0.0000770163,0.00049060094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001961615,0.00008449627,0.08871439,0.000002293659,0.0000066467064,6.266873e-7,0.0010384183,0.8583353,0.000629193,0.045539882,0.0009894137,0.0046396996],"study_design_scores_gemma":[0.00064889964,0.00008813599,0.016386941,0.000025483634,0.000005843105,0.000002721364,0.0016370055,0.8580566,0.003763131,0.11111448,0.008081778,0.00018897261],"about_ca_topic_score_codex":0.00007584185,"about_ca_topic_score_gemma":0.000017328952,"teacher_disagreement_score":0.19684015,"about_ca_system_score_codex":0.000016860233,"about_ca_system_score_gemma":0.000062449006,"threshold_uncertainty_score":0.8406271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000081994585,0.0004539646,0.9962311,0.0004072278,0.0020635198,0.0006713497,0.000033596363,0.000058530906,0.00007251863],"genre_scores_gemma":[0.03861904,0.00004095575,0.9599033,0.00024450064,0.00031798048,0.000020442574,0.00000535957,0.00003565233,0.00081278814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966468,0.00007650365,0.00063768786,0.0009352064,0.0013357718,0.00036801788],"domain_scores_gemma":[0.9856509,0.01199199,0.00045853984,0.00093777897,0.00089619885,0.0000645853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045899,0.00027502596,0.0004366238,0.0009036224,0.00045440497,0.000302652,0.0020842124,0.0002366171,0.000038239446],"category_scores_gemma":[0.005553894,0.00016830073,0.00018107021,0.0011145344,0.0009357955,0.000178104,0.0003552327,0.0003889803,0.000017306154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012182962,0.0000065886593,0.0000137842835,0.000003728324,0.000014379767,0.0000011926406,0.00033491364,0.9056452,0.000032810032,0.0014544644,0.000036198024,0.09244458],"study_design_scores_gemma":[0.0001601817,0.000062041196,0.00018733335,0.00005379474,0.000019749106,0.0000042129063,0.0000013467946,0.7975034,0.0003029689,0.20149167,0.00005996404,0.00015333114],"about_ca_topic_score_codex":0.000018438297,"about_ca_topic_score_gemma":0.000031933378,"teacher_disagreement_score":0.20003721,"about_ca_system_score_codex":0.00007531149,"about_ca_system_score_gemma":0.00055649586,"threshold_uncertainty_score":0.6863104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14918837,0.0009781579,0.8464279,0.0009091106,0.00022116103,0.001876433,0.000050075105,0.00027977876,0.00006902627],"genre_scores_gemma":[0.9715149,0.000031366697,0.024875494,0.00006698225,0.0002696214,0.0016546479,0.00013473793,0.00005285511,0.0013994393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729794,0.0001466291,0.0005515902,0.0008715016,0.00065701857,0.0004753108],"domain_scores_gemma":[0.995078,0.0034620496,0.00029098507,0.0004998765,0.00032602515,0.00034306158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018581613,0.00025736837,0.0003841957,0.00064926385,0.0011696151,0.00068093004,0.00030039204,0.00013446879,0.000002735419],"category_scores_gemma":[0.002366648,0.00020522306,0.00006618433,0.0015355055,0.0000790742,0.00027593164,0.00009346552,0.00017422784,0.000058834314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012860745,0.0000577609,0.0050118766,0.00010204013,0.00009880029,0.000001191857,0.0021851694,0.96506286,0.0040466613,0.0006842472,0.0023968297,0.02022398],"study_design_scores_gemma":[0.0022993016,0.0008626419,0.008587875,0.00185067,0.00016428903,0.00006326329,0.015845213,0.9465645,0.0014134594,0.0016186811,0.019346615,0.001383506],"about_ca_topic_score_codex":0.00019068483,"about_ca_topic_score_gemma":0.000031948526,"teacher_disagreement_score":0.8223265,"about_ca_system_score_codex":0.00006397356,"about_ca_system_score_gemma":0.000121519115,"threshold_uncertainty_score":0.8995852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003556988,0.00042338425,0.9322259,0.0035321047,0.0006564771,0.0005309229,0.000021269938,0.00009846808,0.062475897],"genre_scores_gemma":[0.009013741,0.0014644593,0.9815759,0.0011925015,0.00019919784,0.000050737868,0.000056423043,0.00003090597,0.006416114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682176,0.000121718425,0.0011329071,0.0003251693,0.0012835718,0.00031485554],"domain_scores_gemma":[0.9936216,0.0019522022,0.00067684223,0.002555963,0.0011131108,0.00008032087],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009005613,0.00021071793,0.0002463195,0.0010462871,0.002842071,0.0022558118,0.0041429023,0.0001281502,0.000023860446],"category_scores_gemma":[0.0008076154,0.00012973095,0.000087586704,0.0016993334,0.0017729234,0.003967194,0.001200288,0.0006854201,0.00013916001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001427324,0.000010518056,0.00002781076,0.0000046420005,0.000010983813,1.8054197e-7,0.0040392596,0.6212995,0.0000010676338,0.16783065,0.00025170873,0.20652223],"study_design_scores_gemma":[0.00010285181,0.000009622389,0.00007597912,0.00013601272,0.000014750302,0.000017738168,0.00058680866,0.9694901,0.00000127096,0.012049248,0.01735652,0.00015910681],"about_ca_topic_score_codex":0.0000349277,"about_ca_topic_score_gemma":0.00001386294,"teacher_disagreement_score":0.34819055,"about_ca_system_score_codex":0.00011824912,"about_ca_system_score_gemma":0.00049660663,"threshold_uncertainty_score":0.99877995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11493118,0.0009180566,0.87589914,0.0025031508,0.002386639,0.00084438815,0.0003029734,0.000116741234,0.0020977394],"genre_scores_gemma":[0.966385,0.00003524135,0.03180921,0.000088759065,0.0005839295,0.000012384629,0.000004364419,0.00002595269,0.0010551475],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668604,0.0002686156,0.00091678125,0.00026525,0.0013329331,0.00053038646],"domain_scores_gemma":[0.99073243,0.006365327,0.0005326821,0.00027740374,0.0018755643,0.00021658542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00913065,0.00015362474,0.00048416902,0.0008430697,0.00038271083,0.00023134163,0.0005920401,0.000094541545,0.000051967614],"category_scores_gemma":[0.0069400407,0.000107859465,0.00037147276,0.0017840187,0.00006202631,0.00024551412,0.00010595014,0.00040861306,0.00029019342],"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.0037859848,0.002715258,0.043862287,0.00022729368,0.0030061458,0.0009171858,0.014835666,0.122419484,0.0049342536,0.13598384,0.39346236,0.27385023],"study_design_scores_gemma":[0.00808733,0.0036384624,0.031970292,0.00045378043,0.0007319005,0.00040967434,0.005467901,0.56743836,0.0031708714,0.2803535,0.09729783,0.000980109],"about_ca_topic_score_codex":0.000003412231,"about_ca_topic_score_gemma":0.000002098512,"teacher_disagreement_score":0.85145384,"about_ca_system_score_codex":0.000067140594,"about_ca_system_score_gemma":0.00026715404,"threshold_uncertainty_score":0.83083785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988506,0.002014932,0.096343435,0.0018534942,0.0005683428,0.00019780894,0.000004027263,0.000041356427,0.00012595637],"genre_scores_gemma":[0.8048002,0.00039075117,0.19394824,0.000070862065,0.00034558392,0.000013561351,0.0000014107454,0.000024678244,0.00040471918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965738,0.0001625404,0.0013099384,0.00043005944,0.000945358,0.0005783058],"domain_scores_gemma":[0.99602735,0.0025537836,0.000693439,0.00028741133,0.00018419477,0.00025380173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009741304,0.00020957217,0.0005887914,0.0012193667,0.0003698559,0.00034942597,0.0004845394,0.0001321254,0.000043829885],"category_scores_gemma":[0.006372861,0.00017132692,0.00026080167,0.0012228141,0.00010079235,0.0003439845,0.00012482055,0.00048542253,0.00010028907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046210663,0.00015630318,0.039117713,0.000037861617,0.00012575784,0.000118688746,0.0053325184,0.9251533,0.0028763262,0.0018810903,0.00017896971,0.024559353],"study_design_scores_gemma":[0.0054658526,0.00045138696,0.019048784,0.0012077279,0.00018484189,0.0002414911,0.026926525,0.8774019,0.00048417295,0.06169756,0.006156902,0.00073287793],"about_ca_topic_score_codex":0.0000136466715,"about_ca_topic_score_gemma":0.0000048201737,"teacher_disagreement_score":0.097604804,"about_ca_system_score_codex":0.00009653295,"about_ca_system_score_gemma":0.00014746758,"threshold_uncertainty_score":0.762937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6292856,0.0011011731,0.34472343,0.003413044,0.00025074763,0.00030232413,0.000094471696,0.00014873267,0.020680457],"genre_scores_gemma":[0.923237,0.00028506963,0.07491507,0.00003501233,0.0000194408,0.0000163784,0.0000766751,0.000020059522,0.0013952998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439543,0.002580829,0.0009665274,0.0007930286,0.0009158392,0.00034832372],"domain_scores_gemma":[0.9893136,0.004901508,0.0009029888,0.0019422107,0.0027542235,0.00018546867],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.014302552,0.0002658844,0.0005181754,0.0005871228,0.00052446494,0.0006357992,0.0011693421,0.00025380903,0.0000670446],"category_scores_gemma":[0.010008755,0.00026166002,0.00025569877,0.00092842185,0.00025476475,0.0002368855,0.0011201847,0.00055035506,0.000016600346],"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.000040323335,0.0006497636,0.048852697,0.0002124054,0.0003050439,0.000007533438,0.04392373,0.013431324,0.005299944,0.7360125,0.0014496641,0.14981504],"study_design_scores_gemma":[0.0014084781,0.0000021661642,0.083420314,0.004298868,0.00024890047,0.00003279193,0.0014118368,0.16645946,0.036212225,0.6953257,0.009866446,0.0013128332],"about_ca_topic_score_codex":0.0005302785,"about_ca_topic_score_gemma":0.0006871683,"teacher_disagreement_score":0.2939514,"about_ca_system_score_codex":0.000055207933,"about_ca_system_score_gemma":0.00024018863,"threshold_uncertainty_score":0.99998355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7597591,0.00020706671,0.2222566,0.0016283074,0.00724528,0.0012244949,0.0006810997,0.0012640866,0.0057339137],"genre_scores_gemma":[0.965297,0.00011665807,0.0028340165,0.00011929566,0.00023784334,0.000009098537,0.00005588033,0.00005645711,0.031273786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961501,0.0002033674,0.0005779325,0.0019077141,0.00042149678,0.0007394065],"domain_scores_gemma":[0.99294853,0.002663242,0.00051835924,0.002805406,0.0007352128,0.00032922797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031796717,0.00040558973,0.0006441403,0.0012068497,0.00048111563,0.00039333757,0.0038001388,0.0005023417,0.00013105872],"category_scores_gemma":[0.005658854,0.00041747757,0.00089081185,0.0018587528,0.00023033407,0.00026904777,0.0023971568,0.00067834964,0.0007720695],"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.0002171163,0.00021186007,0.010536534,0.000076006596,0.00057893415,0.00020190324,0.0004681451,0.45226026,0.000106208645,0.48003444,0.05465548,0.00065312214],"study_design_scores_gemma":[0.0007821331,0.000055873967,0.0021646926,0.00006760975,0.0002603553,0.0000020430252,0.00030875445,0.12970023,0.000052466195,0.85028005,0.015792256,0.00053354754],"about_ca_topic_score_codex":0.00035157014,"about_ca_topic_score_gemma":0.00047840108,"teacher_disagreement_score":0.3702456,"about_ca_system_score_codex":0.00017024437,"about_ca_system_score_gemma":0.00029824255,"threshold_uncertainty_score":0.9998277},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029673677,0.0001348365,0.96261066,0.0068988926,0.00027638033,0.00013189734,0.00013935247,0.00002459283,0.00010973153],"genre_scores_gemma":[0.66243005,0.00014721832,0.33265394,0.00018209129,0.0009007289,0.0000148709005,0.00031322677,0.000019569183,0.0033382964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977829,0.00012155325,0.00081275095,0.0002098855,0.0009003506,0.00017255747],"domain_scores_gemma":[0.99680954,0.00081275054,0.0005730962,0.0001398222,0.0015562703,0.00010854385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047396948,0.00009381733,0.00033198277,0.0011890937,0.0003041522,0.00021321361,0.0001987436,0.000072995346,0.00012559889],"category_scores_gemma":[0.00260397,0.00006389098,0.00035556295,0.002978401,0.00003187655,0.0003530129,0.000035967692,0.00010803379,0.000026395875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039307426,0.00005673497,0.0054309946,0.0000041853777,0.0006016673,7.1423204e-7,0.00020811145,0.9896104,0.00009603724,0.00060010905,0.0021030607,0.0012487277],"study_design_scores_gemma":[0.00041076436,0.000067723144,0.013509486,0.00000764842,0.000639085,0.000010096279,0.00012210601,0.97566885,0.000007854071,0.005412494,0.0040635397,0.00008033702],"about_ca_topic_score_codex":0.000014300398,"about_ca_topic_score_gemma":0.000013643642,"teacher_disagreement_score":0.63275635,"about_ca_system_score_codex":0.000027640112,"about_ca_system_score_gemma":0.00016379521,"threshold_uncertainty_score":0.31173834},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014193158,0.0012905954,0.54770845,0.0028528979,0.0043874434,0.022760285,0.011820973,0.0006394218,0.39434677],"genre_scores_gemma":[0.07632093,0.0003446921,0.7621809,0.000054149747,0.00009823462,0.0005325109,0.00039417,0.00024541604,0.15982899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958787,0.000007232904,0.001708085,0.00060911564,0.0012399543,0.0005569075],"domain_scores_gemma":[0.9973151,0.00069992733,0.00086804177,0.00031775457,0.0006133637,0.0001857873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028805372,0.00035788357,0.00073323335,0.0017162322,0.00015220573,0.0001603952,0.00059760374,0.00023981633,0.00009989485],"category_scores_gemma":[0.00083619007,0.00037071845,0.0001296175,0.00040905608,0.00016077893,0.00009904616,0.00012558399,0.00037234667,0.000067427376],"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.00001066474,0.000152721,0.00052844186,0.00068107934,0.00007505289,0.000021216201,0.0015096522,0.0005071588,0.000010188885,0.98454607,0.004766044,0.007191688],"study_design_scores_gemma":[0.0007594757,0.00009149594,0.0014194355,0.0025907033,0.00021424273,0.000005533173,0.0024053731,0.04452334,0.000015740425,0.90496784,0.04225285,0.000753969],"about_ca_topic_score_codex":0.0007344748,"about_ca_topic_score_gemma":0.0056981524,"teacher_disagreement_score":0.23451778,"about_ca_system_score_codex":0.00038013677,"about_ca_system_score_gemma":0.0002523538,"threshold_uncertainty_score":0.9998745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068102024,0.0005432337,0.9199854,0.0006528397,0.0029282493,0.00095953164,0.00012992065,0.0008174945,0.005881325],"genre_scores_gemma":[0.91395926,0.000017722015,0.07984215,0.00011773985,0.0004860774,0.00024315166,0.00005581399,0.000052979583,0.005225089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958776,0.00021700359,0.000991528,0.001032807,0.0012196105,0.0006614115],"domain_scores_gemma":[0.9937155,0.0043061893,0.0002705548,0.0006193689,0.0009167409,0.00017161958],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0060919803,0.0002981155,0.00043521624,0.0015026185,0.00062358746,0.0031374828,0.0011793228,0.00014211444,0.00017912927],"category_scores_gemma":[0.00120908,0.0002425115,0.00023933181,0.0038956539,0.00010105686,0.0017502776,0.00007847003,0.00033220084,0.00023027533],"study_design_candidate":"design_other","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.000020026731,0.00012351117,0.00044861482,0.000104106686,0.00011655823,0.000011414049,0.0006127786,0.0112581635,0.0031778764,0.001476182,0.004863496,0.97778726],"study_design_scores_gemma":[0.00054258475,0.00007081439,0.0025829587,0.00045399787,0.00011746631,0.0000036304828,0.00011959486,0.9586544,0.010421447,0.019149538,0.007456333,0.00042720512],"about_ca_topic_score_codex":0.00041656787,"about_ca_topic_score_gemma":0.00026760108,"teacher_disagreement_score":0.97736007,"about_ca_system_score_codex":0.00016036718,"about_ca_system_score_gemma":0.00043385045,"threshold_uncertainty_score":0.9978973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077518856,0.0052855513,0.9387007,0.021990808,0.0010235795,0.0005857385,0.000023237802,0.00090641907,0.030708808],"genre_scores_gemma":[0.58301914,0.000021711727,0.38425753,0.000390901,0.0005689388,0.00027321698,0.0000041357835,0.00002098448,0.031443466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982799,0.000050921484,0.00038326962,0.00041214668,0.0005987966,0.00027494418],"domain_scores_gemma":[0.9950629,0.0040678694,0.000041167063,0.00046893265,0.00029841135,0.000060738163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034512852,0.00010630246,0.00012433191,0.00023383585,0.00050716224,0.0005715504,0.0005902733,0.000071177725,0.00042458772],"category_scores_gemma":[0.0017395064,0.000053737396,0.00021489937,0.0010158212,0.00012246426,0.0002743228,0.00003566232,0.0001664037,0.0006102322],"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.000017735149,0.000057267946,0.00026504387,0.000012985764,0.00007651657,0.0000024931628,0.0003765142,0.0021403623,0.00054853613,0.6164362,0.17470482,0.20536152],"study_design_scores_gemma":[0.000055542005,0.000036113794,0.0001774007,0.000042693933,0.000038769464,0.000019299014,0.00079973915,0.2726293,0.0006931786,0.21079071,0.5145953,0.00012196284],"about_ca_topic_score_codex":0.000029190252,"about_ca_topic_score_gemma":0.000008063741,"teacher_disagreement_score":0.5822439,"about_ca_system_score_codex":0.000034476823,"about_ca_system_score_gemma":0.00019124524,"threshold_uncertainty_score":0.7843504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4459252,0.0022877723,0.54454005,0.000928142,0.005624606,0.000077348406,0.000034742705,0.000023325394,0.0005587916],"genre_scores_gemma":[0.99455976,0.00043876955,0.004078021,0.000025088279,0.00046438337,0.0000019241777,0.000003591239,0.000009109876,0.00041937217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954646,0.00016562142,0.0016861808,0.00023892651,0.002248366,0.00019629598],"domain_scores_gemma":[0.99332464,0.0031104437,0.00068589184,0.00026487073,0.0025412014,0.000072983596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006973351,0.00012605761,0.0002998858,0.0014340605,0.00018574967,0.0007712273,0.0013579959,0.00006236091,0.00024138301],"category_scores_gemma":[0.004063686,0.000078925856,0.0004031638,0.002450659,0.00024198981,0.00053827214,0.000080085774,0.00031108124,0.00007561227],"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.000035658966,0.000101199024,0.0010971867,0.000004090798,0.0010747559,0.00001166587,0.001090112,0.16306598,0.0015673701,0.01888951,0.00016588908,0.81289655],"study_design_scores_gemma":[0.000021996917,0.000093027644,0.004744153,0.0000905929,0.00038380048,0.000037758957,0.0006374037,0.9644988,0.0076026134,0.014772652,0.007008084,0.00010909404],"about_ca_topic_score_codex":0.000025935069,"about_ca_topic_score_gemma":0.000028240845,"teacher_disagreement_score":0.8127875,"about_ca_system_score_codex":0.000079960744,"about_ca_system_score_gemma":0.00017455117,"threshold_uncertainty_score":0.7436963},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.670335e-7,0.00025928835,0.0000017609972,0.00022054947,0.0011893093,0.00014761172,0.99766165,0.00023103457,0.00028821986],"genre_scores_gemma":[0.0000036621213,0.0000132589585,0.00017309023,0.00023575603,0.0010982512,0.00007450292,0.9958736,0.000037192258,0.0024907023],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951126,0.00017433353,0.00074994337,0.0013353497,0.0020060053,0.0006217503],"domain_scores_gemma":[0.99018055,0.0042573465,0.00047595246,0.0044853818,0.00034382837,0.0002569635],"candidate_categories":["metaresearch","metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016371838,0.0003363724,0.00060922635,0.0006586408,0.00036950124,0.0009249461,0.006023473,0.00045327563,0.29305267],"category_scores_gemma":[0.076257594,0.00027690938,0.00019697916,0.0020078628,0.0000203049,0.0003537121,0.0019043906,0.00080575695,0.4612129],"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.0000016558494,0.000013337712,2.8240768e-7,0.000022185122,0.000030134355,0.000051910465,0.000021796948,0.00004997248,8.404417e-8,8.872318e-7,0.9976658,0.0021419136],"study_design_scores_gemma":[0.00011226953,0.0000141047985,0.00008836406,0.0006268153,0.000033150554,0.0000132599125,0.00010486256,0.00060861185,3.019397e-7,0.0004638769,0.9975875,0.00034690846],"about_ca_topic_score_codex":0.000087198336,"about_ca_topic_score_gemma":0.00024938432,"teacher_disagreement_score":0.16816023,"about_ca_system_score_codex":0.00003355663,"about_ca_system_score_gemma":0.0006288035,"threshold_uncertainty_score":0.9999683},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.670335e-7,0.00025928835,0.0000017609972,0.00022054947,0.0011893093,0.00014761172,0.99766165,0.00023103457,0.00028821986],"genre_scores_gemma":[0.0000036621213,0.0000132589585,0.00017309023,0.00023575603,0.0010982512,0.00007450292,0.9958736,0.000037192258,0.0024907023],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951126,0.00017433353,0.00074994337,0.0013353497,0.0020060053,0.0006217503],"domain_scores_gemma":[0.99018055,0.0042573465,0.00047595246,0.0044853818,0.00034382837,0.0002569635],"candidate_categories":["metaresearch","metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016371838,0.0003363724,0.00060922635,0.0006586408,0.00036950124,0.0009249461,0.006023473,0.00045327563,0.29305267],"category_scores_gemma":[0.076257594,0.00027690938,0.00019697916,0.0020078628,0.0000203049,0.0003537121,0.0019043906,0.00080575695,0.4612129],"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.0000016558494,0.000013337712,2.8240768e-7,0.000022185122,0.000030134355,0.000051910465,0.000021796948,0.00004997248,8.404417e-8,8.872318e-7,0.9976658,0.0021419136],"study_design_scores_gemma":[0.00011226953,0.0000141047985,0.00008836406,0.0006268153,0.000033150554,0.0000132599125,0.00010486256,0.00060861185,3.019397e-7,0.0004638769,0.9975875,0.00034690846],"about_ca_topic_score_codex":0.000087198336,"about_ca_topic_score_gemma":0.00024938432,"teacher_disagreement_score":0.16816023,"about_ca_system_score_codex":0.00003355663,"about_ca_system_score_gemma":0.0006288035,"threshold_uncertainty_score":0.9999683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710485,0.00200841,0.0018730517,0.0044488087,0.009995175,0.00031475312,0.000015135214,0.00020634687,0.010089866],"genre_scores_gemma":[0.994577,0.0000074597497,0.0030065023,0.00005982059,0.000020951346,0.000012848691,8.500384e-7,0.000015839436,0.0022987195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975005,0.00021195588,0.0005823476,0.00042010893,0.0009973034,0.00028780897],"domain_scores_gemma":[0.9975262,0.0011906341,0.00013286508,0.0008062214,0.0002657278,0.00007832702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003414805,0.00013129489,0.00023634266,0.00020049668,0.00025175975,0.00039078106,0.0009623541,0.000090836285,0.00012665517],"category_scores_gemma":[0.0018766767,0.00007842829,0.00023962566,0.002220478,0.00013792847,0.00024100678,0.00022156425,0.00030823634,0.00039575293],"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.0000039584547,0.000064008345,0.0008127855,0.000010331924,0.000040604675,0.000006404715,0.00045983426,0.00092621974,0.0010722919,0.9927171,0.0022794295,0.0016070337],"study_design_scores_gemma":[0.00020703021,0.00003180978,0.0009075236,0.00012927521,0.000038010403,0.000023659788,0.00015821276,0.014636017,0.0015277725,0.9732109,0.009014355,0.00011545495],"about_ca_topic_score_codex":0.0000797238,"about_ca_topic_score_gemma":0.00000658446,"teacher_disagreement_score":0.023528554,"about_ca_system_score_codex":0.000049060764,"about_ca_system_score_gemma":0.0003281565,"threshold_uncertainty_score":0.5086735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045989747,0.00022170326,0.98320204,0.0072242133,0.00078976457,0.00037994917,0.0000047387734,0.0004261454,0.0031524966],"genre_scores_gemma":[0.8935397,0.000004328403,0.10410668,0.000119528784,0.00023406197,0.000063011656,0.00006818146,0.000026839092,0.0018376721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660045,0.0002818631,0.0007847264,0.0004963106,0.0014946018,0.00034202068],"domain_scores_gemma":[0.98858744,0.010499713,0.00014168659,0.000290473,0.00037011548,0.000110555906],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038158786,0.00017794706,0.0002050539,0.00028648556,0.00081699545,0.0023534892,0.00034157655,0.000092842485,0.000104512525],"category_scores_gemma":[0.003847372,0.0001130351,0.00017255059,0.0015643198,0.0001936804,0.00023305923,0.000059762737,0.00029758672,0.0028391539],"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.000016320195,0.00010625145,0.000009547225,0.00002028755,0.000032585514,0.0000051988127,0.00033282235,0.35281307,0.000002596851,0.40887418,0.0041930387,0.23359409],"study_design_scores_gemma":[0.000080779,0.00003980362,0.00007896649,0.00009588605,0.0000151592485,0.000010976291,0.00017964456,0.590021,0.000003293381,0.40352508,0.0058631147,0.000086306754],"about_ca_topic_score_codex":0.0000023624668,"about_ca_topic_score_gemma":0.0000033452395,"teacher_disagreement_score":0.88894075,"about_ca_system_score_codex":0.00008489951,"about_ca_system_score_gemma":0.00008144041,"threshold_uncertainty_score":0.99868214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030491468,0.0019937602,0.9641303,0.00081635383,0.0021293582,0.00016035223,0.00013120112,0.000041584957,0.00010562432],"genre_scores_gemma":[0.55872875,0.000058375794,0.4390264,0.000047156074,0.0009357127,0.0000044333538,0.0000015618226,0.000027435624,0.0011701875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691826,0.0001572473,0.0008800178,0.00032312042,0.0012470518,0.00047430146],"domain_scores_gemma":[0.99591815,0.0018928677,0.00028719718,0.00030411725,0.0013428475,0.00025479408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00693153,0.00016528847,0.00043284014,0.0005233811,0.00030548364,0.0006922976,0.0005521545,0.00012232328,0.0000840016],"category_scores_gemma":[0.003998083,0.000118627846,0.000411449,0.00088175945,0.00006428662,0.00036219566,0.00009143124,0.0006621763,0.00009378414],"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.00024679038,0.003840372,0.0068603205,0.00037823294,0.001141483,0.00057781464,0.0100817345,0.06960431,0.004907908,0.0074473736,0.03180982,0.86310387],"study_design_scores_gemma":[0.0006636076,0.00021077195,0.00060333125,0.00013311287,0.000088987596,0.00014903753,0.0006220239,0.97248894,0.00038199386,0.0074215224,0.017087432,0.00014925678],"about_ca_topic_score_codex":0.00000646569,"about_ca_topic_score_gemma":0.000009868093,"teacher_disagreement_score":0.9028846,"about_ca_system_score_codex":0.000078830584,"about_ca_system_score_gemma":0.00053513725,"threshold_uncertainty_score":0.6675841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109974295,0.028486798,0.4525932,0.012822676,0.007833617,0.0026079009,0.00020103657,0.0054786326,0.38000184],"genre_scores_gemma":[0.037196014,0.00014515837,0.8935342,0.0001846906,0.00031425734,0.0000426372,0.000085264524,0.00011497007,0.068382815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923839,0.0017045715,0.0014367688,0.0019757277,0.0017036989,0.00079536426],"domain_scores_gemma":[0.99520874,0.0019966597,0.0005851203,0.001588955,0.00029945662,0.00032107104],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012568125,0.00054144644,0.00096902536,0.0014354999,0.000679961,0.0010138319,0.0013546513,0.00040403273,0.0005811571],"category_scores_gemma":[0.0017273952,0.00043592116,0.0004921147,0.0015296803,0.00009452429,0.00009321468,0.004361361,0.0022883664,0.0008100631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055701155,0.000037336038,0.00028615078,0.00021271872,0.00027291567,0.00011013612,0.0011700983,0.8122142,0.0004983933,0.0046880366,0.00177231,0.178682],"study_design_scores_gemma":[0.00022740092,0.000042676842,0.00013127414,0.00094179413,0.00021802957,0.000026775015,0.0018801532,0.8750975,0.000121990284,0.06691048,0.05374995,0.0006519709],"about_ca_topic_score_codex":0.0007005645,"about_ca_topic_score_gemma":0.000008907992,"teacher_disagreement_score":0.44094098,"about_ca_system_score_codex":0.00027808943,"about_ca_system_score_gemma":0.00024295642,"threshold_uncertainty_score":0.99996793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109974295,0.028486798,0.4525932,0.012822676,0.007833617,0.0026079009,0.00020103657,0.0054786326,0.38000184],"genre_scores_gemma":[0.037196014,0.00014515837,0.8935342,0.0001846906,0.00031425734,0.0000426372,0.000085264524,0.00011497007,0.068382815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923839,0.0017045715,0.0014367688,0.0019757277,0.0017036989,0.00079536426],"domain_scores_gemma":[0.99520874,0.0019966597,0.0005851203,0.001588955,0.00029945662,0.00032107104],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012568125,0.00054144644,0.00096902536,0.0014354999,0.000679961,0.0010138319,0.0013546513,0.00040403273,0.0005811571],"category_scores_gemma":[0.0017273952,0.00043592116,0.0004921147,0.0015296803,0.00009452429,0.00009321468,0.004361361,0.0022883664,0.0008100631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055701155,0.000037336038,0.00028615078,0.00021271872,0.00027291567,0.00011013612,0.0011700983,0.8122142,0.0004983933,0.0046880366,0.00177231,0.178682],"study_design_scores_gemma":[0.00022740092,0.000042676842,0.00013127414,0.00094179413,0.00021802957,0.000026775015,0.0018801532,0.8750975,0.000121990284,0.06691048,0.05374995,0.0006519709],"about_ca_topic_score_codex":0.0007005645,"about_ca_topic_score_gemma":0.000008907992,"teacher_disagreement_score":0.44094098,"about_ca_system_score_codex":0.00027808943,"about_ca_system_score_gemma":0.00024295642,"threshold_uncertainty_score":0.99996793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015709024,0.0009796327,0.9802024,0.0087182475,0.0006653459,0.00052921794,0.0000142007975,0.00033201376,0.006988064],"genre_scores_gemma":[0.53680295,0.0000073035358,0.44713384,0.0004220348,0.000713587,0.00039313044,0.000011050598,0.000030081968,0.014486027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803543,0.000041819534,0.00045525416,0.00053203374,0.0006157666,0.000319669],"domain_scores_gemma":[0.9965753,0.0024245244,0.000070528426,0.0005426197,0.00031052873,0.00007648273],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004325772,0.00012002625,0.0001443784,0.00019473617,0.000575517,0.00095613184,0.0006142317,0.00007163958,0.0001219642],"category_scores_gemma":[0.0010615557,0.00006590349,0.00019040768,0.0010972408,0.000085505075,0.00029206244,0.000033526332,0.00017583773,0.0009190258],"study_design_candidate":"design_other","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.0000044374387,0.000037338865,0.000059834336,0.000009050987,0.000039761653,7.1770603e-7,0.0008618168,0.0042960835,0.0011254583,0.17912807,0.007602074,0.80683535],"study_design_scores_gemma":[0.000082958795,0.000016369802,0.00005364391,0.000019263814,0.000027999233,0.000007646665,0.0009606656,0.7738166,0.00056875765,0.10076908,0.12357712,0.000099889075],"about_ca_topic_score_codex":0.000044331813,"about_ca_topic_score_gemma":0.0000149429125,"teacher_disagreement_score":0.80673546,"about_ca_system_score_codex":0.000031644646,"about_ca_system_score_gemma":0.00017167289,"threshold_uncertainty_score":0.99985886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089618705,0.001420703,0.90002155,0.005846573,0.00065293943,0.00043605466,0.000008381981,0.0003672115,0.0016278584],"genre_scores_gemma":[0.9183474,0.00006733328,0.074831866,0.000056301837,0.0006780672,0.00012340037,0.000038468268,0.0000312974,0.0058258316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387336,0.0011045303,0.00060812937,0.0010371556,0.0026313507,0.0007454864],"domain_scores_gemma":[0.9940919,0.0031115047,0.000015895253,0.00081359706,0.0016878342,0.00027925722],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01417716,0.0001618101,0.00023001818,0.0017844519,0.0020512894,0.004040011,0.0011511144,0.00012673753,0.00023781341],"category_scores_gemma":[0.0028366118,0.00013555722,0.00014683451,0.005763298,0.00030791017,0.00066205097,0.00045829391,0.0014534171,0.006465262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057362913,0.00007185204,0.00024016555,0.0000111950785,0.000040960767,0.000016219308,0.0021218527,0.6997981,0.0022973404,0.025484007,0.00276281,0.26714975],"study_design_scores_gemma":[0.00011542302,0.00007828484,0.00024447642,0.000056218683,0.00000574104,0.000021034399,0.0011872628,0.9606011,0.0004019153,0.0018410897,0.03530358,0.00014390128],"about_ca_topic_score_codex":0.0003114477,"about_ca_topic_score_gemma":0.00005174753,"teacher_disagreement_score":0.82872874,"about_ca_system_score_codex":0.00018580083,"about_ca_system_score_gemma":0.0007439927,"threshold_uncertainty_score":0.9992479},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32644862,0.007973621,0.5675785,0.006273282,0.005930064,0.0002580408,0.000019324523,0.0007877175,0.084730804],"genre_scores_gemma":[0.9846448,0.000013527535,0.012527882,0.00042008993,0.00030756093,0.000017526676,0.0000049272826,0.000016313365,0.0020474019],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976119,0.00012940899,0.0004643723,0.00053611584,0.0009471541,0.00031103965],"domain_scores_gemma":[0.99861,0.0006981019,0.00007246354,0.00043777004,0.00009272099,0.00008891735],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015046616,0.0001497568,0.00021670251,0.00021489225,0.0003115879,0.0008775956,0.00041957686,0.000075838594,0.00076242996],"category_scores_gemma":[0.0006883026,0.00011241633,0.00013903019,0.00096444495,0.00010280784,0.0004898134,0.00010925176,0.000207107,0.0009499796],"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.00021255658,0.00042422905,0.009015137,0.00020261515,0.00044214597,0.000687589,0.05595665,0.10222842,0.040190708,0.14079802,0.018926913,0.63091505],"study_design_scores_gemma":[0.00056572765,0.0001504842,0.00084904715,0.0003992057,0.00006815762,0.000016147464,0.001250623,0.10847017,0.020269372,0.056966413,0.8104392,0.000555403],"about_ca_topic_score_codex":0.00011111757,"about_ca_topic_score_gemma":0.00003509798,"teacher_disagreement_score":0.7915123,"about_ca_system_score_codex":0.000095102834,"about_ca_system_score_gemma":0.00023361253,"threshold_uncertainty_score":0.9998279},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034318272,0.8842027,0.031176852,0.031602915,0.0022727791,0.0060643377,0.00055105897,0.00043500835,0.009376057],"genre_scores_gemma":[0.6341829,0.24784449,0.034810685,0.0038961384,0.0006519582,0.0004879897,0.00021694035,0.00017002948,0.0777389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99011505,0.002126602,0.0021747712,0.0023280992,0.0017767227,0.0014787721],"domain_scores_gemma":[0.99308354,0.0036020945,0.00068719086,0.0011919143,0.00044329086,0.0009919646],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009324237,0.0011015629,0.0017719549,0.0004798183,0.0011478197,0.0017574524,0.001019908,0.0004325617,0.0018144054],"category_scores_gemma":[0.0023904648,0.00083675043,0.0005782411,0.0018545302,0.0007994059,0.0005519768,0.0009746531,0.0016739444,0.00047544626],"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.0007898989,0.0012288586,0.006836804,0.030349651,0.002956967,0.0021604965,0.003937794,0.000037422527,0.00023519216,0.58555317,0.11268184,0.2532319],"study_design_scores_gemma":[0.002646136,0.0010940967,0.03736374,0.12053937,0.0069473474,0.00075004913,0.0063746213,0.036520883,0.00006910875,0.018101746,0.76580757,0.0037853313],"about_ca_topic_score_codex":0.000026719472,"about_ca_topic_score_gemma":0.000010942885,"teacher_disagreement_score":0.6531257,"about_ca_system_score_codex":0.00020842842,"about_ca_system_score_gemma":0.0014095996,"threshold_uncertainty_score":0.9994083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05205445,0.00032699405,0.85344225,0.069816306,0.0020021677,0.000986988,0.000082195606,0.00006943668,0.021219227],"genre_scores_gemma":[0.9949305,0.0022693137,0.0010915935,0.00018588136,0.00005377063,0.000075132135,0.000012616763,0.000011048131,0.0013701452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983275,0.00013654858,0.00032287562,0.00038710382,0.0005727501,0.00025320324],"domain_scores_gemma":[0.9986358,0.00081107987,0.00002527681,0.00030535847,0.00017930615,0.00004315345],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038842042,0.00008863172,0.000107714965,0.0009472603,0.0004295742,0.0011157221,0.00046231152,0.000035949448,0.00019048052],"category_scores_gemma":[0.00007826348,0.00006384845,0.000027859318,0.0013287801,0.00009442139,0.00032410692,0.00002075249,0.0002685656,0.000024675352],"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.000046144774,0.00007238019,0.000081618535,0.000019450848,0.00004035231,0.000023191214,0.00018863035,0.8199414,0.0000011108974,0.015693331,0.0014876729,0.16240473],"study_design_scores_gemma":[0.00043978496,0.000016551863,0.006547874,0.00008016966,0.00001592853,0.000011897617,0.0018196495,0.8341585,0.0000072305743,0.003979106,0.1527777,0.00014563196],"about_ca_topic_score_codex":0.012193958,"about_ca_topic_score_gemma":0.057697594,"teacher_disagreement_score":0.94287604,"about_ca_system_score_codex":0.0001649727,"about_ca_system_score_gemma":0.00017096617,"threshold_uncertainty_score":0.9999212},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08559811,0.017295795,0.057473343,0.8011705,0.0058573326,0.0005751144,0.000013797777,0.000060782528,0.03195521],"genre_scores_gemma":[0.9186738,0.0001624302,0.07658018,0.0009714872,0.0006080223,0.0000071084874,0.0000017212054,0.000010997435,0.0029842542],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823546,0.00034567283,0.00046900805,0.00019677004,0.00060694915,0.0001461094],"domain_scores_gemma":[0.99704295,0.0017316241,0.00027344853,0.00014655857,0.0006360855,0.00016932617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006499501,0.00008660544,0.00013387512,0.000304637,0.0005570751,0.00084873533,0.00016721062,0.00004567303,0.000021179148],"category_scores_gemma":[0.0036067418,0.000050163944,0.00005479207,0.00071474316,0.00007429965,0.00095644384,0.000016133785,0.00031664775,0.000031065796],"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.000105683626,0.00044225086,0.00010476942,0.000011876057,0.000046920093,0.000003865312,0.036747012,0.00016316056,0.00048986095,0.010685907,0.15088497,0.8003137],"study_design_scores_gemma":[0.00015786248,0.00022179607,0.0030340897,0.0006764554,0.0002901184,0.0048387237,0.028198857,0.0019363503,0.000033027125,0.03429937,0.9261754,0.00013795451],"about_ca_topic_score_codex":0.00002561128,"about_ca_topic_score_gemma":0.0000058595024,"teacher_disagreement_score":0.8330757,"about_ca_system_score_codex":0.00006459864,"about_ca_system_score_gemma":0.0004941963,"threshold_uncertainty_score":0.81843746},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31541446,0.00019460871,0.66206557,0.018213786,0.002519713,0.00014451209,0.00007971578,0.00015776491,0.0012098871],"genre_scores_gemma":[0.9915636,0.00001735218,0.008006845,0.00009535052,0.00009330896,5.8830483e-7,0.000009499172,0.0000035722242,0.00020987944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.000034819095,0.0007222565,0.00009685396,0.0006389332,0.00015023243],"domain_scores_gemma":[0.9970134,0.00053097715,0.0004477633,0.00010275628,0.0018510557,0.000054047512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438796,0.000088356064,0.00017084951,0.001039887,0.00012603233,0.00031378862,0.00060940004,0.000150456,0.00012899532],"category_scores_gemma":[0.0022933262,0.00007023569,0.0001604568,0.0003915917,0.00021799283,0.0013533118,0.00006446321,0.00027726075,0.00006574963],"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.00029496566,0.00013010982,0.0022300929,0.000017381923,0.0014166109,0.0001087966,0.00364422,0.26863694,0.0013518238,0.28893813,0.020321243,0.4129097],"study_design_scores_gemma":[0.0035914844,0.00024972088,0.0005366751,0.0003040874,0.00015910646,0.0010194259,0.027452292,0.64197475,0.002788624,0.123112164,0.19839533,0.0004163384],"about_ca_topic_score_codex":0.0000035417174,"about_ca_topic_score_gemma":7.7431514e-7,"teacher_disagreement_score":0.67614913,"about_ca_system_score_codex":0.00020917424,"about_ca_system_score_gemma":0.0002783701,"threshold_uncertainty_score":0.3025871},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8363324,0.06675775,0.007235806,0.020810649,0.0072961585,0.00041232066,0.00003888907,0.00030096542,0.060815062],"genre_scores_gemma":[0.99223304,0.00012576436,0.0009483622,0.00012595976,0.00047898706,0.000024255389,0.000003047116,0.000017094713,0.0060435105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780023,0.00019495905,0.00036723365,0.0005713839,0.00081472297,0.00025145372],"domain_scores_gemma":[0.99788713,0.0011627065,0.00004485758,0.0003764502,0.00044250442,0.00008632359],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019079711,0.000116954245,0.00017024751,0.0007411308,0.000119890086,0.0005606866,0.00031083898,0.00006204078,0.00018370876],"category_scores_gemma":[0.0050951457,0.0000909963,0.00007125683,0.0024683727,0.000044466706,0.00019771082,0.000041333533,0.0002952947,0.005261377],"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.000022809594,0.00018269703,0.0013808933,0.000044194305,0.000031408952,0.000040541257,0.0019105888,0.13125895,0.0011408742,0.86114424,0.0011860324,0.001656773],"study_design_scores_gemma":[0.000974088,0.00033296237,0.04892728,0.0046868054,0.00006551808,0.00015456315,0.011903474,0.6691299,0.0005577201,0.106361456,0.15573762,0.0011686072],"about_ca_topic_score_codex":0.00010614573,"about_ca_topic_score_gemma":0.000017893915,"teacher_disagreement_score":0.7547828,"about_ca_system_score_codex":0.00018016693,"about_ca_system_score_gemma":0.0003509649,"threshold_uncertainty_score":0.99551314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001881543,0.0315529,0.93863624,0.019677795,0.0017666144,0.0031357836,0.00004006316,0.0004881161,0.002820918],"genre_scores_gemma":[0.83890784,0.0004849618,0.15598246,0.0020365522,0.00013254117,0.00027436894,0.000080521495,0.000029020213,0.0020717364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934901,0.00017363369,0.0010347262,0.0014170961,0.0025702978,0.0013141459],"domain_scores_gemma":[0.9972852,0.0005695574,0.00033099577,0.0009748143,0.000485277,0.00035416626],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010175818,0.0002696511,0.00037962393,0.0009835371,0.0038951873,0.0013856657,0.0018036368,0.00004514376,0.000019731473],"category_scores_gemma":[0.00048205772,0.00017843005,0.00020408395,0.004563336,0.00039476698,0.00045731146,0.0005451426,0.0004617556,0.00006895749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017234786,0.00003921595,0.00009363762,0.0009655558,0.00003642725,0.0000022588297,0.014150867,0.64404595,0.0000031208149,0.025930226,0.0016806297,0.3130349],"study_design_scores_gemma":[0.0003518811,0.00032334437,0.00066345534,0.0002561096,0.000030606767,0.000005967807,0.071667455,0.8441388,0.0000020274665,0.00071922306,0.081564315,0.00027680013],"about_ca_topic_score_codex":0.00018935806,"about_ca_topic_score_gemma":0.00009725557,"teacher_disagreement_score":0.8370263,"about_ca_system_score_codex":0.0011662017,"about_ca_system_score_gemma":0.0014353364,"threshold_uncertainty_score":0.999651},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007789128,0.011746398,0.9713099,0.0017850241,0.0006866608,0.0022436094,0.00016662768,0.0006990771,0.0035735806],"genre_scores_gemma":[0.88782346,0.00003897243,0.0983224,0.00011102585,0.0009402353,0.007016653,0.00006753968,0.000058265286,0.005621472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717915,0.000095224845,0.0006660663,0.00088221673,0.00074706035,0.0004303097],"domain_scores_gemma":[0.9963267,0.0017752828,0.00015697592,0.0008480755,0.0006840072,0.00020897275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018930209,0.00022361235,0.00034826444,0.00034355748,0.000769432,0.0009545954,0.00058795285,0.00012542777,0.000031841686],"category_scores_gemma":[0.00026003047,0.00015550188,0.00014813278,0.001258905,0.00012964637,0.0003221456,0.00004573015,0.00017362965,0.00086063467],"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.00014642764,0.00010658753,0.0003950629,0.0003131915,0.0006842156,0.000013988638,0.012644712,0.018593354,0.0153690055,0.8345229,0.09151929,0.02569129],"study_design_scores_gemma":[0.00042883217,0.00008944586,0.000015641159,0.000236719,0.00006041453,0.00008390737,0.011546585,0.21172872,0.0003670259,0.002203437,0.77282107,0.00041820406],"about_ca_topic_score_codex":0.00021647452,"about_ca_topic_score_gemma":0.000015778909,"teacher_disagreement_score":0.8800343,"about_ca_system_score_codex":0.00008641266,"about_ca_system_score_gemma":0.0003114686,"threshold_uncertainty_score":0.9999173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010836715,0.001302443,0.98287094,0.0036102189,0.00052124506,0.00039375515,0.00021149061,0.000183561,0.00006960988],"genre_scores_gemma":[0.69607484,0.00014374491,0.30284983,0.00003189614,0.00013556829,0.000058002013,0.00024780125,0.000024169396,0.00043412714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735475,0.00029995004,0.0006519059,0.0007410953,0.00063127495,0.00032102683],"domain_scores_gemma":[0.99630123,0.002413418,0.00021199166,0.000660349,0.0003389856,0.00007399394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027871071,0.00019280294,0.00023116876,0.00041288635,0.002047703,0.0003770955,0.00056405785,0.00015420183,0.000103759005],"category_scores_gemma":[0.0019666788,0.00014922325,0.0001298467,0.0010337455,0.00013452486,0.0009461117,0.00004338008,0.00039603357,0.000015241125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031461106,0.00007319859,0.0002769162,0.000028371334,0.000051599116,2.045883e-7,0.0028235218,0.98537123,0.0001237217,0.00025141743,0.00013999899,0.010828384],"study_design_scores_gemma":[0.00032718523,0.00013474558,0.0002565973,0.00014210764,0.000117991294,0.000010839943,0.0032540907,0.99238396,0.0000311576,0.0007780619,0.0024015887,0.00016167042],"about_ca_topic_score_codex":0.000027926646,"about_ca_topic_score_gemma":0.00005843226,"teacher_disagreement_score":0.6852381,"about_ca_system_score_codex":0.000057790363,"about_ca_system_score_gemma":0.00018519853,"threshold_uncertainty_score":0.9992515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003594738,0.00030465153,0.9964454,0.0004406185,0.00090033334,0.00063472847,0.000013004652,0.000090285816,0.0008114989],"genre_scores_gemma":[0.19147584,0.0000021615522,0.8062605,0.0006945051,0.00043600696,0.000027143798,0.000015545387,0.000033156597,0.0010551024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954218,0.00013803228,0.0007473843,0.0014816541,0.0015887327,0.0006223992],"domain_scores_gemma":[0.9893171,0.008160243,0.0003997415,0.0010637111,0.00093259447,0.00012661166],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0072584627,0.00039037273,0.00048292443,0.0010883574,0.0014761606,0.0012729814,0.002384637,0.0002841367,0.000016593305],"category_scores_gemma":[0.0029404412,0.00026498368,0.00022215548,0.0011501224,0.0007243097,0.0003257571,0.00025473858,0.00087533245,0.0000098732435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000852469,0.000016604792,0.0002716517,0.000010834155,0.000009829242,0.0000016498282,0.00046090045,0.85547,0.000044068835,0.0009910625,0.00002680743,0.14268807],"study_design_scores_gemma":[0.00019969736,0.00007606658,0.00008359945,0.00013945183,0.000042455886,0.000007650779,0.0000029105195,0.9691287,0.00009112733,0.028775733,0.0011369232,0.0003156774],"about_ca_topic_score_codex":0.00009572594,"about_ca_topic_score_gemma":0.000083918705,"teacher_disagreement_score":0.19111636,"about_ca_system_score_codex":0.00019892288,"about_ca_system_score_gemma":0.0015025666,"threshold_uncertainty_score":0.9999802},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025267394,0.0003237078,0.28610846,0.0002297635,0.0009799538,0.00484919,0.0006609237,0.00035839257,0.70396286],"genre_scores_gemma":[0.0075862478,0.000021047086,0.43769473,0.00026306027,0.0022607099,0.0002533942,0.00010081336,0.00022136194,0.5515986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599075,0.000011435236,0.0016752472,0.0008687571,0.0009184245,0.0005353861],"domain_scores_gemma":[0.9959914,0.0018425273,0.001124265,0.0006095966,0.00026397748,0.00016823685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003936991,0.00056025636,0.0011736272,0.00015315744,0.00097410136,0.0005580594,0.00055501243,0.0010740653,0.000024455469],"category_scores_gemma":[0.00053853326,0.0004736101,0.0009677867,0.000098533215,0.00031522312,0.000044654345,0.00027789376,0.00088844844,0.000012781203],"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.000017039962,0.00003655836,6.320384e-7,0.0003374258,0.00045077165,4.2699045e-7,0.0026308997,0.00029927972,0.0003955,0.9558407,0.004540705,0.03545008],"study_design_scores_gemma":[0.0014727633,0.000038669627,1.0918086e-7,0.00093214604,0.0006967338,0.0000112137,0.00076908397,0.03230785,0.00019452925,0.92981356,0.033072934,0.0006904108],"about_ca_topic_score_codex":0.00000749043,"about_ca_topic_score_gemma":0.0000035850744,"teacher_disagreement_score":0.15236425,"about_ca_system_score_codex":0.00008755678,"about_ca_system_score_gemma":0.00045579782,"threshold_uncertainty_score":0.99977154},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41500217,0.0024386467,0.1028645,0.008706226,0.005130942,0.0058262423,0.0009282837,0.0003342613,0.45876873],"genre_scores_gemma":[0.98176885,0.00019503044,0.014570042,0.0008426239,0.00005075553,0.00005493649,0.000064138236,0.000007949693,0.0024456934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688536,0.00014402633,0.0011076666,0.00042562708,0.0011746174,0.00026269344],"domain_scores_gemma":[0.99420625,0.0014749283,0.0005328431,0.0030117347,0.00067530863,0.000098915705],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029322626,0.00023113466,0.00028662934,0.0006473222,0.0026200137,0.00065271574,0.0029735328,0.00006947589,0.000043892614],"category_scores_gemma":[0.00040446548,0.0001728192,0.00005536187,0.00084729766,0.0004075417,0.0020631417,0.001703077,0.0004923476,0.00003545474],"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.000026873093,0.00038504874,0.003634329,0.000016728056,0.00011348443,0.000032734948,0.029445715,0.04951646,0.000003217191,0.22719409,0.006397283,0.68323404],"study_design_scores_gemma":[0.00061548763,0.00016587999,0.0032077434,0.0002743033,0.00007331192,0.00007322963,0.004289007,0.8935389,0.000004272369,0.03614394,0.060939755,0.0006741795],"about_ca_topic_score_codex":0.040346526,"about_ca_topic_score_gemma":0.25370196,"teacher_disagreement_score":0.84402245,"about_ca_system_score_codex":0.00032783503,"about_ca_system_score_gemma":0.00090541324,"threshold_uncertainty_score":0.99867845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1332776,0.024082238,0.6867611,0.0393331,0.005551001,0.021215936,0.0054492196,0.0021300653,0.08219977],"genre_scores_gemma":[0.64262486,0.0002825885,0.33329403,0.00036991463,0.0022883138,0.0030425384,0.0002894815,0.00012162462,0.01768668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98972994,0.000925591,0.00089956255,0.0020801337,0.0048962324,0.001468559],"domain_scores_gemma":[0.98530483,0.007681596,0.000325886,0.0020335305,0.0043091984,0.00034495597],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.010598527,0.0004856458,0.00083353656,0.0021476753,0.0016950145,0.0010456502,0.0020289144,0.0005053263,0.00006599661],"category_scores_gemma":[0.006462105,0.00036902167,0.000514681,0.0034666003,0.00035163257,0.00021328704,0.0011873295,0.0024048998,0.00029707002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011678261,0.0015009411,0.0077091297,0.0011215286,0.00076464785,0.00005053516,0.0016484765,0.4863209,0.00007903632,0.015476653,0.026834715,0.4573256],"study_design_scores_gemma":[0.0037390064,0.0019131422,0.011506427,0.024623537,0.0002364617,0.000012370435,0.006707872,0.5376279,0.0011215287,0.33342642,0.07674332,0.002342027],"about_ca_topic_score_codex":0.0002063113,"about_ca_topic_score_gemma":0.000048159352,"teacher_disagreement_score":0.50934726,"about_ca_system_score_codex":0.00060810446,"about_ca_system_score_gemma":0.0028146273,"threshold_uncertainty_score":0.99999136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852394,0.07157311,0.058934767,0.0023573039,0.0008678845,0.00011417849,0.000017235552,0.00011362827,0.013627909],"genre_scores_gemma":[0.9846434,0.0005791293,0.00701996,0.00036840636,0.000222351,0.0000012423952,0.0000028568518,0.000026354475,0.007136328],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788284,0.0002031823,0.000449857,0.00024283628,0.0010066614,0.00021464961],"domain_scores_gemma":[0.99784577,0.001093116,0.00034089733,0.00016968523,0.00037495224,0.00017556564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033489498,0.00015092187,0.000309586,0.0005942716,0.0002390453,0.0002849843,0.00025037906,0.00006358239,0.00012669961],"category_scores_gemma":[0.0008964422,0.0000897294,0.00010752721,0.00029510196,0.00038826757,0.00070324197,0.000012046626,0.0010465789,0.00001902336],"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.00033759774,0.0003442706,0.04281874,0.00011481263,0.00068043126,0.00117481,0.009784033,0.000397513,0.018212307,0.00740626,0.904426,0.014303222],"study_design_scores_gemma":[0.00056283624,0.000740776,0.0010873536,0.00023070298,0.00016529854,0.0008369447,0.0009433228,0.0011401597,0.0002203905,0.0008200451,0.9930154,0.00023673895],"about_ca_topic_score_codex":0.000038072583,"about_ca_topic_score_gemma":0.000011917193,"teacher_disagreement_score":0.13224939,"about_ca_system_score_codex":0.00010894013,"about_ca_system_score_gemma":0.00038201222,"threshold_uncertainty_score":0.45469227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046558905,0.000749332,0.91931903,0.028661687,0.00039609967,0.0014478713,0.000009270204,0.000067532324,0.0027902431],"genre_scores_gemma":[0.9450134,0.00017911644,0.04493723,0.00033163198,0.00015197566,0.00022620123,0.0000087998615,0.000012292072,0.009139362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970657,0.0005014037,0.00038053998,0.00056658353,0.0009595093,0.00052624993],"domain_scores_gemma":[0.9924965,0.0048700976,0.000020424957,0.0007348577,0.0017591153,0.000119005956],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007722025,0.00011279915,0.00017997764,0.0009874023,0.003510888,0.0019865402,0.0010079041,0.000076023854,0.000021455442],"category_scores_gemma":[0.0018732524,0.00007602328,0.000088262816,0.0028627382,0.00043471807,0.0003883597,0.0006690931,0.00041182304,0.0000736163],"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.00012231771,0.00023680994,0.009359436,0.000045625566,0.00014794632,0.0000074892414,0.002499811,0.1360492,0.00056987914,0.6306681,0.07476842,0.14552498],"study_design_scores_gemma":[0.0010719126,0.0001650195,0.008525672,0.000114858725,0.000024555795,0.000016085163,0.002829709,0.9271414,0.00041342573,0.018675905,0.04083598,0.00018544185],"about_ca_topic_score_codex":0.00042101787,"about_ca_topic_score_gemma":0.00026676324,"teacher_disagreement_score":0.8984545,"about_ca_system_score_codex":0.000083745115,"about_ca_system_score_gemma":0.00055879145,"threshold_uncertainty_score":0.9990495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9080932,0.0005081387,0.071061134,0.0020175404,0.00080135907,0.0015494702,0.00002460077,0.0001575275,0.015787043],"genre_scores_gemma":[0.99515855,0.0000017737453,0.0021951098,0.000056539913,0.0000603131,0.00068557984,0.000008702229,0.000012170577,0.0018212526],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.987075,0.006523437,0.0012975078,0.0007464259,0.003537665,0.00081996917],"domain_scores_gemma":[0.98232067,0.012242573,0.0002739083,0.00091941137,0.0040414217,0.00020200663],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03021906,0.00025698385,0.0005606373,0.0024193367,0.0017530934,0.0015698763,0.0015949648,0.00014158676,0.000104091756],"category_scores_gemma":[0.014135802,0.00017494686,0.00015759088,0.006320979,0.00057813304,0.0009884398,0.0002788621,0.0014028964,0.00079121604],"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.00035759728,0.0030458642,0.0085382005,0.00017138477,0.00034420163,0.000011147056,0.8334143,0.0070935343,0.00023739724,0.10771881,0.0101563465,0.028911194],"study_design_scores_gemma":[0.00083051616,0.00065603777,0.0013663349,0.0003924277,0.0000123475575,5.867166e-7,0.8467757,0.105196066,0.0002752509,0.04290985,0.0013792107,0.00020565347],"about_ca_topic_score_codex":0.00072265905,"about_ca_topic_score_gemma":0.00021802519,"teacher_disagreement_score":0.098102525,"about_ca_system_score_codex":0.00031048237,"about_ca_system_score_gemma":0.0011265603,"threshold_uncertainty_score":0.99998677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08009343,0.00013917092,0.8913063,0.025264725,0.0021838762,0.0005501714,0.000009770711,0.00007644712,0.0003761496],"genre_scores_gemma":[0.51021045,0.0000052352398,0.48535758,0.003955606,0.00003566874,0.00006742653,0.0000018854718,0.00000863184,0.00035752894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957905,0.00008432678,0.00080204895,0.00095434143,0.0017632579,0.00060555316],"domain_scores_gemma":[0.99086756,0.0067119156,0.00023312205,0.001244455,0.00081768393,0.00012529152],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010637566,0.000183655,0.00024844334,0.001069975,0.002095411,0.0017263762,0.0026068424,0.00006682534,0.00010110405],"category_scores_gemma":[0.016785154,0.000111427886,0.0001918315,0.005378252,0.0008933573,0.00080238975,0.00014884408,0.00018782624,0.000121181685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005788194,0.000045640933,0.0004569373,0.000002362452,0.000012051918,9.776663e-7,0.00034595304,0.8474287,0.011772071,0.003018263,0.004688033,0.13217115],"study_design_scores_gemma":[0.00049480336,0.000014500342,0.0025106512,0.00005383913,0.00002657336,0.000003530322,0.00069222477,0.9828027,0.0003945852,0.0068326774,0.0060279956,0.00014591085],"about_ca_topic_score_codex":0.00001261944,"about_ca_topic_score_gemma":0.000007337953,"teacher_disagreement_score":0.43011698,"about_ca_system_score_codex":0.00012870233,"about_ca_system_score_gemma":0.00027191007,"threshold_uncertainty_score":0.99930996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761932,0.00014085839,0.0015299205,0.0052570677,0.0011091151,0.000531155,0.000018546089,0.00007468475,0.015145446],"genre_scores_gemma":[0.9973345,0.00007306738,0.0012793164,0.00022197109,0.00007858033,0.000040211773,6.4172207e-7,0.00001034037,0.0009614161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957086,0.000046009292,0.0013033013,0.00087961025,0.0015814053,0.00048109223],"domain_scores_gemma":[0.9958534,0.000793167,0.0006988893,0.00047594227,0.0019622834,0.0002163227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029508297,0.00032980656,0.0005496714,0.00034243916,0.0005428954,0.0010333759,0.0023295248,0.00017335585,0.00056497304],"category_scores_gemma":[0.0045679575,0.00022213781,0.00016637915,0.0012704992,0.0013345876,0.0003549852,0.00053911767,0.00058255723,0.00022438838],"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.00009627719,0.00058649754,0.027174188,0.000027217186,0.000103438986,8.412854e-7,0.000978661,0.00043356072,0.0059680184,0.89696276,0.00033663778,0.067331895],"study_design_scores_gemma":[0.00017900663,0.0002088455,0.13102861,0.0008436598,0.00016156162,0.000006014254,0.021587163,0.0035290343,0.10751954,0.7342491,0.00016878384,0.0005186485],"about_ca_topic_score_codex":0.00008366502,"about_ca_topic_score_gemma":0.000040476887,"teacher_disagreement_score":0.16271363,"about_ca_system_score_codex":0.000055470766,"about_ca_system_score_gemma":0.00044251836,"threshold_uncertainty_score":0.9964868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15153301,0.000279396,0.73205805,0.010936686,0.030326195,0.0010290554,0.000005836994,0.00008531302,0.07374648],"genre_scores_gemma":[0.9492293,0.0000032429457,0.04966854,0.00016616525,0.0007311588,0.0000055982227,0.0000031929067,0.000017427716,0.00017535914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950542,0.0007278442,0.0014161408,0.00036327366,0.0021205612,0.00031798455],"domain_scores_gemma":[0.9916936,0.0054614507,0.0007415513,0.00041842522,0.0015556298,0.0001293141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015932797,0.00020149855,0.00048619384,0.0018576122,0.00060334196,0.00052016723,0.00064167223,0.0001972258,0.000011592922],"category_scores_gemma":[0.005628791,0.00017283716,0.00012293253,0.0014411833,0.00008766993,0.00021122258,0.000113332564,0.0010966657,0.000006337376],"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.00008132666,0.0011765976,0.00003501525,0.000015371119,0.000013517585,9.967738e-7,0.00023010939,0.28298697,0.000011215551,0.6926049,0.0011476452,0.021696331],"study_design_scores_gemma":[0.0012907102,0.00020298289,0.00016617673,0.00042108019,0.000014233748,0.0000015586114,0.0003419007,0.60345966,0.00003343799,0.39349148,0.00048206415,0.00009472609],"about_ca_topic_score_codex":0.000009606487,"about_ca_topic_score_gemma":2.2980822e-7,"teacher_disagreement_score":0.7976963,"about_ca_system_score_codex":0.00031459925,"about_ca_system_score_gemma":0.0010016591,"threshold_uncertainty_score":0.7048095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.750847,0.00020282218,0.24449775,0.00013093467,0.0033125624,0.00053616986,0.00000133691,0.000016188827,0.00045527538],"genre_scores_gemma":[0.9439682,0.0000049965356,0.055766158,0.000012114206,0.000198857,0.000007750418,4.0207237e-7,0.000012554857,0.000028964852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629694,0.00018631491,0.0018983985,0.0003470956,0.00091851695,0.00035274244],"domain_scores_gemma":[0.9949027,0.0029341918,0.0010017629,0.00025683263,0.00076752,0.00013700323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008073424,0.00024891124,0.0010120966,0.0005929194,0.00038643484,0.00044018982,0.00041933826,0.0001303172,0.000005357615],"category_scores_gemma":[0.0051005175,0.0001969812,0.00015306206,0.000688197,0.00011544668,0.00019520243,0.00021842572,0.00037005558,0.0000015858249],"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.00035024693,0.004503026,0.0030589525,0.00015920657,0.00020172667,0.000014959999,0.005538593,0.013037077,0.0003281883,0.96879745,0.00057100016,0.0034395785],"study_design_scores_gemma":[0.004502454,0.00038716034,0.000041602838,0.00027551947,0.00008286597,0.000014207034,0.002039464,0.45981607,0.00005672388,0.5326453,0.000015615957,0.00012302854],"about_ca_topic_score_codex":0.0000030685694,"about_ca_topic_score_gemma":8.656294e-8,"teacher_disagreement_score":0.44677898,"about_ca_system_score_codex":0.00008153077,"about_ca_system_score_gemma":0.00022947353,"threshold_uncertainty_score":0.80326605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49452522,0.0010035428,0.49876553,0.0034830733,0.0013500605,0.00023577234,0.00000644514,0.000055051598,0.0005752897],"genre_scores_gemma":[0.736538,0.00002518944,0.25947884,0.00051048066,0.00051302795,0.000015904405,0.0000016294076,0.000026356049,0.0028905612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954668,0.00022639704,0.001719673,0.0005588719,0.0012141085,0.0008141422],"domain_scores_gemma":[0.9943333,0.0018429871,0.0008815552,0.00041725222,0.0021422,0.00038265597],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012623482,0.0002834299,0.000771617,0.0015094639,0.0011355352,0.0008233494,0.0010838563,0.00019062219,0.000086604654],"category_scores_gemma":[0.0141436905,0.0002311604,0.00059183344,0.0024149243,0.000047478494,0.0006729811,0.00018506103,0.0008936024,0.00012806096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028865703,0.00025287873,0.010958973,0.000058113117,0.0002211135,0.000008270098,0.008683716,0.95374984,0.010402451,0.003557721,0.00078604615,0.011032242],"study_design_scores_gemma":[0.0076147355,0.001433834,0.0044305227,0.0027729713,0.0005963446,0.00010811075,0.082200296,0.7234865,0.012648816,0.055234868,0.108057894,0.0014150984],"about_ca_topic_score_codex":0.0000093659455,"about_ca_topic_score_gemma":0.000014077975,"teacher_disagreement_score":0.24201278,"about_ca_system_score_codex":0.0001274633,"about_ca_system_score_gemma":0.00056845375,"threshold_uncertainty_score":0.9941606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98538285,0.000108693894,0.0032860672,0.005168156,0.001339465,0.00076278317,0.0000034300826,0.000022567881,0.003925972],"genre_scores_gemma":[0.9957105,0.000022977278,0.0024317764,0.0006213177,0.000065857406,0.00008330352,0.0000038742523,0.000005791974,0.0010546065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9953506,0.000109205124,0.0010250225,0.00074821693,0.0022364492,0.00053049123],"domain_scores_gemma":[0.9963622,0.0018504448,0.00018447051,0.00095347373,0.0005488352,0.000100574434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016514402,0.00019838975,0.0006677519,0.0012657549,0.00035211237,0.000096071366,0.0013283712,0.00007580676,0.000074484946],"category_scores_gemma":[0.003280194,0.00011435701,0.000094360286,0.0063476823,0.0012059199,0.0002560264,0.0001437851,0.0003502214,0.0000056237964],"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.0016332187,0.00081007835,0.86050415,0.000021069054,0.0000016606451,0.00007370915,0.007191866,0.029487278,0.000017584658,0.0008111955,0.011816826,0.08763135],"study_design_scores_gemma":[0.00066164584,0.00021338042,0.96991163,0.0011570464,0.00003026854,0.0000021731519,0.004068743,0.012035021,0.00003134743,0.011316018,0.00044455766,0.0001281634],"about_ca_topic_score_codex":0.00017233158,"about_ca_topic_score_gemma":0.000020956999,"teacher_disagreement_score":0.10940748,"about_ca_system_score_codex":0.00010703952,"about_ca_system_score_gemma":0.0006421549,"threshold_uncertainty_score":0.5723595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007367376,0.0022786984,0.93644613,0.014689,0.00089618395,0.00091370655,0.00021448033,0.00023498344,0.03695946],"genre_scores_gemma":[0.20549121,0.0002288459,0.7184924,0.00013464235,0.00006527003,0.00012150244,0.00035970256,0.000038576945,0.07506788],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929038,0.00313627,0.0011475475,0.0012312867,0.0011135392,0.00046754794],"domain_scores_gemma":[0.9832099,0.0077121924,0.001012443,0.0030568915,0.004748627,0.0002599124],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.014212921,0.0003599059,0.0006700914,0.00068051455,0.00052971573,0.0006009492,0.0025983802,0.00039098028,0.00023255667],"category_scores_gemma":[0.013243448,0.00033166845,0.0005786744,0.0010986547,0.00017500682,0.00017500926,0.0016260293,0.00048768116,0.00003585812],"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.00016433843,0.0015102874,0.0040479316,0.0004681944,0.00045066094,0.0000038543426,0.029895106,0.0026696434,0.004769396,0.2695686,0.09609726,0.59035474],"study_design_scores_gemma":[0.0032218713,0.0000030525155,0.002645712,0.008308289,0.00039773414,0.000008068419,0.001251171,0.14277847,0.10273937,0.42822027,0.30888507,0.0015409248],"about_ca_topic_score_codex":0.0012599397,"about_ca_topic_score_gemma":0.000537094,"teacher_disagreement_score":0.5888138,"about_ca_system_score_codex":0.00010644041,"about_ca_system_score_gemma":0.0012403397,"threshold_uncertainty_score":0.9999135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24580245,0.000083617066,0.74992573,0.00043385057,0.0025356684,0.0003707776,0.0000022606453,0.00018663291,0.00065900624],"genre_scores_gemma":[0.50070095,0.0000010415812,0.49819437,0.0005674097,0.00032329845,0.000019470655,5.129542e-7,0.0000099312165,0.00018298882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99455094,0.00009359843,0.00087054895,0.0015132428,0.0019399641,0.0010316791],"domain_scores_gemma":[0.99607956,0.0010586756,0.00022417461,0.00095240655,0.001235115,0.00045005648],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0069976146,0.0002924513,0.00045393142,0.0017154993,0.0014791468,0.0018728072,0.0025848097,0.00009149467,0.000019802568],"category_scores_gemma":[0.005200876,0.00024377325,0.00016539068,0.007684752,0.00047957743,0.001180749,0.0008124297,0.00032312455,0.00023276947],"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.000080483835,0.00019167484,0.09605406,0.00003951104,0.00004590397,0.000024295043,0.0029320673,0.33642042,0.004460819,0.0043456997,0.00079039426,0.55461466],"study_design_scores_gemma":[0.00072764436,0.00005343614,0.005022783,0.0001516098,0.000028433944,0.000022074226,0.00012450306,0.9830609,0.0014245571,0.008780968,0.0003329914,0.00027007595],"about_ca_topic_score_codex":0.000083433435,"about_ca_topic_score_gemma":0.000011769297,"teacher_disagreement_score":0.6466405,"about_ca_system_score_codex":0.00017139963,"about_ca_system_score_gemma":0.0012159939,"threshold_uncertainty_score":0.99982077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910284,0.0034720122,0.00026875062,0.0037311625,0.00068989204,0.00054627383,4.6430614e-7,0.000003108438,0.00025989904],"genre_scores_gemma":[0.9952737,0.000152661,0.0021869126,0.00008988204,0.000053625357,0.0000069731664,0.000002007321,0.000007080507,0.002227142],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99560916,0.0018530148,0.0014286957,0.00028803787,0.00054863456,0.00027245138],"domain_scores_gemma":[0.99652195,0.001362499,0.0012580738,0.00023678775,0.0005293761,0.00009133811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009792611,0.00017126022,0.00043935858,0.0024361028,0.00033308368,0.00017521973,0.00037668846,0.00016071391,0.00008182976],"category_scores_gemma":[0.0020139846,0.0001391614,0.000090929745,0.003978453,0.00011356057,0.00068011903,0.000097068645,0.0012526518,0.0000028906352],"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.0001506932,0.011762641,0.8360974,0.00013030783,0.000101552374,0.000069258196,0.080358386,0.016495658,0.00019249551,0.0022640422,0.00025414524,0.052123394],"study_design_scores_gemma":[0.0020565814,0.00040927352,0.15565298,0.0013330425,0.0003051627,0.0006903886,0.7928138,0.027509298,0.000012822057,0.0007572165,0.018199386,0.00026007058],"about_ca_topic_score_codex":0.0006347761,"about_ca_topic_score_gemma":0.0006332962,"teacher_disagreement_score":0.7124554,"about_ca_system_score_codex":0.0006406641,"about_ca_system_score_gemma":0.0031027207,"threshold_uncertainty_score":0.5674837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11510575,0.01586708,0.8657969,0.0005889115,0.0023956269,0.000116866824,0.000011303036,0.00010206993,0.000015448186],"genre_scores_gemma":[0.86839676,0.000118417796,0.13107866,0.000012850717,0.00025016375,0.0000078714775,0.0000023029604,0.000016687043,0.00011628521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984553,0.0000245621,0.00067422434,0.00023235152,0.00036073977,0.00025281863],"domain_scores_gemma":[0.99664116,0.0019961577,0.00017693292,0.00008394768,0.0009501462,0.00015163724],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0019892408,0.00017339968,0.00031766747,0.0007385438,0.00012103767,0.00026642077,0.00028625314,0.00008210233,0.0000033314993],"category_scores_gemma":[0.011098316,0.00015319492,0.00012889775,0.00034224818,0.000036723253,0.000111988724,0.00010790229,0.00040400124,0.0000012828218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006744505,0.00009503512,0.013914329,0.00019091542,0.0004379519,0.000021193988,0.0009943089,0.7294315,0.00096791604,0.015075838,0.000040349518,0.23876323],"study_design_scores_gemma":[0.0010975375,0.00009189737,0.0015586793,0.00083441526,0.000049356735,0.0001849268,0.00027382243,0.9538185,0.00036852036,0.0002963722,0.041194707,0.0002312736],"about_ca_topic_score_codex":0.0000047912827,"about_ca_topic_score_gemma":0.0000013593676,"teacher_disagreement_score":0.753291,"about_ca_system_score_codex":0.00008180655,"about_ca_system_score_gemma":0.00012292551,"threshold_uncertainty_score":0.9972316},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44549853,0.013628329,0.102130294,0.021530472,0.008529897,0.018524501,0.004195235,0.00012111683,0.3858416],"genre_scores_gemma":[0.16082984,0.0018366092,0.36554462,0.00063305016,0.00080173713,0.004374253,0.009029635,0.00026357642,0.45668668],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914962,0.00091995654,0.0020735716,0.002472844,0.0018876333,0.0011497901],"domain_scores_gemma":[0.99171907,0.002003039,0.00090881594,0.0021197584,0.0026093714,0.00063994556],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0051691076,0.0010258754,0.0013904897,0.0007420914,0.0013105202,0.0059398054,0.004808561,0.0010170218,0.020353135],"category_scores_gemma":[0.0015537669,0.00092438405,0.0005484676,0.0023361328,0.00032346294,0.002820764,0.000826686,0.0013991004,0.026524968],"study_design_candidate":"design_other","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.00006705652,0.0015762477,0.0010171736,0.00010109739,0.0005214858,0.000021635327,0.033036567,0.0006515315,0.003269445,0.003817376,0.012010219,0.9439102],"study_design_scores_gemma":[0.0023991333,0.00046302882,0.0062971977,0.0015017724,0.0010583607,0.00006974671,0.065452754,0.03411546,0.014576576,0.01736034,0.8535659,0.0031397366],"about_ca_topic_score_codex":0.0022072245,"about_ca_topic_score_gemma":0.0017659495,"teacher_disagreement_score":0.94077045,"about_ca_system_score_codex":0.0001313295,"about_ca_system_score_gemma":0.0021916342,"threshold_uncertainty_score":0.9999896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813384,0.000529459,0.014411711,0.0020516913,0.00009851002,0.000041562118,0.0000014519893,0.0000017665839,0.001525469],"genre_scores_gemma":[0.9941978,0.00012493938,0.0053052413,0.00023249208,0.000037815054,0.0000011462591,6.5497625e-7,0.000003120451,0.000096800264],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964949,0.0006299608,0.0011466139,0.00020646024,0.0013455885,0.000176468],"domain_scores_gemma":[0.99600035,0.0025089914,0.0008082175,0.00031073808,0.00030585617,0.00006585595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020305568,0.00009652495,0.0005291129,0.001550029,0.00007961371,0.00012744211,0.0003928053,0.000043220494,0.000069026035],"category_scores_gemma":[0.0041804174,0.000053541862,0.000233088,0.0032256343,0.00011063131,0.00024128413,0.000029712643,0.0002480615,0.000007336663],"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.000058730577,0.0002078016,0.94638187,0.0000016771659,0.00018147197,0.00009474202,0.0051037245,0.021521084,0.000043906603,0.020265808,0.0010279515,0.005111244],"study_design_scores_gemma":[0.00039582056,0.00013779469,0.9128864,0.00003436924,0.00031696446,0.000024276203,0.007947993,0.014432689,0.000012146921,0.060931634,0.0027788805,0.00010104711],"about_ca_topic_score_codex":0.000101164456,"about_ca_topic_score_gemma":0.0004929122,"teacher_disagreement_score":0.040665828,"about_ca_system_score_codex":0.000028123695,"about_ca_system_score_gemma":0.00004711839,"threshold_uncertainty_score":0.7037545},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009817464,0.00037709452,0.1510298,0.004778207,0.002416384,0.0028324868,0.032445874,0.004133961,0.80100447],"genre_scores_gemma":[0.039674953,0.000035278816,0.025861984,0.0005771069,0.0023668627,0.0000015097962,0.035434805,0.021786656,0.87426084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968644,0.00032156272,0.00045180845,0.00093250576,0.00087411597,0.00055562175],"domain_scores_gemma":[0.9982084,0.00009298114,0.00026671618,0.00076604006,0.00048209372,0.00018375747],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018823321,0.00027048748,0.00036092527,0.0010440401,0.0010617214,0.0019814186,0.0015185201,0.00019134692,0.17508915],"category_scores_gemma":[0.0010173783,0.00022508178,0.00012237568,0.00088176475,0.0002930633,0.000088411,0.0006520123,0.00029566104,0.03191518],"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.00007731089,0.00006684072,9.819014e-7,0.000056273053,0.000085575084,0.000019928282,0.00015527676,0.000041410756,0.0004608079,0.0013168806,0.99230695,0.00541175],"study_design_scores_gemma":[0.0007351133,0.0002844318,0.000008639028,0.00010278932,0.000049549617,0.00007658405,0.00030864656,0.0006010426,0.00015211068,0.0004938334,0.9969188,0.0002684375],"about_ca_topic_score_codex":0.00007342604,"about_ca_topic_score_gemma":0.0000050642166,"teacher_disagreement_score":0.14317396,"about_ca_system_score_codex":0.00011467063,"about_ca_system_score_gemma":0.000020308144,"threshold_uncertainty_score":0.9990546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.693095,0.0000022744362,0.3001108,0.000020510497,0.00030552698,0.00017446879,0.00001855293,0.00006901474,0.0062038605],"genre_scores_gemma":[0.9939246,4.2439e-8,0.005905273,0.000017296665,0.000029657313,0.000015249249,0.000007974793,0.0000055848336,0.000094296964],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972576,0.00032965178,0.001242484,0.00018506795,0.0007832888,0.0002019012],"domain_scores_gemma":[0.9977466,0.0002524409,0.00081454613,0.00034215284,0.00078934233,0.00005493463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050106132,0.00012876991,0.000334525,0.00096734066,0.00011302072,0.00013855386,0.0002623235,0.00009495496,0.000024544986],"category_scores_gemma":[0.0023090106,0.000106260304,0.000063779895,0.0010819975,0.00006811921,0.000901043,0.00005471834,0.000106341286,0.00040695322],"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.00013969048,0.00003216268,0.7289788,0.00033085526,0.00008215874,0.0000016346872,0.12856318,0.039574903,0.00003564188,0.056140464,0.00006967926,0.046050835],"study_design_scores_gemma":[0.0019163134,0.00011172969,0.20762107,0.00026862966,0.000031129963,0.000024759749,0.038426828,0.749673,0.0011832744,0.0002855333,0.00017575202,0.0002819942],"about_ca_topic_score_codex":0.000024149394,"about_ca_topic_score_gemma":7.861161e-7,"teacher_disagreement_score":0.7100981,"about_ca_system_score_codex":0.0000657128,"about_ca_system_score_gemma":0.000042433814,"threshold_uncertainty_score":0.5230696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.693095,0.0000022744362,0.3001108,0.000020510497,0.00030552698,0.00017446879,0.00001855293,0.00006901474,0.0062038605],"genre_scores_gemma":[0.9939246,4.2439e-8,0.005905273,0.000017296665,0.000029657313,0.000015249249,0.000007974793,0.0000055848336,0.000094296964],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972576,0.00032965178,0.001242484,0.00018506795,0.0007832888,0.0002019012],"domain_scores_gemma":[0.9977466,0.0002524409,0.00081454613,0.00034215284,0.00078934233,0.00005493463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050106132,0.00012876991,0.000334525,0.00096734066,0.00011302072,0.00013855386,0.0002623235,0.00009495496,0.000024544986],"category_scores_gemma":[0.0023090106,0.000106260304,0.000063779895,0.0010819975,0.00006811921,0.000901043,0.00005471834,0.000106341286,0.00040695322],"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.00013969048,0.00003216268,0.7289788,0.00033085526,0.00008215874,0.0000016346872,0.12856318,0.039574903,0.00003564188,0.056140464,0.00006967926,0.046050835],"study_design_scores_gemma":[0.0019163134,0.00011172969,0.20762107,0.00026862966,0.000031129963,0.000024759749,0.038426828,0.749673,0.0011832744,0.0002855333,0.00017575202,0.0002819942],"about_ca_topic_score_codex":0.000024149394,"about_ca_topic_score_gemma":7.861161e-7,"teacher_disagreement_score":0.7100981,"about_ca_system_score_codex":0.0000657128,"about_ca_system_score_gemma":0.000042433814,"threshold_uncertainty_score":0.5230696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9496687,0.00011932233,0.0017550928,0.0006434045,0.00017182592,0.0002753548,0.00003179381,0.000039113605,0.047295384],"genre_scores_gemma":[0.98415184,0.00008321211,0.00034756676,0.000006955947,0.000025232795,3.235428e-7,0.000017065659,0.00000716372,0.01536061],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975494,0.0010314687,0.00030681983,0.00043799798,0.00038269555,0.0002915928],"domain_scores_gemma":[0.9968775,0.002019539,0.00027606095,0.0006165319,0.0001325943,0.0000778099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002043337,0.0001530518,0.0002954216,0.002246487,0.0004769191,0.00005178155,0.0011655593,0.0000901029,0.000024776964],"category_scores_gemma":[0.00086027925,0.00012853183,0.00011999711,0.0047010826,0.00044724793,0.0006100083,0.00047569588,0.00037612865,0.000050706818],"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.00035853742,0.0011072186,0.46725383,0.000138012,0.00013390146,0.0002816207,0.19602406,0.004611597,0.0009973228,0.27423343,0.0065175355,0.04834295],"study_design_scores_gemma":[0.0010139383,0.00008114407,0.89781076,0.00016435543,0.00007808305,0.000012725754,0.08109927,0.004555036,0.000049640326,0.0049193003,0.010018061,0.00019767912],"about_ca_topic_score_codex":0.0013560799,"about_ca_topic_score_gemma":0.005769515,"teacher_disagreement_score":0.43055695,"about_ca_system_score_codex":0.00012705624,"about_ca_system_score_gemma":0.0006468457,"threshold_uncertainty_score":0.52413756},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004766448,0.0003045834,0.050595336,0.009278066,0.00042988904,0.00090978836,0.0015224904,0.002021215,0.93493384],"genre_scores_gemma":[0.0037348135,0.0001165214,0.00780379,0.0012550425,0.0018659129,5.901305e-7,0.008783635,0.012007751,0.96443194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964182,0.0003977751,0.00055822736,0.0010025228,0.0011544945,0.00046882092],"domain_scores_gemma":[0.9968389,0.00018246987,0.00046690245,0.0010427169,0.0011269876,0.00034198782],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00212025,0.0002544288,0.00037967417,0.0008600145,0.0017371055,0.002414327,0.002702828,0.00023078683,0.081796154],"category_scores_gemma":[0.016145974,0.00023907579,0.00021531113,0.0017310206,0.00020168531,0.00018508873,0.0010358718,0.00037533033,0.06572056],"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.000020993379,0.000054284017,2.6394733e-7,0.000026937647,0.000055338918,0.000001516821,0.00015074108,0.000012889723,0.000088644956,0.010149798,0.9392268,0.050211806],"study_design_scores_gemma":[0.00041212045,0.00011645759,0.000015543488,0.00003216498,0.00003404395,0.000017564667,0.00012340047,0.0013039339,0.000021029733,0.001714789,0.9959567,0.00025223265],"about_ca_topic_score_codex":0.000024480412,"about_ca_topic_score_gemma":0.0000010395685,"teacher_disagreement_score":0.056729935,"about_ca_system_score_codex":0.000094838106,"about_ca_system_score_gemma":0.00001693528,"threshold_uncertainty_score":0.9995625},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008146802,0.0012210227,0.0004222598,0.002537128,0.0039345664,0.0004184615,0.9892206,0.00047434177,0.0016901278],"genre_scores_gemma":[0.00006958762,0.0007122033,0.0015177503,0.000386675,0.0015087352,0.00008384667,0.9924109,0.000105864936,0.0032044468],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99002266,0.00048927765,0.0020923417,0.0016826638,0.003975859,0.001737191],"domain_scores_gemma":[0.9910667,0.0020105164,0.0010688583,0.0038473743,0.0012474003,0.00075916917],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005021979,0.0010193532,0.0016129052,0.002023044,0.0019117285,0.0029571948,0.0036213833,0.0009790311,0.0008797254],"category_scores_gemma":[0.007865339,0.0008000246,0.00079961814,0.0021497363,0.0012190857,0.0006280483,0.00075105525,0.0013314193,0.007647925],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000080546626,0.000118250595,0.00008146624,0.00003080129,0.0001836571,0.00011733777,0.000058847,0.000047654186,5.791506e-7,0.002380453,0.99624836,0.0006520173],"study_design_scores_gemma":[0.0005000662,0.0001333149,0.00040590778,0.00009354261,0.00038675824,0.00006831089,0.000833342,0.00056269695,0.0000075277258,0.013773005,0.9823505,0.000884986],"about_ca_topic_score_codex":0.22656235,"about_ca_topic_score_gemma":0.061895467,"teacher_disagreement_score":0.16466688,"about_ca_system_score_codex":0.0006710215,"about_ca_system_score_gemma":0.0012993101,"threshold_uncertainty_score":0.9994451},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996969,0.00061321893,0.000069095935,0.00042293707,0.000779606,0.000120642144,0.000038725808,0.000102460916,0.00088433013],"genre_scores_gemma":[0.40864286,0.00012566916,0.0046647307,0.0000042999095,0.000063816995,2.6490926e-7,0.00013796093,0.000022269323,0.58633816],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9970466,0.00017805894,0.00034462044,0.0007802877,0.0012230927,0.00042733675],"domain_scores_gemma":[0.9973596,0.00028312622,0.000550847,0.0007927365,0.00083374593,0.0001799659],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009401139,0.00026552222,0.00067641004,0.0007518972,0.00056419167,0.00013538424,0.0009816375,0.0004126514,0.0012317885],"category_scores_gemma":[0.000717862,0.0002854787,0.00045248147,0.001033589,0.00010083652,0.0003190107,0.00014601114,0.0005065198,0.00032766585],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.0014749621,0.001242289,0.026174419,0.0009677295,0.0019543304,0.0009770228,0.75830334,0.018341014,0.1346009,0.0030197075,0.0049347663,0.04800953],"study_design_scores_gemma":[0.0014396685,0.000103928345,0.021878734,0.00058714324,0.0004082896,0.000022343267,0.96494395,0.0021966542,0.004163431,0.0019601425,0.0014348415,0.00086089014],"about_ca_topic_score_codex":0.007665057,"about_ca_topic_score_gemma":0.03605812,"teacher_disagreement_score":0.58832616,"about_ca_system_score_codex":0.00008981558,"about_ca_system_score_gemma":0.00034895865,"threshold_uncertainty_score":0.9999597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3047981,0.0013257717,0.3773597,0.007411637,0.0026974312,0.0014869667,0.0052063987,0.0034161364,0.29629785],"genre_scores_gemma":[0.98925245,0.000009069451,0.0015663455,0.0002673443,0.0001680961,0.0000067634987,0.00007961494,0.000053964948,0.008596371],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946804,0.00044706225,0.0009954987,0.0008573577,0.0012845438,0.0017351422],"domain_scores_gemma":[0.995476,0.0012259589,0.0005081218,0.0015042613,0.0002927004,0.0009929709],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020502133,0.00054275076,0.0007195758,0.0016961225,0.0008019653,0.00062427926,0.0016766713,0.000280996,0.00012042245],"category_scores_gemma":[0.00052369834,0.00050018326,0.0005508847,0.0026030354,0.00034516776,0.0018836793,0.0007148904,0.00062357844,0.0015222258],"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.002054871,0.0032650246,0.33575025,0.00018085305,0.0020834445,0.0010463065,0.005959673,0.0018796925,0.0026367705,0.31626892,0.19569033,0.13318385],"study_design_scores_gemma":[0.0032130822,0.0004162152,0.011311883,0.00029936165,0.00043704396,0.0005051405,0.015044922,0.007787243,0.001596606,0.0034820356,0.9534815,0.0024249821],"about_ca_topic_score_codex":0.00034886017,"about_ca_topic_score_gemma":0.0001316726,"teacher_disagreement_score":0.75779116,"about_ca_system_score_codex":0.00067929435,"about_ca_system_score_gemma":0.0002278235,"threshold_uncertainty_score":0.99974495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91428834,0.0052449317,0.010667948,0.012914474,0.010170466,0.0057542427,0.0019180991,0.0009217677,0.038119715],"genre_scores_gemma":[0.9002946,0.00004958748,0.0028199,0.000008299393,0.00004316899,4.6623452e-7,0.00009483368,0.000021266887,0.09666787],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9973257,0.00016156402,0.0003716007,0.00042702342,0.0013144028,0.00039966375],"domain_scores_gemma":[0.9964115,0.0013742727,0.0006842502,0.00058442313,0.000727666,0.0002178852],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019406341,0.00021948053,0.0004065761,0.0006628419,0.0034534363,0.00011924411,0.002539145,0.00018197965,0.00008648162],"category_scores_gemma":[0.00016332084,0.00017775524,0.0004110424,0.001429689,0.00023082833,0.0004814557,0.00016099807,0.00026551858,0.000073978554],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004641782,0.00025890357,0.010149073,0.0011390225,0.005134579,0.00009134531,0.6884192,0.0023347484,0.00031691164,0.004771576,0.046053752,0.23668908],"study_design_scores_gemma":[0.0007615692,0.000022258519,0.004717565,0.0002836911,0.00032389627,5.588441e-7,0.8647158,0.0009492543,0.000544497,0.0003420731,0.12709065,0.00024816667],"about_ca_topic_score_codex":0.052402254,"about_ca_topic_score_gemma":0.7828262,"teacher_disagreement_score":0.7304239,"about_ca_system_score_codex":0.00037775387,"about_ca_system_score_gemma":0.008349036,"threshold_uncertainty_score":0.9978439},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93408203,0.0003160623,0.009307013,0.020908637,0.0024237034,0.00048754743,0.00013975025,0.00039377774,0.03194149],"genre_scores_gemma":[0.9639813,0.000017197062,0.015618085,0.00011026581,0.00011990298,0.000089759706,0.000020426978,0.000022457909,0.020020645],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99680954,0.00026254467,0.0005291311,0.0006011068,0.0009217824,0.0008759105],"domain_scores_gemma":[0.99736995,0.0010289665,0.00010391702,0.0006740622,0.00061876787,0.00020437062],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054622265,0.00016813775,0.00030083855,0.00031336801,0.00079589075,0.0001907457,0.0007725345,0.00041510165,0.0014010093],"category_scores_gemma":[0.024717871,0.000113217095,0.00011322527,0.0014401004,0.00018508587,0.00016267349,0.00014651999,0.00045117887,0.0005266161],"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.00047594603,0.0006384124,0.008613004,0.00002410592,0.00015437072,0.000035991277,0.0014767058,0.00033342498,0.04410312,0.046888717,0.49128723,0.405969],"study_design_scores_gemma":[0.0022094164,0.0001122732,0.00005554679,0.000043663837,0.000019795136,0.000012162889,0.0012331348,0.0046592494,0.059622224,0.048942823,0.8828027,0.0002869778],"about_ca_topic_score_codex":0.000010635242,"about_ca_topic_score_gemma":0.000009652081,"teacher_disagreement_score":0.405682,"about_ca_system_score_codex":0.00007715492,"about_ca_system_score_gemma":0.00045809493,"threshold_uncertainty_score":0.99951184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022277487,0.00003869962,0.627131,0.0007736244,0.0003007065,0.0065766075,0.000081976905,0.00026063225,0.3648145],"genre_scores_gemma":[0.0093020825,0.000045535267,0.7839839,0.001334786,0.00016594179,0.0038529187,0.00012530097,0.00013502334,0.2010545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947245,0.00083892926,0.001048133,0.0008031057,0.001952796,0.0006325325],"domain_scores_gemma":[0.99614555,0.0007691118,0.00064996775,0.0011825685,0.0009155844,0.00033719264],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.025407497,0.00042423513,0.00057151826,0.002350224,0.0006711747,0.0028545675,0.001482739,0.00047489346,0.0010787498],"category_scores_gemma":[0.0020602178,0.0002959887,0.0001247615,0.0027854203,0.0005192803,0.0014193795,0.00063419255,0.00078154454,0.0023225024],"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.000012051866,0.000030645515,0.000008930509,0.00007222559,0.000048447375,0.0000013923519,0.0028679257,0.002852757,0.00028397658,0.093226634,0.22513527,0.67545974],"study_design_scores_gemma":[0.00032060128,0.000023823357,0.00013778116,0.00034995907,0.000043179778,0.00006698375,0.0011921839,0.015183113,0.0020269654,0.0030140637,0.977161,0.0004803476],"about_ca_topic_score_codex":0.0006498655,"about_ca_topic_score_gemma":0.00026850536,"teacher_disagreement_score":0.7520257,"about_ca_system_score_codex":0.00019613176,"about_ca_system_score_gemma":0.0007333741,"threshold_uncertainty_score":0.9999492},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90758127,0.030125557,0.0550255,0.00084754394,0.0032808662,0.0019188195,0.000043581804,0.00022939152,0.00094748335],"genre_scores_gemma":[0.96415716,0.0000786495,0.01900038,0.000029696886,0.00032402424,0.0003451378,0.00056494947,0.00016396419,0.015336017],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9912247,0.00050778745,0.0013100546,0.0026861245,0.0027141497,0.0015571725],"domain_scores_gemma":[0.9948348,0.0014148059,0.00090920663,0.0013307312,0.00059980556,0.00091065356],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021306858,0.0010683322,0.0013604867,0.0017475411,0.0036751826,0.0017559,0.0012946513,0.00052410195,0.0013955759],"category_scores_gemma":[0.002967547,0.00106421,0.00047553444,0.0029500555,0.00040402377,0.00038403156,0.00059254863,0.0014794068,0.000276147],"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.00079597544,0.00062843977,0.0028832387,0.00059056847,0.00034894457,0.000050143368,0.44775584,0.07572087,0.00029048254,0.0011233955,0.00010393101,0.46970814],"study_design_scores_gemma":[0.0013385742,0.0010179537,0.008292793,0.003667213,0.0012261339,0.00012276402,0.958873,0.021075789,0.0005938889,0.0003649603,0.0008405337,0.002586396],"about_ca_topic_score_codex":0.00018057582,"about_ca_topic_score_gemma":0.00041632686,"teacher_disagreement_score":0.51111716,"about_ca_system_score_codex":0.0010915118,"about_ca_system_score_gemma":0.0008511514,"threshold_uncertainty_score":0.99951726},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066819735,0.0014103042,0.02155251,0.0038457075,0.00078851724,0.00045982745,0.00096811407,0.000050791357,0.9041045],"genre_scores_gemma":[0.55275434,0.001268108,0.08324589,0.0009748785,0.00038664992,0.000037624777,0.000047188692,0.00014813337,0.36113715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99488455,0.00086631364,0.0008524179,0.00049116253,0.0023176484,0.00058789225],"domain_scores_gemma":[0.996308,0.0019048456,0.0008234771,0.00043662163,0.000003590925,0.00052344595],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021523307,0.0004298886,0.00060942327,0.00013588119,0.00065544987,0.00012292717,0.0005317179,0.00021799518,0.0021978118],"category_scores_gemma":[0.00015337786,0.00038816273,0.00011238084,0.00020273503,0.00048479097,0.000710353,0.00019297272,0.00042367334,1.5637443e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052803574,0.00011616901,0.01780076,0.0006536453,0.00039062346,0.00014517484,0.0042584846,0.00022246216,0.0023932257,0.65603936,0.005399886,0.3120522],"study_design_scores_gemma":[0.0016321362,0.00021584803,0.056466915,0.0012742945,0.00032435782,0.00021472404,0.027654476,0.009898855,0.039451864,0.02719682,0.8343062,0.0013635192],"about_ca_topic_score_codex":0.01651878,"about_ca_topic_score_gemma":0.06631792,"teacher_disagreement_score":0.8289063,"about_ca_system_score_codex":0.00007874044,"about_ca_system_score_gemma":0.007917796,"threshold_uncertainty_score":0.999857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7317606,0.0016866047,0.02932491,0.03904192,0.0011841863,0.00034571686,0.0001340945,0.0002682142,0.1962537],"genre_scores_gemma":[0.9535633,0.000045100413,0.0011535984,0.0013202108,0.000043065193,0.0000074724953,0.0000046755636,0.0000056542317,0.043856934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998137,0.00018869313,0.00042185644,0.00041992593,0.0005185257,0.00031399322],"domain_scores_gemma":[0.9976057,0.0014489271,0.00009106463,0.0005963288,0.00015575366,0.00010223863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019363711,0.0001421942,0.0002207182,0.00017449836,0.00057878194,0.00047053146,0.00054595445,0.00008751751,0.00088593236],"category_scores_gemma":[0.0012679741,0.000077074925,0.00009035285,0.0010161797,0.00021987806,0.00013439434,0.00013161905,0.00020485335,0.0003624466],"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.00008047778,0.00023165016,0.015808424,0.0000051177767,0.00023616286,0.000008077881,0.001187112,0.0006753325,0.0048108,0.13251388,0.798182,0.046260968],"study_design_scores_gemma":[0.002816548,0.00020967217,0.107789345,0.00004657159,0.00028310978,0.000031123367,0.007876278,0.059319794,0.00563028,0.14322412,0.67197126,0.000801916],"about_ca_topic_score_codex":0.00062959676,"about_ca_topic_score_gemma":0.0004583315,"teacher_disagreement_score":0.22180265,"about_ca_system_score_codex":0.00001529868,"about_ca_system_score_gemma":0.00009434017,"threshold_uncertainty_score":0.9700338},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81315744,0.000035470508,0.064986356,0.000054696615,0.0001297522,0.000028844153,8.802358e-7,0.000030339512,0.12157621],"genre_scores_gemma":[0.9783536,6.952358e-7,0.019312324,0.000027782673,0.00001165264,9.053192e-7,4.8504626e-7,0.0000025235086,0.002290014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99875516,0.00024187038,0.00025513922,0.00015997987,0.0004925223,0.000095350755],"domain_scores_gemma":[0.9987777,0.00048485232,0.00008330151,0.00035987856,0.00024608918,0.000048187772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004626954,0.000035404875,0.00008723645,0.00017300915,0.00008054718,0.00005039103,0.0001845601,0.000029010518,0.00064313755],"category_scores_gemma":[0.0045045284,0.000025174644,0.000033047454,0.00058829953,0.000034515306,0.00017654769,0.000007045671,0.00003660657,0.00010644084],"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.000006360001,0.0003158178,0.027979614,0.0000024952856,0.000015129599,0.0000014050358,0.0023804153,0.008520959,0.017373666,0.835836,0.0011232458,0.1064449],"study_design_scores_gemma":[0.0011001524,0.00032967352,0.44517013,0.000026360738,0.000041752122,0.000022077358,0.011398152,0.064148664,0.18093139,0.26844004,0.027901972,0.0004896235],"about_ca_topic_score_codex":0.00001206917,"about_ca_topic_score_gemma":0.000007818044,"teacher_disagreement_score":0.5673959,"about_ca_system_score_codex":0.0000056163394,"about_ca_system_score_gemma":0.000024519873,"threshold_uncertainty_score":0.7041905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97299135,0.00014978183,0.019935424,0.00021116785,0.00022743491,0.000040757634,0.000004202702,0.000044551496,0.006395346],"genre_scores_gemma":[0.99136055,0.000038435366,0.0061194818,0.0000072206694,0.000029911369,3.544032e-8,2.2299983e-7,0.0000013961322,0.0024427476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941653,0.000021791468,0.00010787543,0.00012245464,0.00025437883,0.00007698886],"domain_scores_gemma":[0.9994142,0.00027858716,0.000031382187,0.00014528859,0.00006457319,0.00006594339],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004899322,0.00003345174,0.00010051494,0.000024615894,0.0000687622,0.0000069757884,0.00014405891,0.000053993674,0.0010517046],"category_scores_gemma":[0.00089656404,0.000027480039,0.000034220866,0.000103281425,0.00004171071,0.00009952478,0.000052913834,0.000047180503,0.00002625547],"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.00041349127,0.0008371838,0.10757706,0.0000080795035,0.00034163374,0.00012437138,0.0060776854,0.004820328,0.019433415,0.57774657,0.18613964,0.096480556],"study_design_scores_gemma":[0.00855559,0.0008199702,0.20353441,0.00004773733,0.00014784996,0.0002994755,0.0060769273,0.24730437,0.011674388,0.009429405,0.5108964,0.0012134671],"about_ca_topic_score_codex":0.0013178476,"about_ca_topic_score_gemma":0.00017001566,"teacher_disagreement_score":0.5683172,"about_ca_system_score_codex":0.00001011998,"about_ca_system_score_gemma":0.000039732746,"threshold_uncertainty_score":0.9998615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7573186,0.00015754548,0.2113552,0.008781648,0.00050617347,0.000339871,0.000022865348,0.00025760187,0.02126046],"genre_scores_gemma":[0.5024085,0.000015732163,0.47726566,0.00059577613,0.00024848923,0.000053896652,0.000008614023,0.000035845125,0.01936747],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941026,0.0015374898,0.0009480269,0.0010641281,0.0014144958,0.0009332745],"domain_scores_gemma":[0.9931041,0.0035849705,0.00029386443,0.0015884879,0.00090818346,0.0005203957],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.023148462,0.00039482876,0.00050399994,0.0003987796,0.00085045135,0.0006466252,0.0015440587,0.00059727137,0.0047440687],"category_scores_gemma":[0.020370023,0.00028664529,0.00035391585,0.0019740511,0.0002918203,0.00046658528,0.00032615234,0.0013228384,0.0013314779],"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.00022202516,0.0028628286,0.38960975,0.000048688864,0.0008407231,0.00007941528,0.07701443,0.002911423,0.1669813,0.07526111,0.10993915,0.17422916],"study_design_scores_gemma":[0.0036539533,0.00033862845,0.07260126,0.00012414511,0.0005475478,0.00037167396,0.053874057,0.029357456,0.07821353,0.43779123,0.32026148,0.0028650367],"about_ca_topic_score_codex":0.0007572685,"about_ca_topic_score_gemma":0.0015953892,"teacher_disagreement_score":0.3625301,"about_ca_system_score_codex":0.00014708759,"about_ca_system_score_gemma":0.00053190725,"threshold_uncertainty_score":0.9999586},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23672292,0.0016132668,0.07190388,0.005393663,0.0013854698,0.00014628994,0.000013153194,0.00040976238,0.6824116],"genre_scores_gemma":[0.8538595,0.00000360157,0.011922227,0.0002597644,0.00026878432,0.000004028998,0.0000035874689,0.000007643766,0.13367088],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979174,0.00007398643,0.0004390451,0.0003704728,0.0008962435,0.0003028164],"domain_scores_gemma":[0.998243,0.00072207476,0.00008695605,0.0006246128,0.00023233918,0.000091054324],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017417476,0.00010450103,0.0001778972,0.0002589648,0.0002776726,0.00034592603,0.0005246146,0.000067676745,0.002033859],"category_scores_gemma":[0.0011610538,0.000071928596,0.00013243784,0.0010339789,0.000087729604,0.00020391545,0.00007323584,0.000106271495,0.0060530244],"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.000017153274,0.0002942559,0.027686182,0.0000017122815,0.000029209654,0.000016322816,0.000060717615,0.0043483223,0.0017146937,0.27356648,0.66011256,0.032152392],"study_design_scores_gemma":[0.0005044117,0.000038982504,0.040899042,0.000007003813,0.000023816117,0.000019952622,0.00017759956,0.0130522065,0.0019395081,0.33419976,0.60880333,0.000334382],"about_ca_topic_score_codex":0.0010213227,"about_ca_topic_score_gemma":0.00029409735,"teacher_disagreement_score":0.61713654,"about_ca_system_score_codex":0.000015401089,"about_ca_system_score_gemma":0.00006300184,"threshold_uncertainty_score":0.9988784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026716642,0.0070029465,0.93289477,0.00014082927,0.027264252,0.0033884016,0.0008167288,0.0002471902,0.0015282225],"genre_scores_gemma":[0.97228944,0.00034468577,0.0015608076,0.000063546184,0.00038516894,0.00090752664,0.000008729398,0.0000801492,0.024359964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915322,0.0010508538,0.0026252388,0.0019838247,0.0015228305,0.0012850338],"domain_scores_gemma":[0.9929988,0.0028388347,0.0006890799,0.0016216269,0.0011281047,0.0007235476],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0048817866,0.0008580235,0.0015351113,0.00190172,0.0023972034,0.0026090727,0.0009995766,0.0006858429,0.000024880412],"category_scores_gemma":[0.0001224484,0.0008085019,0.0005446396,0.0022664499,0.0005066994,0.00022226722,0.000011368707,0.0007044674,0.00015369292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024168025,0.0017743481,0.000048084832,0.00081957993,0.0009139638,0.000020301288,0.0016683823,0.9270467,0.00022961093,0.01238263,0.0013714252,0.05348328],"study_design_scores_gemma":[0.0022434636,0.00094271067,0.00007559743,0.001367801,0.00079047383,0.00008237604,0.0074481755,0.9691018,0.00025354684,0.00030374472,0.016579866,0.00081045926],"about_ca_topic_score_codex":0.0011585641,"about_ca_topic_score_gemma":0.00008570532,"teacher_disagreement_score":0.9455728,"about_ca_system_score_codex":0.00031363498,"about_ca_system_score_gemma":0.00046392978,"threshold_uncertainty_score":0.99943656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30327,0.0017456963,0.6678822,0.00031896218,0.0014883379,0.00087162666,0.0000038431795,0.00021300055,0.024206309],"genre_scores_gemma":[0.78832114,0.000029962377,0.20623825,0.00006539133,0.00008685539,0.0000044582016,0.000007751018,0.00001910173,0.005227092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495184,0.00054822984,0.0010938795,0.0014600827,0.00083349016,0.0011124599],"domain_scores_gemma":[0.9974703,0.000621772,0.00045662234,0.00075411727,0.000466579,0.00023058886],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043458496,0.00045465733,0.0006978523,0.002369661,0.0013733867,0.0011649006,0.0011923923,0.00042481834,0.000085480126],"category_scores_gemma":[0.00040623915,0.00046094338,0.0002849331,0.008625551,0.00030304075,0.0014274566,0.000595651,0.0010064015,0.00003481124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000275095,0.0004145211,0.012041949,0.000085142376,0.00011506789,0.000020813834,0.009824322,0.9007255,0.00024644803,0.0064769983,0.000051812836,0.069722325],"study_design_scores_gemma":[0.0009273421,0.000029279749,0.00041945218,0.0012234999,0.0001478392,0.000022446375,0.15586747,0.8343244,0.00015387617,0.000355697,0.006108508,0.0004201859],"about_ca_topic_score_codex":0.0010996702,"about_ca_topic_score_gemma":0.000043142478,"teacher_disagreement_score":0.4850511,"about_ca_system_score_codex":0.000616573,"about_ca_system_score_gemma":0.0006175475,"threshold_uncertainty_score":0.9999267},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79694587,0.014597,0.06979197,0.0006101891,0.002167477,0.0010018207,0.00005881392,0.00046245707,0.11436439],"genre_scores_gemma":[0.7869886,0.0035331114,0.09305812,0.00006173573,0.00026837995,0.000004582039,0.00021985134,0.00013040207,0.11573521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99277997,0.00041878936,0.0012215383,0.0020444805,0.0020860462,0.0014491746],"domain_scores_gemma":[0.99375015,0.0016548843,0.0011574153,0.0010843264,0.0015837101,0.0007695243],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0076999613,0.0008485928,0.0012145351,0.0014969417,0.0024158412,0.0008681662,0.0011276006,0.001052385,0.00066511217],"category_scores_gemma":[0.0016408705,0.0009022222,0.00044183768,0.002680032,0.00031017666,0.00065197656,0.00029030527,0.0015027649,0.0006947725],"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.003943397,0.0030160414,0.015277755,0.0009892494,0.0032043145,0.00095563807,0.27043837,0.22180201,0.0034131384,0.15767057,0.008109672,0.31117985],"study_design_scores_gemma":[0.0018069226,0.00023250132,0.0015021903,0.0010427244,0.001640578,0.000078108904,0.12459248,0.8572685,0.0001620589,0.0029735088,0.0069226045,0.0017778163],"about_ca_topic_score_codex":0.0065982547,"about_ca_topic_score_gemma":0.0017570012,"teacher_disagreement_score":0.63546646,"about_ca_system_score_codex":0.00019948387,"about_ca_system_score_gemma":0.0017648475,"threshold_uncertainty_score":0.99934286},"labels":[],"label_agreement":null}]}