{"meta":{"query_hash":"551296308a21","filters":{"topic":"Resource-Constrained Project Scheduling"},"cohort_total":164,"direct_labels_cover":0,"predictions_cover":164,"exported":164,"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/551296308a21","api":"https://metacan.xera.ac/api/v1/cohort?topic=Resource-Constrained+Project+Scheduling"},"results":[{"id":"W1493332065","doi":"10.5539/mas.v8n5p152","title":"Logic of Interval Uncertainty","year":2014,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Resource-Constrained Project Scheduling","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":"Russian Science Foundation","keywords":"Interval (graph theory); Interpretation (philosophy); Mathematics; Quality (philosophy); Uncertainty analysis; Interval arithmetic; Function (biology); Computer science; Statistics; Epistemology; Combinatorics","score_opus":0.09726818748840614,"score_gpt":0.3704236843490807,"score_spread":0.27315549686067453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493332065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014585833,0.010469622,0.7730986,0.009865417,0.0011575235,0.00014450627,0.0008834894,0.00026578136,0.18952931],"genre_scores_gemma":[0.71148413,0.0077573736,0.2581928,0.0039322246,0.002691069,0.0007946566,0.0007115362,0.00016173598,0.014274452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897434,0.004656903,0.0008192104,0.0018146487,0.0025567524,0.0004090548],"domain_scores_gemma":[0.9913765,0.005759743,0.0006761244,0.0007711946,0.0012048291,0.00021155554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008167953,0.00068905874,0.00070707576,0.0037343344,0.0026543583,0.006427816,0.0013665622,0.0015542819,0.0045322166],"category_scores_gemma":[0.012867235,0.00036242988,0.0014403906,0.0032237833,0.014857282,0.008546003,0.0031277612,0.0039024,0.0008653636],"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.000006184875,0.0000019401161,0.00004585594,0.00003133627,0.0000047396493,0.000022113369,0.00015033089,0.00031397844,0.00007112549,0.9962484,0.00046299148,0.002641121],"study_design_scores_gemma":[0.000005431816,0.000010000324,0.00006348871,0.000052140735,0.000008610736,0.00006296142,0.000095825795,0.0020874294,0.0002022659,0.97975403,0.017646102,0.0000116369],"about_ca_topic_score_codex":0.0020648856,"about_ca_topic_score_gemma":0.000779603,"teacher_disagreement_score":0.008167953,"about_ca_system_score_codex":0.0039498787,"about_ca_system_score_gemma":0.0015819999,"threshold_uncertainty_score":0.043196797},"labels":[],"label_agreement":null},{"id":"W1595750606","doi":"10.1061/(asce)cp.1943-5487.0000498","title":"Zero-One Programming Approach to Determine Optimum Resource Supply under Time-Dependent Resource Constraints","year":2015,"lang":"en","type":"article","venue":"Journal of Computing in Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Research Council Canada","keywords":"Schedule; Scheduling (production processes); Resource leveling; Duration (music); Computer science; Turnaround time; Operations research; Resource (disambiguation); Mathematical optimization; Project management; Resource allocation; Engineering; Systems engineering; Mathematics","score_opus":0.07749233858812359,"score_gpt":0.3110297004792523,"score_spread":0.23353736189112873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595750606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084195575,0.00018102181,0.9854489,0.00018767241,0.000027265567,0.00008678269,0.00008796767,0.00009137869,0.005469481],"genre_scores_gemma":[0.47340336,0.0012179997,0.5144611,0.0001963439,0.00007968082,0.00093541306,0.00033703208,0.00019771453,0.009171404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992436,0.0003122247,0.000024208271,0.00012088148,0.00016751805,0.00013164929],"domain_scores_gemma":[0.99786276,0.0017006743,0.00015494792,0.000034152552,0.00018597973,0.00006146703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018348589,0.0013846022,0.0014521395,0.0010631654,0.0005527644,0.0017302493,0.0014134565,0.0010500932,0.0039040018],"category_scores_gemma":[0.00420842,0.0010146067,0.0011474628,0.001312052,0.0010526683,0.0012318621,0.0010692867,0.0022418888,0.00039671056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019392566,0.000026969323,0.00014380449,0.000079499885,0.000011828037,0.000040632698,0.0000350245,0.97651243,0.00036672628,0.016746152,0.00032638785,0.0056911865],"study_design_scores_gemma":[0.0000068937857,0.00002470519,0.000041578693,0.000010878264,0.0000047067433,0.000008179519,0.000019201541,0.9913946,0.00022983659,0.007818649,0.00043484973,0.0000058760443],"about_ca_topic_score_codex":0.0065982332,"about_ca_topic_score_gemma":0.0055701835,"teacher_disagreement_score":0.0065982332,"about_ca_system_score_codex":0.0014610542,"about_ca_system_score_gemma":0.003332167,"threshold_uncertainty_score":0.013119638},"labels":[],"label_agreement":null},{"id":"W1689295453","doi":"10.1061/(asce)co.1943-7862.0001027","title":"Resource Supply-Demand Matching Scheduling Approach for Construction Workface Planning","year":2015,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Workflow; Executable; Operations research; Schedule; Resource (disambiguation); Traverse; Operations management; Database; Engineering","score_opus":0.05922927266322259,"score_gpt":0.31552136032905054,"score_spread":0.25629208766582795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1689295453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037276873,0.00008288158,0.99204046,0.000102040925,0.000021117847,0.000082702434,0.000059346334,0.00007610554,0.0038075114],"genre_scores_gemma":[0.26288894,0.00054814364,0.7302905,0.000086961314,0.000060805083,0.00042685802,0.0002889298,0.0001308711,0.005277968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907374,0.00035474944,0.0000407315,0.00015211434,0.00026622022,0.00011242488],"domain_scores_gemma":[0.99963117,0.00018424046,0.00005032129,0.000031505104,0.00006413478,0.000038640042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391136,0.0008337295,0.00092775485,0.0009885272,0.0006033412,0.0011270392,0.0014825184,0.000788613,0.0060709184],"category_scores_gemma":[0.0013840437,0.0005587478,0.0010880776,0.0016703717,0.00052917097,0.0011499658,0.000949773,0.0012289095,0.0005966779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049723196,0.000088097935,0.00027561147,0.000111293404,0.000027777402,0.00009218341,0.00007617024,0.89789796,0.0015678654,0.05824756,0.0013214697,0.04024435],"study_design_scores_gemma":[0.000009775626,0.00004498173,0.00009949101,0.000010193107,0.000009076673,0.000032313063,0.000031416148,0.9785221,0.0005947682,0.017025476,0.0036103239,0.000010155508],"about_ca_topic_score_codex":0.0047073695,"about_ca_topic_score_gemma":0.0055628726,"teacher_disagreement_score":0.0060709184,"about_ca_system_score_codex":0.0019162258,"about_ca_system_score_gemma":0.0026446634,"threshold_uncertainty_score":0.02030921},"labels":[],"label_agreement":null},{"id":"W1870952394","doi":"10.1002/mcda.490","title":"Compression of Project Schedules using the Analytical Hierarchy Process","year":2011,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Schedule; Analytic hierarchy process; Computer science; Harmony search; Operations research; Process (computing); Heuristic; Procurement; Risk analysis (engineering); Industrial engineering; Engineering; Artificial intelligence","score_opus":0.38960638530079117,"score_gpt":0.5028744321261565,"score_spread":0.11326804682536529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870952394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006648133,0.00013620693,0.99109495,0.00008182644,0.000023428647,0.00023849339,0.00004027033,0.00017666741,0.0015600387],"genre_scores_gemma":[0.14735423,0.00031438854,0.8502829,0.000034794844,0.000053024793,0.00055736984,0.00017490867,0.00006766889,0.001160735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99165994,0.0030869406,0.000429454,0.0004193657,0.004173489,0.00023086395],"domain_scores_gemma":[0.99331397,0.0042316807,0.0006218033,0.00043642934,0.0012304058,0.00016569011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071118837,0.0009328866,0.0012585861,0.003711951,0.00083163596,0.0016082037,0.001157848,0.0004884725,0.002838103],"category_scores_gemma":[0.015464533,0.0005802513,0.0009858866,0.0030205015,0.0008484688,0.0016018639,0.0016370416,0.0013173054,0.0003961231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013965204,0.00013600755,0.0006777739,0.00033846582,0.00009319907,0.00011986404,0.00077677675,0.5910963,0.0033222933,0.03177087,0.001449289,0.3700795],"study_design_scores_gemma":[0.000047962254,0.00014160042,0.00036465042,0.00007222083,0.000027755508,0.00004375934,0.00014112734,0.9739837,0.0018796813,0.018981097,0.004290805,0.000025521582],"about_ca_topic_score_codex":0.0049093035,"about_ca_topic_score_gemma":0.0037821806,"teacher_disagreement_score":0.0071118837,"about_ca_system_score_codex":0.0019652906,"about_ca_system_score_gemma":0.0028723641,"threshold_uncertainty_score":0.037611663},"labels":[],"label_agreement":null},{"id":"W1942626595","doi":"10.15439/2015f273","title":"A new benchmark dataset for Multi-Skill Resource-Constrained Project Scheduling Problem","year":2015,"lang":"en","type":"article","venue":"Annals of Computer Science and Information Systems","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Scheduling (production processes); Heuristic; Greedy algorithm; Mathematical optimization; Job shop scheduling; Machine learning; Artificial intelligence; Schedule; Algorithm; Mathematics","score_opus":0.25766210454801025,"score_gpt":0.4199907239378667,"score_spread":0.16232861938985643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942626595","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31866783,0.0037868305,0.068256184,0.0033754758,0.001518172,0.0015253703,0.5637575,0.0037197294,0.03539294],"genre_scores_gemma":[0.31714588,0.0015149543,0.10901902,0.0005931537,0.0002023254,0.0017096517,0.563963,0.0003433611,0.005508667],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906427,0.0002817088,0.00009740268,0.00024332249,0.00020820615,0.00010513837],"domain_scores_gemma":[0.9981567,0.0007767645,0.00016364794,0.00033917342,0.0004062403,0.00015750842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010069889,0.0010438374,0.00066884863,0.0015542761,0.0005784685,0.0010721985,0.0021507004,0.0013112144,0.005041502],"category_scores_gemma":[0.004319006,0.00025470948,0.001071073,0.00409772,0.00029273945,0.00090849056,0.0006358514,0.0014657297,0.0010025937],"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.0010254376,0.00196756,0.013357588,0.002808057,0.00037763536,0.00079612085,0.00012883094,0.36255115,0.003958606,0.013600411,0.4583838,0.14104474],"study_design_scores_gemma":[0.00081274635,0.0008908553,0.037347686,0.00040686002,0.00020691032,0.0010517584,0.0007341256,0.6077738,0.008781261,0.025880054,0.31594965,0.0001643421],"about_ca_topic_score_codex":0.009210302,"about_ca_topic_score_gemma":0.013365601,"teacher_disagreement_score":0.009210302,"about_ca_system_score_codex":0.0014730849,"about_ca_system_score_gemma":0.0013831853,"threshold_uncertainty_score":0.018313348},"labels":[],"label_agreement":null},{"id":"W1957849372","doi":"10.3968/j.css.1923669720070303.005","title":"Grey Critical Chain Project Scheduling Technique and Its Application/TECHNIQUE DE PROGRAMMATION DE LA CHAINE CRITIQUE GRISE DU PROJET ET SON APPLICATION","year":2010,"lang":"en","type":"article","venue":"Canadian social science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":9,"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; Operations research; Humanities; Philosophy; Mathematics","score_opus":0.02653385839663599,"score_gpt":0.3900429609888565,"score_spread":0.3635091025922205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957849372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008191822,0.00043575515,0.98500973,0.00018129143,0.000056043922,0.000057933452,0.000022326454,0.00031147525,0.0057336264],"genre_scores_gemma":[0.37522548,0.0017503636,0.6097008,0.000100793164,0.000115116214,0.00020636423,0.00011313043,0.00020208147,0.0125858635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922454,0.00020422372,0.000039638515,0.00014241457,0.0003373154,0.000051750165],"domain_scores_gemma":[0.9994289,0.00022745362,0.000060654613,0.000059421465,0.00018932248,0.000034194312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009564962,0.0005586324,0.00032043847,0.0014441052,0.0006290891,0.0008198461,0.0006329779,0.00050594314,0.004173824],"category_scores_gemma":[0.0019867045,0.00026677173,0.00066623447,0.0015837136,0.0008386296,0.0010462138,0.00067377684,0.000913123,0.0005831632],"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.00018621812,0.000059809983,0.001475223,0.0005897019,0.000050867027,0.00046169493,0.0014509261,0.18898885,0.053486794,0.1969866,0.0051442245,0.551119],"study_design_scores_gemma":[0.00007689526,0.00033347093,0.0014093015,0.00015759686,0.00007439941,0.0006808804,0.00038294998,0.8055213,0.039291352,0.082408115,0.06957697,0.00008679172],"about_ca_topic_score_codex":0.0056503178,"about_ca_topic_score_gemma":0.0027260818,"teacher_disagreement_score":0.0056503178,"about_ca_system_score_codex":0.0012450959,"about_ca_system_score_gemma":0.0016913837,"threshold_uncertainty_score":0.013962805},"labels":[],"label_agreement":null},{"id":"W1967901027","doi":"10.1061/(asce)0733-9364(2000)126:6(414)","title":"Algorithm for Scheduling with Multiskilled Constrained Resources","year":2000,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Economic shortage; Computer science; Scheduling (production processes); Heuristic; Software; Genetic algorithm scheduling; Operations research; Resource (disambiguation); Job shop scheduling; Industrial engineering; Mathematical optimization; Flow shop scheduling; Artificial intelligence; Engineering; Schedule; Operating system","score_opus":0.017469763523441477,"score_gpt":0.27688464488566594,"score_spread":0.25941488136222446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967901027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006689922,0.00013733636,0.9878498,0.00015844824,0.000045825243,0.00027656852,0.00014795178,0.0010192054,0.003675033],"genre_scores_gemma":[0.06580388,0.00017283118,0.93036044,0.00006221697,0.000024733077,0.0005799284,0.00035632547,0.00012258289,0.0025169954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953675,0.00010659735,0.000034418365,0.00009625035,0.00012914701,0.00009679399],"domain_scores_gemma":[0.9995716,0.0002259751,0.000044892564,0.00003891279,0.000089678964,0.000028784387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008838157,0.0009061991,0.00081677816,0.0009829637,0.0009817329,0.0011959672,0.0016118407,0.0011657226,0.0075957733],"category_scores_gemma":[0.0016414477,0.00047214527,0.00062792376,0.0012847651,0.00053724594,0.00097496115,0.0011538343,0.0008802518,0.0014527356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025019576,0.0001683902,0.0006308953,0.0003125092,0.00006765147,0.00013917261,0.00021906203,0.7214592,0.003762683,0.038409773,0.0077955155,0.22678497],"study_design_scores_gemma":[0.00015264204,0.000050258823,0.00010410107,0.000017294966,0.00001582451,0.00005070714,0.000036950896,0.98144287,0.001151555,0.010795757,0.0061701755,0.000011843014],"about_ca_topic_score_codex":0.006799937,"about_ca_topic_score_gemma":0.0073757963,"teacher_disagreement_score":0.0075957733,"about_ca_system_score_codex":0.0012218917,"about_ca_system_score_gemma":0.0030917532,"threshold_uncertainty_score":0.025410414},"labels":[],"label_agreement":null},{"id":"W1969628616","doi":"10.1111/itor.12071","title":"A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem","year":2014,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Resource-Constrained Project Scheduling","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 Victoria","funders":"","keywords":"Mathematical optimization; Computer science; Ant colony optimization algorithms; Scheduling (production processes); Job shop scheduling; Multi-objective optimization; Set (abstract data type); Convergence (economics); Ant colony; Pareto principle; Local search (optimization); Pareto optimal; Mathematics; Routing (electronic design automation)","score_opus":0.13855279954783678,"score_gpt":0.433266879528203,"score_spread":0.2947140799803662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969628616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018128864,0.00021538707,0.9756104,0.00017704185,0.00004957088,0.0000780247,0.000025923679,0.00012448685,0.0055904468],"genre_scores_gemma":[0.5645778,0.0003882875,0.4286621,0.00010366619,0.000049806706,0.00036915203,0.00006454749,0.000074893396,0.005709877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995888,0.00019251998,0.000015023822,0.000037015936,0.0001306866,0.000035992223],"domain_scores_gemma":[0.9996252,0.00022010812,0.000032847962,0.0000160466,0.00007523836,0.000030484338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007449154,0.00074622774,0.0007626114,0.00082583184,0.00049616885,0.0008781043,0.0011295048,0.0010313562,0.0018524915],"category_scores_gemma":[0.0010320756,0.00037299434,0.0005249295,0.0009249261,0.00051423797,0.00043538687,0.0009543174,0.00063625036,0.00025096847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023193794,0.000030448524,0.00014553843,0.000043656368,0.000021354554,0.00006406143,0.000028623908,0.974,0.0011190955,0.007178069,0.00035858335,0.016987491],"study_design_scores_gemma":[0.0000034454376,0.0000070830356,0.000013667799,0.0000015193308,0.0000020583225,0.000005342815,0.0000032739022,0.99892503,0.00008122154,0.00075721066,0.00019894393,0.0000011943642],"about_ca_topic_score_codex":0.0065338644,"about_ca_topic_score_gemma":0.0055354326,"teacher_disagreement_score":0.0065338644,"about_ca_system_score_codex":0.0005257923,"about_ca_system_score_gemma":0.0010230917,"threshold_uncertainty_score":0.012991667},"labels":[],"label_agreement":null},{"id":"W1969794772","doi":"10.1007/s10589-010-9380-0","title":"Heuristics for a project management problem with incompatibility and assignment costs","year":2010,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Resource-Constrained Project Scheduling","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é Laval","funders":"","keywords":"Heuristics; Duration (music); Mathematical optimization; Tabu search; Set (abstract data type); Heuristic; Mathematics; Project management; Computer science; Operations research","score_opus":0.039840321685528014,"score_gpt":0.3602183300798796,"score_spread":0.32037800839435154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969794772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09833261,0.0009908782,0.88747126,0.000823087,0.00015869223,0.00055757375,0.00039039084,0.0003901186,0.0108854445],"genre_scores_gemma":[0.43935484,0.0006657909,0.5548484,0.00022445632,0.000135387,0.0007072386,0.00045991628,0.00014431676,0.0034597039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801254,0.0011619016,0.00008394254,0.00020875681,0.00025469565,0.0002780422],"domain_scores_gemma":[0.9916319,0.007235248,0.00038650967,0.00020423441,0.00025991444,0.00028209653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038104753,0.0015994004,0.0024647615,0.00309834,0.001247261,0.0027874438,0.0029780508,0.0031161178,0.0047119693],"category_scores_gemma":[0.009884082,0.001810455,0.0017678156,0.004172158,0.0015803131,0.0026966303,0.0017303169,0.0023151482,0.0003040539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010594114,0.00012492527,0.00030825584,0.000114587594,0.00005578974,0.0000739173,0.00006955347,0.96106356,0.00028550363,0.018887797,0.0012539275,0.017656196],"study_design_scores_gemma":[0.000083672596,0.000051818854,0.0001463136,0.000021822389,0.000034025892,0.000025087564,0.000036528483,0.9813519,0.0001564676,0.01740305,0.0006759922,0.000013284546],"about_ca_topic_score_codex":0.00940188,"about_ca_topic_score_gemma":0.0107120555,"teacher_disagreement_score":0.00940188,"about_ca_system_score_codex":0.0028303703,"about_ca_system_score_gemma":0.0030585944,"threshold_uncertainty_score":0.020535886},"labels":[],"label_agreement":null},{"id":"W1969988169","doi":"10.1061/(asce)me.1943-5479.0000338","title":"Multimode Resource-Constrained Scheduling and Leveling for Practical-Size Projects","year":2014,"lang":"en","type":"article","venue":"Journal of Management in Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":53,"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; Golder Associates (Canada)","funders":"","keywords":"Solver; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Job shop scheduling; Constraint programming; Software; Heuristics; Project management; Heuristic; Industrial engineering; Operations research; Systems engineering; Algorithm; Stochastic programming; Schedule; Mathematics; Engineering; Programming language","score_opus":0.07902712514998302,"score_gpt":0.3579501755480102,"score_spread":0.2789230503980272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969988169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03167357,0.000301364,0.9618064,0.00023175208,0.000040202023,0.00015128305,0.00008905498,0.00025560087,0.005450765],"genre_scores_gemma":[0.40212736,0.0004120792,0.5938654,0.00007699941,0.000025908399,0.00026436787,0.0001895623,0.00012925966,0.0029090398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984326,0.0008127698,0.00005937717,0.0002262469,0.00027200373,0.000197035],"domain_scores_gemma":[0.9978388,0.0013202425,0.00027915902,0.0001718393,0.00021278615,0.00017711916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022601858,0.0007078474,0.0008570746,0.000919427,0.00081003446,0.0013844451,0.0011257447,0.0009466814,0.0046627917],"category_scores_gemma":[0.005341401,0.0004987771,0.00071415055,0.0016637706,0.0004970481,0.0015891758,0.00119115,0.001172751,0.0004538651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009291121,0.00007709723,0.0006226251,0.00017430674,0.00002829689,0.00008352488,0.00006488066,0.8969421,0.002971808,0.016700272,0.0012645151,0.08097765],"study_design_scores_gemma":[0.000018574277,0.00010317384,0.00027425503,0.00002011638,0.000008623872,0.000041825413,0.000053981774,0.98371017,0.0017832812,0.010341766,0.0036316486,0.000012562148],"about_ca_topic_score_codex":0.0061447835,"about_ca_topic_score_gemma":0.009535105,"teacher_disagreement_score":0.0061447835,"about_ca_system_score_codex":0.0014777594,"about_ca_system_score_gemma":0.002443238,"threshold_uncertainty_score":0.015598536},"labels":[],"label_agreement":null},{"id":"W1974202129","doi":"10.1016/j.autcon.2014.03.008","title":"Construction spatial modeling and scheduling with three-dimensional singularity functions","year":2014,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"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":"Scheduling (production processes); Cartesian coordinate system; Mathematical optimization; Computer science; Singularity; Dimension (graph theory); Fourth Dimension; Mathematics; Spacetime; Geometry","score_opus":0.04101644279093249,"score_gpt":0.2994533535044828,"score_spread":0.25843691071355035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974202129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06803415,0.00019923493,0.9276259,0.00018106688,0.000033257827,0.000031367483,0.00010176847,0.00009993924,0.0036932924],"genre_scores_gemma":[0.9154685,0.00030991164,0.08075895,0.000038017166,0.00002902096,0.00009104967,0.00012219399,0.00005619999,0.0031261516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994393,0.00021587349,0.000033146433,0.00010649694,0.0001023306,0.00010282207],"domain_scores_gemma":[0.9987801,0.00072574656,0.00017787406,0.00006872865,0.00014588091,0.00010168427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011211759,0.0008957356,0.0014690581,0.0010083964,0.0007336711,0.0018861808,0.0015212456,0.0011003016,0.0016829129],"category_scores_gemma":[0.0032290418,0.00080594386,0.0014546327,0.0018173029,0.0016641185,0.0016023284,0.0013415675,0.0011598179,0.00023433124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013303934,0.000010229842,0.00019511451,0.000008105811,0.000004935302,0.000017789696,0.000016354788,0.982786,0.00013730365,0.015114525,0.00006900012,0.0016272488],"study_design_scores_gemma":[0.0000015097343,0.000002976683,0.000030550404,9.1148667e-7,0.0000016074594,0.000002163766,0.000003477066,0.99625623,0.000042642692,0.003584142,0.000071609014,0.0000021537523],"about_ca_topic_score_codex":0.025327278,"about_ca_topic_score_gemma":0.011092568,"teacher_disagreement_score":0.025327278,"about_ca_system_score_codex":0.0021782077,"about_ca_system_score_gemma":0.0018912309,"threshold_uncertainty_score":0.050359666},"labels":[],"label_agreement":null},{"id":"W1975246199","doi":"10.1061/(asce)0733-9364(2003)129:6(664)","title":"Optimized Scheduling of Linear Projects","year":2003,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bidding; Computer science; Scheduling (production processes); Crew; Linear programming; Operations research; Software; Crew scheduling; Process (computing); Industrial engineering; Engineering; Operations management; Algorithm; Programming language","score_opus":0.03945352496548811,"score_gpt":0.3002256918817797,"score_spread":0.2607721669162916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975246199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13216865,0.00036703178,0.8412126,0.00031407937,0.00006245252,0.0002896082,0.0007301213,0.00057223387,0.024283238],"genre_scores_gemma":[0.85674834,0.00037709883,0.12899998,0.00004958005,0.000021048603,0.00040502488,0.0005688074,0.00011828007,0.012711936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999382,0.00025160302,0.000019961919,0.000116829426,0.00012370116,0.00010586263],"domain_scores_gemma":[0.999463,0.00027769504,0.00009942493,0.00003184589,0.00007431486,0.000053719377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007722751,0.00064109,0.0008100106,0.0004399792,0.00040251706,0.0012468095,0.0010050462,0.0007681817,0.0046990053],"category_scores_gemma":[0.0016468804,0.0005906398,0.00049159274,0.00072431413,0.0005327986,0.0008329282,0.00057479605,0.00060801796,0.0005067417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002346907,0.000013406507,0.00010202008,0.000017083885,0.000003853588,0.000014614669,0.000010029248,0.9949385,0.00015138883,0.0021006344,0.00016347849,0.0024615533],"study_design_scores_gemma":[0.0000120657505,0.000026754058,0.000075113225,0.0000028012018,0.0000028867169,0.000004103454,0.0000083713585,0.9978142,0.00012810047,0.0015012585,0.00042145172,0.0000028945599],"about_ca_topic_score_codex":0.01384945,"about_ca_topic_score_gemma":0.014271513,"teacher_disagreement_score":0.01384945,"about_ca_system_score_codex":0.0016785277,"about_ca_system_score_gemma":0.0022387477,"threshold_uncertainty_score":0.027537644},"labels":[],"label_agreement":null},{"id":"W1993807130","doi":"10.5430/air.v1n2p185","title":"An ABC-Genetic method to solve resource constrained project scheduling problem","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":8,"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 Fredericton; University of New Brunswick","funders":"","keywords":"Computer science; Mathematical optimization; Metaheuristic; Genetic algorithm; Scheduling (production processes); Set (abstract data type); Algorithm; Mathematics","score_opus":0.49280051569781036,"score_gpt":0.5737288236780013,"score_spread":0.0809283079801909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993807130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02049335,0.0009865918,0.9650252,0.00036503465,0.00015223381,0.00018087353,0.00008324035,0.00027355764,0.012439961],"genre_scores_gemma":[0.28090245,0.0011589612,0.7093476,0.00020021225,0.00006166522,0.0004567807,0.00025406538,0.000058197224,0.0075600725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995383,0.00017842276,0.000021280583,0.000045469853,0.00017591695,0.00004060628],"domain_scores_gemma":[0.9996978,0.00013155096,0.000026852638,0.000015885813,0.00011099338,0.000016998254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006858975,0.0006278525,0.00062865275,0.0009078654,0.00052203896,0.0006502294,0.00083237566,0.0009926084,0.0028132107],"category_scores_gemma":[0.001415012,0.00021414467,0.00055883615,0.0013575797,0.00031021275,0.0005049461,0.00042266055,0.0007622979,0.0003870117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006050907,0.0000990737,0.0010509718,0.00021237838,0.0000712897,0.00012478438,0.00007988036,0.78812605,0.0031768547,0.023558281,0.0034686374,0.17997131],"study_design_scores_gemma":[0.000024659066,0.000048283742,0.00017872578,0.000018027646,0.000015524418,0.00007624833,0.000017097653,0.9923097,0.0006503552,0.0027842752,0.0038702253,0.0000069495472],"about_ca_topic_score_codex":0.010119027,"about_ca_topic_score_gemma":0.008426418,"teacher_disagreement_score":0.010119027,"about_ca_system_score_codex":0.0007507195,"about_ca_system_score_gemma":0.0016628973,"threshold_uncertainty_score":0.020120263},"labels":[],"label_agreement":null},{"id":"W1994057952","doi":"10.1139/l06-057","title":"An optimization model for workgroup-based repetitive scheduling","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":6,"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":"Workgroup; Scheduling (production processes); Job shop scheduling; Computer science; Operations research; Industrial engineering; Rework; Mathematical optimization; Engineering; Schedule; Operations management; Computer network; Mathematics","score_opus":0.03993039463950925,"score_gpt":0.2881642235264971,"score_spread":0.24823382888698786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994057952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033249475,0.00020574448,0.94773936,0.00032631133,0.00004022981,0.00017665146,0.0003093649,0.00021836627,0.01773444],"genre_scores_gemma":[0.8256046,0.000690019,0.15346645,0.00009479152,0.00003470027,0.0009688644,0.00050817785,0.00010579085,0.018526493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00018265894,0.000020466734,0.00012198487,0.00015678832,0.00010593935],"domain_scores_gemma":[0.9995809,0.00019664197,0.0000843541,0.000023102115,0.000077684716,0.00003732988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089525135,0.00095497514,0.0009877189,0.00075964665,0.00063127564,0.0013941101,0.0020519071,0.0018725717,0.006186525],"category_scores_gemma":[0.0015690328,0.0005247166,0.0007995028,0.0013054239,0.00083487027,0.0013559808,0.00073109043,0.0010832374,0.0008430471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011871136,0.000012779768,0.000084902196,0.000013091643,0.0000055705154,0.000025366011,0.000016027845,0.990837,0.00023296938,0.0068198526,0.00022738522,0.0017131484],"study_design_scores_gemma":[0.0000085958645,0.000014642234,0.000064480606,0.0000031004574,0.0000035504672,0.000007957832,0.000009893741,0.9959865,0.0000882682,0.0032319173,0.0005772391,0.0000037301163],"about_ca_topic_score_codex":0.014342558,"about_ca_topic_score_gemma":0.007910551,"teacher_disagreement_score":0.014342558,"about_ca_system_score_codex":0.002183618,"about_ca_system_score_gemma":0.00210345,"threshold_uncertainty_score":0.02851814},"labels":[],"label_agreement":null},{"id":"W1994453397","doi":"10.1139/l08-135","title":"Robust global and local search approach to resource-constrained project scheduling","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"Mathematical optimization; Computer science; Local search (optimization); Guided Local Search; Scheduling (production processes); Genetic algorithm; Premature convergence; Tabu search; Heuristic; Algorithm; Mathematics","score_opus":0.06983607493615519,"score_gpt":0.296244105261282,"score_spread":0.2264080303251268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994453397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008968034,0.00021143469,0.9879023,0.000087774206,0.000020600517,0.000026213822,0.000023086803,0.00027607987,0.002484442],"genre_scores_gemma":[0.70272607,0.00035228164,0.29226142,0.00012787251,0.000061286766,0.00024797954,0.00013274819,0.000147754,0.0039425143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942905,0.00026151733,0.00001793315,0.00008498349,0.00015523378,0.00005121181],"domain_scores_gemma":[0.99921703,0.00046949534,0.000089471374,0.000054512795,0.00012595751,0.00004360013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013772637,0.0007274495,0.0012807309,0.0009413411,0.00038687044,0.00071047974,0.001379182,0.0008946927,0.0018968028],"category_scores_gemma":[0.0021650738,0.00043724503,0.00079203746,0.0008786827,0.0009708405,0.00082418486,0.00085730944,0.0007625631,0.00034872856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015498646,0.000008038753,0.000067671295,0.000015276868,0.000018730934,0.000014549374,0.000011192486,0.98624134,0.0002988441,0.0035488466,0.00020251103,0.009557574],"study_design_scores_gemma":[0.0000056200142,0.000013329896,0.000019198747,0.0000014936744,0.0000036492477,0.0000040537625,0.000002958361,0.99818677,0.000103519465,0.0014957122,0.00016144467,0.000002200332],"about_ca_topic_score_codex":0.0048243273,"about_ca_topic_score_gemma":0.0036126098,"teacher_disagreement_score":0.0048243273,"about_ca_system_score_codex":0.0008451697,"about_ca_system_score_gemma":0.0013139892,"threshold_uncertainty_score":0.009592533},"labels":[],"label_agreement":null},{"id":"W1994525790","doi":"10.1111/j.1475-3995.2012.00842.x","title":"Resource‐constrained project scheduling through the goal programming model: integration of the manager's preferences","year":2012,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Resource-Constrained Project Scheduling","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":"Laurentian University; Université Laval; Golder Associates (Canada)","funders":"","keywords":"Goal programming; Computer science; Scheduling (production processes); Operations research; Process management; Mathematical optimization; Business; Mathematics","score_opus":0.3098998449138487,"score_gpt":0.49175098647437443,"score_spread":0.18185114156052573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994525790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030726062,0.000070862174,0.96475285,0.0002625763,0.000010962329,0.000041097428,0.00003661397,0.00007181662,0.004027197],"genre_scores_gemma":[0.7526555,0.00021290252,0.24472961,0.0000676276,0.000019116982,0.00021135632,0.00006221241,0.00004245521,0.0019993505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888283,0.000757071,0.000023585695,0.000060880797,0.00019789292,0.00007777125],"domain_scores_gemma":[0.999231,0.0004972572,0.000077555604,0.000032247026,0.00010413649,0.000057841742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020953554,0.00046032015,0.00056333485,0.0003677955,0.00029662915,0.0014724552,0.000908668,0.0005489044,0.0014673301],"category_scores_gemma":[0.0024434344,0.00036170194,0.00044037806,0.0007289658,0.0003910323,0.001034587,0.00057840644,0.0009845312,0.00020789757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067747605,0.00006506338,0.00031442213,0.000035729157,0.000028789847,0.000054392305,0.00009109797,0.95520324,0.00094074645,0.028742857,0.000441558,0.01401445],"study_design_scores_gemma":[0.000009816249,0.000023522169,0.00006622517,0.0000057005086,0.0000050918748,0.0000067147275,0.000017419285,0.99313426,0.00016852311,0.0062117046,0.00034689662,0.000004179126],"about_ca_topic_score_codex":0.0035985508,"about_ca_topic_score_gemma":0.003946003,"teacher_disagreement_score":0.0035985508,"about_ca_system_score_codex":0.00074922934,"about_ca_system_score_gemma":0.0018505456,"threshold_uncertainty_score":0.011081457},"labels":[],"label_agreement":null},{"id":"W1997169784","doi":"10.5539/ass.v11n1p204","title":"Genetic Algorithm of Network Graph Multi-Objective Optimization as an Instrument of Project Monitoring","year":2014,"lang":"en","type":"article","venue":"Asian Social Science","topic":"Resource-Constrained Project Scheduling","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":"Kazan Federal University","keywords":"Computer science; Graph; Earned value management; Network monitoring; Genetic algorithm; Project management triangle; Project management; Theoretical computer science; Systems engineering; Machine learning; Project charter; Engineering; Computer network","score_opus":0.05747877646932525,"score_gpt":0.3710632454947993,"score_spread":0.31358446902547404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997169784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045663416,0.0006507716,0.9462525,0.0004025776,0.0000622146,0.000104505314,0.00008619094,0.00025937118,0.0065184277],"genre_scores_gemma":[0.73205775,0.0007609005,0.26017895,0.00015434517,0.00005132932,0.0005468813,0.00034516727,0.0000702719,0.00583443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995627,0.00021261233,0.000012969385,0.00007594406,0.00007941758,0.000056446042],"domain_scores_gemma":[0.99945134,0.00034787843,0.000053012358,0.000019707328,0.000107247535,0.000020834928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008773759,0.00087453733,0.0008490814,0.0009315347,0.00048551618,0.00082553085,0.0009708585,0.0009746068,0.0018102385],"category_scores_gemma":[0.0018378751,0.00038569703,0.00059049675,0.001041021,0.00056225475,0.00065389596,0.0006399686,0.00082598446,0.00014764574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013294018,0.000012912608,0.00035880264,0.000016727821,0.000018871953,0.000019316763,0.000019089659,0.9867343,0.00015128746,0.0032516439,0.00031602994,0.009087815],"study_design_scores_gemma":[0.0000067302813,0.0000097491165,0.000084703854,0.0000043874543,0.0000047473363,0.000004342339,0.0000059540334,0.99811554,0.000066132096,0.0015010826,0.00019477306,0.0000019760705],"about_ca_topic_score_codex":0.014841679,"about_ca_topic_score_gemma":0.008769176,"teacher_disagreement_score":0.014841679,"about_ca_system_score_codex":0.0012948317,"about_ca_system_score_gemma":0.0015730328,"threshold_uncertainty_score":0.029510558},"labels":[],"label_agreement":null},{"id":"W2012605577","doi":"10.1139/l09-049","title":"Improved genetic algorithm for resource-constrained scheduling of large projects","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"University of Florida","keywords":"Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Genetic algorithm scheduling; Genetic algorithm; Project management; Algorithm; Dynamic priority scheduling; Two-level scheduling; Engineering; Systems engineering; Mathematics; Machine learning","score_opus":0.02988674346614349,"score_gpt":0.28485290728277,"score_spread":0.2549661638166265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012605577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023811629,0.00016322886,0.97257,0.00010732276,0.000023979854,0.000046931433,0.000037307003,0.0003056318,0.0029339518],"genre_scores_gemma":[0.4296472,0.00029971125,0.56542957,0.000092126225,0.00003681903,0.00030638356,0.00021431687,0.00009335006,0.0038804535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995177,0.00016035522,0.000017029392,0.000071581366,0.00018141295,0.000051850522],"domain_scores_gemma":[0.99958926,0.00022246798,0.000047222962,0.000037199552,0.0000889309,0.000015007778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089964,0.0004762062,0.00077838893,0.0007002489,0.00035679762,0.0005045165,0.0008718827,0.0007096153,0.0012509623],"category_scores_gemma":[0.0018364656,0.0002945991,0.00050810614,0.0010061298,0.00050779217,0.00048009376,0.00053488376,0.0006942539,0.00024235898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013752693,0.000010833111,0.000085795466,0.00000943584,0.000009239455,0.000015587528,0.000014776129,0.9747766,0.0004501036,0.0034379573,0.0002562645,0.02091963],"study_design_scores_gemma":[0.000010534517,0.000008543724,0.000034945977,0.0000014031175,0.000002900138,0.000005198092,0.0000017435555,0.99808717,0.0001157407,0.0014617955,0.0002685038,0.000001515687],"about_ca_topic_score_codex":0.009497217,"about_ca_topic_score_gemma":0.0074354573,"teacher_disagreement_score":0.009497217,"about_ca_system_score_codex":0.0010010746,"about_ca_system_score_gemma":0.001759416,"threshold_uncertainty_score":0.018883884},"labels":[],"label_agreement":null},{"id":"W2013987637","doi":"10.1061/(asce)me.1943-5479.0000190","title":"Discussion of “Ant Colony Optimization for Multimode Resource-Constrained Project Scheduling” by Hong Zhang","year":2014,"lang":"en","type":"article","venue":"Journal of Management in Engineering","topic":"Resource-Constrained Project Scheduling","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 Waterloo","funders":"","keywords":"Zhàng; Ant colony optimization algorithms; Scheduling (production processes); ANT; Operations research; Computer science; Mathematical optimization; Engineering; Artificial intelligence; Operations management; Geography; Mathematics; Computer network; China","score_opus":0.035036045946857775,"score_gpt":0.3236500471661229,"score_spread":0.2886140012192651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013987637","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015650412,0.06582284,0.11552508,0.67469764,0.030284503,0.00021464325,0.00018263556,0.00017525506,0.097447],"genre_scores_gemma":[0.41653258,0.097559154,0.065811925,0.2033522,0.026421014,0.0005217002,0.00024281912,0.00028051547,0.18927804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798536,0.0010050929,0.000103459206,0.00024068801,0.0005750511,0.00009022229],"domain_scores_gemma":[0.99781203,0.0011740228,0.00010016903,0.0000781091,0.0007473205,0.000088282184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042275125,0.00041421974,0.00034051455,0.0006923493,0.00094836287,0.0020200855,0.0013546847,0.0023661498,0.0029024389],"category_scores_gemma":[0.0062901466,0.00022676018,0.0007448447,0.0015969153,0.0011950094,0.0027005263,0.0010447328,0.0025921515,0.00063978264],"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.00015577307,0.00010975411,0.0017549483,0.0008287757,0.000114463575,0.0014274536,0.0024616143,0.02517008,0.001376018,0.47242135,0.36404693,0.13013282],"study_design_scores_gemma":[0.00005116681,0.00010174193,0.0012707819,0.0004603463,0.00003583125,0.00038236697,0.00152776,0.021016981,0.0019580931,0.08434719,0.8887845,0.000063292646],"about_ca_topic_score_codex":0.0057930383,"about_ca_topic_score_gemma":0.003185235,"teacher_disagreement_score":0.0057930383,"about_ca_system_score_codex":0.0018641026,"about_ca_system_score_gemma":0.0014280077,"threshold_uncertainty_score":0.022357523},"labels":[],"label_agreement":null},{"id":"W2021216055","doi":"10.5539/cis.v2n1p188","title":"Stochastic Programming Models and Hybrid Intelligent Algorithm for Unbalanced Bidding Problem","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"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; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Bidding; Computer science; Mathematical optimization; Stochastic programming; Genetic algorithm; Artificial neural network; Genetic programming; Value (mathematics); Order (exchange); Hybrid algorithm (constraint satisfaction); Stochastic optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics; Constraint programming","score_opus":0.06573409781362602,"score_gpt":0.3486509251111805,"score_spread":0.2829168272975545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021216055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010495323,0.00010212132,0.98707724,0.00012738448,0.000013396807,0.000018731582,0.000015584943,0.000068838475,0.0020813157],"genre_scores_gemma":[0.7395433,0.0004779747,0.25396353,0.00013830539,0.0000617064,0.00042225537,0.0001536912,0.00007178405,0.0051674144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993773,0.0002850579,0.00002610738,0.00006903798,0.00017695768,0.00006565204],"domain_scores_gemma":[0.99932075,0.00044136937,0.00008930556,0.000023471315,0.00009633055,0.00002869569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012890022,0.00076432806,0.00087810855,0.0005775385,0.00037546904,0.0010302479,0.0011876464,0.0008654111,0.001600799],"category_scores_gemma":[0.0022735372,0.00047365404,0.00070623093,0.00082142814,0.00060199224,0.0012208115,0.000667862,0.0010709332,0.00020321178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011889978,0.00001314455,0.000093815645,0.000011540065,0.000009804243,0.000019951163,0.000015867665,0.974898,0.00016694902,0.019145273,0.00020774706,0.005405985],"study_design_scores_gemma":[0.0000030305937,0.000003992898,0.0000140410275,8.7044356e-7,0.0000011790282,0.0000031383804,0.0000014741901,0.99635303,0.000027249398,0.0035110924,0.000079373924,0.000001505326],"about_ca_topic_score_codex":0.0053237854,"about_ca_topic_score_gemma":0.003407512,"teacher_disagreement_score":0.0053237854,"about_ca_system_score_codex":0.0008583111,"about_ca_system_score_gemma":0.0010732526,"threshold_uncertainty_score":0.010585606},"labels":[],"label_agreement":null},{"id":"W2026357126","doi":"10.1007/s10845-012-0719-5","title":"CIGI2011: A heuristic method for resource-constrained project scheduling with activity overlapping","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"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; SNC-Lavalin (Canada)","funders":"","keywords":"Rework; Computer science; Schedule; Scheduling (production processes); Duration (music); Heuristic; Downstream (manufacturing); Upstream (networking); Set (abstract data type); Resource consumption; Resource (disambiguation); Operations research; Mathematical optimization; Industrial engineering; Operations management; Engineering; Mathematics; Artificial intelligence; Embedded system; Computer network","score_opus":0.12183211971760004,"score_gpt":0.4027743370761721,"score_spread":0.28094221735857206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026357126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018566096,0.0004583283,0.96727115,0.00019809217,0.00026777442,0.000378569,0.00035035124,0.0021425276,0.0103671495],"genre_scores_gemma":[0.12614727,0.0002463294,0.86723804,0.00022471775,0.000087196495,0.0007096144,0.000760388,0.00050001155,0.004086391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993748,0.00019364737,0.000027447286,0.000078224715,0.0002008277,0.00012506546],"domain_scores_gemma":[0.9991629,0.00039759395,0.000048462825,0.00008820666,0.00021624066,0.000086624925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015454008,0.0012884401,0.0016982978,0.002338965,0.0009811887,0.0013537698,0.0027016976,0.001547335,0.00692741],"category_scores_gemma":[0.0027374143,0.000875215,0.00149809,0.003003816,0.0005676105,0.0008887572,0.0011952809,0.0015356416,0.00093370787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020688801,0.00020725708,0.00060072634,0.00021726095,0.00009223284,0.00010344089,0.000076796074,0.7558573,0.0028514068,0.0082358,0.0066167144,0.22493419],"study_design_scores_gemma":[0.00005922097,0.00004379354,0.00011976069,0.000015791647,0.000022118287,0.000022691815,0.00001221362,0.99460065,0.0008157811,0.0017117553,0.0025649164,0.000011350804],"about_ca_topic_score_codex":0.01744408,"about_ca_topic_score_gemma":0.019429957,"teacher_disagreement_score":0.01744408,"about_ca_system_score_codex":0.0021992098,"about_ca_system_score_gemma":0.004622382,"threshold_uncertainty_score":0.034685075},"labels":[],"label_agreement":null},{"id":"W2029292549","doi":"10.1061/(asce)co.1943-7862.0000916","title":"Location-Aware Scheduling and Control of Linear Projects: Introducing Space-Time Float Prisms","year":2014,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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":"McMaster University","funders":"","keywords":"Scheduling (production processes); Computer science; Operations research; Float (project management); Real-time computing; Space time; Industrial engineering; Simulation; Operations management; Marine engineering; Engineering","score_opus":0.012831717861110809,"score_gpt":0.2549513047224789,"score_spread":0.24211958686136809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029292549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014179392,0.00019881854,0.98177755,0.0001211531,0.00008471589,0.00004595779,0.000035483907,0.0001500073,0.0034069472],"genre_scores_gemma":[0.77728814,0.00060901354,0.2182652,0.00010714959,0.00011172204,0.00022008724,0.0000897788,0.00007038128,0.0032384575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00013774828,0.000029196526,0.0001189879,0.00014678536,0.00007938195],"domain_scores_gemma":[0.99919575,0.00030613545,0.00019645487,0.000050841063,0.00015567857,0.00009521007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094577036,0.0005319415,0.0005984876,0.00045951788,0.0004486249,0.0010680764,0.0011245973,0.000643512,0.0016924589],"category_scores_gemma":[0.0018339877,0.0004077997,0.0006478217,0.0005447434,0.0010662017,0.0010558346,0.0015918828,0.0010055557,0.000248201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006867336,0.00003501837,0.0003631667,0.000060482893,0.00001907416,0.00006286971,0.00009149355,0.94982517,0.0034494733,0.027001081,0.00042574108,0.01859781],"study_design_scores_gemma":[0.000008257584,0.000058607642,0.0000828952,0.0000071398854,0.000004974684,0.000009444507,0.000012639182,0.9949722,0.0004056521,0.003175653,0.0012552132,0.000007167775],"about_ca_topic_score_codex":0.006744032,"about_ca_topic_score_gemma":0.0041266754,"teacher_disagreement_score":0.006744032,"about_ca_system_score_codex":0.00067198224,"about_ca_system_score_gemma":0.0014113232,"threshold_uncertainty_score":0.013409555},"labels":[],"label_agreement":null},{"id":"W2033535334","doi":"10.1002/nav.20091","title":"Project scheduling under competition","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Resource-Constrained Project Scheduling","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":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Heuristics; Computer science; Profit (economics); Scheduling (production processes); Mathematical optimization; Operations research; Job shop scheduling; Mathematics; Microeconomics; Economics","score_opus":0.5793536814083795,"score_gpt":0.5661915052106762,"score_spread":0.013162176197703324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033535334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47846112,0.0012055577,0.46184644,0.0021193062,0.0002738591,0.00071168854,0.0007305918,0.0005102436,0.054141253],"genre_scores_gemma":[0.9478563,0.00038621057,0.04471998,0.00012005541,0.00008994393,0.00027660804,0.0003970515,0.000085642605,0.006068206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997006,0.0013187709,0.00008807964,0.00046794055,0.0003938101,0.0007254274],"domain_scores_gemma":[0.99445194,0.0032410943,0.00048522613,0.0002366254,0.00043877392,0.00114641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024381147,0.0009061145,0.0015153612,0.00072406564,0.0011040474,0.0019188164,0.001479037,0.0012266565,0.0074504805],"category_scores_gemma":[0.0075648697,0.0005921151,0.00079900475,0.0017528823,0.0013318425,0.002029591,0.0014018553,0.0015469261,0.000741349],"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.00054282555,0.00020313798,0.0014830016,0.00024267635,0.00007272581,0.00060438924,0.00019316319,0.8683281,0.0028814517,0.09036938,0.0053679063,0.029711084],"study_design_scores_gemma":[0.0002256434,0.00054912484,0.00094492704,0.000029733175,0.00002753404,0.00033420362,0.00022897743,0.8972703,0.0014192964,0.09020481,0.008714562,0.000050851195],"about_ca_topic_score_codex":0.006131332,"about_ca_topic_score_gemma":0.0033468062,"teacher_disagreement_score":0.0074504805,"about_ca_system_score_codex":0.0019400276,"about_ca_system_score_gemma":0.002662091,"threshold_uncertainty_score":0.024924397},"labels":[],"label_agreement":null},{"id":"W2041826802","doi":"10.4018/ijamc.2015040104","title":"Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem","year":2015,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Resource-Constrained Project Scheduling","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 Victoria","funders":"","keywords":"Computer science; Benchmark (surveying); Mathematical optimization; Genetic algorithm; Scheduling (production processes); Algorithm; Resource constraints; Mathematics; Machine learning; Distributed computing","score_opus":0.09795418836628828,"score_gpt":0.3777364726663504,"score_spread":0.27978228430006213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041826802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136505235,0.00065400894,0.9803436,0.00015837663,0.000045262124,0.00009057205,0.000046515554,0.00018222485,0.004828851],"genre_scores_gemma":[0.2553914,0.0010494326,0.73917806,0.00012464655,0.000053930566,0.0004930796,0.00024416484,0.00006248864,0.0034028073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960846,0.00016421355,0.000015008351,0.000050659324,0.00012595567,0.00003567675],"domain_scores_gemma":[0.9997712,0.00013865244,0.000023230377,0.000013304306,0.00004410618,0.000009590504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122095,0.00071452424,0.0006810682,0.00075820275,0.00043843052,0.00051404344,0.00083010795,0.0010474339,0.0012807925],"category_scores_gemma":[0.0014453998,0.00025148992,0.00061611366,0.0011744491,0.00047110117,0.0003764512,0.00048184692,0.0010227223,0.00029271518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024762794,0.000029945213,0.00025950876,0.00005887075,0.000038629485,0.00004934076,0.000038921058,0.9322648,0.0013772795,0.014171922,0.00071776804,0.05096822],"study_design_scores_gemma":[0.00002264122,0.00003488289,0.000116207666,0.000013177582,0.000013734047,0.00003452713,0.000013159799,0.99126875,0.0005603908,0.0061307005,0.001785389,0.000006440531],"about_ca_topic_score_codex":0.0047902497,"about_ca_topic_score_gemma":0.0033746553,"teacher_disagreement_score":0.0047902497,"about_ca_system_score_codex":0.00063498394,"about_ca_system_score_gemma":0.0014566247,"threshold_uncertainty_score":0.009524703},"labels":[],"label_agreement":null},{"id":"W2044479004","doi":"10.1061/(asce)0733-9364(2003)129:6(698)","title":"Resource Optimization Using Combined Simulation and Genetic Algorithms","year":2003,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Genetic algorithm; Software; Set (abstract data type); Mathematical optimization; Resource (disambiguation); Simulation modeling; Simulation software; Industrial engineering; Engineering; Machine learning","score_opus":0.0389053613313472,"score_gpt":0.3042320755583036,"score_spread":0.2653267142269564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044479004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008116313,0.00017377596,0.9878934,0.000085589585,0.00002238206,0.00004101932,0.000016823255,0.0004557872,0.0031948776],"genre_scores_gemma":[0.4095395,0.0007008302,0.5865725,0.00008138541,0.00006055767,0.00037666454,0.00011406801,0.00015104914,0.0024034954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990828,0.0004435282,0.00003359208,0.00009286436,0.00029295636,0.000054277803],"domain_scores_gemma":[0.99901104,0.00071615295,0.0000704432,0.00007684236,0.00010182211,0.000023662351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108227,0.0011250837,0.0012131464,0.001451838,0.0004288371,0.0011507598,0.0011927867,0.0011322205,0.0014948957],"category_scores_gemma":[0.0024063385,0.0006193405,0.0009794608,0.0010409267,0.00085441844,0.00105655,0.0008385385,0.00085544854,0.0002777904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013110551,0.00001596031,0.00014527129,0.000014034389,0.000031153995,0.000013323135,0.000011265833,0.9817006,0.00044215063,0.004758219,0.00009588231,0.012759041],"study_design_scores_gemma":[0.000006202395,0.000008931765,0.000022841014,0.000002841053,0.000005406767,0.000004076585,0.0000019266952,0.9977736,0.00018264647,0.0016537448,0.00033503203,0.000002794007],"about_ca_topic_score_codex":0.008212738,"about_ca_topic_score_gemma":0.0058564427,"teacher_disagreement_score":0.008212738,"about_ca_system_score_codex":0.0011428065,"about_ca_system_score_gemma":0.0011840279,"threshold_uncertainty_score":0.016329885},"labels":[],"label_agreement":null},{"id":"W2046023406","doi":"10.1016/j.advengsoft.2010.05.010","title":"A hybrid scatter search approach for resource-constrained project scheduling problem in PERT-type networks","year":2010,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":28,"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":"Metaheuristic; Job shop scheduling; Mathematical optimization; Computer science; Crossover; Scheduling (production processes); Critical path method; Local search (optimization); Benchmark (surveying); Algorithm; Mathematics; Artificial intelligence; Engineering; Schedule","score_opus":0.03298794965464718,"score_gpt":0.3305595728414295,"score_spread":0.2975716231867823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046023406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029000694,0.00025915122,0.9680378,0.00017080744,0.000031189786,0.000056053403,0.00005349418,0.00014464658,0.0022460974],"genre_scores_gemma":[0.6425206,0.00045398745,0.34902367,0.00020502071,0.00012949535,0.00045597405,0.00032564971,0.0001339129,0.00675169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956375,0.00018167739,0.000019791423,0.000057784575,0.00011391155,0.00006304277],"domain_scores_gemma":[0.9988255,0.0007955576,0.00007306203,0.00005122239,0.00017884167,0.00007573818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012487759,0.000734513,0.0016026442,0.0013168996,0.00065409887,0.0011093499,0.0014132244,0.0015847898,0.0030813138],"category_scores_gemma":[0.002162928,0.00064020563,0.0008956694,0.0018905884,0.00058267114,0.0013549712,0.0011777545,0.0006860534,0.0003129134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006217822,0.000047346926,0.0003284399,0.00004140513,0.000034013196,0.00003214588,0.000026189957,0.9719909,0.00057496486,0.00561126,0.0006201791,0.020631002],"study_design_scores_gemma":[0.000007469997,0.000012357415,0.000030748586,0.0000021813175,0.000003838663,0.0000049533924,0.0000054004913,0.99830973,0.00005716055,0.0014533825,0.00011144693,0.0000013227835],"about_ca_topic_score_codex":0.0067718127,"about_ca_topic_score_gemma":0.007335344,"teacher_disagreement_score":0.0067718127,"about_ca_system_score_codex":0.0006637932,"about_ca_system_score_gemma":0.0012007281,"threshold_uncertainty_score":0.013464749},"labels":[],"label_agreement":null},{"id":"W2049149460","doi":"10.1007/s10845-006-0034-0","title":"Project-driven planning and scheduling support for virtual manufacturing","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"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é du Québec en Outaouais","funders":"","keywords":"Computer science; Scheduling (production processes); Critical path method; Schedule; Production planning; Dynamic priority scheduling; Two-level scheduling; Mathematical optimization; Industrial engineering; Distributed computing; Operations research; Engineering; Production (economics); Systems engineering; Operating system; Mathematics","score_opus":0.08940917395364503,"score_gpt":0.37252990705198796,"score_spread":0.28312073309834296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049149460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18012522,0.00017879659,0.81007594,0.0002562352,0.00008542896,0.00013604709,0.00022300243,0.0017049577,0.007214397],"genre_scores_gemma":[0.8750916,0.000054717868,0.123656854,0.000026916323,0.0000124683565,0.00008059799,0.00015784954,0.0000498516,0.00086911774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992908,0.0003148634,0.000041294083,0.0000772782,0.0001766424,0.00009897284],"domain_scores_gemma":[0.99880946,0.0005481773,0.00011941124,0.0001999064,0.00018129946,0.00014169567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773509,0.00035921473,0.0005198031,0.0005523955,0.00052498974,0.0012241155,0.001310642,0.00054629054,0.0024229737],"category_scores_gemma":[0.0027420933,0.00046897447,0.00039734828,0.0007459568,0.00027332347,0.0010019304,0.0010201354,0.00050851045,0.00034339508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080353563,0.0002822314,0.0021958007,0.00009405735,0.000073187,0.00026511116,0.00021933927,0.7658385,0.014412442,0.018308887,0.0040423446,0.19346452],"study_design_scores_gemma":[0.000026625035,0.0000637792,0.00030687093,0.0000030501149,0.000008770589,0.000028429831,0.000028222903,0.9896017,0.0030741547,0.0055175987,0.001332144,0.0000085809115],"about_ca_topic_score_codex":0.0023502614,"about_ca_topic_score_gemma":0.004260451,"teacher_disagreement_score":0.0024229737,"about_ca_system_score_codex":0.00048129517,"about_ca_system_score_gemma":0.0012514621,"threshold_uncertainty_score":0.008105695},"labels":[],"label_agreement":null},{"id":"W2051204535","doi":"10.1016/j.ejor.2005.10.012","title":"Multi-objectives Tabu Search based algorithm for progressive resource allocation","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":67,"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":"Computer science; Tabu search; Resource allocation; Scheduling (production processes); Operations research; Schedule; Task (project management); Mathematical optimization; Set (abstract data type); Algorithm; Mathematics","score_opus":0.2167307243235256,"score_gpt":0.46419412353311057,"score_spread":0.24746339920958496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051204535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025564665,0.0005216666,0.9664835,0.00016761111,0.0000846302,0.0001795773,0.00014759135,0.0013705366,0.005480263],"genre_scores_gemma":[0.22739004,0.00024589608,0.76764464,0.00015743353,0.00004113924,0.00055288145,0.00029467428,0.00019780421,0.0034754823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947304,0.00023046319,0.000022975577,0.00005601607,0.00014915041,0.00006828252],"domain_scores_gemma":[0.99891317,0.0007240347,0.00007169256,0.000060104405,0.0001855282,0.000045523957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177775,0.00087337976,0.001393335,0.0017731013,0.0008575926,0.0009010968,0.001986074,0.0015608595,0.006496226],"category_scores_gemma":[0.0034070069,0.00061340904,0.00073523645,0.001949199,0.0005622665,0.0009406937,0.0009705936,0.0011839607,0.0008464701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025186327,0.00014731221,0.00033155287,0.00015543356,0.000078314035,0.000057508285,0.000082866994,0.79995257,0.00212937,0.007195865,0.0037850845,0.18583234],"study_design_scores_gemma":[0.000048127033,0.000054005355,0.00007703009,0.00000825447,0.000014389888,0.000015447964,0.000007824422,0.997322,0.00043670056,0.0015331695,0.00047788385,0.0000052013047],"about_ca_topic_score_codex":0.0069533275,"about_ca_topic_score_gemma":0.0060511804,"teacher_disagreement_score":0.0069533275,"about_ca_system_score_codex":0.0010076243,"about_ca_system_score_gemma":0.0018294514,"threshold_uncertainty_score":0.021732032},"labels":[],"label_agreement":null},{"id":"W2052282146","doi":"10.1061/(asce)0733-9364(2007)133:1(96)","title":"CTAN for Risk Assessments Using Multilevel Stochastic Networks","year":2006,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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":"University of Calgary","funders":"","keywords":"Schedule; Scope (computer science); Computer science; Realization (probability); Operations research; Stochastic simulation; Risk analysis (engineering); Engineering","score_opus":0.041782369891244286,"score_gpt":0.3396303362319099,"score_spread":0.2978479663406656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052282146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050890907,0.000042822034,0.99128133,0.00016315929,0.000018189266,0.00006439448,0.0002028456,0.0003873339,0.0027508067],"genre_scores_gemma":[0.2959425,0.00030292754,0.6992716,0.00009053614,0.000054928754,0.00069759437,0.0008617307,0.00016408083,0.0026139987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837315,0.000790082,0.00009750819,0.00017671683,0.00049463264,0.00006790298],"domain_scores_gemma":[0.9957247,0.0026172895,0.00039678617,0.00040050584,0.00072588044,0.00013483153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022084035,0.00067134463,0.0005739237,0.0015880686,0.0006150558,0.0017974311,0.001186814,0.0008385945,0.00585486],"category_scores_gemma":[0.013001874,0.00043048096,0.0011474709,0.0014205844,0.00046114298,0.0019457205,0.0015136653,0.0013411574,0.0007443456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028221,0.000019984738,0.0013027729,0.000031257292,0.000032799184,0.000046608817,0.000039589184,0.9098826,0.00060113554,0.06204058,0.0011510875,0.024823355],"study_design_scores_gemma":[0.0000029705807,0.0000053311182,0.00008577747,0.0000064169376,0.0000033652357,0.000006059724,0.000006075087,0.9853608,0.00012667831,0.013258983,0.0011342047,0.0000033382228],"about_ca_topic_score_codex":0.014762683,"about_ca_topic_score_gemma":0.01297918,"teacher_disagreement_score":0.014762683,"about_ca_system_score_codex":0.0019284923,"about_ca_system_score_gemma":0.0023813036,"threshold_uncertainty_score":0.0293535},"labels":[],"label_agreement":null},{"id":"W2056893819","doi":"10.5539/ass.v10n17p292","title":"Methodology Making Management Decisions Based on a Modified Ramsey Model","year":2014,"lang":"en","type":"article","venue":"Asian Social Science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":10,"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":"Order (exchange); Function (biology); Probabilistic logic; Computer science; Process (computing); Control (management); Basis (linear algebra); Operations research; Process management; Business; Artificial intelligence; Mathematics","score_opus":0.3089835468246972,"score_gpt":0.4662142820065225,"score_spread":0.1572307351818253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056893819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00921534,0.00019232178,0.9845233,0.00029586567,0.000027358623,0.00014402765,0.000094066854,0.00010932403,0.005398468],"genre_scores_gemma":[0.5356951,0.0006630746,0.4524064,0.00017239341,0.00008526999,0.00087408785,0.00023710405,0.00005160899,0.009815024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974269,0.0014017489,0.00011740438,0.0003860569,0.00046053316,0.00020736005],"domain_scores_gemma":[0.9984067,0.0009555638,0.00016521648,0.000119541255,0.00024932006,0.00010369693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029711556,0.0007520918,0.0012348096,0.001120996,0.00058203284,0.001722135,0.0026460157,0.0011224989,0.008003884],"category_scores_gemma":[0.0034357505,0.0005145057,0.0012845694,0.0008709498,0.0008460524,0.0014994686,0.0014749244,0.0014600375,0.00077023264],"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.00011194913,0.00014306254,0.0011514539,0.0002751924,0.00016931773,0.00031706714,0.00030349544,0.7298703,0.0011886294,0.22703929,0.001372228,0.03805793],"study_design_scores_gemma":[0.000027608517,0.0000695922,0.0001500596,0.000023959352,0.00002697905,0.00004955912,0.0000461863,0.9405218,0.00026190284,0.057048596,0.0017523195,0.000021485015],"about_ca_topic_score_codex":0.004043614,"about_ca_topic_score_gemma":0.0032217721,"teacher_disagreement_score":0.008003884,"about_ca_system_score_codex":0.0015408678,"about_ca_system_score_gemma":0.002296134,"threshold_uncertainty_score":0.026775658},"labels":[],"label_agreement":null},{"id":"W2061323651","doi":"10.1080/01446190410001673571","title":"Accelerating linear projects","year":2005,"lang":"en","type":"article","venue":"Construction Management and Economics","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"","keywords":"Business; Engineering; Construction engineering; Process management; Systems engineering","score_opus":0.12311128553238058,"score_gpt":0.3266476792046519,"score_spread":0.20353639367227128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061323651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045646828,0.0002621142,0.9343921,0.00011740685,0.000056747936,0.00043915835,0.00016656828,0.0011796291,0.017739449],"genre_scores_gemma":[0.39000997,0.00062341377,0.5870467,0.000045973346,0.000047037367,0.0004351179,0.000454132,0.0001958603,0.021141801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888486,0.00029955042,0.00005981172,0.00021843963,0.00040463396,0.00013273188],"domain_scores_gemma":[0.99818784,0.00073944224,0.00030632727,0.0002747673,0.00035788192,0.00013376233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014149522,0.000669907,0.00048230923,0.0008868111,0.0005899469,0.0010661001,0.0010658158,0.00045372298,0.010217437],"category_scores_gemma":[0.00362823,0.00033131748,0.00040728337,0.0013335516,0.00035638156,0.0008660083,0.0012491447,0.0006749298,0.0016638753],"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.00023095628,0.00015107136,0.0035659831,0.00046407792,0.00003508094,0.0001493586,0.00026733588,0.36892068,0.010742417,0.042819854,0.0049974895,0.5676556],"study_design_scores_gemma":[0.00012227468,0.0010092801,0.0057964716,0.00011961067,0.00006319833,0.00043709166,0.00042367566,0.8467687,0.016555939,0.04842173,0.08021885,0.00006323113],"about_ca_topic_score_codex":0.0039794813,"about_ca_topic_score_gemma":0.005914418,"teacher_disagreement_score":0.010217437,"about_ca_system_score_codex":0.0008041978,"about_ca_system_score_gemma":0.0019245947,"threshold_uncertainty_score":0.0341807},"labels":[],"label_agreement":null},{"id":"W2062705997","doi":"10.1007/s00500-008-0337-5","title":"Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem","year":2008,"lang":"en","type":"article","venue":"Soft Computing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":46,"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":"Benchmark (surveying); Job shop scheduling; Computer science; Crossover; Mathematical optimization; Algorithm; Scheduling (production processes); Schedule; Computational complexity theory; Mathematics; Artificial intelligence","score_opus":0.21734528770111128,"score_gpt":0.41781450600162656,"score_spread":0.20046921830051528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062705997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017468123,0.00008586564,0.9810114,0.00008930846,0.000028762213,0.00003938954,0.000022194705,0.00018811098,0.0010668857],"genre_scores_gemma":[0.2919049,0.00014536786,0.7047252,0.00010657636,0.000061376595,0.0002296055,0.0001866083,0.00013302303,0.0025073767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938977,0.00023656734,0.000032412954,0.00007752658,0.00020676556,0.00005688613],"domain_scores_gemma":[0.99831605,0.0010638258,0.0001120082,0.00010516699,0.00033340853,0.00006947654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016898594,0.0007394679,0.0013906539,0.0011124144,0.00050191884,0.0009731831,0.0009229185,0.0014059271,0.00282052],"category_scores_gemma":[0.003978196,0.0005115952,0.0008520241,0.0018043838,0.0005652689,0.0012644412,0.0012423907,0.00089453254,0.0004558583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001389086,0.00009790372,0.00057211204,0.000064503874,0.000056566,0.0000376265,0.000041755324,0.92443746,0.0028157202,0.008078942,0.0010412364,0.062617406],"study_design_scores_gemma":[0.00001689158,0.000020269259,0.00005232576,0.000003057604,0.0000048826837,0.000007642338,0.0000037995962,0.99789363,0.00022862341,0.0015662296,0.00020049926,0.000002137004],"about_ca_topic_score_codex":0.005187766,"about_ca_topic_score_gemma":0.005265683,"teacher_disagreement_score":0.005187766,"about_ca_system_score_codex":0.0005782959,"about_ca_system_score_gemma":0.0016907364,"threshold_uncertainty_score":0.01031518},"labels":[],"label_agreement":null},{"id":"W2069867923","doi":"10.1139/l08-121","title":"Delay analysis in resource-constrained schedules","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":7,"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":"Korea Institute of Construction and Transportation Technology Evaluation and Planning; Korea Institute of Construction Technology","keywords":"Schedule; Critical path method; Duration (music); Computer science; Scheduling (production processes); Path (computing); Resource (disambiguation); Mathematical optimization; Reduction (mathematics); Operations research; Reliability engineering; Engineering; Mathematics; Computer network","score_opus":0.0302553204847984,"score_gpt":0.2823269323888884,"score_spread":0.25207161190409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069867923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015551064,0.00028701904,0.9774445,0.0000876804,0.000036397298,0.00010337396,0.00008856163,0.00010315819,0.0062982137],"genre_scores_gemma":[0.64635205,0.001290704,0.34315124,0.00009595979,0.000078962985,0.00042163883,0.00036066433,0.00021657317,0.008032129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.0003843976,0.00005329175,0.00012390772,0.0005014726,0.0001545829],"domain_scores_gemma":[0.9969422,0.0021677036,0.00025328103,0.00011767546,0.0004505729,0.000068532216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016727479,0.0009979479,0.0005186361,0.0013887944,0.00056338176,0.0009294048,0.0009477856,0.00039106474,0.003919127],"category_scores_gemma":[0.008011228,0.00049535575,0.0005771998,0.0015000628,0.00076630927,0.0017644798,0.0005757635,0.0007557008,0.00032398058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006986266,0.000018189708,0.00039502402,0.000108352884,0.000018022354,0.00010035807,0.000073344105,0.85781825,0.0016841969,0.11546755,0.0007375465,0.023509283],"study_design_scores_gemma":[0.000010461725,0.000041472445,0.00016753389,0.000018738452,0.0000127974035,0.00003372461,0.00003797829,0.9572031,0.00126007,0.03842541,0.0027754647,0.000013273759],"about_ca_topic_score_codex":0.013643739,"about_ca_topic_score_gemma":0.0054972568,"teacher_disagreement_score":0.013643739,"about_ca_system_score_codex":0.0017626021,"about_ca_system_score_gemma":0.00260283,"threshold_uncertainty_score":0.027128637},"labels":[],"label_agreement":null},{"id":"W2071082497","doi":"10.3141/1907-02","title":"Computerized System for Efficient Scheduling of Highway Construction","year":2005,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Resource-Constrained Project Scheduling","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":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Schedule; Flexibility (engineering); Computer science; Crew; Operations research; Construction management; Industrial engineering; Engineering; Mathematical optimization; Operations management","score_opus":0.18184919851554662,"score_gpt":0.4401150229805617,"score_spread":0.2582658244650151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071082497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01417372,0.00012930683,0.9652825,0.00027001696,0.00008960975,0.0003679003,0.00096053374,0.0028759704,0.01585039],"genre_scores_gemma":[0.43204114,0.0005417625,0.54061884,0.000105065665,0.000076268036,0.0019626631,0.002474281,0.00031004605,0.02186997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994228,0.00017353064,0.000033938846,0.00013213254,0.00017067355,0.00006687918],"domain_scores_gemma":[0.99947244,0.00020267001,0.000053070133,0.00010751248,0.00011858934,0.00004579187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536084,0.0007868204,0.0007880819,0.000568738,0.0008412605,0.0016347964,0.0013751948,0.0009760802,0.018009018],"category_scores_gemma":[0.001684499,0.00046450985,0.0006043579,0.00096562336,0.000707581,0.0011901866,0.00095579337,0.0009826865,0.0023637153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012195524,0.00008479725,0.00056602847,0.0000912229,0.000024204488,0.0001023502,0.00007201091,0.89012414,0.0020776945,0.0684914,0.0061896457,0.032054476],"study_design_scores_gemma":[0.00004979893,0.000042994016,0.0001235903,0.0000086686005,0.000009171597,0.00002255134,0.000014865209,0.9789451,0.0006934557,0.008265198,0.011815426,0.000009149373],"about_ca_topic_score_codex":0.012613518,"about_ca_topic_score_gemma":0.011210698,"teacher_disagreement_score":0.018009018,"about_ca_system_score_codex":0.002144297,"about_ca_system_score_gemma":0.003510626,"threshold_uncertainty_score":0.06024611},"labels":[],"label_agreement":null},{"id":"W2072148912","doi":"10.3141/1761-16","title":"Critical Path Method–Line of Balance Model for Efficient Scheduling of Repetitive Construction Projects","year":2001,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Resource-Constrained Project Scheduling","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 Waterloo","funders":"","keywords":"Critical path method; Scheduling (production processes); Computer science; Schedule; Operations research; Pipeline transport; Path (computing); Industrial engineering; Engineering; Systems engineering; Operations management; Computer network","score_opus":0.2671081567740019,"score_gpt":0.5032961908038592,"score_spread":0.23618803402985733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072148912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027371184,0.000075519434,0.99330753,0.00007800827,0.00001739586,0.00006598277,0.000099989855,0.00012021942,0.003498373],"genre_scores_gemma":[0.43429983,0.001051312,0.5448695,0.00014316499,0.00009106085,0.0013653912,0.00079504977,0.0003323018,0.017052507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995622,0.00016164321,0.000012364992,0.000058379494,0.00013552658,0.00006986897],"domain_scores_gemma":[0.9995982,0.00022214517,0.00006177497,0.000016236801,0.000073993084,0.000027753651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011249444,0.0010832673,0.00076382235,0.0009840713,0.0005337997,0.00092319696,0.0016641002,0.0009599303,0.009014987],"category_scores_gemma":[0.0017363938,0.00060385815,0.0007536307,0.0012654081,0.0006014818,0.0012866099,0.0006047762,0.0012146113,0.0010987625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001933673,0.000015269941,0.000105560226,0.000036154237,0.000009200749,0.00003278184,0.000028118337,0.96214396,0.00046606947,0.027996223,0.0011305627,0.008016672],"study_design_scores_gemma":[0.0000081635335,0.000021554022,0.000033818036,0.0000062401978,0.0000039290544,0.000011233266,0.000008037085,0.9895884,0.00011748972,0.008248036,0.0019490069,0.0000041283797],"about_ca_topic_score_codex":0.012893068,"about_ca_topic_score_gemma":0.00928446,"teacher_disagreement_score":0.012893068,"about_ca_system_score_codex":0.0016889153,"about_ca_system_score_gemma":0.0027265952,"threshold_uncertainty_score":0.030158162},"labels":[],"label_agreement":null},{"id":"W2074314438","doi":"10.1016/j.ejor.2008.10.030","title":"Activity list representation for a generalization of the resource-constrained project scheduling problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"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":"Scheduling (production processes); Computer science; Generalization; Mathematical optimization; Representation (politics); Resource constraints; Mathematics","score_opus":0.3762451047095662,"score_gpt":0.47259360421699004,"score_spread":0.09634849950742386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074314438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019916076,0.00022372649,0.9640803,0.0005444843,0.000120004115,0.00021114595,0.0027954187,0.0017603242,0.010348611],"genre_scores_gemma":[0.288725,0.0005384389,0.69191384,0.00021284005,0.000105927065,0.000528356,0.0068572955,0.00027422214,0.0108440155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994,0.00015782316,0.00007654908,0.00011029607,0.00015131802,0.00010391896],"domain_scores_gemma":[0.9990965,0.00039844264,0.000096240714,0.00015946114,0.00019073971,0.00005866599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078794966,0.0006908298,0.0007813668,0.0012523268,0.000561452,0.0022846665,0.0015347688,0.0010840802,0.008837342],"category_scores_gemma":[0.0021388095,0.00025699174,0.0014171394,0.0023211131,0.00038536222,0.0024056379,0.00090697355,0.0013732918,0.0014335199],"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.0004993712,0.0004904552,0.001351011,0.0005670234,0.00007943551,0.0005975531,0.00041605654,0.397304,0.005491216,0.34553865,0.020561004,0.22710428],"study_design_scores_gemma":[0.00006505165,0.000055506796,0.00021907937,0.00004764921,0.000047567984,0.00011671057,0.000080077036,0.84091955,0.0014566204,0.1412375,0.015727645,0.000027071284],"about_ca_topic_score_codex":0.0086349845,"about_ca_topic_score_gemma":0.01247665,"teacher_disagreement_score":0.008837342,"about_ca_system_score_codex":0.0009035097,"about_ca_system_score_gemma":0.0017425101,"threshold_uncertainty_score":0.029563844},"labels":[],"label_agreement":null},{"id":"W2081143485","doi":"10.1061/(asce)cp.1943-5487.0000165","title":"Simulation-Based Approach for Estimating Project Completion Time of Stochastic Resource–Constrained Project Networks","year":2012,"lang":"en","type":"article","venue":"Journal of Computing in Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"University of Alberta; Natural Sciences and Engineering Research Council of Canada; Canadian Natural Resources","funders":"","keywords":"Critical path method; Duration (music); Probabilistic logic; Event (particle physics); Path (computing); Computer science; Discrete event simulation; Resource (disambiguation); Project management; Operations research; Mathematical optimization; Industrial engineering; Simulation; Engineering; Systems engineering; Mathematics; Artificial intelligence","score_opus":0.07050947443990635,"score_gpt":0.3484539446943054,"score_spread":0.27794447025439906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081143485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009861074,0.00007736138,0.98943526,0.000028277856,0.000008663861,0.000030545514,0.000038784394,0.0001350821,0.00038499697],"genre_scores_gemma":[0.6265429,0.00044439323,0.3711172,0.000041061197,0.000035193898,0.00037706748,0.000403007,0.000071643975,0.0009675678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840945,0.00079494755,0.00008421556,0.00022035468,0.00039347634,0.000097587654],"domain_scores_gemma":[0.9961139,0.0025632381,0.00045800608,0.00017482106,0.0005553823,0.00013464391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199212,0.0009652619,0.0010958465,0.0020477448,0.00046817475,0.0008229194,0.0014254772,0.0008202337,0.0011434283],"category_scores_gemma":[0.0071587954,0.0007848802,0.0011465898,0.0013873422,0.00043405767,0.0011737299,0.00086506805,0.00093876163,0.00018346084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001632102,0.0000063359585,0.00039512603,0.000013859292,0.000015113995,0.000015902431,0.000008489096,0.99369276,0.00025324564,0.001495598,0.00004333948,0.004044069],"study_design_scores_gemma":[0.0000017793413,0.0000056029658,0.000047017325,0.0000016455433,0.0000028130794,0.000005058967,0.0000017900863,0.99923754,0.00011572534,0.00048300542,0.00009549294,0.0000026283622],"about_ca_topic_score_codex":0.013207588,"about_ca_topic_score_gemma":0.007374753,"teacher_disagreement_score":0.013207588,"about_ca_system_score_codex":0.001473313,"about_ca_system_score_gemma":0.0020657198,"threshold_uncertainty_score":0.02626139},"labels":[],"label_agreement":null},{"id":"W2081463457","doi":"10.1139/l02-007","title":"An optimal construction resource leveling scheduling simulation model","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"Probabilistic logic; Resource leveling; Scheduling (production processes); Duration (music); Computer science; Resource (disambiguation); Operations research; Schedule; Mathematical optimization; Resource allocation; Engineering; Mathematics; Artificial intelligence","score_opus":0.08089126180476691,"score_gpt":0.30163045059642923,"score_spread":0.22073918879166232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081463457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15626483,0.0003861542,0.8005244,0.00073576585,0.00010574218,0.00034738582,0.0018175368,0.0009878685,0.03883031],"genre_scores_gemma":[0.9107245,0.00036899184,0.07474844,0.000076321565,0.00001992781,0.0007402445,0.0011583122,0.00006650179,0.012096625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949193,0.00017475737,0.000026511818,0.00007847944,0.00012849085,0.00009974901],"domain_scores_gemma":[0.999468,0.00023575882,0.00007114037,0.000026569372,0.00014811548,0.000050374823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068171666,0.0007252061,0.00094462896,0.0007441236,0.00058415055,0.0010247857,0.0015369143,0.001274398,0.006023274],"category_scores_gemma":[0.0015020074,0.00050479744,0.0008078107,0.00095116126,0.0007049382,0.0007564116,0.00064753985,0.00082926045,0.000501635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010588935,0.0000049368477,0.00008349041,0.0000052666715,0.0000033313715,0.00001246554,0.0000053766557,0.9975777,0.00009142481,0.0015991256,0.00006707511,0.0005392377],"study_design_scores_gemma":[0.000010608574,0.0000064673322,0.00004042249,0.0000012049467,0.0000025528946,0.000003074094,0.0000037426478,0.998678,0.000061681974,0.00087493076,0.00031545604,0.0000019222591],"about_ca_topic_score_codex":0.040520575,"about_ca_topic_score_gemma":0.01683889,"teacher_disagreement_score":0.040520575,"about_ca_system_score_codex":0.0019581907,"about_ca_system_score_gemma":0.0036189952,"threshold_uncertainty_score":0.080569446},"labels":[],"label_agreement":null},{"id":"W2082724002","doi":"10.1061/9780784413517.137","title":"Project Delivery Systems Selection for Capital Projects Using the Analytical Hierarchy Process and the Analytical Network Process","year":2014,"lang":"en","type":"article","venue":"Construction Research Congress 2014","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"","keywords":"Analytic network process; Pairwise comparison; Analytic hierarchy process; Hierarchy; Ranking (information retrieval); Computer science; Interdependence; Process (computing); Operations research; Cluster (spacecraft); Risk analysis (engineering); Engineering; Artificial intelligence; Business; Computer network","score_opus":0.15895049319059995,"score_gpt":0.453898261453948,"score_spread":0.29494776826334806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082724002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02706625,0.00027024283,0.96670645,0.00020960542,0.000024470033,0.00046815074,0.000048279315,0.0000808188,0.005125602],"genre_scores_gemma":[0.30520654,0.0005109448,0.6921551,0.000033695,0.000021581465,0.00053030933,0.00010017413,0.00004243602,0.0013991987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98684037,0.008145078,0.0005404198,0.00061516964,0.0034999321,0.00035898754],"domain_scores_gemma":[0.99062854,0.0068277847,0.0008417025,0.00026380253,0.0012438156,0.0001942218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0122150285,0.0011306674,0.0010472519,0.0051463596,0.0017149484,0.0025797333,0.00094319595,0.00062368164,0.0026724315],"category_scores_gemma":[0.021802418,0.0005547125,0.0010853978,0.004298945,0.0010103846,0.0029479167,0.0016069608,0.001021837,0.00024387354],"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.00030794932,0.00023512694,0.006285375,0.0011409333,0.00017992785,0.0002315578,0.0023394527,0.49423108,0.0044618044,0.09701272,0.00165951,0.39191452],"study_design_scores_gemma":[0.00009249818,0.00051200204,0.0031907524,0.00027333482,0.00012672662,0.00016322205,0.0016716185,0.88936585,0.00577227,0.087604575,0.011120249,0.00010683436],"about_ca_topic_score_codex":0.005294361,"about_ca_topic_score_gemma":0.008330904,"teacher_disagreement_score":0.0122150285,"about_ca_system_score_codex":0.0029877182,"about_ca_system_score_gemma":0.004165619,"threshold_uncertainty_score":0.06460005},"labels":[],"label_agreement":null},{"id":"W2085278007","doi":"10.1007/s10479-006-0149-x","title":"Time-cost trade-off via optimal control theory in Markov PERT networks","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","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":"Dalhousie University","funders":"","keywords":"Theory of computation; Mathematical optimization; Minification; Erlang (programming language); Markov decision process; Computer science; Optimal control; Control (management); Markov chain; Variance (accounting); Stochastic programming; Function (biology); Markov process; Mathematics; Statistics; Economics; Artificial intelligence; Algorithm","score_opus":0.21522929893561688,"score_gpt":0.49586635955987185,"score_spread":0.280637060624255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085278007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054780293,0.001375735,0.92751276,0.0017930189,0.00014126432,0.000100214784,0.00025681837,0.00015360091,0.013886318],"genre_scores_gemma":[0.95042104,0.0014895339,0.03673809,0.0002394609,0.00019823022,0.00028686898,0.00014289375,0.00012190665,0.010362015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997849,0.0011764991,0.00007671478,0.0002573455,0.00029837945,0.00034213255],"domain_scores_gemma":[0.9805895,0.016989917,0.00097470015,0.00026177167,0.00071015506,0.00047396772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048543457,0.0018139327,0.002995384,0.0020972467,0.001127595,0.0035074728,0.0023163643,0.0032484515,0.006310859],"category_scores_gemma":[0.019177455,0.0015604508,0.0010399662,0.002029503,0.0031187304,0.005120925,0.0024233148,0.0022497782,0.00034606073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613506,0.000043545555,0.00020184266,0.000060385562,0.000030583473,0.000039788825,0.000040477244,0.8835844,0.00020375443,0.11052506,0.0007842226,0.004424588],"study_design_scores_gemma":[0.000012068307,0.000013848713,0.00006534807,0.000008746893,0.000009334411,0.0000073071883,0.000009943606,0.93657434,0.00005358612,0.06309041,0.00014518207,0.000009918176],"about_ca_topic_score_codex":0.0089693805,"about_ca_topic_score_gemma":0.005354949,"teacher_disagreement_score":0.0089693805,"about_ca_system_score_codex":0.0039015089,"about_ca_system_score_gemma":0.002169416,"threshold_uncertainty_score":0.028307557},"labels":[],"label_agreement":null},{"id":"W2086411192","doi":"10.1061/(asce)co.1943-7862.0000722","title":"Fast and Near-Optimum Schedule Optimization for Large-Scale Projects","year":2013,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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 Waterloo","funders":"","keywords":"Schedule; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Set (abstract data type); Scale (ratio); Resource (disambiguation); Operations research; Engineering; Algorithm; Mathematics","score_opus":0.01978522260025422,"score_gpt":0.27043634731529653,"score_spread":0.2506511247150423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086411192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036841027,0.00025053616,0.9595012,0.00014066637,0.000023155133,0.00006083914,0.0000852408,0.0001540269,0.002943323],"genre_scores_gemma":[0.5801617,0.00054566405,0.4159595,0.00005869371,0.000028231356,0.0002658246,0.0002687259,0.00015322176,0.0025585128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994386,0.0002658049,0.000017527736,0.00007294134,0.00013085567,0.00007432772],"domain_scores_gemma":[0.9987117,0.000915064,0.00013795804,0.0000573863,0.000117130134,0.000060682403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015836722,0.0007276755,0.0008531945,0.00066538394,0.00046239173,0.0007452857,0.0007600804,0.00086166186,0.0020713687],"category_scores_gemma":[0.0034775732,0.0006366012,0.0007903324,0.0012856286,0.00043549377,0.0010277026,0.0006620425,0.0012794086,0.00020793187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015522646,0.000014405789,0.000090187525,0.000027517133,0.0000073328893,0.000012938746,0.000012243689,0.9890486,0.0003817586,0.0031202626,0.00027843635,0.006990823],"study_design_scores_gemma":[0.000004558747,0.000021468208,0.000050392136,0.0000029360092,0.0000021541105,0.0000054523716,0.000011172081,0.99692374,0.00018547082,0.0024320127,0.00035858268,0.0000020943905],"about_ca_topic_score_codex":0.00786141,"about_ca_topic_score_gemma":0.008587259,"teacher_disagreement_score":0.00786141,"about_ca_system_score_codex":0.00096984394,"about_ca_system_score_gemma":0.0020786962,"threshold_uncertainty_score":0.015631318},"labels":[],"label_agreement":null},{"id":"W2089754016","doi":"10.1109/ifsa-nafips.2013.6608566","title":"Fuzzy dynamic programming for optimized scheduling of repetitive construction projects","year":2013,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic programming; Fuzzy logic; Mathematical optimization; Schedule; Fuzzy set; Duration (music); Computation; Set (abstract data type); Project management; Operations research; Industrial engineering; Algorithm; Engineering; Artificial intelligence; Systems engineering; Mathematics","score_opus":0.06595495741476406,"score_gpt":0.36224642805999013,"score_spread":0.2962914706452261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089754016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03300962,0.00022516362,0.9631605,0.00012185523,0.000019853922,0.000074359574,0.000045038698,0.00011972797,0.0032238534],"genre_scores_gemma":[0.730981,0.00033142394,0.26503828,0.00004348047,0.000024380312,0.00032922495,0.00011266463,0.0000559115,0.0030836505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949884,0.00021322799,0.00001790516,0.00007946508,0.000123951,0.00006667634],"domain_scores_gemma":[0.9992568,0.00056679023,0.00006569228,0.000014653709,0.00007081811,0.00002528295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011717979,0.0007729922,0.0010184941,0.0007419434,0.00047456942,0.0009409384,0.000666145,0.0008171947,0.0014133771],"category_scores_gemma":[0.002179044,0.0004975679,0.0005634024,0.00090694113,0.00058664905,0.00058164966,0.00061633624,0.000772832,0.00016633415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014501249,0.000008442563,0.000041021856,0.000011704715,0.0000054086786,0.000010308395,0.000015110064,0.99162734,0.00021665098,0.0018784114,0.00007944434,0.0060916073],"study_design_scores_gemma":[0.000003902246,0.000010148207,0.000019919806,0.00000247925,0.0000017287219,0.000002162354,0.000004579773,0.99814236,0.00012759007,0.0015726248,0.000110634195,0.000001982689],"about_ca_topic_score_codex":0.009260836,"about_ca_topic_score_gemma":0.005873338,"teacher_disagreement_score":0.009260836,"about_ca_system_score_codex":0.0014282784,"about_ca_system_score_gemma":0.0016160737,"threshold_uncertainty_score":0.018413842},"labels":[],"label_agreement":null},{"id":"W2096430829","doi":"10.5555/2675983.2676383","title":"Time-stepped, simulation-based scheduling system for large-scale industrial construction projects","year":2013,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Scheduling (production processes); Computer science; Idle; Duration (music); Industrial engineering; Variable (mathematics); Operations research; Distributed computing; Real-time computing; Engineering; Operations management; Operating system","score_opus":0.1362791873176047,"score_gpt":0.3597215394200818,"score_spread":0.2234423521024771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096430829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18003866,0.00019293332,0.80585593,0.00016760419,0.000070914764,0.00036948375,0.00049277215,0.0070946836,0.0057169897],"genre_scores_gemma":[0.86499643,0.00014772516,0.13205294,0.000025638441,0.00001066637,0.00042074433,0.0004759326,0.000090855254,0.0017792014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972206,0.00009946606,0.000029125933,0.000058575613,0.000063316555,0.000027487451],"domain_scores_gemma":[0.9993826,0.0002883998,0.00006849861,0.00005924195,0.00010670682,0.000094491756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008020194,0.0006500993,0.00065103115,0.00057277747,0.00060478173,0.0006823819,0.0010756493,0.00049212674,0.004482159],"category_scores_gemma":[0.0012043741,0.0004336954,0.00039650072,0.00056409667,0.000320055,0.0005530912,0.0006802548,0.00044565045,0.00046945576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013867283,0.000065776476,0.000671514,0.000031288142,0.000017767734,0.000044511722,0.000041832045,0.9823453,0.0020711378,0.001138821,0.00048438934,0.012948989],"study_design_scores_gemma":[0.000013663912,0.000016826272,0.000068950554,0.0000013541897,0.0000038004698,0.0000034637314,0.000004925205,0.9990363,0.00032874866,0.00022482645,0.000294245,0.000002913688],"about_ca_topic_score_codex":0.010129642,"about_ca_topic_score_gemma":0.010076955,"teacher_disagreement_score":0.010129642,"about_ca_system_score_codex":0.0009068111,"about_ca_system_score_gemma":0.001967475,"threshold_uncertainty_score":0.020141363},"labels":[],"label_agreement":null},{"id":"W2097369068","doi":"10.1061/(asce)co.1943-7862.0000483","title":"Heuristic Method for Satisfying Both Deadlines and Resource Constraints","year":2011,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristic; Scheduling (production processes); Software; Resource (disambiguation); Process (computing); Set (abstract data type); Operations research; Software engineering; Mathematical optimization; Operating system; Programming language; Artificial intelligence; Engineering","score_opus":0.0693014588953265,"score_gpt":0.3304401048909163,"score_spread":0.2611386459955898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097369068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009493223,0.00019914606,0.9865736,0.00006334636,0.000034665092,0.00022262477,0.000052591506,0.00024514334,0.0031157655],"genre_scores_gemma":[0.15275995,0.00025258385,0.8447287,0.000056502493,0.000024229035,0.00045779138,0.00015910846,0.000072886156,0.0014882359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984364,0.00063782674,0.00009932583,0.00017948574,0.0005002313,0.000146634],"domain_scores_gemma":[0.9977977,0.0015262385,0.00021388376,0.000117106,0.0002600098,0.00008511538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020892355,0.00086104346,0.0007854556,0.0017130908,0.0006375794,0.00092718226,0.0013126926,0.00073949614,0.0039731963],"category_scores_gemma":[0.0042356905,0.00048655842,0.00079732423,0.0013452382,0.0005723717,0.0009390398,0.00074663456,0.0008090695,0.00044939856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019966422,0.00020942398,0.00097175123,0.00046185745,0.00009669957,0.0002230485,0.00025805054,0.7271671,0.0068151983,0.03707452,0.0029578547,0.2235648],"study_design_scores_gemma":[0.000108979606,0.00017582036,0.0002501985,0.000049268743,0.000044570577,0.00018355207,0.00009715855,0.97475046,0.0037280358,0.013976455,0.006605307,0.000030227211],"about_ca_topic_score_codex":0.0029092806,"about_ca_topic_score_gemma":0.004326142,"teacher_disagreement_score":0.0039731963,"about_ca_system_score_codex":0.0009814841,"about_ca_system_score_gemma":0.0033896079,"threshold_uncertainty_score":0.013291657},"labels":[],"label_agreement":null},{"id":"W2100941354","doi":"10.5267/j.dsl.2015.5.005","title":"A study on the performance of differential search algorithm for single mode resource constrained project scheduling problem","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Scheduling (production processes); Mode (computer interface); Resource (disambiguation); Algorithm; Differential evolution; Resource constraints; Operations research; Mathematics; Distributed computing","score_opus":0.20502261837556643,"score_gpt":0.4111129716131563,"score_spread":0.20609035323758987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100941354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4249095,0.0075842035,0.52863485,0.00086983136,0.0002538514,0.00014365438,0.00015803069,0.0005070087,0.036939003],"genre_scores_gemma":[0.9193212,0.0017883877,0.07684563,0.00009226199,0.00003443596,0.000057856785,0.0001765981,0.000060126204,0.0016235595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988839,0.00050296576,0.000059909562,0.00013855145,0.00029615287,0.00011855433],"domain_scores_gemma":[0.9936888,0.005272295,0.00016249182,0.00018201137,0.00056613836,0.00012827295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670313,0.00059614325,0.00083216274,0.00092711236,0.00040877392,0.0009632013,0.00073942705,0.0007138933,0.0021680952],"category_scores_gemma":[0.008099436,0.00020233441,0.0004840013,0.0011356907,0.00039779439,0.0011896912,0.00043896647,0.0007027866,0.00017272828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044079844,0.00023951697,0.004103855,0.00047675724,0.00013569943,0.00012776529,0.00009660201,0.7961232,0.005205345,0.017581008,0.0020995932,0.17336975],"study_design_scores_gemma":[0.000021400205,0.00014717877,0.0005356188,0.0000140479615,0.000018176224,0.00005444457,0.000026367828,0.99526346,0.0013406116,0.0017837631,0.00078955083,0.00000537117],"about_ca_topic_score_codex":0.0028677613,"about_ca_topic_score_gemma":0.0015171625,"teacher_disagreement_score":0.0028677613,"about_ca_system_score_codex":0.0008888105,"about_ca_system_score_gemma":0.0011633121,"threshold_uncertainty_score":0.010402739},"labels":[],"label_agreement":null},{"id":"W2103309143","doi":"10.1109/picmet.2001.952246","title":"Calculating the theoretical project completion time of large networks in polynomial processing time","year":2002,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"McMaster University","funders":"","keywords":"Duration (music); Time complexity; Computer science; Polynomial; Mathematical optimization; Computational complexity theory; Mathematics; Algorithm","score_opus":0.06484969735203121,"score_gpt":0.3548422319852788,"score_spread":0.2899925346332476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103309143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11608344,0.0005493941,0.87218255,0.0009917347,0.000045453013,0.00012387183,0.0004529615,0.000812694,0.008757881],"genre_scores_gemma":[0.7286548,0.0007886179,0.2632638,0.00022905548,0.00014833032,0.0004907144,0.0010289843,0.0005671046,0.004828634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810165,0.0006073287,0.00008045403,0.0003428519,0.00046790537,0.000399798],"domain_scores_gemma":[0.96995753,0.026366716,0.0010237672,0.0011998634,0.00089245394,0.0005597465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042262925,0.0010430212,0.0012288205,0.0015452434,0.0008903344,0.0023632115,0.0020416316,0.0010815138,0.0052128113],"category_scores_gemma":[0.0346847,0.00086351443,0.0012774719,0.0016780563,0.0017354261,0.004074404,0.0014534642,0.0023265423,0.0008463314],"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.00011553053,0.000046519366,0.00080846256,0.00010991394,0.00002799633,0.000041711224,0.00007340212,0.9515291,0.0006676979,0.03041671,0.0010354257,0.015127573],"study_design_scores_gemma":[0.000019060897,0.000012115854,0.00019612901,0.0000078652065,0.000009602618,0.000014348893,0.000017012357,0.9677459,0.00035806405,0.03131415,0.0003008119,0.00000503621],"about_ca_topic_score_codex":0.011981131,"about_ca_topic_score_gemma":0.0138727585,"teacher_disagreement_score":0.011981131,"about_ca_system_score_codex":0.004145866,"about_ca_system_score_gemma":0.003558623,"threshold_uncertainty_score":0.030080438},"labels":[],"label_agreement":null},{"id":"W2105760447","doi":"10.1061/(asce)0733-9364(2001)127:3(183)","title":"Cost Optimization in Projects with Repetitive Nonserial Activities","year":2001,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":150,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Crew; Scheduling (production processes); Operations research; Novelty; Total cost; Software; Reliability engineering; Engineering; Operations management","score_opus":0.035848616329094876,"score_gpt":0.2890536171455027,"score_spread":0.25320500081640784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105760447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08966384,0.00025970943,0.8989763,0.00033490645,0.000026478792,0.00019358587,0.00031773082,0.000183438,0.010043951],"genre_scores_gemma":[0.84772784,0.0006683582,0.13863084,0.000051561303,0.000024511653,0.0007451564,0.0004008212,0.0001211771,0.011629675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919766,0.00032245106,0.00002702704,0.00013217826,0.00019262075,0.00012811986],"domain_scores_gemma":[0.9993,0.00039570857,0.00011982132,0.00003706762,0.000091720496,0.000055609067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011636534,0.00085418567,0.0009841645,0.00068694056,0.0004872339,0.0015129866,0.0015025409,0.0014201076,0.0036489],"category_scores_gemma":[0.0023069135,0.00082807406,0.0007258668,0.0012298235,0.00074630347,0.001396951,0.0006498019,0.00097349647,0.0003971143],"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.000008097487,0.000008466903,0.00009331236,0.000009552634,0.0000031783786,0.000014177311,0.0000071769728,0.99408036,0.000084663334,0.003730801,0.00007962734,0.0018804271],"study_design_scores_gemma":[0.000006666971,0.000015914724,0.00009888771,0.0000030679314,0.000003078811,0.0000072230696,0.000009401694,0.9959804,0.00008200526,0.0034177809,0.0003723632,0.0000032589137],"about_ca_topic_score_codex":0.014045061,"about_ca_topic_score_gemma":0.011691186,"teacher_disagreement_score":0.014045061,"about_ca_system_score_codex":0.0021130352,"about_ca_system_score_gemma":0.0024009952,"threshold_uncertainty_score":0.027926624},"labels":[],"label_agreement":null},{"id":"W2110057954","doi":"10.1139/l2012-024","title":"Enhancing the critical path segments scheduling technique for project control<sup>1</sup>This paper is one of a selection of papers in this Special Issue on Construction Engineering and Management.","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Critical path method; Rework; Scheduling (production processes); Project management; Float (project management); Computer science; Operations research; Decision support system; Project planning; Schedule; Construction management; Systems engineering; Industrial engineering; Control (management); Reliability engineering; Engineering; Operations management; Data mining; Civil engineering; Artificial intelligence","score_opus":0.018954219185010137,"score_gpt":0.27086691933169976,"score_spread":0.25191270014668965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110057954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034596445,0.00007915271,0.99449193,0.000052791478,0.00004213992,0.00003712892,0.00001901793,0.00038666537,0.001431543],"genre_scores_gemma":[0.10660732,0.000263773,0.89127254,0.000028383887,0.00005461713,0.00008465481,0.000074374904,0.00020272858,0.0014116328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920386,0.0002875313,0.000038678743,0.000101439015,0.00031999836,0.00004853507],"domain_scores_gemma":[0.9982179,0.0009188583,0.00023569848,0.00016311074,0.00041367498,0.000050796923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009759022,0.00085605925,0.00036696353,0.0011129021,0.0005273296,0.0005734179,0.0006813324,0.0003988911,0.003970527],"category_scores_gemma":[0.0035681229,0.0003254954,0.00041869946,0.0016221196,0.0004714565,0.0009488844,0.0005775864,0.00095785956,0.0006735727],"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.00022075881,0.00008513511,0.0015637082,0.00030502919,0.00004222242,0.00014792875,0.00037240266,0.25990203,0.028700005,0.035949003,0.0061460864,0.6665657],"study_design_scores_gemma":[0.000034844,0.0002238508,0.0007196771,0.000044774046,0.000031057287,0.00021477036,0.00011047441,0.9265136,0.021359244,0.012801716,0.037906125,0.00003985675],"about_ca_topic_score_codex":0.003926673,"about_ca_topic_score_gemma":0.0049778963,"teacher_disagreement_score":0.003970527,"about_ca_system_score_codex":0.0006652793,"about_ca_system_score_gemma":0.0013518159,"threshold_uncertainty_score":0.013282776},"labels":[],"label_agreement":null},{"id":"W2113659109","doi":"10.1109/nafips.2007.383851","title":"Possible Criticality of Paths in Networks with Imprecise Durations and Time Lags","year":2007,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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 Toronto","funders":"","keywords":"Fuzzy logic; Computer science; Criticality; Interval (graph theory); Fuzzy number; Scheduling (production processes); Mathematical optimization; Fuzzy set; Fuzzy set operations; Critical path method; Algorithm; Mathematics; Artificial intelligence; Engineering","score_opus":0.04118206778889575,"score_gpt":0.3584242674731654,"score_spread":0.31724219968426964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113659109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08293912,0.0003201335,0.91433775,0.00017116842,0.000018450153,0.000033986,0.00009749888,0.00005350809,0.0020283463],"genre_scores_gemma":[0.92650485,0.00056389015,0.070765086,0.000033379652,0.000029354242,0.00009807253,0.00011094088,0.000024973326,0.0018694369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984458,0.00039545103,0.00007916725,0.00042387567,0.00044392693,0.00021172865],"domain_scores_gemma":[0.99380624,0.0040683476,0.0013048822,0.0002474993,0.00039478712,0.00017832861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025307224,0.000980041,0.000742878,0.0014985044,0.00078566704,0.0016953488,0.0016269038,0.0011426394,0.0017058493],"category_scores_gemma":[0.009257424,0.0007412749,0.00093613967,0.0011827495,0.002029735,0.0045105442,0.0009449296,0.0015135262,0.00013191576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006485252,0.000010604062,0.0008814082,0.00005477017,0.000023385235,0.0002362972,0.00015445212,0.94393545,0.0011876309,0.047648236,0.00012555515,0.005677256],"study_design_scores_gemma":[0.000012052346,0.00003801019,0.00044908823,0.00002498643,0.00002541714,0.00011498298,0.00008373242,0.93498343,0.0012401096,0.06188187,0.0011229203,0.000023275836],"about_ca_topic_score_codex":0.0046516648,"about_ca_topic_score_gemma":0.0033524288,"teacher_disagreement_score":0.0046516648,"about_ca_system_score_codex":0.0021883089,"about_ca_system_score_gemma":0.0009820038,"threshold_uncertainty_score":0.015877366},"labels":[],"label_agreement":null},{"id":"W2141739264","doi":"10.1061/(asce)0733-9364(2008)134:4(253)","title":"Efficient Repetitive Scheduling for High-Rise Construction","year":2008,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Distributed computing; Mathematical optimization; Real-time computing; Engineering","score_opus":0.028696489337741597,"score_gpt":0.28016341916258974,"score_spread":0.25146692982484814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141739264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04028121,0.00014669848,0.9532245,0.00018515073,0.000023642833,0.0000806492,0.00011159646,0.0002274415,0.0057190624],"genre_scores_gemma":[0.81193596,0.0003865779,0.17751831,0.00004669439,0.00002820328,0.00026877224,0.00030694474,0.00012131012,0.009387168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.00034609908,0.000027209744,0.00014197268,0.00026174806,0.00014671846],"domain_scores_gemma":[0.99938154,0.00031966844,0.00012307861,0.000049359576,0.000076051554,0.000050329796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011238647,0.0006682233,0.0010895104,0.0005131752,0.0005219357,0.0011011967,0.0015411951,0.0011164721,0.0034259325],"category_scores_gemma":[0.0019083149,0.00059624756,0.00075841375,0.0009417587,0.0006513039,0.0011764118,0.0007987573,0.0010992504,0.0003752636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010917009,0.000012730053,0.00006569241,0.000010844631,0.0000033231552,0.000016172049,0.0000129765385,0.99330914,0.00020565103,0.0037164567,0.0001237389,0.00251239],"study_design_scores_gemma":[0.000004546857,0.00001272855,0.000047019414,0.000001343947,0.0000020656958,0.0000056669014,0.0000071453765,0.99742055,0.0000888405,0.0021646502,0.00024319593,0.0000022487268],"about_ca_topic_score_codex":0.015068785,"about_ca_topic_score_gemma":0.013956136,"teacher_disagreement_score":0.015068785,"about_ca_system_score_codex":0.0019853069,"about_ca_system_score_gemma":0.0023238554,"threshold_uncertainty_score":0.029962182},"labels":[],"label_agreement":null},{"id":"W2144184895","doi":"10.1109/picmet.2001.952313","title":"Calculating the theoretical project completion time of large networks in polynomial time","year":2002,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"McMaster University","funders":"","keywords":"Critical path method; Criticality; Duration (music); Path (computing); Computer science; Mathematical optimization; Project management; Longest path problem; Operations research; Mathematics; Theoretical computer science; Engineering; Shortest path problem; Graph; Computer network; Systems engineering","score_opus":0.06570568339862448,"score_gpt":0.351189822817973,"score_spread":0.2854841394193485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144184895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062280282,0.0004972677,0.9267987,0.0006284008,0.000032569016,0.00010483781,0.00025348732,0.00050151494,0.008902897],"genre_scores_gemma":[0.64158595,0.0011132219,0.3491103,0.00019090623,0.00013842773,0.0005752101,0.00076191546,0.0004570523,0.0060669566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997926,0.0007099793,0.000079115314,0.0002983717,0.00061078736,0.0003757132],"domain_scores_gemma":[0.97636026,0.02036777,0.0009688798,0.0009164911,0.00091515476,0.00047151075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004345329,0.0010527481,0.0011223888,0.0016909546,0.0008112179,0.0022362352,0.0017875572,0.0009831261,0.0047413954],"category_scores_gemma":[0.031739816,0.000695893,0.0010870389,0.0016164505,0.0017560122,0.0034155762,0.0013470356,0.0019402419,0.0009977296],"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.00012199498,0.000045575365,0.0009610155,0.00013694631,0.000021996666,0.00008701534,0.00009415118,0.93793446,0.0006748034,0.04279176,0.0008943462,0.016235918],"study_design_scores_gemma":[0.000010750769,0.000013476617,0.00016081423,0.0000107243395,0.000005836514,0.000024744731,0.000020318852,0.9679968,0.00032462826,0.030982973,0.00044419116,0.0000046894215],"about_ca_topic_score_codex":0.006739772,"about_ca_topic_score_gemma":0.0068141897,"teacher_disagreement_score":0.006739772,"about_ca_system_score_codex":0.004302649,"about_ca_system_score_gemma":0.0026745256,"threshold_uncertainty_score":0.031218052},"labels":[],"label_agreement":null},{"id":"W2144411460","doi":"10.1139/l2012-053","title":"Generational differences on craft workers’ perceptions of the factors affecting labour productivity<sup>1</sup>This paper is one of a selection of papers in this Special Issue on Construction Engineering and Management.","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":15,"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":"Craft; Productivity; Workforce; Baby boomers; Economic shortage; Labour economics; Engineering; Layoff; Business; Economics; Operations management; Economic growth; Unemployment; Government (linguistics); Geography","score_opus":0.022326006104759696,"score_gpt":0.24096459190021857,"score_spread":0.21863858579545886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144411460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9993363,0.00005064331,0.000029727235,0.000038220835,0.0000021337637,0.0000021536964,0.000019223902,4.524125e-7,0.000521088],"genre_scores_gemma":[0.9995198,0.000071489354,0.000027449252,0.00001981981,0.0000017654679,0.0000025732422,0.000040618386,5.802993e-7,0.00031592342],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99952877,0.00016130165,0.000029464407,0.000050306928,0.00011197862,0.00011818189],"domain_scores_gemma":[0.99728596,0.0011315249,0.0009026923,0.00012062637,0.00028652462,0.00027270764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011265122,0.00015402256,0.00012472007,0.00048387673,0.00047298288,0.00086285814,0.00016149112,0.0002656408,0.003076942],"category_scores_gemma":[0.002827239,0.00013422508,0.00020825844,0.00044071485,0.0005340409,0.00041556923,0.00058439694,0.00040103367,0.00022356915],"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.00011994486,0.00006689179,0.955172,0.000020369816,0.000032239892,0.00013463377,0.032355845,0.000099675904,0.00075624796,0.00017963698,0.0002916441,0.010770876],"study_design_scores_gemma":[0.000002346639,0.000078100216,0.967366,0.000011318116,0.0000070546657,0.000048939768,0.03175828,0.00008236496,0.00007015368,0.000061014547,0.00050655653,0.000007858911],"about_ca_topic_score_codex":0.017366363,"about_ca_topic_score_gemma":0.04649849,"teacher_disagreement_score":0.017366363,"about_ca_system_score_codex":0.00047654405,"about_ca_system_score_gemma":0.0002580566,"threshold_uncertainty_score":0.03453052},"labels":[],"label_agreement":null},{"id":"W2147317472","doi":"10.1061/9780784412329.039","title":"Finance-Based Scheduling for Multiple Projects with Multimode Activities","year":2012,"lang":"en","type":"article","venue":"Construction Research Congress 2012","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Cash flow; Finance; Scheduling (production processes); Population; Genetic algorithm; Operations research; Business; Operations management; Economics; Engineering","score_opus":0.2749705436613488,"score_gpt":0.4509779102217301,"score_spread":0.1760073665603813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147317472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33096924,0.0001979648,0.65943897,0.00024841906,0.000054429784,0.0003710849,0.00019990676,0.00018916038,0.008330756],"genre_scores_gemma":[0.90723455,0.00012055477,0.08911275,0.000016558688,0.000010683305,0.00022674729,0.00013409615,0.000023060606,0.0031208855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.00014864249,0.000017117844,0.000066078836,0.00008207159,0.00009760511],"domain_scores_gemma":[0.9995735,0.00018481864,0.00008133994,0.000023895365,0.00005608799,0.00008026314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010391066,0.00044420036,0.0007023541,0.0007941217,0.0005935811,0.00081250013,0.0007604521,0.00062426855,0.0027244294],"category_scores_gemma":[0.0013799288,0.00034019497,0.00063825515,0.0010132245,0.00037995208,0.00057695474,0.0007333971,0.00047138098,0.000180247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008280425,0.00006238214,0.00093062216,0.000035635374,0.00001494079,0.00009245978,0.000039005074,0.96651447,0.0013994449,0.00456383,0.00029081793,0.025973674],"study_design_scores_gemma":[0.000018679972,0.000097192846,0.00054143195,0.000005289202,0.0000073007895,0.000027527101,0.000029227927,0.9952696,0.0006371233,0.0027068718,0.00065402774,0.0000056915464],"about_ca_topic_score_codex":0.006429531,"about_ca_topic_score_gemma":0.008144661,"teacher_disagreement_score":0.006429531,"about_ca_system_score_codex":0.0014699264,"about_ca_system_score_gemma":0.0022135992,"threshold_uncertainty_score":0.012784183},"labels":[],"label_agreement":null},{"id":"W2147638424","doi":"10.5555/2693848.2694267","title":"Bi-level project simulation methodology to integrate superintendent and project manager in decision making: shutdown/turnaround applications","year":2014,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Critical path method; Shutdown; Turnaround time; Computer science; Operations research; Duration (music); Crew; Scheduling (production processes); Monte Carlo method; Project management; Resource (disambiguation); Project manager; Discrete event simulation; Resource allocation; Project planning; Work (physics); Reliability engineering; Industrial engineering; Systems engineering; Engineering; Simulation; Operations management","score_opus":0.3972892948686963,"score_gpt":0.4954420267429048,"score_spread":0.09815273187420848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147638424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008886129,0.00004631165,0.9878549,0.00007491288,0.000012640464,0.00007240083,0.00005296225,0.00024536907,0.002754299],"genre_scores_gemma":[0.31470424,0.00023986107,0.6809884,0.00008569165,0.000016033595,0.00077449816,0.00023261561,0.00010752611,0.0028512254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989975,0.0006140957,0.000053957996,0.0000791096,0.0001768496,0.00007850071],"domain_scores_gemma":[0.9988262,0.00066967995,0.000090497015,0.00010339915,0.00022551477,0.00008471665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020832096,0.0006977604,0.0006959053,0.00074413,0.00051082874,0.0009995188,0.0012575609,0.00076592737,0.0043120254],"category_scores_gemma":[0.0028167162,0.0006064487,0.00075791666,0.0010632423,0.00040940446,0.0010180847,0.0011511391,0.0010891125,0.0005692119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003022727,0.000048064834,0.0006814898,0.000036526828,0.000030426374,0.000041269708,0.00007032799,0.96069974,0.0010888706,0.02287136,0.00032261063,0.014079052],"study_design_scores_gemma":[0.0000046834384,0.000014218477,0.00006083604,0.0000036807455,0.000004257334,0.0000063339244,0.0000073327387,0.9962692,0.00015622773,0.0027410232,0.00072930806,0.0000029048254],"about_ca_topic_score_codex":0.008135453,"about_ca_topic_score_gemma":0.007605938,"teacher_disagreement_score":0.008135453,"about_ca_system_score_codex":0.0009790442,"about_ca_system_score_gemma":0.0023878124,"threshold_uncertainty_score":0.016176164},"labels":[],"label_agreement":null},{"id":"W2155654644","doi":"10.1139/l02-034","title":"Application of genetic algorithms to construction scheduling with or without resource constraints","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":72,"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); Operator (biology); Mathematical optimization; Computer science; Genetic algorithm; Fitness function; Key (lock); Resource leveling; Genetic algorithm scheduling; Genetic operator; Resource constraints; Algorithm; Dynamic priority scheduling; Mathematics; Two-level scheduling; Distributed computing; Resource allocation; Meta-optimization; Schedule","score_opus":0.03595200893317288,"score_gpt":0.2696699419705341,"score_spread":0.23371793303736124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155654644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09210827,0.0016577536,0.8954949,0.00057742215,0.00009736823,0.00011383195,0.000031827087,0.0002933684,0.009625276],"genre_scores_gemma":[0.63003016,0.0019621945,0.3644513,0.00012805178,0.00010578553,0.00016470408,0.00007637831,0.00006589919,0.003015585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995047,0.0002832544,0.000016341066,0.00003927034,0.00011680155,0.00003972525],"domain_scores_gemma":[0.9989405,0.0008721413,0.000043173604,0.000037588736,0.000086873326,0.00001964741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000760075,0.0006315034,0.0006471499,0.00064579997,0.0004703758,0.0006515373,0.0005640029,0.0008772421,0.000767774],"category_scores_gemma":[0.0036333844,0.00023964983,0.00039719837,0.0012987364,0.0009419875,0.00037256524,0.00047740084,0.0007276117,0.00009890739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020496409,0.000020913305,0.00022716456,0.00003551307,0.000029486073,0.00005479085,0.000039932645,0.9562022,0.00060988177,0.009508215,0.00020941356,0.03304208],"study_design_scores_gemma":[0.000021283611,0.000035019904,0.00014118756,0.000011005491,0.000017110704,0.000030662373,0.000021217746,0.98348016,0.0004906915,0.014581708,0.0011642604,0.0000056227327],"about_ca_topic_score_codex":0.009531881,"about_ca_topic_score_gemma":0.006510278,"teacher_disagreement_score":0.009531881,"about_ca_system_score_codex":0.00081610907,"about_ca_system_score_gemma":0.0012728834,"threshold_uncertainty_score":0.018952787},"labels":[],"label_agreement":null},{"id":"W2155750016","doi":"10.1061/(asce)0733-9364(2000)126:3(219)","title":"Simplified CPM/PERT Simulation Model","year":2000,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":99,"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":"Critical path method; Computer science; Complement (music); Criticality; Schedule; Project management; Reliability engineering; Operations research; Systems engineering; Engineering","score_opus":0.04317147818980395,"score_gpt":0.320221638407086,"score_spread":0.27705016021728207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155750016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022906473,0.0001641501,0.94231135,0.0003758218,0.00007070513,0.00019324609,0.00057189853,0.0008308887,0.032575548],"genre_scores_gemma":[0.7997772,0.0006031035,0.17029582,0.0001793437,0.00010419964,0.000966154,0.00094142585,0.00017370241,0.026959097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987369,0.0004867503,0.00006451257,0.00015125312,0.0004436022,0.0001169661],"domain_scores_gemma":[0.99865216,0.0005355612,0.00017888228,0.00014350256,0.00042327767,0.00006657736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010381577,0.0005910627,0.00061823655,0.0009773509,0.00046194304,0.0013256706,0.0015782011,0.0011212971,0.0073282085],"category_scores_gemma":[0.0034422644,0.00035299227,0.00081109966,0.0009312539,0.0005796482,0.0014243502,0.0010998427,0.0009524176,0.001053499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045360095,0.000029544788,0.00050242885,0.000058055743,0.00001531266,0.00018370348,0.000060872302,0.9069023,0.0011555968,0.07718441,0.0010795838,0.01278281],"study_design_scores_gemma":[0.000009988402,0.000024832116,0.00013993097,0.0000074273803,0.000008021069,0.00006472382,0.000011802663,0.9844268,0.00031185045,0.011248377,0.0037379982,0.0000083525],"about_ca_topic_score_codex":0.007754899,"about_ca_topic_score_gemma":0.0034468507,"teacher_disagreement_score":0.007754899,"about_ca_system_score_codex":0.0011640897,"about_ca_system_score_gemma":0.0016990887,"threshold_uncertainty_score":0.02451533},"labels":[],"label_agreement":null},{"id":"W2163482281","doi":"10.1061/41109(373)109","title":"A New Approach for Resource-Constrained Multi-Project Scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"National Research Council Canada","funders":"","keywords":"Computer science; Schedule; Mathematical optimization; Scheduling (production processes); Benchmark (surveying); Job shop scheduling; Resource constraints; Minification; Dynamic priority scheduling; Distributed computing; Mathematics","score_opus":0.16788318795970186,"score_gpt":0.40774496224112805,"score_spread":0.2398617742814262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163482281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012868643,0.00026033507,0.99615747,0.00012001703,0.000066450775,0.00006925957,0.00004530227,0.00009240755,0.0019019538],"genre_scores_gemma":[0.04979547,0.00083433354,0.94468623,0.00015479757,0.00012099369,0.00041857112,0.00020011289,0.00007780326,0.0037116783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989625,0.00029275744,0.000052442087,0.00019878772,0.0004308327,0.00006270799],"domain_scores_gemma":[0.9996358,0.00015107787,0.000045306417,0.00004927326,0.00009037374,0.000028256476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374538,0.0012587688,0.0011280779,0.0014309536,0.00058001763,0.00094626035,0.0020580022,0.0010670354,0.0029037045],"category_scores_gemma":[0.0012272163,0.00048744338,0.0014019482,0.0022018473,0.00058474153,0.0017486305,0.0011006843,0.0016032066,0.00062331045],"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.00006284031,0.00015167939,0.00038923533,0.0004750677,0.00014443013,0.00024144123,0.00016343524,0.5992401,0.0068195704,0.12865049,0.006860575,0.25680113],"study_design_scores_gemma":[0.00003348642,0.000087221066,0.000115931914,0.000027033331,0.00003300482,0.0001553274,0.000029381588,0.9485979,0.0013522797,0.030806754,0.018737983,0.00002363274],"about_ca_topic_score_codex":0.002800192,"about_ca_topic_score_gemma":0.0040113064,"teacher_disagreement_score":0.0029037045,"about_ca_system_score_codex":0.0011441768,"about_ca_system_score_gemma":0.0018430225,"threshold_uncertainty_score":0.009713829},"labels":[],"label_agreement":null},{"id":"W2166193199","doi":"10.1061/41182(416)69","title":"A Generalized Time-Scale Network Simulation Using Chronographic Dynamics Relations","year":2011,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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; Université du Québec à Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Interdependence; Scheduling (production processes); Task (project management); Software; Operations research; Industrial engineering; Mathematical optimization; Data mining; Distributed computing; Artificial intelligence; Systems engineering; Mathematics; Engineering","score_opus":0.1647441314334564,"score_gpt":0.36724680473840843,"score_spread":0.20250267330495203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166193199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1294731,0.00016939436,0.8591157,0.00027112055,0.000046172605,0.00010949947,0.0005141339,0.00027039833,0.0100303525],"genre_scores_gemma":[0.86529297,0.00045996372,0.12927891,0.000046248297,0.000022248556,0.0004608935,0.00041609778,0.000066607645,0.003956027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996246,0.00019534345,0.00001749404,0.00006674498,0.00006249384,0.00003334174],"domain_scores_gemma":[0.9992999,0.00045054167,0.00007845808,0.00005720682,0.00007147117,0.000042364856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775897,0.00050814194,0.0004701678,0.0006829479,0.00042412124,0.00095081836,0.0008633938,0.00077022566,0.0025272667],"category_scores_gemma":[0.0023763212,0.0003304837,0.00080518815,0.0011773934,0.00064305257,0.0011361148,0.0006869828,0.0004773965,0.00016662497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009217244,0.000003947036,0.00022126957,0.000006502401,0.000005614579,0.000015774705,0.000016925998,0.9920508,0.00011821307,0.0064910823,0.00004536475,0.0010152849],"study_design_scores_gemma":[0.000004775863,0.000003908805,0.000049288166,0.0000013446593,0.0000025760828,0.0000029963387,0.000005306679,0.9973326,0.000037346996,0.002315261,0.00024255768,0.0000020562056],"about_ca_topic_score_codex":0.025009189,"about_ca_topic_score_gemma":0.013135586,"teacher_disagreement_score":0.025009189,"about_ca_system_score_codex":0.0011781753,"about_ca_system_score_gemma":0.0013714527,"threshold_uncertainty_score":0.0497272},"labels":[],"label_agreement":null},{"id":"W2168976754","doi":"10.1080/01446193.2015.1063676","title":"Enhanced heuristic for finance-based scheduling of construction projects","year":2015,"lang":"en","type":"article","venue":"Construction Management and Economics","topic":"Resource-Constrained Project Scheduling","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 Manitoba","funders":"","keywords":"Scheduling (production processes); Computer science; Integer programming; Payment; Heuristic; Finance; Cash; Job shop scheduling; Linear programming; Cash flow; Operations research; Mathematical optimization; Economics; Engineering; Algorithm; Mathematics; Operating system; Schedule","score_opus":0.11356629892382172,"score_gpt":0.3207669187765104,"score_spread":0.2072006198526887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168976754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13227838,0.00061664893,0.85427576,0.0002065462,0.00009214987,0.00052247575,0.00037779714,0.00046987628,0.011160284],"genre_scores_gemma":[0.5227175,0.0003130898,0.47312963,0.00006985525,0.000031308908,0.00043223787,0.0004969977,0.00007684906,0.0027325856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994444,0.0002489395,0.000023715438,0.00006513259,0.00010231746,0.000115497016],"domain_scores_gemma":[0.9990422,0.0006571025,0.00007785268,0.000053656007,0.000100888654,0.00006824307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009761685,0.0006629264,0.0008943608,0.0010916444,0.00036196117,0.00066212803,0.0010369128,0.00076598575,0.0028854623],"category_scores_gemma":[0.0018946733,0.0004570383,0.00067988277,0.0010412852,0.00040144162,0.0006039252,0.0005718305,0.0006668838,0.00026699668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094496136,0.00009411059,0.00030137683,0.00007492539,0.000016783197,0.000065271735,0.00003780053,0.96751004,0.0011190397,0.0033446613,0.0005652093,0.0267763],"study_design_scores_gemma":[0.00003463611,0.00006134788,0.00015707513,0.000009938432,0.000010043527,0.000020634943,0.000018764262,0.9961118,0.00059190136,0.0018583674,0.0011193658,0.000006202431],"about_ca_topic_score_codex":0.006200449,"about_ca_topic_score_gemma":0.0064482703,"teacher_disagreement_score":0.006200449,"about_ca_system_score_codex":0.001352465,"about_ca_system_score_gemma":0.002325448,"threshold_uncertainty_score":0.012328744},"labels":[],"label_agreement":null},{"id":"W2185936838","doi":"10.1061/9780784479247.081","title":"Methodology for Crew-Job Allocation Optimization in Project and Workface Scheduling","year":2015,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Computer science; Schedule; Resource leveling; Duration (music); Operations research; Crew; Scheduling (production processes); Workflow; Resource (disambiguation); Resource allocation; Operations management; Database; Engineering; Operating system; Computer network","score_opus":0.4898140766549786,"score_gpt":0.4854198320279474,"score_spread":0.004394244627031196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185936838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008212116,0.000051831037,0.9977671,0.000031222735,0.00001037315,0.000068468544,0.000021709666,0.0000650551,0.001162936],"genre_scores_gemma":[0.067691036,0.00033597066,0.9284264,0.000054256354,0.00003311312,0.0008797241,0.00012978016,0.00010606358,0.0023435885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985781,0.00060993485,0.0000730566,0.00019791367,0.00040736826,0.00013364997],"domain_scores_gemma":[0.9989642,0.0006150012,0.000111376605,0.000076328164,0.00019191022,0.00004119564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002991486,0.0011707648,0.0013742901,0.0018576371,0.00083742384,0.0016777033,0.0021554488,0.001103734,0.0055459817],"category_scores_gemma":[0.0036138508,0.00082652573,0.0018587719,0.002209693,0.00079018786,0.0010411965,0.0013503934,0.0014400458,0.0010183448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029422295,0.00012357622,0.0003480049,0.00023620555,0.00006546636,0.00010064099,0.000113052956,0.8441332,0.0027477809,0.07945664,0.0014276508,0.07121838],"study_design_scores_gemma":[0.000009851109,0.000037730224,0.00006760126,0.000016233898,0.000010274116,0.000027434979,0.000025702186,0.97831833,0.00068857573,0.017687723,0.0031003999,0.000010284586],"about_ca_topic_score_codex":0.0049155992,"about_ca_topic_score_gemma":0.0049543097,"teacher_disagreement_score":0.0055459817,"about_ca_system_score_codex":0.0018562496,"about_ca_system_score_gemma":0.003500921,"threshold_uncertainty_score":0.018553138},"labels":[],"label_agreement":null},{"id":"W2284004793","doi":"10.22060/miscj.2015.544","title":"Developing Robust Project Scheduling Methods for Uncertain Parameters","year":2015,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Project management; Dynamic priority scheduling; Robust optimization; Mathematical optimization; Systems engineering; Engineering; Mathematics","score_opus":0.6115358886107809,"score_gpt":0.5414694386015658,"score_spread":0.07006645000921508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284004793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001504376,0.000097664415,0.99792814,0.000023199213,0.000009546285,0.000016947622,0.000011857373,0.000053299114,0.00035496705],"genre_scores_gemma":[0.19199197,0.0007843185,0.8050701,0.000051753566,0.0001056506,0.0003249732,0.000136088,0.00020734403,0.0013278659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865437,0.0006137934,0.000071483875,0.00020332095,0.00037455605,0.00008251797],"domain_scores_gemma":[0.9944804,0.004122554,0.0005350601,0.00022214233,0.00055013876,0.00008975952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034792868,0.0012650755,0.0012349861,0.0010576632,0.00036905674,0.0009144499,0.0012310722,0.001027383,0.0020337366],"category_scores_gemma":[0.010319811,0.0009493916,0.0014195815,0.0010067851,0.0008068337,0.0014454968,0.0011755029,0.0015856827,0.0004635986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017916873,0.000009339794,0.00006955784,0.00006566514,0.000021408767,0.000017971804,0.00002947886,0.9752917,0.0011334969,0.006498311,0.00019128453,0.016653785],"study_design_scores_gemma":[0.000004420784,0.000012254641,0.000017031109,0.000005504479,0.00000343812,0.0000060925195,0.0000044644103,0.99633586,0.0003438917,0.0028878031,0.00037498484,0.000004199825],"about_ca_topic_score_codex":0.0032573908,"about_ca_topic_score_gemma":0.0016253925,"teacher_disagreement_score":0.0034792868,"about_ca_system_score_codex":0.0008580867,"about_ca_system_score_gemma":0.001696559,"threshold_uncertainty_score":0.01840043},"labels":[],"label_agreement":null},{"id":"W2304713160","doi":"","title":"Expected Duration of Dynamic Markov PERT Networks","year":2007,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Resource-Constrained Project Scheduling","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":"Dalhousie University","funders":"","keywords":"Engineering economics; Duration (music); Flexible manufacturing system; Markov chain; Markov process; Computer science; Operations research; Engineering; Industrial engineering; Operations management; Economics; Mathematics; Statistics; Machine learning; Physics","score_opus":0.3282723209924089,"score_gpt":0.6058655636690989,"score_spread":0.27759324267669006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304713160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2461495,0.00044723868,0.7451008,0.000553894,0.000051804378,0.00008825972,0.0004613618,0.00016458845,0.006982575],"genre_scores_gemma":[0.97005534,0.00026972048,0.026110027,0.000039455765,0.00002436755,0.00014545597,0.00028322884,0.00003332994,0.0030390122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880934,0.0004330147,0.000053212087,0.0002324286,0.00030409812,0.00016786784],"domain_scores_gemma":[0.99380577,0.004333067,0.0007873493,0.00015136697,0.000629318,0.0002931232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019649821,0.000490685,0.00057659444,0.001120862,0.0004363939,0.0012274886,0.0014473923,0.00086662895,0.0038229434],"category_scores_gemma":[0.012148858,0.0004767728,0.0005277482,0.001179861,0.0010023548,0.0019439787,0.0009440639,0.0010225265,0.00019630558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058772035,0.000021828702,0.0013281511,0.000042613614,0.000018971436,0.000090596775,0.000046597703,0.9540754,0.0003237901,0.0392196,0.00033791646,0.0044357115],"study_design_scores_gemma":[0.000004769391,0.000014257496,0.00027622792,0.000008018878,0.0000052309474,0.000025447707,0.000014411451,0.97963494,0.00018880793,0.019510888,0.0003117631,0.0000052038104],"about_ca_topic_score_codex":0.0044054072,"about_ca_topic_score_gemma":0.0026518675,"teacher_disagreement_score":0.0044054072,"about_ca_system_score_codex":0.0020894988,"about_ca_system_score_gemma":0.0009511848,"threshold_uncertainty_score":0.015160441},"labels":[],"label_agreement":null},{"id":"W2323732138","doi":"10.1061/9780784413517.171","title":"Strategies for Optimizing Labor Resource Planning on Plant Shutdown and Turnaround","year":2014,"lang":"en","type":"article","venue":"Construction Research Congress 2014","topic":"Resource-Constrained Project Scheduling","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":"University of Alberta","funders":"","keywords":"Crew; Turnaround time; Duration (music); Operations management; Context (archaeology); Scheduling (production processes); Operations research; Computer science; Engineering; Aeronautics","score_opus":0.1880992759569194,"score_gpt":0.452743687804996,"score_spread":0.26464441184807663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323732138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15025695,0.0010171905,0.82560337,0.0013650928,0.000052998377,0.00084256753,0.0002704071,0.00024276429,0.020348681],"genre_scores_gemma":[0.84902734,0.00088203186,0.14623459,0.000115726754,0.000022063112,0.00044729345,0.00013911401,0.00005419552,0.0030776367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991448,0.000424633,0.000030226922,0.0001034485,0.00012180497,0.00017501968],"domain_scores_gemma":[0.9986197,0.00084998127,0.00022488876,0.000042725318,0.00014383055,0.000118925585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024017799,0.0010998249,0.0010307025,0.0014703486,0.00056006236,0.0022113991,0.0011155641,0.0010948735,0.003433462],"category_scores_gemma":[0.0048684706,0.0007243997,0.0005227104,0.0012898729,0.00082139956,0.0013955388,0.0010738918,0.0010509794,0.0002667163],"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.00006002255,0.00007390917,0.0005988833,0.00007747033,0.00002865372,0.00004590521,0.00008726544,0.96116775,0.00091496937,0.014130216,0.00061718153,0.022197781],"study_design_scores_gemma":[0.00003088544,0.00015941892,0.00085251126,0.000055729844,0.000025753137,0.000013936247,0.00031845208,0.97973996,0.000909694,0.016347015,0.0015254796,0.000021172178],"about_ca_topic_score_codex":0.0101754675,"about_ca_topic_score_gemma":0.012977507,"teacher_disagreement_score":0.0101754675,"about_ca_system_score_codex":0.0024367603,"about_ca_system_score_gemma":0.003947984,"threshold_uncertainty_score":0.020232499},"labels":[],"label_agreement":null},{"id":"W2323947924","doi":"10.1061/40671(2003)113","title":"A Generalized Paradigm for Planning and Scheduling","year":2003,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Computer science; Scheduling (production processes); Automated planning and scheduling; Schedule; Dynamic priority scheduling; Visualization; Industrial engineering; Theoretical computer science; Artificial intelligence; Mathematical optimization; Engineering; Mathematics","score_opus":0.18055314782707144,"score_gpt":0.4150469127942156,"score_spread":0.23449376496714414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323947924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007525523,0.00027281255,0.9921938,0.00040055971,0.00010030739,0.000095919764,0.00010170459,0.00018963862,0.0058927312],"genre_scores_gemma":[0.026271677,0.0008868082,0.96749276,0.00034337997,0.00014103555,0.00061565347,0.00032375852,0.00011351897,0.003811404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964541,0.0014614937,0.00027109217,0.0006827129,0.0009001812,0.00023045219],"domain_scores_gemma":[0.99829406,0.0006483765,0.00011827354,0.00047441843,0.00031182423,0.00015307953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033575597,0.0012889643,0.00095580245,0.0012222123,0.0016709483,0.0031714812,0.0030478942,0.0015064627,0.005496315],"category_scores_gemma":[0.0031417918,0.0007306207,0.0020778596,0.0022610722,0.0027557544,0.005056591,0.0031248142,0.004749169,0.0021215412],"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.000028888791,0.000017943617,0.00009371366,0.00015551812,0.000018689649,0.00011318901,0.00030467007,0.01698151,0.0011144369,0.9463929,0.003442429,0.03133618],"study_design_scores_gemma":[0.000041596297,0.000056882458,0.00008131292,0.00007614401,0.00002286408,0.00028159574,0.00013440133,0.07810427,0.0005999586,0.8066816,0.11388368,0.000035799545],"about_ca_topic_score_codex":0.005216502,"about_ca_topic_score_gemma":0.007845582,"teacher_disagreement_score":0.005496315,"about_ca_system_score_codex":0.0018894336,"about_ca_system_score_gemma":0.0039282585,"threshold_uncertainty_score":0.01838702},"labels":[],"label_agreement":null},{"id":"W2324991507","doi":"10.1139/cjce-2013-0232","title":"A novel multiple decision-maker model for resource-constrained project scheduling problems","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":9,"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":"Decision maker; Scheduling (production processes); Operations research; Fuzzy logic; Computer science; Particle swarm optimization; Mathematical optimization; Hydropower; Decision model; Project management; Engineering; Systems engineering; Mathematics; Artificial intelligence; Algorithm","score_opus":0.062382014661605596,"score_gpt":0.29237704708666135,"score_spread":0.22999503242505576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324991507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066281096,0.00023082881,0.9876435,0.00029150984,0.00006444805,0.0000802391,0.00013780738,0.00008641119,0.0048372033],"genre_scores_gemma":[0.6672194,0.0013495769,0.31087863,0.00023149315,0.00016753683,0.0011082462,0.00048146286,0.000116626186,0.018447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982791,0.00076216675,0.00007404118,0.00028763994,0.0003901623,0.00020682845],"domain_scores_gemma":[0.9989893,0.0005897426,0.00013414511,0.00003643514,0.00015545962,0.00009507272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022666287,0.0015739085,0.00215558,0.0008799432,0.00082032516,0.0025319096,0.0036543042,0.0025372151,0.0055149696],"category_scores_gemma":[0.0024815057,0.0011629243,0.0017284984,0.0018916324,0.00094848394,0.0019213704,0.0016208313,0.0032944118,0.00068898714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022990249,0.0000266142,0.00015560827,0.000052790834,0.00002900619,0.00009731793,0.0000356706,0.97512674,0.0003698679,0.0207862,0.0003422471,0.0029549373],"study_design_scores_gemma":[0.000009646758,0.0000128471365,0.0000263325,0.000003185863,0.0000054550783,0.000010359138,0.00000673751,0.99641365,0.000055109576,0.0030227841,0.00042869354,0.0000051443685],"about_ca_topic_score_codex":0.007956227,"about_ca_topic_score_gemma":0.005718579,"teacher_disagreement_score":0.007956227,"about_ca_system_score_codex":0.0017396822,"about_ca_system_score_gemma":0.0026644026,"threshold_uncertainty_score":0.018449426},"labels":[],"label_agreement":null},{"id":"W2337674258","doi":"10.5539/mas.v10n3p214","title":"A Mathematical Modeling for Delivery Time in Dynamic PERT Networks","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Resource-Constrained Project Scheduling","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":"Randomness; Limit (mathematics); Time limit; Closure (psychology); Casual; Dynamic programming; Computer science; Scheduling (production processes); Function (biology); Mathematical optimization; Exponential function; Linear programming; Mathematics; Statistics; Engineering; Economics; Mathematical analysis","score_opus":0.06399376967656345,"score_gpt":0.3450776163982406,"score_spread":0.28108384672167713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337674258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018170739,0.00064900273,0.9643756,0.0008851889,0.00008723505,0.00005604905,0.00033263638,0.00013046207,0.015312983],"genre_scores_gemma":[0.8508456,0.0028048435,0.094781764,0.00029339406,0.00025899985,0.0005883854,0.0004742273,0.00017526427,0.049777586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.00028092347,0.000048185764,0.0002015758,0.00024286502,0.00013768565],"domain_scores_gemma":[0.9978206,0.0012526739,0.0003859276,0.00009267868,0.00033420487,0.000113927286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016951712,0.0009949531,0.000638452,0.0015502998,0.0007572825,0.0018713493,0.0022583853,0.0014603692,0.0062267724],"category_scores_gemma":[0.007444031,0.0006292196,0.0010893984,0.0017212622,0.0011321072,0.0029468562,0.001127604,0.0018121644,0.0009676044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022209279,0.000025693065,0.0006049404,0.00008348181,0.000013993786,0.00016598859,0.00011787641,0.8266558,0.00068759295,0.16250859,0.0014640683,0.007649789],"study_design_scores_gemma":[0.0000023703535,0.000010678953,0.00010475725,0.000007254437,0.0000051743373,0.000031727173,0.000017265482,0.98414296,0.00007696828,0.014423684,0.0011709208,0.0000061829332],"about_ca_topic_score_codex":0.012376684,"about_ca_topic_score_gemma":0.0058935434,"teacher_disagreement_score":0.012376684,"about_ca_system_score_codex":0.0027400726,"about_ca_system_score_gemma":0.0011453212,"threshold_uncertainty_score":0.024609327},"labels":[],"label_agreement":null},{"id":"W2339465796","doi":"10.1139/cjce-2014-0309","title":"Devising extended-duration schedules of enhanced resource leveling","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"Resource leveling; Duration (music); Schedule; Critical path method; Resource (disambiguation); Computer science; Mathematical optimization; Operations research; Genetic algorithm; Resource allocation; Systems engineering; Engineering; Mathematics","score_opus":0.08183494597364788,"score_gpt":0.3092851756658838,"score_spread":0.22745022969223594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339465796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09572648,0.0001247024,0.8994357,0.00006321864,0.000023881108,0.00014898245,0.000041369392,0.00012666413,0.0043090535],"genre_scores_gemma":[0.70291424,0.00014454215,0.29516694,0.000021451739,0.0000147469245,0.0002331045,0.00010385782,0.00004427511,0.0013568879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994252,0.00023454044,0.00003150071,0.00007184473,0.00015886867,0.00007819793],"domain_scores_gemma":[0.9987571,0.0005104499,0.0002657861,0.00012760756,0.0002317562,0.00010732156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010984752,0.00043566566,0.00038858273,0.00046048933,0.00025344835,0.00037196616,0.00086148496,0.00033110814,0.0015728979],"category_scores_gemma":[0.0036941762,0.00026295034,0.00028102216,0.00055176666,0.00032639503,0.0006663618,0.0005925272,0.0005511259,0.00015866285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011907206,0.00006386964,0.00077212026,0.00008709205,0.00001711931,0.00009756117,0.00012299554,0.91815776,0.011612767,0.017513555,0.00042110326,0.051014997],"study_design_scores_gemma":[0.000025591007,0.00022335045,0.0005104772,0.000013822003,0.000009365948,0.000040922834,0.000037012822,0.9880221,0.0039945873,0.0046645887,0.0024459094,0.000012263053],"about_ca_topic_score_codex":0.0019005057,"about_ca_topic_score_gemma":0.0024305,"teacher_disagreement_score":0.0019005057,"about_ca_system_score_codex":0.00057709444,"about_ca_system_score_gemma":0.0012877813,"threshold_uncertainty_score":0.005809307},"labels":[],"label_agreement":null},{"id":"W2346431641","doi":"10.1016/j.ifacol.2015.06.371","title":"A Fuzzy-Logic based Resource Levelling Optimisation Tool","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Resource-Constrained Project Scheduling","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":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Levelling; Resource (disambiguation); Fuzzy logic; Resource leveling; Computer science; Extant taxon; Artificial intelligence; Data mining; Machine learning; Algorithm; Resource allocation; Geography","score_opus":0.2566218910585413,"score_gpt":0.394360046568761,"score_spread":0.13773815551021973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346431641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003669823,0.000026181136,0.99217343,0.000042996206,0.000016422422,0.000066983,0.000049867576,0.0012845432,0.0026696904],"genre_scores_gemma":[0.12640946,0.00006610577,0.87065464,0.000059836177,0.000009762922,0.00017982372,0.00010135759,0.0001018745,0.0024169572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960214,0.00005989869,0.000024983065,0.00006307243,0.00022095881,0.000028973236],"domain_scores_gemma":[0.99957126,0.00022676257,0.0000479007,0.000030345558,0.00010463354,0.000019109377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072522345,0.0004890535,0.00047881523,0.00093056035,0.00044795484,0.00094376085,0.0010046872,0.00070580805,0.006251376],"category_scores_gemma":[0.0018226113,0.00031353813,0.00051241956,0.00058365276,0.0003585679,0.0007259187,0.0005073555,0.0007676354,0.000800084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001012029,0.00009944602,0.00047737148,0.00018631127,0.000039372815,0.00010600927,0.000072917144,0.7024436,0.019532926,0.022661705,0.0028005657,0.25147864],"study_design_scores_gemma":[0.00002199146,0.000038310758,0.00008483094,0.000014382409,0.000008944647,0.000029706756,0.0000075534244,0.98900884,0.004278613,0.002985121,0.0035102263,0.000011455028],"about_ca_topic_score_codex":0.0037124606,"about_ca_topic_score_gemma":0.0035512822,"teacher_disagreement_score":0.006251376,"about_ca_system_score_codex":0.0007348655,"about_ca_system_score_gemma":0.0013668609,"threshold_uncertainty_score":0.020912886},"labels":[],"label_agreement":null},{"id":"W2412833024","doi":"10.1061/(asce)co.1943-7862.0001193","title":"Flexible Activity Relations to Support Optimum Schedule Acceleration","year":2016,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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 Waterloo","funders":"","keywords":"Schedule; Flexibility (engineering); Computer science; Representation (politics); Relation (database); Resource (disambiguation); Operations research; Range (aeronautics); Process (computing); Logical framework; Industrial engineering; Mathematical optimization; Engineering; Mathematics; Data mining","score_opus":0.05089605280751104,"score_gpt":0.325454514715168,"score_spread":0.274558461907657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412833024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033716742,0.000078796984,0.9588016,0.000116305,0.00002082805,0.00010329298,0.00010025965,0.00029114416,0.0067710225],"genre_scores_gemma":[0.62343484,0.0002032043,0.37126195,0.000042122803,0.000023270963,0.00025508282,0.00021919374,0.00013545557,0.004424876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841,0.00058190455,0.000108307344,0.00023468237,0.00045746882,0.00020758182],"domain_scores_gemma":[0.998505,0.0007116242,0.00028947688,0.00022427141,0.00016318036,0.000106420106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015960352,0.0006833399,0.00053061853,0.00067772303,0.0005043518,0.001851439,0.0015572557,0.0005911858,0.0057244385],"category_scores_gemma":[0.0044376315,0.00048699637,0.0008206454,0.0011391453,0.0010215738,0.0027153213,0.0013961795,0.0015896434,0.00065491005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014167457,0.00008998533,0.0011207318,0.000119065546,0.00001784632,0.00013420517,0.00028425016,0.70504194,0.006321081,0.24812953,0.0010019036,0.03759775],"study_design_scores_gemma":[0.000036202386,0.00017386298,0.0005090471,0.000029353454,0.000026667482,0.00008607563,0.0001609223,0.90261155,0.0041666967,0.08304807,0.009123906,0.000027641872],"about_ca_topic_score_codex":0.0028331776,"about_ca_topic_score_gemma":0.0044040857,"teacher_disagreement_score":0.0057244385,"about_ca_system_score_codex":0.0010394957,"about_ca_system_score_gemma":0.0017203351,"threshold_uncertainty_score":0.019150138},"labels":[],"label_agreement":null},{"id":"W2529544702","doi":"10.1007/s10479-016-2336-8","title":"An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"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":"University of Calgary","keywords":"Computer science; Schedule; Scheduling (production processes); Operations research; Mathematical optimization; Operating system; Mathematics","score_opus":0.4946935409284301,"score_gpt":0.5864833560107651,"score_spread":0.09178981508233497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529544702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017992484,0.000024022544,0.99710387,0.000017634182,0.000038890383,0.000060015052,0.000023816603,0.00035275935,0.00057978765],"genre_scores_gemma":[0.049168028,0.00006577246,0.94811493,0.000036545618,0.000036221816,0.00016720757,0.0000852853,0.0002558738,0.0020699955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.0002570513,0.00006429532,0.00017661623,0.0004154392,0.000102973165],"domain_scores_gemma":[0.99766916,0.0012202254,0.00016742887,0.00034567493,0.0005055239,0.00009192079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017189778,0.0009802231,0.0009520811,0.0009077127,0.00062890415,0.00077931554,0.0017355377,0.0008065707,0.0041743633],"category_scores_gemma":[0.0056948266,0.00057701557,0.0011173562,0.00092346687,0.00058057543,0.0010201329,0.0013481034,0.0017381775,0.0008616146],"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.00032631893,0.00025406075,0.0009269846,0.00027778166,0.00012299784,0.0003668834,0.00032233764,0.26824814,0.02867439,0.040809285,0.004428902,0.655242],"study_design_scores_gemma":[0.00004732907,0.00007627529,0.00018604522,0.00001973758,0.000039807324,0.00012550343,0.00003193591,0.97163457,0.0058504194,0.016147725,0.0058104936,0.00003019177],"about_ca_topic_score_codex":0.003978521,"about_ca_topic_score_gemma":0.0056098453,"teacher_disagreement_score":0.0041743633,"about_ca_system_score_codex":0.00063298154,"about_ca_system_score_gemma":0.0017567505,"threshold_uncertainty_score":0.013964593},"labels":[],"label_agreement":null},{"id":"W2555012946","doi":"10.1108/ecam-05-2014-0069","title":"Optimized scheduling and buffering of repetitive construction projects under uncertainty","year":2016,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":56,"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":"Scheduling (production processes); Computer science; Construction management; Operations research; Industrial engineering; Systems engineering; Risk analysis (engineering); Engineering; Operations management; Business; Civil engineering","score_opus":0.030402780990002504,"score_gpt":0.2825019141844581,"score_spread":0.2520991331944556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555012946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25178966,0.00010498543,0.7442163,0.00008192845,0.000013894184,0.00016242018,0.00007370415,0.00028379474,0.0032732852],"genre_scores_gemma":[0.87030214,0.000046524547,0.1286943,0.000009356805,0.000004514884,0.000074321775,0.000067064,0.000027106309,0.00077465374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960953,0.00011171427,0.000021824386,0.00008164505,0.00010257727,0.00007267813],"domain_scores_gemma":[0.9991486,0.00046143527,0.00016866364,0.000040228584,0.00013346427,0.00004750911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092615007,0.0005311546,0.000585677,0.00063759886,0.00043220096,0.0007156586,0.0007722666,0.00042425323,0.0013754037],"category_scores_gemma":[0.001934171,0.00029365742,0.0003331203,0.0006119008,0.00036501177,0.00046466966,0.0004884141,0.00037523644,0.00010141423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051491792,0.000021945643,0.00042392832,0.000017199593,0.0000062927693,0.00002772116,0.000040151634,0.97497296,0.0013418993,0.0014856908,0.00010354596,0.021507181],"study_design_scores_gemma":[0.0000065602985,0.000040594736,0.0001797234,0.0000035051912,0.0000041011663,0.000007674464,0.000021985936,0.99755836,0.0012365166,0.0007988266,0.00013872089,0.0000034726042],"about_ca_topic_score_codex":0.0072867046,"about_ca_topic_score_gemma":0.005192808,"teacher_disagreement_score":0.0072867046,"about_ca_system_score_codex":0.0011592872,"about_ca_system_score_gemma":0.0016504421,"threshold_uncertainty_score":0.014488578},"labels":[],"label_agreement":null},{"id":"W2558964015","doi":"10.1061/(asce)co.1943-7862.0001276","title":"Uncertainty-Aware Linear Schedule Optimization: A Space-Time Constraint-Satisfaction Approach","year":2016,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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":"","keywords":"Schedule; Duration (music); Computer science; Mathematical optimization; Workspace; Scheduling (production processes); Constraint satisfaction; Linear programming; Operations research; Industrial engineering; Engineering; Mathematics; Robot; Algorithm; Artificial intelligence","score_opus":0.022462676244273835,"score_gpt":0.26897624360049965,"score_spread":0.24651356735622582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558964015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005454327,0.00013123847,0.9920214,0.00010530061,0.000018036524,0.00004691579,0.000056887613,0.000086702144,0.0020792198],"genre_scores_gemma":[0.5350398,0.00054263126,0.46018863,0.00013629154,0.00009231397,0.00043154953,0.00034849925,0.00012178497,0.0030986106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882334,0.00047932722,0.00005112165,0.00015409543,0.00035397816,0.00013813961],"domain_scores_gemma":[0.99832755,0.0011372175,0.00015056219,0.000050877556,0.00027249748,0.00006121398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016966027,0.001110349,0.0012949075,0.0011320076,0.0005751331,0.0013611161,0.0015516749,0.0010275592,0.0028178617],"category_scores_gemma":[0.002932172,0.000756749,0.0014132148,0.0016465192,0.00074665237,0.0010473172,0.0011533765,0.0012840098,0.00028491725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016849335,0.000016425747,0.00010398751,0.000036321126,0.000017737413,0.000034844612,0.000030581283,0.9861712,0.00032211724,0.0051180986,0.00024561118,0.007886201],"study_design_scores_gemma":[0.0000034688546,0.000012440395,0.000024834528,0.000003156606,0.00000397335,0.0000041050325,0.00000806163,0.9976774,0.00011078184,0.0019463178,0.00020260568,0.0000028527327],"about_ca_topic_score_codex":0.015380064,"about_ca_topic_score_gemma":0.009998941,"teacher_disagreement_score":0.015380064,"about_ca_system_score_codex":0.0013046762,"about_ca_system_score_gemma":0.0023291926,"threshold_uncertainty_score":0.030581057},"labels":[],"label_agreement":null},{"id":"W2625348099","doi":"10.1061/9780784480847.047","title":"Automation of Project Planning and Resource Scheduling on a Rough Grading Project","year":2017,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Canadian Natural Resources; University of Alberta","funders":"","keywords":"Earthworks; Automation; Computer science; Scheduling (production processes); Schedule; Operations research; Flow network; Grading (engineering); Plan (archaeology); Project management; Linear programming; Resource leveling; Project planning; Industrial engineering; Engineering; Operations management; Resource allocation; Systems engineering; Civil engineering; Computer network","score_opus":0.2428784745298078,"score_gpt":0.45949220805671476,"score_spread":0.21661373352690697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625348099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24386989,0.00003890532,0.74545336,0.000086961685,0.000012287298,0.00024033914,0.000166132,0.0008660865,0.009266095],"genre_scores_gemma":[0.7978704,0.00007019611,0.19944087,0.000007916925,0.0000033737472,0.000108105334,0.00016169582,0.00004514588,0.0022923066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959594,0.00012974822,0.000014791217,0.000059439102,0.00013381861,0.00006628085],"domain_scores_gemma":[0.9996449,0.00016170299,0.000048582846,0.000054461136,0.000050504677,0.000039865292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820613,0.0004157529,0.0004329865,0.0004214393,0.00058903865,0.00073398615,0.0005122999,0.00031176695,0.0017399464],"category_scores_gemma":[0.0008610081,0.00029797977,0.00038463168,0.0005227946,0.00050641387,0.0005061757,0.0005270118,0.0003928759,0.00020837484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057841113,0.000028224747,0.0006337693,0.000029008768,0.000004000674,0.000079343816,0.000118559066,0.9559007,0.0050249663,0.0027746067,0.00020202977,0.035146855],"study_design_scores_gemma":[0.000010759256,0.00004380026,0.00070107094,0.0000045314855,0.0000051888724,0.000022053538,0.00007368369,0.99334735,0.0021515936,0.0024001915,0.0012295533,0.000010222297],"about_ca_topic_score_codex":0.03376845,"about_ca_topic_score_gemma":0.036945652,"teacher_disagreement_score":0.03376845,"about_ca_system_score_codex":0.0010607146,"about_ca_system_score_gemma":0.0026884559,"threshold_uncertainty_score":0.0671438},"labels":[],"label_agreement":null},{"id":"W2757346420","doi":"10.1139/cjce-2017-0020","title":"Integration of linear scheduling method and the critical chain project management","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":21,"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":"Computer science; Scheduling (production processes); Two-level scheduling; Industrial engineering; Dynamic priority scheduling; Distributed computing; Operations research; Mathematical optimization; Schedule; Engineering; Mathematics","score_opus":0.0713092974417582,"score_gpt":0.3719281797955934,"score_spread":0.3006188823538352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757346420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002206496,0.00014323415,0.9954601,0.0000461244,0.00002204605,0.00005570944,0.000011413259,0.00021124915,0.0018436448],"genre_scores_gemma":[0.16285522,0.0004161162,0.8335765,0.00005424112,0.000061157094,0.00021897374,0.000074582895,0.00009679896,0.002646426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975017,0.0009304695,0.00014018104,0.00036211862,0.0009367255,0.0001288081],"domain_scores_gemma":[0.9975176,0.0013765516,0.00030886105,0.00019236344,0.0005127187,0.00009188912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129969,0.00071938353,0.00046256566,0.0018009018,0.00059001776,0.00093148195,0.0012092083,0.00044756365,0.0038630553],"category_scores_gemma":[0.004172885,0.0004175372,0.0005263411,0.0017447062,0.00076808943,0.0012006584,0.0009011316,0.00075449265,0.00048940233],"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.00009895403,0.000102861566,0.0013554266,0.0004149502,0.00006623791,0.00013632624,0.00037570373,0.30190513,0.006583577,0.080442116,0.0018418679,0.6066768],"study_design_scores_gemma":[0.00003493632,0.0002473191,0.0006051733,0.00007822996,0.000034119992,0.00017492185,0.000116213436,0.94049364,0.006664008,0.036170032,0.015333023,0.000048308684],"about_ca_topic_score_codex":0.006435626,"about_ca_topic_score_gemma":0.0053124595,"teacher_disagreement_score":0.006435626,"about_ca_system_score_codex":0.0013907097,"about_ca_system_score_gemma":0.0031765956,"threshold_uncertainty_score":0.012923241},"labels":[],"label_agreement":null},{"id":"W2766525559","doi":"10.1080/01446193.2017.1390241","title":"A simulation-based method for effective workface planning of industrial construction projects","year":2017,"lang":"en","type":"article","venue":"Construction Management and Economics","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; PCL Construction (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Discrete event simulation; Work (physics); Plan (archaeology); Computer science; Workforce planning; Process (computing); Scale (ratio); Industrial engineering; Operations research; Workforce; Engineering; Simulation; Operations management","score_opus":0.16702214608180224,"score_gpt":0.4017609918205162,"score_spread":0.23473884573871398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766525559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004247876,0.000048430466,0.99369,0.00003416454,0.000017984983,0.000045186564,0.000035893838,0.00026849384,0.0016119382],"genre_scores_gemma":[0.35823756,0.00023709906,0.6377834,0.000041155534,0.000023509818,0.00051939435,0.00021812157,0.0001217041,0.0028179311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964106,0.00012737223,0.000019599054,0.000057308058,0.00011523387,0.000039437506],"domain_scores_gemma":[0.99950635,0.00027589276,0.00004844787,0.000035522437,0.000095957526,0.000037834474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006958572,0.0007100659,0.0008349391,0.0006905451,0.0005117901,0.0006957564,0.0012018821,0.0007535822,0.0038439056],"category_scores_gemma":[0.0012787422,0.0005486926,0.0009885657,0.0008378948,0.00049333804,0.0005550949,0.00080150977,0.00075456384,0.0003819564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018490768,0.000013916441,0.00016310182,0.000022754968,0.000011008201,0.000029238026,0.000019082716,0.9851504,0.0008730932,0.004025286,0.00017399392,0.009499665],"study_design_scores_gemma":[0.000003998816,0.0000049945693,0.000018901059,0.0000030724934,0.000002079766,0.0000046480995,0.00000276345,0.99874073,0.00015624084,0.0006500419,0.00041016773,0.0000024413237],"about_ca_topic_score_codex":0.011070228,"about_ca_topic_score_gemma":0.009824858,"teacher_disagreement_score":0.011070228,"about_ca_system_score_codex":0.0009174844,"about_ca_system_score_gemma":0.001875814,"threshold_uncertainty_score":0.022011578},"labels":[],"label_agreement":null},{"id":"W2805714452","doi":"10.1007/978-3-319-93031-2_23","title":"Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Resource-Constrained Project Scheduling","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":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Constraint programming; Scheduling (production processes); Constraint (computer-aided design); Mathematical optimization; Resource constraints; Computation; Set (abstract data type); Theoretical computer science; Mathematics; Distributed computing; Stochastic programming","score_opus":0.06981872775659288,"score_gpt":0.3314531585137394,"score_spread":0.26163443075714654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805714452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01521827,0.00027557474,0.97876894,0.00018802048,0.00015679734,0.00007855692,0.00017405195,0.001251264,0.0038884568],"genre_scores_gemma":[0.19451585,0.00027202853,0.79423535,0.00025647983,0.00016829392,0.00018126919,0.0008836727,0.0004498044,0.009037329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991105,0.00011451514,0.00006411636,0.00017922057,0.00030827225,0.00022338868],"domain_scores_gemma":[0.99819785,0.0007720288,0.00010563862,0.0004861105,0.00032558446,0.0001127767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096560275,0.00094820245,0.0016012227,0.0010761598,0.0011909344,0.0017905605,0.0018922131,0.0011488561,0.00877287],"category_scores_gemma":[0.0031401166,0.00060445064,0.0009406978,0.0020456295,0.00057157467,0.0020792098,0.0017924912,0.0017846114,0.0013781453],"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.00072767516,0.00033945896,0.0012847502,0.00019234382,0.000095694755,0.00013316853,0.00012510049,0.21548487,0.012913644,0.036866836,0.01731062,0.71452594],"study_design_scores_gemma":[0.000047452788,0.00007244628,0.00034038455,0.000016877848,0.00002827071,0.00005896012,0.00003580224,0.97452104,0.004303262,0.017424332,0.0031296166,0.00002142658],"about_ca_topic_score_codex":0.009837521,"about_ca_topic_score_gemma":0.011800091,"teacher_disagreement_score":0.009837521,"about_ca_system_score_codex":0.0011327972,"about_ca_system_score_gemma":0.0036223684,"threshold_uncertainty_score":0.029348195},"labels":[],"label_agreement":null},{"id":"W2886699219","doi":"10.1139/cjce-2017-0670","title":"Resource leveling in construction projects with activity splitting and resource constraints: a simulated annealing optimization","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":27,"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 Toronto","funders":"","keywords":"Resource leveling; Simulated annealing; Resource (disambiguation); Overtime; Computer science; Novelty; Operations research; Heuristic; Stakeholder; Industrial engineering; Project management; Engineering; Systems engineering; Economics","score_opus":0.03741523378493097,"score_gpt":0.2731750177899749,"score_spread":0.2357597840050439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886699219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22980729,0.00049673376,0.75368756,0.00048069545,0.000047317644,0.00020209228,0.00018521985,0.0002310281,0.014861981],"genre_scores_gemma":[0.90474427,0.00030625027,0.08957902,0.00005522499,0.000011558677,0.00028333784,0.00011845774,0.000054160515,0.0048477366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961394,0.00019942145,0.000012194092,0.00005168982,0.000052398667,0.00007036153],"domain_scores_gemma":[0.9993272,0.00048568728,0.000054435055,0.000027635582,0.000060038037,0.000044991546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075626344,0.00065630936,0.0010502278,0.0006209896,0.00055121153,0.0010762679,0.00088689645,0.0014602302,0.002433207],"category_scores_gemma":[0.001634556,0.0007468328,0.00091359246,0.00080147083,0.0008268665,0.00070089643,0.00061893516,0.00092366233,0.0001767642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012721864,0.000008351991,0.00010689814,0.0000080813115,0.0000052364057,0.000011179865,0.0000088165325,0.9975661,0.0001887767,0.000985604,0.00004852678,0.001049665],"study_design_scores_gemma":[0.000005951622,0.000016332355,0.000073018884,0.0000027507438,0.0000046344826,0.0000033999725,0.000008566111,0.9988937,0.00010000411,0.00074143766,0.00014826759,0.0000019912504],"about_ca_topic_score_codex":0.017326161,"about_ca_topic_score_gemma":0.009411599,"teacher_disagreement_score":0.017326161,"about_ca_system_score_codex":0.0014809613,"about_ca_system_score_gemma":0.0017316352,"threshold_uncertainty_score":0.03445065},"labels":[],"label_agreement":null},{"id":"W2894184593","doi":"10.1080/00207543.2018.1524168","title":"A review of methods, techniques and tools for project planning and control","year":2018,"lang":"en","type":"review","venue":"International Journal of Production Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":125,"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; SNC-Lavalin (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Project planning; Project management; Control (management); Schedule; Project management triangle; Automated planning and scheduling; Computer science; Management science; Scheduling (production processes); Operations research; Risk analysis (engineering); Plan (archaeology); Process management; Engineering; Systems engineering; Operations management; Business","score_opus":0.740716950937955,"score_gpt":0.7034723258423267,"score_spread":0.037244625095628314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894184593","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046039146,0.9171496,0.06614574,0.0015214321,0.0008277008,0.000105044855,0.00027083093,0.00016878647,0.013350486],"genre_scores_gemma":[0.0071112853,0.9309409,0.0573893,0.00045701442,0.00079771347,0.00019920559,0.00027512244,0.0000466305,0.0027828084],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971777,0.00060990255,0.00042517867,0.00036024718,0.0013244314,0.000102498256],"domain_scores_gemma":[0.9956053,0.003009294,0.00034628587,0.00018641622,0.0007716237,0.000081120015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027207008,0.0016830931,0.0014035591,0.005551512,0.0006464263,0.002477128,0.0021296113,0.0018402614,0.0060615973],"category_scores_gemma":[0.0055986578,0.00080756017,0.0009531599,0.008151409,0.001392099,0.0027039188,0.0011581283,0.0018012646,0.0025852777],"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.000028015573,0.000066116874,0.0003536394,0.015287831,0.00006244175,0.00011629932,0.00016178557,0.009420909,0.00073135283,0.059812997,0.025281206,0.88867736],"study_design_scores_gemma":[0.000013058279,0.00008607532,0.0009250109,0.0062481575,0.00006533482,0.00038580273,0.00014017928,0.0037891315,0.00064169575,0.036529716,0.9511022,0.0000738024],"about_ca_topic_score_codex":0.006110331,"about_ca_topic_score_gemma":0.0053423615,"teacher_disagreement_score":0.006110331,"about_ca_system_score_codex":0.002288341,"about_ca_system_score_gemma":0.0046631703,"threshold_uncertainty_score":0.020278037},"labels":[],"label_agreement":null},{"id":"W2903697342","doi":"10.1139/cjce-2018-0352","title":"An evolutionary stochastic discrete time-cost trade-off method","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":5,"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":"Flexibility (engineering); Computer science; Duration (music); Mode (computer interface); Process (computing); Mathematical optimization; Operations research; Selection (genetic algorithm); Industrial engineering; Reliability engineering; Engineering; Mathematics; Machine learning","score_opus":0.03233382638574227,"score_gpt":0.3180598952190216,"score_spread":0.28572606883327933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903697342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019468861,0.000083073464,0.99642366,0.000040660158,0.000018254876,0.000045179873,0.00001683329,0.00006263907,0.0013627548],"genre_scores_gemma":[0.24165297,0.0003005743,0.75203377,0.00013274366,0.00006382937,0.0008135801,0.00013190522,0.00016648418,0.0047041257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803704,0.0010432802,0.00007373533,0.00021176816,0.0005069329,0.00012715986],"domain_scores_gemma":[0.99676526,0.0025550022,0.00016947786,0.00010714144,0.00032132576,0.000081813254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036824485,0.0012050265,0.0013560407,0.0012491334,0.00038280155,0.001112936,0.0017096993,0.0015004034,0.00482727],"category_scores_gemma":[0.006309675,0.00077409495,0.0013429603,0.0009812565,0.00072905194,0.00089680514,0.0010911297,0.0016538217,0.0004974102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004652189,0.000045566594,0.00026715413,0.00008593616,0.000052598298,0.000043530228,0.000030727133,0.9510581,0.0009413211,0.015431586,0.00032631535,0.031670645],"study_design_scores_gemma":[0.00001118205,0.000025033602,0.000045109846,0.000009063527,0.000008904774,0.0000108797585,0.0000025019508,0.99612194,0.00023547607,0.0030708571,0.00045434845,0.00000474718],"about_ca_topic_score_codex":0.0021388808,"about_ca_topic_score_gemma":0.0013799237,"teacher_disagreement_score":0.00482727,"about_ca_system_score_codex":0.0012627376,"about_ca_system_score_gemma":0.0015744121,"threshold_uncertainty_score":0.019474864},"labels":[],"label_agreement":null},{"id":"W2912411243","doi":"10.5267/j.jpm.2019.1.001","title":"Project scheduling and forecasting by laws of physical movement","year":2019,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","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":"Operations research; Scheduling (production processes); Computer science; Law; Engineering; Political science; Operations management","score_opus":0.08027434343143473,"score_gpt":0.36578540992297953,"score_spread":0.2855110664915448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912411243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091384705,0.0005625824,0.98171866,0.0003743638,0.00011768336,0.000072604336,0.0001865321,0.00022566554,0.0076034325],"genre_scores_gemma":[0.62704915,0.003912221,0.34887087,0.00020840668,0.00036785877,0.00078205287,0.00066290394,0.00021632604,0.017930262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988537,0.00025583405,0.00006975223,0.00029952903,0.00044871762,0.00007256032],"domain_scores_gemma":[0.9981324,0.0011319476,0.0002885372,0.00013205159,0.00027142916,0.0000437163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526968,0.0008323198,0.0007960462,0.0014008111,0.0005398438,0.001633145,0.0012794251,0.0009938981,0.0035075275],"category_scores_gemma":[0.006313413,0.0005800616,0.0010594502,0.0016052749,0.0012826248,0.0022255501,0.0005932152,0.0011967574,0.00077587034],"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.000020986614,0.000029912655,0.0022343993,0.00011334776,0.000032883218,0.00007421139,0.00012618104,0.8612025,0.00074893265,0.098596476,0.0014428257,0.035377398],"study_design_scores_gemma":[0.0000071555482,0.000016241987,0.00061125465,0.000026468248,0.000009129577,0.00003430725,0.000023231873,0.95783305,0.00020442148,0.037952136,0.003267093,0.00001543535],"about_ca_topic_score_codex":0.015272169,"about_ca_topic_score_gemma":0.009239392,"teacher_disagreement_score":0.015272169,"about_ca_system_score_codex":0.0014982803,"about_ca_system_score_gemma":0.0012842721,"threshold_uncertainty_score":0.03036654},"labels":[],"label_agreement":null},{"id":"W2917897232","doi":"","title":"Multi-Project Multi-Mode Resource Constrained Scheduling Problem with Material Ordering","year":2018,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":2,"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":"Mathematical optimization; Heuristic; Scheduling (production processes); Computer science; Job shop scheduling; Resource (disambiguation); Software; Mathematics; Schedule","score_opus":0.08637007765545343,"score_gpt":0.36922796884416814,"score_spread":0.28285789118871474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917897232","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15264626,0.0009942468,0.8247681,0.0008441807,0.00017694854,0.0004993312,0.0006628306,0.00018288438,0.019225135],"genre_scores_gemma":[0.67195296,0.0012537347,0.31297973,0.000112396745,0.00007901043,0.00062957144,0.0005548943,0.0000825777,0.0123550575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00032505102,0.00003737821,0.00015050956,0.00012512857,0.00013106386],"domain_scores_gemma":[0.9992199,0.00049080444,0.00008963724,0.000042070064,0.00008370909,0.00007377304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821042,0.0009442457,0.0011069461,0.0007568186,0.0007604238,0.0011491511,0.0011265477,0.0013192232,0.003610225],"category_scores_gemma":[0.0017050763,0.00050160586,0.0011666012,0.0017140304,0.0004977294,0.0011068023,0.0006945278,0.0010910451,0.00028114382],"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.00015057393,0.00014031996,0.0010193003,0.00036285064,0.000070669776,0.00040893466,0.00008707182,0.92915475,0.0026012317,0.020928241,0.00202822,0.04304781],"study_design_scores_gemma":[0.000033697648,0.00015161347,0.00062366255,0.000031556752,0.000031334806,0.00013071655,0.00012605704,0.9798692,0.0014454371,0.014048591,0.0034893404,0.000018952813],"about_ca_topic_score_codex":0.006988209,"about_ca_topic_score_gemma":0.007881459,"teacher_disagreement_score":0.006988209,"about_ca_system_score_codex":0.0013169979,"about_ca_system_score_gemma":0.0025770601,"threshold_uncertainty_score":0.013895035},"labels":[],"label_agreement":null},{"id":"W2939607216","doi":"10.1139/cjce-2018-0544","title":"Multi-dimensional optimization model for schedule fast-tracking without over-stressing construction workers","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Jarislowsky Foundation","keywords":"Schedule; Flexibility (engineering); Process (computing); Computer science; Constraint (computer-aided design); Variety (cybernetics); Acceleration; Resource (disambiguation); Benchmark (surveying); Mathematical optimization; Industrial engineering; Engineering; Operations research; Artificial intelligence","score_opus":0.04543249479354657,"score_gpt":0.2980623664017784,"score_spread":0.25262987160823186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939607216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019495688,0.0004487408,0.9634572,0.00045193933,0.000096261945,0.00014493387,0.0005254451,0.00021832307,0.015161385],"genre_scores_gemma":[0.7607291,0.0013339195,0.21561465,0.00022128542,0.00010690087,0.0010960165,0.00094191846,0.00017243328,0.019783804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992367,0.00027559433,0.000036076435,0.00013894236,0.00017112447,0.00014146024],"domain_scores_gemma":[0.99908805,0.0005313828,0.00012649351,0.000027376442,0.00015855147,0.00006817893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015116013,0.0011885025,0.0013802856,0.0007243065,0.00054894574,0.0017338555,0.0014999864,0.0015119489,0.00588893],"category_scores_gemma":[0.0022523915,0.0007349282,0.0009688709,0.0013416226,0.00061300956,0.0008525504,0.0011298276,0.0016640153,0.0006244676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009624693,0.000009091496,0.00006486741,0.000017400665,0.0000058023716,0.000015636966,0.000008074624,0.9958293,0.000082867286,0.0022882728,0.00023003461,0.0014390929],"study_design_scores_gemma":[0.0000035725222,0.000009022657,0.000036746333,0.0000028425238,0.0000031094962,0.000002976551,0.0000050029444,0.9989349,0.00003513862,0.0007025556,0.00026183485,0.0000021616531],"about_ca_topic_score_codex":0.019803686,"about_ca_topic_score_gemma":0.014460554,"teacher_disagreement_score":0.019803686,"about_ca_system_score_codex":0.0016639614,"about_ca_system_score_gemma":0.0026287932,"threshold_uncertainty_score":0.039376795},"labels":[],"label_agreement":null},{"id":"W2944277995","doi":"10.1108/ecam-05-2018-0217","title":"Multi-objective optimization for repetitive scheduling under uncertainty","year":2019,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":51,"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":"Schedule; Computer science; Mathematical optimization; Duration (music); Scheduling (production processes); Fuzzy logic; Genetic algorithm; Reliability engineering; Mathematics; Engineering","score_opus":0.03050651757581384,"score_gpt":0.303171025998577,"score_spread":0.27266450842276313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944277995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020756142,0.00020121361,0.97629136,0.000048788424,0.000016177413,0.000048670292,0.00003813183,0.00011891081,0.0024805062],"genre_scores_gemma":[0.6188334,0.0002723778,0.376638,0.000048552633,0.000031746327,0.00030056,0.00015538518,0.0001302625,0.003589755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992793,0.00023288128,0.000031878506,0.00010864195,0.00028446649,0.00006280924],"domain_scores_gemma":[0.9992705,0.000442838,0.00012242825,0.000027771182,0.00011299052,0.000023342276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012993279,0.0008680951,0.000836761,0.0008042932,0.00037443708,0.00071900414,0.0008358155,0.00062719913,0.0016398795],"category_scores_gemma":[0.00185844,0.0004538995,0.0011053855,0.0006583874,0.00031794223,0.000578281,0.0005947472,0.000829794,0.00017989296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010563506,0.000012253496,0.00012147703,0.000030754123,0.000017948356,0.000018798399,0.000017757227,0.98862386,0.00073379313,0.0010005726,0.00007000944,0.009342211],"study_design_scores_gemma":[0.000002909633,0.000018271605,0.00008536734,0.000004545491,0.000004310283,0.0000060157467,0.0000054712655,0.99877685,0.0002824729,0.0006234415,0.00018726956,0.00000309389],"about_ca_topic_score_codex":0.0051487405,"about_ca_topic_score_gemma":0.004102808,"teacher_disagreement_score":0.0051487405,"about_ca_system_score_codex":0.0009001979,"about_ca_system_score_gemma":0.001336341,"threshold_uncertainty_score":0.010237515},"labels":[],"label_agreement":null},{"id":"W2950905671","doi":"10.19255/jmpm01905","title":"The impact of project characteristics on the efficiency of activity overlapping in project scheduling","year":2019,"lang":"en","type":"article","venue":"Journal of Modern Project Management","topic":"Resource-Constrained Project Scheduling","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é Laval; Polytechnique Montréal","funders":"","keywords":"Rework; Job shop scheduling; Computer science; Project management; Limiting; Scheduling (production processes); Operations research; Mathematical optimization; Schedule; Systems engineering; Engineering; Mathematics","score_opus":0.08815023638419449,"score_gpt":0.39007367657568637,"score_spread":0.30192344019149187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950905671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85637414,0.0003814608,0.1404041,0.0000898798,0.00000898892,0.00006249379,0.000037880658,0.00004409026,0.0025968924],"genre_scores_gemma":[0.9901518,0.00010072465,0.009528673,0.000005639516,0.000004196204,0.000019373501,0.000017994946,0.000015320966,0.00015614813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9962064,0.0022144683,0.00013027123,0.0003237493,0.000621896,0.00050310785],"domain_scores_gemma":[0.95817703,0.03578827,0.0035216983,0.0010122054,0.0008119759,0.0006887846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046296585,0.0005203253,0.000747853,0.00085567764,0.00046929176,0.0011406721,0.0006502176,0.00047086208,0.0006913192],"category_scores_gemma":[0.022724396,0.00042144975,0.00042657554,0.001102041,0.00079761416,0.0017153176,0.0009676776,0.00058744865,0.000096089854],"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.00028996452,0.00008748828,0.010183936,0.00007343354,0.00005199595,0.00009571311,0.00007945664,0.9580007,0.0030942056,0.0014291893,0.00006549408,0.026548307],"study_design_scores_gemma":[0.000024397776,0.00075142697,0.013244382,0.000019412482,0.000065327215,0.0001774938,0.00022716766,0.97713864,0.0042445306,0.003641094,0.00044132952,0.000024886025],"about_ca_topic_score_codex":0.0019893867,"about_ca_topic_score_gemma":0.0021409548,"teacher_disagreement_score":0.0046296585,"about_ca_system_score_codex":0.0006784293,"about_ca_system_score_gemma":0.0011029489,"threshold_uncertainty_score":0.024484277},"labels":[],"label_agreement":null},{"id":"W2978780371","doi":"10.1016/j.cie.2019.106075","title":"The railway rapid transit network construction scheduling problem","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":9,"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":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Federación Española de Enfermedades Raras","keywords":"Integer programming; Schedule; Scheduling (production processes); Computer science; Mathematical optimization; Revenue; Operations research; Flow network; Profit (economics); Engineering; Mathematics; Economics","score_opus":0.053731820466978025,"score_gpt":0.2703974483743323,"score_spread":0.2166656279073543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978780371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.347486,0.0027534463,0.572566,0.006469942,0.00045871123,0.00081577833,0.0045333225,0.0004263098,0.06449051],"genre_scores_gemma":[0.8565454,0.0024847533,0.11003951,0.000368382,0.0003922745,0.00036143468,0.0025536756,0.00017314855,0.027081393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993685,0.0002586635,0.00001982025,0.00014356265,0.00007588016,0.00013360099],"domain_scores_gemma":[0.99889344,0.00075428217,0.000100562225,0.000037980444,0.00007662301,0.00013716011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083855,0.0008857804,0.0013673493,0.0008543248,0.0007476571,0.0017974062,0.0010888848,0.001622923,0.007620197],"category_scores_gemma":[0.0024470575,0.0006771168,0.0008953784,0.0017442645,0.0008556418,0.0014395316,0.0008679003,0.0011635593,0.00043638307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022153978,0.00016987194,0.0007914805,0.0002454145,0.00006577207,0.0001886549,0.00006778693,0.91300684,0.0010036959,0.04313854,0.009778028,0.031322416],"study_design_scores_gemma":[0.00013742826,0.0001137224,0.0006441326,0.000025836118,0.000042629763,0.00007167036,0.000102128004,0.94847536,0.00056700216,0.043498587,0.006302858,0.000018648872],"about_ca_topic_score_codex":0.01694307,"about_ca_topic_score_gemma":0.011942826,"teacher_disagreement_score":0.01694307,"about_ca_system_score_codex":0.0022223801,"about_ca_system_score_gemma":0.0030178344,"threshold_uncertainty_score":0.033688903},"labels":[],"label_agreement":null},{"id":"W2999291911","doi":"10.1061/9780784482421.074","title":"Path-Float Based Approach to Optimizing Time-Cost Tradeoff in Project Planning and Scheduling","year":2019,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Critical path method; Float (project management); Duration (music); Computer science; Mathematical optimization; Scheduling (production processes); Integer programming; Project management; Path (computing); Shortest path problem; Heuristic; Operations research; Network planning and design; Industrial engineering; Engineering; Systems engineering; Algorithm; Mathematics; Artificial intelligence; Computer network; Theoretical computer science","score_opus":0.10988901591074457,"score_gpt":0.36568250129693697,"score_spread":0.2557934853861924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999291911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005909897,0.00016217396,0.99058807,0.0001151544,0.000026389476,0.00009053652,0.00006596359,0.00009133838,0.0029503559],"genre_scores_gemma":[0.2515843,0.0006891125,0.743046,0.00012382497,0.00005593559,0.0005283957,0.00022731652,0.00017027184,0.0035748966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993156,0.00028405283,0.000025467249,0.00012841648,0.00016597328,0.00008052684],"domain_scores_gemma":[0.99921286,0.0005123993,0.00009422179,0.00002934983,0.000119281875,0.00003191118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016315387,0.0014340169,0.0010641539,0.0016693638,0.0006909588,0.0010042675,0.0012295218,0.000980423,0.0049117454],"category_scores_gemma":[0.0025397541,0.00079884264,0.0011128358,0.0018004366,0.00083845144,0.0015864877,0.00084317604,0.0014456986,0.00035589316],"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.000027007361,0.000029635969,0.00029080707,0.00007896739,0.00002832221,0.000029238425,0.00004491525,0.95872784,0.00052437285,0.017283566,0.0006111591,0.022324136],"study_design_scores_gemma":[0.000006423862,0.00004923493,0.00008209473,0.000010361998,0.000011335951,0.000015445044,0.000016142165,0.98720235,0.00029889322,0.011049589,0.0012509867,0.0000069965436],"about_ca_topic_score_codex":0.009283411,"about_ca_topic_score_gemma":0.008173459,"teacher_disagreement_score":0.009283411,"about_ca_system_score_codex":0.0019660513,"about_ca_system_score_gemma":0.0023480006,"threshold_uncertainty_score":0.018458784},"labels":[],"label_agreement":null},{"id":"W3003378510","doi":"10.5267/j.jpm.2020.1.002","title":"A genetic algorithm-based method for solving multi-mode resource-constrained project scheduling problem in uncertain environment","year":2020,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Douglas College","funders":"","keywords":"Computer science; Genetic algorithm; Mathematical optimization; Scheduling (production processes); Distributed computing; Mathematics; Machine learning","score_opus":0.1224594599562345,"score_gpt":0.39909491086921617,"score_spread":0.2766354509129817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003378510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01058849,0.00026165857,0.9863434,0.00010708175,0.00003369056,0.000053125408,0.00002445677,0.00015101481,0.002437137],"genre_scores_gemma":[0.41639248,0.0006200977,0.5789941,0.00015138506,0.000051873765,0.0005771128,0.00015063731,0.00007269418,0.0029895979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967337,0.00013734905,0.000013091091,0.000048276997,0.00008985504,0.000038066468],"domain_scores_gemma":[0.9995697,0.00028904446,0.000036000805,0.000012328701,0.00007562753,0.000017260892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007264567,0.0008674283,0.0010389097,0.000796968,0.0005385012,0.00067981734,0.0010303191,0.0013765162,0.0015646406],"category_scores_gemma":[0.0013507619,0.0004268739,0.0008430876,0.0011549405,0.0004932092,0.00059052074,0.000615091,0.0009395731,0.0001855241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015821983,0.000020872078,0.00019340804,0.000030975163,0.000023900191,0.0000380525,0.000023467777,0.97693515,0.00058027945,0.002604852,0.00026438467,0.019268807],"study_design_scores_gemma":[0.000006582642,0.00001419217,0.0000383862,0.0000044454832,0.000004852514,0.000010674792,0.0000046579376,0.99886465,0.00008927978,0.0007526796,0.000206889,0.0000027379392],"about_ca_topic_score_codex":0.0134119615,"about_ca_topic_score_gemma":0.009101115,"teacher_disagreement_score":0.0134119615,"about_ca_system_score_codex":0.00072538067,"about_ca_system_score_gemma":0.0019965845,"threshold_uncertainty_score":0.026667833},"labels":[],"label_agreement":null},{"id":"W3035172757","doi":"10.24963/ijcai.2020/162","title":"Learning Sensitivity of RCPSP by Analyzing the Search Process","year":2020,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Computer science; Solver; Constraint programming; Sensitivity (control systems); Task (project management); Constraint (computer-aided design); Mathematical optimization; Scheduling (production processes); Integer programming; Linear programming; Process (computing); Forcing (mathematics); Resource constraints; Local consistency; Constraint satisfaction problem; Artificial intelligence; Algorithm; Mathematics; Programming language; Distributed computing; Stochastic programming","score_opus":0.12079949155951657,"score_gpt":0.3971092873093908,"score_spread":0.27630979574987424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035172757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24056546,0.0011875705,0.7484977,0.0014391863,0.00008058915,0.00029318393,0.0005318042,0.0008844388,0.006520007],"genre_scores_gemma":[0.858795,0.00047411438,0.1375366,0.00031325844,0.000070490976,0.0003580377,0.0007871123,0.00016821378,0.0014971314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971347,0.0013000634,0.00016070995,0.00051545736,0.000612258,0.00027676343],"domain_scores_gemma":[0.96631247,0.029855339,0.0015639844,0.0007220069,0.0011298306,0.00041642002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061106062,0.0014150997,0.0014650676,0.0030361142,0.0006163436,0.0018278176,0.0011643781,0.0016299022,0.0022574905],"category_scores_gemma":[0.035268087,0.00094803853,0.0015918495,0.0015387791,0.0013691996,0.0025044065,0.0016839122,0.0023737294,0.0002374498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855839,0.00006353756,0.0035996328,0.00010103096,0.000071556264,0.00007313743,0.00008431773,0.97278756,0.0006596005,0.0058752643,0.0005773278,0.01602143],"study_design_scores_gemma":[0.0000055491228,0.000016920327,0.00021616498,0.000008663413,0.000008111519,0.000008786626,0.000010646388,0.9926144,0.00021508952,0.006777341,0.00011389965,0.0000043971163],"about_ca_topic_score_codex":0.0064387,"about_ca_topic_score_gemma":0.0036905801,"teacher_disagreement_score":0.0064387,"about_ca_system_score_codex":0.0020671505,"about_ca_system_score_gemma":0.0026385328,"threshold_uncertainty_score":0.032316387},"labels":[],"label_agreement":null},{"id":"W3049012445","doi":"10.1080/03155986.2020.1803720","title":"Multi-mode resource constrained project scheduling problem along with contractor selection","year":2020,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":7,"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":"TOPSIS; Mathematical optimization; Ideal solution; Computer science; Pareto principle; Scheduling (production processes); Multi-objective optimization; Operations research; Decision maker; Job shop scheduling; Selection (genetic algorithm); Mode (computer interface); Resource leveling; Sensitivity (control systems); Constraint (computer-aided design); Engineering; Resource allocation; Mathematics; Routing (electronic design automation); Artificial intelligence","score_opus":0.1811134015186594,"score_gpt":0.42382638210485113,"score_spread":0.24271298058619173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049012445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12387074,0.0010582032,0.8628638,0.0008574108,0.00011173742,0.00053118437,0.00039111706,0.00015087795,0.010165075],"genre_scores_gemma":[0.7294458,0.0011946223,0.2568721,0.00012627429,0.00009706636,0.0007731461,0.0004462566,0.000071191156,0.010973631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958224,0.0022692382,0.0001910833,0.0006042554,0.00060386397,0.0005090479],"domain_scores_gemma":[0.9976987,0.0013939606,0.00031499827,0.000104348124,0.00022914012,0.00025887045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039090766,0.0013701702,0.0019564088,0.0014670213,0.0012219463,0.0019917977,0.001740784,0.0017522884,0.0040402603],"category_scores_gemma":[0.0034233287,0.00070587324,0.0015460321,0.002655641,0.0007335638,0.0018476151,0.0010603924,0.001472041,0.0003647239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003803315,0.00029447884,0.0030400576,0.0005381495,0.00020097387,0.0008361526,0.00019241891,0.89671326,0.0041366373,0.022786869,0.002505989,0.06837479],"study_design_scores_gemma":[0.000042090556,0.00023578071,0.00093169644,0.000031751293,0.00004235111,0.00022640408,0.00016126683,0.98256266,0.0012390176,0.012700797,0.0017946002,0.0000314757],"about_ca_topic_score_codex":0.006876906,"about_ca_topic_score_gemma":0.0063929595,"teacher_disagreement_score":0.006876906,"about_ca_system_score_codex":0.0014685743,"about_ca_system_score_gemma":0.0035259943,"threshold_uncertainty_score":0.020673454},"labels":[],"label_agreement":null},{"id":"W3070075040","doi":"10.1108/ecam-10-2019-0590","title":"Optimized crew selection for scheduling of repetitive projects","year":2020,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"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":"Crew; Duration (music); Operations research; Crew scheduling; Float (project management); Computer science; Operations management; Scheduling (production processes); Engineering; Aeronautics; Systems engineering","score_opus":0.06415923892039745,"score_gpt":0.3106000499711349,"score_spread":0.24644081105073745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3070075040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22524375,0.00036876366,0.76360923,0.00010191086,0.000032595974,0.00023071558,0.00016142557,0.000320506,0.009931133],"genre_scores_gemma":[0.91984564,0.00013095103,0.07604982,0.000023864903,0.000008381749,0.00015316969,0.00015212214,0.00006556896,0.0035704395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995017,0.00013590211,0.000014109061,0.00010370656,0.00014078505,0.000103790364],"domain_scores_gemma":[0.9996363,0.00011626333,0.000102559665,0.000037819078,0.00006705417,0.00003994571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005400229,0.00065432454,0.00074080593,0.0007519281,0.0003519301,0.00079278613,0.0008750111,0.00052493723,0.0028399983],"category_scores_gemma":[0.0014375725,0.00042080984,0.0005435738,0.00052030594,0.00027205423,0.0006987046,0.00056433654,0.0005995744,0.00039295602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009634048,0.00005727866,0.0009305348,0.000059032725,0.000023387103,0.00005593457,0.00004418173,0.96598744,0.0035875004,0.0015569666,0.00030750758,0.027293867],"study_design_scores_gemma":[0.000012290475,0.00016003093,0.00093565683,0.000012029089,0.000010567534,0.000024917912,0.000041400523,0.99527293,0.0016462787,0.0011270172,0.00074816856,0.000008782961],"about_ca_topic_score_codex":0.006722407,"about_ca_topic_score_gemma":0.006615145,"teacher_disagreement_score":0.006722407,"about_ca_system_score_codex":0.0007202513,"about_ca_system_score_gemma":0.0013431847,"threshold_uncertainty_score":0.01336658},"labels":[],"label_agreement":null},{"id":"W3093058335","doi":"10.1155/2020/8897710","title":"Effective Evolutionary Algorithm for Solving the Real-Resource-Constrained Scheduling Problem","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Resource-Constrained Project Scheduling","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":"Computer science; Evolutionary algorithm; Scheduling (production processes); Cuckoo search; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03489116857546906,"score_gpt":0.3284135591069907,"score_spread":0.2935223905315216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093058335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012623293,0.0008958312,0.9806788,0.00026956154,0.00010785788,0.00007414221,0.000053198193,0.0001607648,0.005136571],"genre_scores_gemma":[0.29621303,0.0014941973,0.6953878,0.0002965198,0.00012047095,0.00049707945,0.00038806308,0.000106971725,0.0054958565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994455,0.00018584442,0.00003327174,0.000105470586,0.00015816484,0.000071760456],"domain_scores_gemma":[0.9994684,0.00031095787,0.000046033383,0.00003119641,0.00011402871,0.00002940256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010548698,0.0010727636,0.0010592362,0.0010343397,0.0005462973,0.00082685583,0.0011107356,0.0012468623,0.0020629722],"category_scores_gemma":[0.0024385867,0.0003802253,0.00081554,0.0012782186,0.0004885624,0.0009297874,0.0007114164,0.0011677804,0.0002970191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034844626,0.00005170311,0.00045841842,0.00011289648,0.00005034522,0.000079638754,0.00005151706,0.90880024,0.00096845254,0.019620148,0.0019597732,0.06781192],"study_design_scores_gemma":[0.000018231936,0.000022632377,0.00007959155,0.0000107353735,0.000009233092,0.00002914228,0.000013336303,0.9933795,0.00022695176,0.0044059902,0.001799632,0.0000050645936],"about_ca_topic_score_codex":0.004019213,"about_ca_topic_score_gemma":0.003140754,"teacher_disagreement_score":0.004019213,"about_ca_system_score_codex":0.0006905257,"about_ca_system_score_gemma":0.0015912812,"threshold_uncertainty_score":0.007991612},"labels":[],"label_agreement":null},{"id":"W3129503847","doi":"10.1016/j.autcon.2021.103616","title":"Hybrid multi-mode simulation and optimization for subarea scheduling in heavy industrial construction","year":2021,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PCL Construction (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bidding; Scheduling (production processes); Interdependence; Schedule; Computer science; Industrial engineering; Operations research; Engineering; Operations management","score_opus":0.12738740819452501,"score_gpt":0.39216551898767005,"score_spread":0.26477811079314506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129503847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47802782,0.00035410133,0.50859493,0.0003358356,0.00009826326,0.00012605875,0.00025809003,0.00059953437,0.011605352],"genre_scores_gemma":[0.9788739,0.00006137939,0.019525468,0.00003258038,0.000008882906,0.00007702401,0.000064000305,0.000037124384,0.0013196685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966455,0.00017081645,0.000010531813,0.000041370557,0.000047184607,0.00006560368],"domain_scores_gemma":[0.9986413,0.0010242797,0.00007789227,0.000045012108,0.0001186522,0.000092887254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090013875,0.00062558154,0.0012015611,0.0005272351,0.0006286998,0.00084251905,0.0009964658,0.00097492716,0.0023868596],"category_scores_gemma":[0.0016902632,0.0006509843,0.00085658237,0.00055973866,0.00060287875,0.000606091,0.0007469797,0.0008232959,0.00016040106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023122846,0.000014723056,0.00014122849,0.000004658094,0.000005144964,0.0000052261,0.00000610725,0.9985429,0.00013345384,0.00026009607,0.000029229042,0.00083401176],"study_design_scores_gemma":[0.0000021828712,0.000004173732,0.000023730678,3.4687608e-7,7.6461015e-7,3.5782222e-7,0.0000016644843,0.99983776,0.00003483822,0.00007997655,0.000013482844,6.727805e-7],"about_ca_topic_score_codex":0.039503366,"about_ca_topic_score_gemma":0.021795943,"teacher_disagreement_score":0.039503366,"about_ca_system_score_codex":0.0011988728,"about_ca_system_score_gemma":0.0017550429,"threshold_uncertainty_score":0.07854688},"labels":[],"label_agreement":null},{"id":"W3156898704","doi":"10.1016/j.ifacol.2020.12.2858","title":"Collaborative supply chain planning and scheduling of construction projects","year":2020,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Resource-Constrained Project Scheduling","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":"École de Technologie Supérieure","funders":"","keywords":"Supply chain; Scheduling (production processes); Integer programming; IBM; Production planning; Computer science; Linear programming; Supply chain management; Operations research; Project management; Process management; Manufacturing engineering; Operations management; Production (economics); Systems engineering; Business; Engineering","score_opus":0.07845513194151653,"score_gpt":0.35297249229498834,"score_spread":0.2745173603534718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156898704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034465834,0.000336636,0.9561281,0.0002090023,0.00004348011,0.00018494218,0.00018303892,0.00013611809,0.008312816],"genre_scores_gemma":[0.79591787,0.00084345683,0.19399323,0.00004477494,0.00004682463,0.0006157756,0.00043840188,0.00006303605,0.00803656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983229,0.00063449476,0.000076902805,0.0003259577,0.0003591863,0.0002806099],"domain_scores_gemma":[0.9991067,0.00043229104,0.00014526243,0.00007336256,0.00013071281,0.00011167757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016819158,0.001190753,0.0013315951,0.0009400375,0.0008650515,0.001969313,0.0017328202,0.0014173122,0.0035277908],"category_scores_gemma":[0.0023165431,0.0008705093,0.0012319771,0.0021525433,0.0008350318,0.0013580336,0.0012903252,0.0010888049,0.00043719375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021768272,0.00001750832,0.00016766069,0.00002419967,0.000011986986,0.000046784106,0.000026747435,0.9890388,0.00018640756,0.00547436,0.00015025224,0.004833433],"study_design_scores_gemma":[0.000008671221,0.00002565229,0.00008687714,0.00000797791,0.00000831271,0.000011371428,0.000022939394,0.99366343,0.00022044498,0.00501074,0.00092809077,0.000005444277],"about_ca_topic_score_codex":0.014767163,"about_ca_topic_score_gemma":0.01093462,"teacher_disagreement_score":0.014767163,"about_ca_system_score_codex":0.0019581479,"about_ca_system_score_gemma":0.0035787737,"threshold_uncertainty_score":0.02936244},"labels":[],"label_agreement":null},{"id":"W3162832615","doi":"10.2139/ssrn.3838101","title":"Type-2 Integrated Process-Planning and Scheduling Problem: Reformulation and Solution Algorithms","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Resource-Constrained Project Scheduling","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":"Western University; University of Windsor","funders":"","keywords":"Computer science; Process (computing); Algorithm; Scheduling (production processes); Mathematical optimization; Mathematics; Programming language","score_opus":0.05335161436015434,"score_gpt":0.36561680832492677,"score_spread":0.3122651939647724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162832615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010528236,0.00052100257,0.9760335,0.00058544887,0.00015136387,0.00017791364,0.0004525353,0.00013208628,0.011417871],"genre_scores_gemma":[0.3981218,0.00161618,0.5803544,0.00035425293,0.00070387975,0.0013721404,0.001381453,0.00022270349,0.0158732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872714,0.00052414363,0.00004868971,0.0002632156,0.00024008029,0.00019659809],"domain_scores_gemma":[0.99657494,0.0025962112,0.00022646002,0.00015611107,0.00033491387,0.00011134317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028623696,0.0016582625,0.002198191,0.0014164088,0.0006283571,0.003044429,0.002568336,0.0038379615,0.00861633],"category_scores_gemma":[0.0075620525,0.0010565554,0.0023058283,0.003009977,0.0010993283,0.0029489556,0.0021910542,0.003236074,0.0009022768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010831819,0.00016618002,0.0004685743,0.00021768858,0.00006556036,0.00017697213,0.000051865874,0.90298414,0.00037808061,0.06646412,0.003955491,0.024963032],"study_design_scores_gemma":[0.000026543026,0.00002163387,0.00009366654,0.000012185776,0.00001623753,0.000027341359,0.000017041391,0.97831523,0.00013737923,0.020582164,0.00074265053,0.000007907023],"about_ca_topic_score_codex":0.011606035,"about_ca_topic_score_gemma":0.008192972,"teacher_disagreement_score":0.011606035,"about_ca_system_score_codex":0.0017554848,"about_ca_system_score_gemma":0.0033750723,"threshold_uncertainty_score":0.028824508},"labels":[],"label_agreement":null},{"id":"W3167143037","doi":"10.1108/ecam-12-2020-1019","title":"Optimized resource-constrained method for project schedule compression","year":2021,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Mathematical optimization; Schedule; Genetic algorithm; Scheduling (production processes); Python (programming language); Metaheuristic; Fuzzy logic; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04989989109981235,"score_gpt":0.35927779783123515,"score_spread":0.3093779067314228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167143037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006686553,0.00018052642,0.9886573,0.000050711526,0.000028730377,0.000082339,0.000111179965,0.0002649809,0.003937723],"genre_scores_gemma":[0.27323306,0.00040336128,0.7204851,0.00006966882,0.0000460989,0.00048235754,0.00050845806,0.00025083803,0.004521095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942446,0.00014074826,0.000033069027,0.00010352562,0.00024807686,0.000050117327],"domain_scores_gemma":[0.99944085,0.00027445605,0.00007764064,0.00004179955,0.0001467117,0.000018519839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085326197,0.00081340346,0.00065777777,0.0015255263,0.00036620675,0.0007971378,0.000969315,0.0005061788,0.0060325814],"category_scores_gemma":[0.002473962,0.00035907413,0.0006952487,0.0014390867,0.00028943532,0.00064878276,0.00059937703,0.0006208,0.0006205903],"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.000066447144,0.000040119117,0.00040887794,0.00016951181,0.000031731783,0.0000692235,0.00005151834,0.8512949,0.002245232,0.009061588,0.0014613214,0.13509957],"study_design_scores_gemma":[0.0000066722714,0.000018236688,0.00014391512,0.000017712035,0.000007663773,0.000023692033,0.000011709621,0.99539196,0.0009883405,0.0018983332,0.001486165,0.0000056473887],"about_ca_topic_score_codex":0.0060180086,"about_ca_topic_score_gemma":0.004607302,"teacher_disagreement_score":0.0060325814,"about_ca_system_score_codex":0.0007676145,"about_ca_system_score_gemma":0.0016778207,"threshold_uncertainty_score":0.020181},"labels":[],"label_agreement":null},{"id":"W3172955132","doi":"10.1088/1742-6596/1900/1/012016","title":"Decision Support NSGA-II Optimization Method for Resource-Constrained Schedule Compression with Allowed Activity Splitting","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Schedule; Scheduling (production processes); Mathematical optimization; Duration (music); Operations research; Genetic algorithm; Python (programming language); Engineering; Mathematics","score_opus":0.08430044258892108,"score_gpt":0.3786118853959317,"score_spread":0.2943114428070106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172955132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051735982,0.00067470403,0.9345866,0.0003489323,0.000118614465,0.00047435923,0.00025292236,0.0005430035,0.011265016],"genre_scores_gemma":[0.69840467,0.00039235645,0.29343694,0.00018785967,0.000042780644,0.0012941086,0.00045763433,0.0001256567,0.005658005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994961,0.00021823982,0.000025627252,0.000052799183,0.00012438405,0.000082878185],"domain_scores_gemma":[0.999041,0.0006497297,0.00006212717,0.000021112242,0.0001803904,0.00004551485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014646978,0.0011239417,0.0011503773,0.0009953656,0.0004905328,0.0009746207,0.0011255457,0.001101812,0.005207972],"category_scores_gemma":[0.0021791654,0.0005642801,0.00085583987,0.0008231649,0.00042669103,0.00038080424,0.00081713934,0.0012546661,0.00036685387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027114402,0.000022044904,0.00016575627,0.000042282987,0.000012203972,0.00002631818,0.000014435881,0.99028975,0.00018174303,0.0011721574,0.0002935018,0.0077526355],"study_design_scores_gemma":[0.000006504534,0.000012139375,0.000033214797,0.000005966466,0.0000032981582,0.000002088156,0.0000059806166,0.99942446,0.0000696225,0.00025904854,0.00017616081,0.0000015755706],"about_ca_topic_score_codex":0.018888162,"about_ca_topic_score_gemma":0.014281631,"teacher_disagreement_score":0.018888162,"about_ca_system_score_codex":0.0010456622,"about_ca_system_score_gemma":0.002491009,"threshold_uncertainty_score":0.03755647},"labels":[],"label_agreement":null},{"id":"W3187738316","doi":"10.1108/ci-05-2018-0046","title":"Integrating critical chain project management with last planner system for linear scheduling of modular construction","year":2021,"lang":"en","type":"article","venue":"Construction Innovation","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":37,"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":"Modular design; Earned value management; Schedule; Computer science; Scheduling (production processes); Planner; Operations research; Project management; Project planning; Duration (music); Reliability engineering; Systems engineering; Operations management; Engineering","score_opus":0.07567651076534823,"score_gpt":0.36863803731443934,"score_spread":0.29296152654909113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187738316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008121693,0.000043510467,0.98982507,0.000030342428,0.0000146961665,0.000111757494,0.000045798617,0.00065405964,0.001153082],"genre_scores_gemma":[0.39912668,0.00010264467,0.5978619,0.000025941477,0.000027601945,0.00043327222,0.00019698314,0.00010743884,0.0021175593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987985,0.00031413496,0.00007595544,0.00026166654,0.0004718059,0.0000778466],"domain_scores_gemma":[0.99859124,0.00046491905,0.00029821182,0.00016557025,0.00039925627,0.00008075014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016710232,0.0006737974,0.00039843237,0.0011841237,0.00056624983,0.00079264335,0.00080859935,0.00033294916,0.0035771942],"category_scores_gemma":[0.0030735824,0.0004106193,0.00047386496,0.0007959066,0.00038733784,0.0006471302,0.0006990896,0.00058396405,0.00042769872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019452893,0.00010308795,0.0045646434,0.0002039799,0.00006098935,0.00015856273,0.00038834612,0.60051715,0.009492861,0.0122985095,0.0020451564,0.3699721],"study_design_scores_gemma":[0.000027424783,0.00011475635,0.00078865694,0.000024065319,0.000022800084,0.00005300845,0.00004294561,0.9879117,0.004505991,0.0028698158,0.0036174436,0.000021371625],"about_ca_topic_score_codex":0.0070080915,"about_ca_topic_score_gemma":0.0060476507,"teacher_disagreement_score":0.0070080915,"about_ca_system_score_codex":0.0010864064,"about_ca_system_score_gemma":0.0027806724,"threshold_uncertainty_score":0.013934612},"labels":[],"label_agreement":null},{"id":"W3205823175","doi":"10.1016/j.autcon.2021.104002","title":"Streamlined project time-cost tradeoff optimization methodology: Algorithm, automation, and application","year":2021,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Automation; Computer science; Industrial engineering; Engineering; Optimization algorithm; Algorithm; Mathematical optimization; Systems engineering; Mathematics; Mechanical engineering","score_opus":0.08429030014314813,"score_gpt":0.38763001149765036,"score_spread":0.3033397113545022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205823175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008900023,0.00009347762,0.98969346,0.00006141781,0.000013632605,0.000058344864,0.000050400515,0.00030910742,0.00082017627],"genre_scores_gemma":[0.20636626,0.00020418361,0.7911109,0.000066106455,0.000031174644,0.00034214987,0.00017372887,0.00010912082,0.0015964302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926263,0.000292133,0.0000383417,0.0001014447,0.0002506823,0.000054789747],"domain_scores_gemma":[0.9982204,0.0009721665,0.0001951779,0.00013099927,0.0004311026,0.000050168106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018706162,0.0008407852,0.0012536956,0.0010632565,0.00042878193,0.00097155484,0.0010451066,0.00079161866,0.0035727066],"category_scores_gemma":[0.0034063903,0.00056438014,0.00068147073,0.0015616079,0.0004158946,0.001005479,0.0008699926,0.0009958219,0.000558108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066204295,0.00007789279,0.0006693494,0.00009505311,0.000027241225,0.000027559418,0.00004117262,0.8629516,0.0017630181,0.0060946587,0.00095538277,0.12723094],"study_design_scores_gemma":[0.000012623629,0.000030690153,0.00007230061,0.000004870069,0.00000519186,0.0000073894594,0.0000029262903,0.99709034,0.00044442766,0.0020012294,0.0003257596,0.0000022646996],"about_ca_topic_score_codex":0.00485943,"about_ca_topic_score_gemma":0.00444982,"teacher_disagreement_score":0.00485943,"about_ca_system_score_codex":0.0011496651,"about_ca_system_score_gemma":0.002336595,"threshold_uncertainty_score":0.011951864},"labels":[],"label_agreement":null},{"id":"W4200244473","doi":"10.5267/j.jpm.2021.10.002","title":"Review of conventional metaheuristic techniques for resource-constrained project scheduling problem","year":2021,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":9,"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; Metaheuristic; Heuristics; Mathematical optimization; Simulated annealing; Particle swarm optimization; Ant colony optimization algorithms; Scheduling (production processes); Heuristic; Meta heuristic; Genetic algorithm; Resource constraints; Operations research; Artificial intelligence; Machine learning; Algorithm; Mathematics; Distributed computing","score_opus":0.11023091709015714,"score_gpt":0.4141277935501616,"score_spread":0.30389687646000446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200244473","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004891805,0.85223,0.11885454,0.0013774968,0.0010435123,0.00014150958,0.00029903016,0.00019535121,0.020966765],"genre_scores_gemma":[0.04060782,0.84252644,0.10979464,0.00056478917,0.0010228078,0.00020327,0.00073303794,0.00010818416,0.0044390038],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918085,0.00023608295,0.00012341894,0.00011206002,0.00028191964,0.00006565892],"domain_scores_gemma":[0.9991159,0.0005194,0.00008987931,0.000043188356,0.00020533746,0.00002631911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010126203,0.0014977149,0.0010974418,0.002445181,0.0005063844,0.0013823687,0.001457705,0.0010449233,0.0028120738],"category_scores_gemma":[0.0021022002,0.0005997082,0.0016985888,0.0062543745,0.0002994915,0.0015050288,0.00049631856,0.00085798197,0.0010102941],"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.00013063852,0.00017150964,0.00078848895,0.019868061,0.0004729783,0.0003137643,0.00015592157,0.08219002,0.0033077074,0.038087532,0.02520685,0.82930654],"study_design_scores_gemma":[0.00007965555,0.00046850738,0.0026666769,0.007830977,0.00094112224,0.0012242493,0.00046854847,0.139569,0.004768455,0.04771216,0.794127,0.00014371211],"about_ca_topic_score_codex":0.0035602872,"about_ca_topic_score_gemma":0.0034126167,"teacher_disagreement_score":0.0035602872,"about_ca_system_score_codex":0.000908655,"about_ca_system_score_gemma":0.0020119932,"threshold_uncertainty_score":0.0094073415},"labels":[],"label_agreement":null},{"id":"W4200419669","doi":"10.5267/j.jpm.2021.9.002","title":"Project scheduling and buffer management: A comprehensive review and future directions","year":2021,"lang":"en","type":"review","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":12,"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":"Buffer (optical fiber); Project management; Project planning; Computer science; Scheduling (production processes); Sizing; Project management triangle; Project portfolio management; Operations research; Process management; Systems engineering; Operations management; Engineering","score_opus":0.16050096408809952,"score_gpt":0.44655382815814765,"score_spread":0.28605286407004815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200419669","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013938131,0.9984456,0.00035201196,0.00036514524,0.0001244821,0.0000047767085,0.000015233063,0.000005678062,0.0005476782],"genre_scores_gemma":[0.0011849438,0.998018,0.00039770082,0.00010156174,0.00012887626,0.0000069784287,0.000020630763,0.0000022935906,0.00013897078],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991161,0.00023379293,0.00015484191,0.00016320146,0.0002616195,0.00007040232],"domain_scores_gemma":[0.9937688,0.004677163,0.00052297383,0.0000895763,0.00080702454,0.00013446574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024707525,0.0011364066,0.0017024194,0.0033515445,0.00048407578,0.0021725306,0.0014459278,0.0016241953,0.0051078764],"category_scores_gemma":[0.0051497393,0.00062781543,0.0010633259,0.006734156,0.00064272777,0.0027089228,0.00087711937,0.0013431604,0.0011566746],"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.00007620567,0.00009850392,0.0004786629,0.055199854,0.00014350495,0.00011123053,0.00020077157,0.0023963267,0.0004222127,0.012237321,0.018465172,0.9101702],"study_design_scores_gemma":[0.000025081725,0.00022946537,0.0022816502,0.048233535,0.0006410294,0.0006811976,0.00059779116,0.0012583741,0.0005272534,0.011681424,0.93375415,0.00008905287],"about_ca_topic_score_codex":0.004866244,"about_ca_topic_score_gemma":0.0067353398,"teacher_disagreement_score":0.0051078764,"about_ca_system_score_codex":0.001393203,"about_ca_system_score_gemma":0.0057617323,"threshold_uncertainty_score":0.017087579},"labels":[],"label_agreement":null},{"id":"W4210299395","doi":"10.1088/1757-899x/1218/1/012010","title":"Tightly-Packed Repetitive Schedules: A Tetris Challenge","year":2022,"lang":"en","type":"article","venue":"IOP Conference Series Materials Science and Engineering","topic":"Resource-Constrained Project Scheduling","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 Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Visualization; Job shop scheduling; Distributed computing; Operations research; Industrial engineering; Artificial intelligence; Operations management; Engineering","score_opus":0.06091720703342447,"score_gpt":0.2984117952257453,"score_spread":0.23749458819232083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210299395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119337775,0.000888725,0.8533079,0.0029657946,0.00037025387,0.00023965385,0.00029359435,0.0005133852,0.02208305],"genre_scores_gemma":[0.7275042,0.00092596526,0.25828856,0.00033848506,0.00014522597,0.0002302974,0.0003345571,0.00025871015,0.0119738905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991117,0.00037121566,0.000030722764,0.00013062898,0.00019910581,0.00015659907],"domain_scores_gemma":[0.9976174,0.001494896,0.00016562297,0.00016619511,0.0002579796,0.00029782357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015013003,0.00057745376,0.0008604606,0.00030192785,0.00074307487,0.0010983496,0.0011905347,0.0008869084,0.0069395513],"category_scores_gemma":[0.004385475,0.00038059228,0.00049189886,0.00048245175,0.0006732412,0.0010134595,0.0010135754,0.0016578157,0.0007144865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024181405,0.0002797565,0.0007559357,0.00023573647,0.000047670444,0.00026336755,0.0002149291,0.78124046,0.0040032305,0.114125416,0.010497009,0.08809465],"study_design_scores_gemma":[0.0000513727,0.00022398692,0.0003512509,0.000035325116,0.000014610004,0.000105223124,0.00022135461,0.9146114,0.0013781352,0.07178202,0.011202088,0.000023194565],"about_ca_topic_score_codex":0.004811983,"about_ca_topic_score_gemma":0.005716977,"teacher_disagreement_score":0.0069395513,"about_ca_system_score_codex":0.001142356,"about_ca_system_score_gemma":0.0018067395,"threshold_uncertainty_score":0.023215115},"labels":[],"label_agreement":null},{"id":"W4213459164","doi":"10.1109/wsc52266.2021.9715359","title":"Enhanced Resource Scheduling Framework For Industrial Construction Projects","year":2021,"lang":"en","type":"article","venue":"2021 Winter Simulation Conference (WSC)","topic":"Resource-Constrained Project Scheduling","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":"Canadian Natural Resources; PCL Construction (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Schedule; Scheduling (production processes); Variable (mathematics); Resource allocation; Distributed computing; Operations research; Systems engineering; Engineering; Operations management; Operating system","score_opus":0.24475009457568106,"score_gpt":0.4132750225596386,"score_spread":0.16852492798395755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213459164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005734839,0.00010763899,0.9886973,0.00007246263,0.000027788854,0.00008329134,0.00015694437,0.0004721639,0.0046475595],"genre_scores_gemma":[0.23114575,0.00039441386,0.7625236,0.000037377355,0.000039880713,0.00044079125,0.0005949386,0.0001419558,0.004681317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999445,0.00019910387,0.000029291377,0.000076412034,0.00019379306,0.000056338515],"domain_scores_gemma":[0.9997656,0.000086821616,0.000027864817,0.00003026847,0.00006871182,0.00002071225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248418,0.000709236,0.000534254,0.00089397276,0.00046300128,0.0009976526,0.0014880827,0.0005421674,0.0039327224],"category_scores_gemma":[0.0010737757,0.00032978717,0.0009314203,0.000956258,0.00042596253,0.0007754804,0.00074657024,0.0007099112,0.000568227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000182855,0.000026407419,0.00016039542,0.000031539603,0.000013543298,0.000060326936,0.00005194787,0.92597574,0.0011024872,0.05877145,0.00067753025,0.013110258],"study_design_scores_gemma":[0.000010828751,0.000013081278,0.000049157286,0.0000067859537,0.0000050068847,0.000012919743,0.000008990271,0.98619175,0.0002671737,0.008846853,0.004582883,0.0000045964953],"about_ca_topic_score_codex":0.016105171,"about_ca_topic_score_gemma":0.015608582,"teacher_disagreement_score":0.016105171,"about_ca_system_score_codex":0.0012532205,"about_ca_system_score_gemma":0.0024247146,"threshold_uncertainty_score":0.032022893},"labels":[],"label_agreement":null},{"id":"W4220755885","doi":"10.1061/9780784483961.132","title":"Optimization of Labor Flow Efficiency in Steel Fabrication Project Planning","year":2022,"lang":"en","type":"article","venue":"Construction Research Congress 2022","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Solver; Productivity; Computer science; Workstation; Flow shop scheduling; Labor cost; Operations management; Operations research; Job shop scheduling; Engineering; Schedule; Economics; Operating system; Mechanical engineering","score_opus":0.1603653683075206,"score_gpt":0.4484722918426909,"score_spread":0.2881069235351703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220755885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39619187,0.0011517222,0.58496255,0.00039796112,0.000054119995,0.00059370045,0.00048850017,0.00030431512,0.015855331],"genre_scores_gemma":[0.91308045,0.0004689154,0.082187444,0.000040319796,0.000010523766,0.00029210045,0.0002662853,0.000055653043,0.0035982337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990363,0.0004233537,0.000039596292,0.00012280013,0.00016423449,0.00021374729],"domain_scores_gemma":[0.9990872,0.0005336799,0.00013515531,0.000034189372,0.00011374709,0.00009595123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719978,0.0009340579,0.0010343253,0.001351886,0.00047869817,0.0014948451,0.0008730407,0.0007692622,0.0021284502],"category_scores_gemma":[0.00269775,0.0006966973,0.0005588391,0.0016566828,0.00049644226,0.00086598593,0.0006215732,0.00063547614,0.00024569253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010641636,0.00006759611,0.00067112665,0.00007418319,0.000020840469,0.000053475578,0.000039945735,0.9790288,0.0008276645,0.002032959,0.00026900973,0.016807955],"study_design_scores_gemma":[0.000013154664,0.00013918716,0.0009859072,0.000021307518,0.000015930464,0.000019997615,0.000075546464,0.99481803,0.0010267331,0.0022468963,0.0006278395,0.000009393463],"about_ca_topic_score_codex":0.007187014,"about_ca_topic_score_gemma":0.005765268,"teacher_disagreement_score":0.007187014,"about_ca_system_score_codex":0.0015736949,"about_ca_system_score_gemma":0.0025126596,"threshold_uncertainty_score":0.014290333},"labels":[],"label_agreement":null},{"id":"W4232697157","doi":"10.32920/ryerson.14661711","title":"Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Heuristics; Computer science; Idle; Scheduling (production processes); Resource (disambiguation); Extension (predicate logic); Mathematical optimization; Operations research; Mathematics","score_opus":0.1883566093142018,"score_gpt":0.3890159238629804,"score_spread":0.20065931454877858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232697157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5674755,0.0016945718,0.41691568,0.0002141697,0.000106271014,0.00041072004,0.00063869974,0.0012000572,0.011344347],"genre_scores_gemma":[0.70653844,0.0004992105,0.29081163,0.000069170266,0.000039886418,0.0001786031,0.0006131505,0.000113136666,0.0011366784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766386,0.0010523193,0.00018395924,0.00028274916,0.0005964567,0.00022070689],"domain_scores_gemma":[0.9818523,0.013963618,0.0010588098,0.0012693751,0.001430529,0.00042543662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038962343,0.00054667157,0.00070767204,0.0020153355,0.00042889907,0.0010211286,0.0011561255,0.00050038047,0.0015893528],"category_scores_gemma":[0.010608544,0.00032416655,0.0005872863,0.0028337112,0.00045688718,0.0009253037,0.0005263195,0.00077520846,0.00018176163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086314656,0.00091922795,0.010211783,0.000559208,0.00015675952,0.000088843735,0.00024338956,0.72233796,0.005105573,0.007948498,0.0015775044,0.24998815],"study_design_scores_gemma":[0.00011271915,0.0006388786,0.0057618497,0.000034812296,0.00009009349,0.00010068066,0.00011867496,0.98085785,0.0043719993,0.005424205,0.0024493604,0.000038974988],"about_ca_topic_score_codex":0.008242593,"about_ca_topic_score_gemma":0.0075170137,"teacher_disagreement_score":0.008242593,"about_ca_system_score_codex":0.0016898506,"about_ca_system_score_gemma":0.0025019753,"threshold_uncertainty_score":0.020605505},"labels":[],"label_agreement":null},{"id":"W4238610103","doi":"10.1177/0361198105190700102","title":"Computerized System for Efficient Scheduling of Highway Construction","year":2005,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Resource-Constrained Project Scheduling","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":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Schedule; Flexibility (engineering); Computer science; Crew; Operations research; Construction management; Industrial engineering; Engineering; Operations management","score_opus":0.18184919851554662,"score_gpt":0.4401150229805617,"score_spread":0.2582658244650151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238610103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01417372,0.00012930683,0.9652825,0.00027001696,0.00008960975,0.0003679003,0.00096053374,0.0028759704,0.01585039],"genre_scores_gemma":[0.43204114,0.0005417625,0.54061884,0.000105065665,0.000076268036,0.0019626631,0.002474281,0.00031004605,0.02186997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994228,0.00017353064,0.000033938846,0.00013213254,0.00017067355,0.00006687918],"domain_scores_gemma":[0.99947244,0.00020267001,0.000053070133,0.00010751248,0.00011858934,0.00004579187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536084,0.0007868204,0.0007880819,0.000568738,0.0008412605,0.0016347964,0.0013751948,0.0009760802,0.018009018],"category_scores_gemma":[0.001684499,0.00046450985,0.0006043579,0.00096562336,0.000707581,0.0011901866,0.00095579337,0.0009826865,0.0023637153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012195524,0.00008479725,0.00056602847,0.0000912229,0.000024204488,0.0001023502,0.00007201091,0.89012414,0.0020776945,0.0684914,0.0061896457,0.032054476],"study_design_scores_gemma":[0.00004979893,0.000042994016,0.0001235903,0.0000086686005,0.000009171597,0.00002255134,0.000014865209,0.9789451,0.0006934557,0.008265198,0.011815426,0.000009149373],"about_ca_topic_score_codex":0.012613518,"about_ca_topic_score_gemma":0.011210698,"teacher_disagreement_score":0.018009018,"about_ca_system_score_codex":0.002144297,"about_ca_system_score_gemma":0.003510626,"threshold_uncertainty_score":0.06024611},"labels":[],"label_agreement":null},{"id":"W4238865701","doi":"10.22215/etd/2005-07818","title":"A political perspective on product development schedules : evidence from software","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Perspective (graphical); Politics; Product (mathematics); Political science; Computer science; Mathematics; Artificial intelligence","score_opus":0.13857989740874543,"score_gpt":0.4339005631712031,"score_spread":0.2953206657624577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238865701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7238623,0.004476758,0.008582641,0.019044915,0.0001243813,0.0000945351,0.00077600364,0.00002550016,0.24301304],"genre_scores_gemma":[0.99543035,0.0014393927,0.00046421489,0.00054447085,0.00006254697,0.000029936786,0.00020452618,0.00001990959,0.0018046765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9910624,0.0055333683,0.00040629614,0.0005127749,0.0017079388,0.0007772626],"domain_scores_gemma":[0.7366119,0.21260396,0.035557948,0.0033502746,0.008349159,0.0035267838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013842966,0.00026612903,0.00028852443,0.0019336058,0.0016152905,0.003203345,0.0005765213,0.0013757122,0.01868171],"category_scores_gemma":[0.09011844,0.00031235605,0.00027709655,0.0031945899,0.003129171,0.0027062525,0.0013174954,0.0020624588,0.0009957985],"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.004557507,0.0010321515,0.28149003,0.000995132,0.00039209166,0.0008102338,0.018820921,0.017028276,0.0012263217,0.4288509,0.021281876,0.2235146],"study_design_scores_gemma":[0.0008319691,0.0010681127,0.5550655,0.0010312913,0.00026652758,0.0003512872,0.035735693,0.015220096,0.0014979179,0.24871486,0.14008959,0.00012713307],"about_ca_topic_score_codex":0.013014082,"about_ca_topic_score_gemma":0.01351751,"teacher_disagreement_score":0.01868171,"about_ca_system_score_codex":0.0038227383,"about_ca_system_score_gemma":0.0034154363,"threshold_uncertainty_score":0.073209524},"labels":[],"label_agreement":null},{"id":"W4240967599","doi":"10.32920/ryerson.14661711.v1","title":"Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Heuristics; Computer science; Scheduling (production processes); Idle; Resource (disambiguation); Extension (predicate logic); Mathematical optimization; Mathematics; Computer network","score_opus":0.1883566093142018,"score_gpt":0.3890159238629804,"score_spread":0.20065931454877858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240967599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5674755,0.0016945718,0.41691568,0.0002141697,0.000106271014,0.00041072004,0.00063869974,0.0012000572,0.011344347],"genre_scores_gemma":[0.70653844,0.0004992105,0.29081163,0.000069170266,0.000039886418,0.0001786031,0.0006131505,0.000113136666,0.0011366784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766386,0.0010523193,0.00018395924,0.00028274916,0.0005964567,0.00022070689],"domain_scores_gemma":[0.9818523,0.013963618,0.0010588098,0.0012693751,0.001430529,0.00042543662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038962343,0.00054667157,0.00070767204,0.0020153355,0.00042889907,0.0010211286,0.0011561255,0.00050038047,0.0015893528],"category_scores_gemma":[0.010608544,0.00032416655,0.0005872863,0.0028337112,0.00045688718,0.0009253037,0.0005263195,0.00077520846,0.00018176163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086314656,0.00091922795,0.010211783,0.000559208,0.00015675952,0.000088843735,0.00024338956,0.72233796,0.005105573,0.007948498,0.0015775044,0.24998815],"study_design_scores_gemma":[0.00011271915,0.0006388786,0.0057618497,0.000034812296,0.00009009349,0.00010068066,0.00011867496,0.98085785,0.0043719993,0.005424205,0.0024493604,0.000038974988],"about_ca_topic_score_codex":0.008242593,"about_ca_topic_score_gemma":0.0075170137,"teacher_disagreement_score":0.008242593,"about_ca_system_score_codex":0.0016898506,"about_ca_system_score_gemma":0.0025019753,"threshold_uncertainty_score":0.020605505},"labels":[],"label_agreement":null},{"id":"W4242958581","doi":"10.1504/ijpom.2018.090372","title":"A path relinking-based scatter search for the resource-constrained project scheduling problem","year":2018,"lang":"en","type":"article","venue":"International Journal of Project Organisation and Management","topic":"Resource-Constrained Project Scheduling","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":"Université Laval; Polytechnique Montréal; SNC-Lavalin (Canada)","funders":"","keywords":"Metaheuristic; Computer science; Critical path method; Benchmark (surveying); Mathematical optimization; Scheduling (production processes); Tabu search; Project management; Path (computing); Job shop scheduling; Schedule; Algorithm; Mathematics; Systems engineering; Engineering","score_opus":0.09024689563341826,"score_gpt":0.39323757672769105,"score_spread":0.3029906810942728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242958581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05746839,0.0004173781,0.9383332,0.00018795615,0.00004255949,0.00012346981,0.00008798647,0.00025979857,0.0030792016],"genre_scores_gemma":[0.44373003,0.0005026713,0.55077523,0.000118529046,0.00004157128,0.0005333024,0.0004163192,0.00012644056,0.0037559026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967587,0.00014453118,0.000012586935,0.00004763411,0.00008199794,0.000037367765],"domain_scores_gemma":[0.9993655,0.00038603132,0.0000619708,0.00003505086,0.00010704593,0.000044329397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093553157,0.00080116576,0.0010502322,0.0012268148,0.0004960156,0.00060661545,0.00094691466,0.0012444515,0.002427003],"category_scores_gemma":[0.0021144312,0.00044150287,0.0009402847,0.0015269645,0.0005779419,0.00081842,0.00094255805,0.0008880833,0.00028689156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053761116,0.00004995108,0.0005160356,0.000063111875,0.000033574514,0.000038062797,0.000038355403,0.9640775,0.0012515752,0.0045059524,0.00062394596,0.028748207],"study_design_scores_gemma":[0.000021563448,0.00005659506,0.000102838254,0.0000098179735,0.000009162403,0.000017729002,0.000012875621,0.9973494,0.00022441255,0.001723103,0.00046824882,0.0000041702992],"about_ca_topic_score_codex":0.0053176554,"about_ca_topic_score_gemma":0.004741897,"teacher_disagreement_score":0.0053176554,"about_ca_system_score_codex":0.0005531049,"about_ca_system_score_gemma":0.0016405197,"threshold_uncertainty_score":0.010573387},"labels":[],"label_agreement":null},{"id":"W4247851133","doi":"10.1061/(asce)0733-9364(2006)132:5(542)","title":"Discussion of “Critical Path Method with Multiple Calendars” by Kyunghwan Kim and Jesús M. de la Garza","year":2006,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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":"École de Technologie Supérieure","funders":"","keywords":"Path (computing); Mathematics; Physics; Computer science; Programming language","score_opus":0.007997066431104666,"score_gpt":0.29590843307746256,"score_spread":0.2879113666463579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247851133","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025669937,0.0029669774,0.9245027,0.049771518,0.0032671024,0.00016994671,0.000064559885,0.00026330596,0.016426949],"genre_scores_gemma":[0.16880612,0.0047341823,0.7786579,0.021710549,0.0058219912,0.0010395513,0.000105636296,0.0005499583,0.018574074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98929745,0.007564596,0.0003194639,0.00073067425,0.0018463365,0.00024151155],"domain_scores_gemma":[0.96079314,0.032837965,0.0009342591,0.0015698656,0.0033897588,0.00047494753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020212738,0.0008506322,0.0007514893,0.0018467007,0.002048627,0.0030994564,0.0040392857,0.0043765213,0.011663659],"category_scores_gemma":[0.068363756,0.00066654634,0.001479618,0.0033665693,0.004353279,0.007739799,0.0023282242,0.006824504,0.0013104834],"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.000065517124,0.000029894372,0.00030153288,0.00015075,0.00003230214,0.00013752423,0.00026918494,0.011360232,0.00019795274,0.91978145,0.025371708,0.04230197],"study_design_scores_gemma":[0.00007836088,0.000056474437,0.00023011476,0.00023141254,0.000028563278,0.0001710247,0.00022110765,0.06841793,0.0007132713,0.8336082,0.096185245,0.00005836006],"about_ca_topic_score_codex":0.004759713,"about_ca_topic_score_gemma":0.0045745526,"teacher_disagreement_score":0.020212738,"about_ca_system_score_codex":0.00273313,"about_ca_system_score_gemma":0.004385411,"threshold_uncertainty_score":0.10689646},"labels":[],"label_agreement":null},{"id":"W4251181365","doi":"10.1109/wsc.2014.7020169","title":"Bi-level project simulation methodology to integrate superintendent and project manager in decision making: Shutdown/turnaround applications","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Winter Simulation Conference 2014","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Critical path method; Shutdown; Turnaround time; Computer science; Duration (music); Monte Carlo method; Scheduling (production processes); Crew; Operations research; Project management; Resource (disambiguation); Project manager; Schedule; Resource allocation; Project planning; Industrial engineering; Reliability engineering; Systems engineering; Engineering; Operations management","score_opus":0.2601029182243634,"score_gpt":0.44950893318563007,"score_spread":0.1894060149612667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251181365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009115184,0.00005126455,0.98766977,0.00008175771,0.0000131789775,0.000073606956,0.00005558901,0.00023939759,0.0027003265],"genre_scores_gemma":[0.31191593,0.00025942887,0.6839211,0.00009155749,0.000016979679,0.00076018117,0.00022552728,0.00010918045,0.0027002187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893683,0.0006416396,0.0000581916,0.00008969161,0.0001899045,0.00008363336],"domain_scores_gemma":[0.9985794,0.000840951,0.00011399087,0.00011539903,0.00025260597,0.00009767056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022759128,0.00074348925,0.0007491208,0.00081324717,0.00052909984,0.0010730778,0.0013536557,0.00084623066,0.0044919313],"category_scores_gemma":[0.0031910797,0.0006503794,0.00082973193,0.001176947,0.00043933777,0.0010898546,0.001264254,0.0011900244,0.00058224564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003104194,0.000049599774,0.00070359715,0.000039888608,0.000032067845,0.000044090302,0.00007505079,0.9606324,0.0010707872,0.023490438,0.00029865315,0.013532314],"study_design_scores_gemma":[0.0000048654897,0.00001477362,0.00006220686,0.0000040876025,0.000004672362,0.000006734262,0.000007973556,0.9958962,0.0001543579,0.0031287002,0.0007122967,0.0000031145132],"about_ca_topic_score_codex":0.008046977,"about_ca_topic_score_gemma":0.007602696,"teacher_disagreement_score":0.008046977,"about_ca_system_score_codex":0.0010185218,"about_ca_system_score_gemma":0.0024509777,"threshold_uncertainty_score":0.01600027},"labels":[],"label_agreement":null},{"id":"W4256589012","doi":"10.1109/wsc.2013.6721690","title":"Time-stepped, simulation-based scheduling system for large-scale industrial construction projects","year":2013,"lang":"en","type":"article","venue":"2013 Winter Simulations Conference (WSC)","topic":"Resource-Constrained Project Scheduling","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":"Canadian Natural Resources","funders":"","keywords":"Scheduling (production processes); Computer science; Idle; Duration (music); Industrial engineering; Operations research; Distributed computing; Real-time computing; Engineering; Operations management; Operating system","score_opus":0.12666353022367394,"score_gpt":0.3503903493081802,"score_spread":0.22372681908450626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256589012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17599598,0.00018489007,0.8104319,0.0001633541,0.00007017884,0.00038051556,0.00049738697,0.006670853,0.00560498],"genre_scores_gemma":[0.8533718,0.00014506707,0.14373806,0.000025637577,0.000011581799,0.0004286396,0.0004722801,0.00009401826,0.0017128898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997117,0.00010241063,0.00003035648,0.00006169061,0.00006551042,0.000028239197],"domain_scores_gemma":[0.99937576,0.0002947379,0.00007221404,0.000058204896,0.00010395331,0.0000951242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264608,0.00066817395,0.00066741527,0.00058251596,0.0006140706,0.00069759716,0.0010509769,0.0005245996,0.0045705917],"category_scores_gemma":[0.0012874354,0.00044435158,0.00041136646,0.00057770836,0.0003163461,0.00053775386,0.0007066709,0.00045073562,0.00046373162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013511722,0.000064355256,0.0006652473,0.00003196474,0.000016883476,0.000045600696,0.0000401759,0.982327,0.0020785122,0.0011134925,0.0004475317,0.013034148],"study_design_scores_gemma":[0.000014629141,0.000017550097,0.00007335745,0.0000014728229,0.0000040559585,0.00000368559,0.0000051902384,0.9989705,0.00034609745,0.00024826516,0.00031219114,0.000003055173],"about_ca_topic_score_codex":0.0095147,"about_ca_topic_score_gemma":0.009408385,"teacher_disagreement_score":0.0095147,"about_ca_system_score_codex":0.0008755674,"about_ca_system_score_gemma":0.0020108894,"threshold_uncertainty_score":0.018918633},"labels":[],"label_agreement":null},{"id":"W4284993186","doi":"10.1016/j.ijpe.2022.108557","title":"A model for advanced planning systems dedicated to the Engineer-To-Order context","year":2022,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Resource-Constrained Project Scheduling","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; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Build to order; Production planning; Concurrent engineering; Context (archaeology); Industrial engineering; Order fulfillment; Integrated business planning; Operations research; Order (exchange); Production (economics); Operations management; Supply chain; Engineering","score_opus":0.12310637010103455,"score_gpt":0.37843897762668915,"score_spread":0.2553326075256546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284993186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03475794,0.00052749075,0.934686,0.0017804205,0.0001650836,0.00016355961,0.0012227284,0.00035401218,0.026342733],"genre_scores_gemma":[0.8226654,0.0011381606,0.14443529,0.0002941807,0.00020398883,0.00057940604,0.0010269474,0.0001637673,0.029492864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936014,0.00021251128,0.00003625176,0.00014577492,0.00012699288,0.00011836136],"domain_scores_gemma":[0.99898416,0.0005789,0.00010780886,0.0000644033,0.00013469027,0.00013010729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091195747,0.0010124978,0.0012026952,0.00077133847,0.0009243899,0.0029138168,0.0020389345,0.0023986504,0.009622758],"category_scores_gemma":[0.0026006685,0.0006299924,0.0010942166,0.0014131974,0.0011792223,0.002202258,0.001572216,0.001892042,0.0010551785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003517267,0.0000320631,0.00019429984,0.000042590607,0.000015951719,0.00012861972,0.000039528997,0.8850898,0.00045074162,0.10901457,0.0011907071,0.0037659402],"study_design_scores_gemma":[0.000020511747,0.000021454385,0.00006185782,0.000007066847,0.000008289367,0.000022530645,0.0000137436045,0.96483594,0.00007618421,0.033347897,0.0015766675,0.000007910426],"about_ca_topic_score_codex":0.013806944,"about_ca_topic_score_gemma":0.0089849485,"teacher_disagreement_score":0.013806944,"about_ca_system_score_codex":0.0018475993,"about_ca_system_score_gemma":0.0027073787,"threshold_uncertainty_score":0.032191336},"labels":[],"label_agreement":null},{"id":"W4285250623","doi":"10.5829/ije.2022.35.08b.14","title":"A Constraint Programming Approach to Solve Multi-skill Resource-constrained Project Scheduling Problem with Calendars","year":2022,"lang":"en","type":"article","venue":"International Journal of Engineering","topic":"Resource-Constrained Project Scheduling","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":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Constraint programming; Computer science; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Resource constraints; Job shop scheduling; Time constraint; Constraint satisfaction; Stochastic programming; Artificial intelligence; Mathematics; Distributed computing; Schedule","score_opus":0.05969218079859123,"score_gpt":0.3363932926531561,"score_spread":0.27670111185456486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285250623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067988513,0.00049397966,0.98743016,0.00033994042,0.00007223441,0.00010513653,0.00021972394,0.0001345888,0.0044053365],"genre_scores_gemma":[0.26041472,0.0019030465,0.73117286,0.0002374881,0.00018069934,0.0006705649,0.00068119325,0.000123148,0.004616298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880564,0.0004445045,0.000068913265,0.0002284854,0.00029232036,0.0001601249],"domain_scores_gemma":[0.99871755,0.0007960396,0.00012738584,0.00005831125,0.00021285294,0.00008791185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016908073,0.001144002,0.0013956126,0.0010322385,0.0008610524,0.0017143396,0.001948456,0.0012881235,0.004482244],"category_scores_gemma":[0.0030916077,0.0007367016,0.0015410292,0.0034811557,0.00054716313,0.0017393007,0.0010165389,0.0023336266,0.00038274153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033696506,0.00005241483,0.000248537,0.00012914727,0.000033302535,0.00010022678,0.000029575995,0.9522744,0.0004850407,0.023649259,0.0018731704,0.021091174],"study_design_scores_gemma":[0.000008636995,0.000016491656,0.000048447593,0.000008440073,0.00000758788,0.000019326519,0.000010713758,0.9938784,0.00013090073,0.0049936557,0.00087202684,0.0000053859726],"about_ca_topic_score_codex":0.02121963,"about_ca_topic_score_gemma":0.0139683215,"teacher_disagreement_score":0.02121963,"about_ca_system_score_codex":0.001457895,"about_ca_system_score_gemma":0.004095351,"threshold_uncertainty_score":0.04219228},"labels":[],"label_agreement":null},{"id":"W4293069302","doi":"10.1007/978-981-19-1029-6_26","title":"Enhanced CPM/LOB Repetitive Scheduling Formulation to Meet Deadlines","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in civil engineering","topic":"Resource-Constrained Project Scheduling","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 Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Computation; Operations research; Distributed computing; Mathematical optimization; Engineering; Algorithm; Mathematics","score_opus":0.041341528159064014,"score_gpt":0.30818552287539175,"score_spread":0.26684399471632775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293069302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007789455,0.00021831652,0.97754043,0.00013088633,0.00009768823,0.000070771224,0.00008806907,0.0002105579,0.013853718],"genre_scores_gemma":[0.5748188,0.00047127687,0.3941491,0.00023887547,0.00023360511,0.00053030055,0.0004114986,0.00055328954,0.028593263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948466,0.00016558978,0.000015795209,0.00006261417,0.00015900483,0.000112248774],"domain_scores_gemma":[0.9993831,0.00030655955,0.00005185724,0.000049707898,0.00015851285,0.000050205854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188862,0.00082844886,0.0010360196,0.0005014201,0.00035458858,0.00092403596,0.0014461267,0.00088026986,0.0105212545],"category_scores_gemma":[0.0020068935,0.00038743863,0.00064317905,0.0009450458,0.0003648364,0.00063767453,0.0009317305,0.001288518,0.0010030608],"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.00007197032,0.000056004155,0.000070540395,0.00012545215,0.000013840839,0.0000604521,0.000029116372,0.9340123,0.002781789,0.025135707,0.0026423528,0.03500053],"study_design_scores_gemma":[0.0000067422197,0.00002524368,0.000020354868,0.000006363481,0.0000027251735,0.000009137878,0.0000057785423,0.99557376,0.00038270932,0.0030008794,0.00096398545,0.0000023471819],"about_ca_topic_score_codex":0.003888571,"about_ca_topic_score_gemma":0.003616314,"teacher_disagreement_score":0.0105212545,"about_ca_system_score_codex":0.00088917464,"about_ca_system_score_gemma":0.0016661817,"threshold_uncertainty_score":0.03519714},"labels":[],"label_agreement":null},{"id":"W4296579871","doi":"10.1139/cjce-2022-0029","title":"Enhanced repetitive scheduling formulation for meeting deadlines and resource constraints in linear and scattered projects","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"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 Waterloo","funders":"","keywords":"Scheduling (production processes); Computer science; Linear programming; Schedule; Crew; Critical path method; Operations research; Mathematical optimization; Distributed computing; Industrial engineering; Engineering; Systems engineering; Algorithm; Mathematics","score_opus":0.041690507653083866,"score_gpt":0.2898501007558356,"score_spread":0.24815959310275176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296579871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020656876,0.00015383582,0.9719791,0.00011674051,0.000046940993,0.00012184791,0.00010849352,0.00013215898,0.0066841403],"genre_scores_gemma":[0.6366543,0.00045316768,0.35186842,0.00008686965,0.0000921664,0.00043707597,0.00034257592,0.00017952186,0.009885928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936503,0.00019213064,0.000028927772,0.00010817176,0.00018174887,0.00012394432],"domain_scores_gemma":[0.99934834,0.00031427105,0.000095224335,0.000034384157,0.00014432243,0.00006348077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160823,0.0008331541,0.0007434825,0.00053845346,0.00043108914,0.0008218599,0.0012874305,0.0007552401,0.0043759043],"category_scores_gemma":[0.001961373,0.00044014637,0.00065358344,0.000744518,0.00049045397,0.0006197669,0.0007256942,0.00089995563,0.00039285867],"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.000040248196,0.000027242124,0.00013619893,0.00007112748,0.000008020864,0.00010987333,0.000052704025,0.97411114,0.0016650228,0.012601419,0.0005927954,0.010584125],"study_design_scores_gemma":[0.000011896017,0.000045772405,0.000058130885,0.0000054388097,0.000004276505,0.00001735518,0.0000185982,0.99557614,0.00038863567,0.002914162,0.00095532596,0.0000042906768],"about_ca_topic_score_codex":0.009067313,"about_ca_topic_score_gemma":0.0094091175,"teacher_disagreement_score":0.009067313,"about_ca_system_score_codex":0.0010883305,"about_ca_system_score_gemma":0.002236882,"threshold_uncertainty_score":0.018029094},"labels":[],"label_agreement":null},{"id":"W4297769732","doi":"10.5267/j.dsl.2022.7.004","title":"A multilayer feed-forward neural network (MLFNN) for the resource-constrained project scheduling problem (RCPSP)","year":2022,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":7,"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; Schedule; Scheduling (production processes); Project management; Artificial neural network; Operations research; Heuristic; Metaheuristic; Mathematical optimization; Artificial intelligence; Systems engineering; Engineering; Mathematics","score_opus":0.08401632250043545,"score_gpt":0.36955755368132104,"score_spread":0.2855412311808856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297769732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046249136,0.0014353724,0.9429986,0.0006747933,0.00020991563,0.00013283629,0.0001647939,0.0007213273,0.0074132327],"genre_scores_gemma":[0.764374,0.0010834755,0.22525062,0.0004594294,0.00009865787,0.00041926693,0.0004218788,0.000037883376,0.007854729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969304,0.00006609923,0.000023660585,0.000090585316,0.000070265036,0.00005633283],"domain_scores_gemma":[0.9996239,0.00017600768,0.000043052936,0.000012108171,0.00012707911,0.00001794823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008144396,0.0008438239,0.0006324759,0.0004203698,0.0004068926,0.0006515076,0.0010833188,0.0018427565,0.0018797294],"category_scores_gemma":[0.0019949728,0.00035015307,0.0005652366,0.0005256412,0.00037392983,0.0010419382,0.000511284,0.0011797099,0.00030111804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006757413,0.0000764838,0.0011953153,0.00012982197,0.000038862556,0.00010838449,0.000049046965,0.89731294,0.0019089493,0.0023555984,0.0013961178,0.09536084],"study_design_scores_gemma":[0.000006123369,0.000033029777,0.00013679083,0.000013734133,0.0000086377895,0.000015041718,0.000006167148,0.99830484,0.00033152115,0.0007745598,0.0003647025,0.000004774218],"about_ca_topic_score_codex":0.013112463,"about_ca_topic_score_gemma":0.012853645,"teacher_disagreement_score":0.013112463,"about_ca_system_score_codex":0.0009800238,"about_ca_system_score_gemma":0.0013028224,"threshold_uncertainty_score":0.026072264},"labels":[],"label_agreement":null},{"id":"W4307562660","doi":"10.1139/cjce-2022-0299","title":"Multicontractor multiproject matching optimization for planning modular school construction programs","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"Government of Alberta; University of Alberta","funders":"","keywords":"Computer science; Modular design; Scheduling (production processes); Multi-objective optimization; Matching (statistics); Operations research; Context (archaeology); Project management; Operations management; Engineering; Systems engineering; Machine learning; Mathematics","score_opus":0.04832454382582793,"score_gpt":0.2932145274324654,"score_spread":0.24488998360663747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307562660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117141455,0.00035973804,0.8731422,0.00030459452,0.00003749293,0.0004363766,0.0001813184,0.0002220941,0.00817475],"genre_scores_gemma":[0.72838,0.00031349974,0.26560265,0.00008412521,0.000019165755,0.0005914874,0.00027101208,0.000084873274,0.0046531055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.00045612032,0.000027748632,0.00011789609,0.00014693213,0.00016740632],"domain_scores_gemma":[0.9987935,0.0007732907,0.00013418254,0.000042546835,0.00013458164,0.00012193377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234103,0.0010627517,0.0011814119,0.0011336878,0.00063504686,0.0010818333,0.0009650632,0.0012448718,0.0042829197],"category_scores_gemma":[0.003243089,0.0006287271,0.000883064,0.0015061235,0.00065566663,0.00095417514,0.0011387788,0.0011268014,0.00028585567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040155508,0.000049326693,0.00036189385,0.000036678546,0.000013873562,0.000031209383,0.000021668222,0.98537606,0.00035920122,0.0028402312,0.00025165093,0.010617937],"study_design_scores_gemma":[0.0000078526555,0.000043945747,0.00016683766,0.0000058591427,0.0000044806966,0.000007125093,0.000026788333,0.9969805,0.00021106497,0.0022442231,0.00029756103,0.0000036971264],"about_ca_topic_score_codex":0.01076884,"about_ca_topic_score_gemma":0.01004523,"teacher_disagreement_score":0.01076884,"about_ca_system_score_codex":0.0017697278,"about_ca_system_score_gemma":0.0020452247,"threshold_uncertainty_score":0.021412313},"labels":[],"label_agreement":null},{"id":"W4353094231","doi":"10.1016/j.cie.2023.109170","title":"Solving resource-constrained project scheduling problems under different activity assumptions","year":2023,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Resource-Constrained Project Scheduling","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 Calgary","funders":"","keywords":"Job shop scheduling; Computer science; Preemption; Scheduling (production processes); Heuristic; Mathematical optimization; Operations research; Interpretability; Artificial intelligence; Mathematics; Schedule","score_opus":0.1983876127189261,"score_gpt":0.3453401446975087,"score_spread":0.14695253197858257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353094231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5713099,0.0006473338,0.4177594,0.00081870425,0.00009458589,0.00032459176,0.00064442557,0.00019142551,0.0082095405],"genre_scores_gemma":[0.91207534,0.00035290906,0.0853452,0.00007460408,0.00005205488,0.00024245902,0.00045076455,0.000050972256,0.0013556671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753594,0.0012944953,0.00012073257,0.00034769022,0.00024111664,0.00045994687],"domain_scores_gemma":[0.98051065,0.017662609,0.00059912656,0.00034584774,0.0005090757,0.0003726963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053750766,0.0010975066,0.0019218267,0.00094926596,0.0005905007,0.001888449,0.0017727552,0.0020731683,0.0025276393],"category_scores_gemma":[0.017173843,0.00097405637,0.0013835239,0.0015673558,0.00090305606,0.0022808535,0.0009352157,0.001772886,0.00014285663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017988801,0.00007777308,0.00035789027,0.00009286442,0.00003404739,0.000045430705,0.000029121327,0.9898935,0.00034347424,0.0040030973,0.00017815139,0.004764827],"study_design_scores_gemma":[0.00004514354,0.00004300038,0.00017427531,0.000008105292,0.000015112658,0.000007686484,0.000026209758,0.9961229,0.00028321822,0.0031973044,0.00007148589,0.0000055511855],"about_ca_topic_score_codex":0.0106946,"about_ca_topic_score_gemma":0.0055832155,"teacher_disagreement_score":0.0106946,"about_ca_system_score_codex":0.0016287597,"about_ca_system_score_gemma":0.00301841,"threshold_uncertainty_score":0.028426468},"labels":[],"label_agreement":null},{"id":"W4360591935","doi":"10.5267/j.dsl.2023.2.002","title":"A convolutional neural network for the resource-constrained project scheduling problem (RCPSP): A new approach","year":2023,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":12,"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; Schedule; Project management; Scheduling (production processes); Project planning; Artificial neural network; Operations research; Mathematical optimization; Artificial intelligence; Systems engineering; Engineering","score_opus":0.14747520844624143,"score_gpt":0.3875546990255678,"score_spread":0.24007949057932634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360591935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019293878,0.00085692154,0.97319114,0.0005962541,0.00009411993,0.00007876737,0.00012306194,0.0004681364,0.0052976687],"genre_scores_gemma":[0.5435005,0.0014209948,0.44052818,0.0005364688,0.0001571675,0.00038831276,0.0007784337,0.000109955756,0.012580032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999726,0.000051140967,0.000017154633,0.00008425362,0.000068718924,0.00005269657],"domain_scores_gemma":[0.9997472,0.000103845465,0.000032012395,0.000016351143,0.00007940648,0.00002120051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159384,0.0009775069,0.0006999839,0.0006513303,0.00035988534,0.00089427305,0.0015180042,0.0015106939,0.0017292242],"category_scores_gemma":[0.001159992,0.00050925114,0.00064145186,0.00080590585,0.00050005,0.0010935985,0.00092115137,0.0014431167,0.00025773695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040289517,0.00005288674,0.00064870407,0.00006714897,0.000045717876,0.00006921486,0.000030931427,0.9050165,0.001720232,0.007200355,0.0015540031,0.083553925],"study_design_scores_gemma":[0.0000018658947,0.0000075953185,0.0000507548,0.0000039725087,0.0000040123728,0.000006060126,0.0000019047186,0.99853694,0.00016155397,0.0009136335,0.0003101382,0.0000016523644],"about_ca_topic_score_codex":0.018038362,"about_ca_topic_score_gemma":0.01575163,"teacher_disagreement_score":0.018038362,"about_ca_system_score_codex":0.001706846,"about_ca_system_score_gemma":0.001843456,"threshold_uncertainty_score":0.035866737},"labels":[],"label_agreement":null},{"id":"W4386882818","doi":"10.32920/24171204.v1","title":"Resource leveling in construction projects with activity splitting and resource constraints: a simulated annealing optimization","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Simulated annealing; Resource leveling; Overtime; Novelty; Resource (disambiguation); Computer science; Operations research; Heuristic; Stakeholder; Mathematical optimization; Resource allocation; Engineering; Economics; Mathematics; Algorithm","score_opus":0.1637997143761759,"score_gpt":0.37206426350437893,"score_spread":0.20826454912820302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386882818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19978903,0.0005044761,0.7853219,0.0005052859,0.000047630987,0.00019343624,0.0001990622,0.00022448502,0.01321474],"genre_scores_gemma":[0.88883746,0.0003375443,0.104926385,0.00006451959,0.000013122208,0.00031682962,0.00014473088,0.00006366431,0.0052956264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995154,0.0002609099,0.00001467504,0.000068664696,0.00006090733,0.000079427075],"domain_scores_gemma":[0.999215,0.0005715621,0.000061449384,0.000032898108,0.00006813689,0.000050911472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008756855,0.00070446136,0.0011322043,0.00065158174,0.0005191965,0.0011459482,0.0008466984,0.0015691941,0.0027387517],"category_scores_gemma":[0.0019063135,0.00081670575,0.0010050534,0.0009047549,0.00084825413,0.0007784175,0.00066208857,0.0010345308,0.00020689123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015246705,0.000009574322,0.00010772705,0.0000101322985,0.0000064328387,0.000011213603,0.00000990102,0.99709773,0.00021647618,0.0011644312,0.000060976232,0.0012902865],"study_design_scores_gemma":[0.0000068139884,0.000017885342,0.00007576559,0.0000035228002,0.00000475635,0.0000034071454,0.000009038128,0.998623,0.000114440925,0.0009683388,0.00017099704,0.0000021089415],"about_ca_topic_score_codex":0.014588212,"about_ca_topic_score_gemma":0.0073597925,"teacher_disagreement_score":0.014588212,"about_ca_system_score_codex":0.0014375863,"about_ca_system_score_gemma":0.0016052986,"threshold_uncertainty_score":0.0290066},"labels":[],"label_agreement":null},{"id":"W4386883461","doi":"10.32920/24171204","title":"Resource leveling in construction projects with activity splitting and resource constraints: a simulated annealing optimization","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Resource-Constrained Project Scheduling","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 Toronto","funders":"","keywords":"Resource leveling; Simulated annealing; Overtime; Novelty; Resource (disambiguation); Computer science; Operations research; Heuristic; Stakeholder; Mathematical optimization; Resource allocation; Engineering; Economics; Mathematics; Algorithm","score_opus":0.1637997143761759,"score_gpt":0.37206426350437893,"score_spread":0.20826454912820302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386883461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19978903,0.0005044761,0.7853219,0.0005052859,0.000047630987,0.00019343624,0.0001990622,0.00022448502,0.01321474],"genre_scores_gemma":[0.88883746,0.0003375443,0.104926385,0.00006451959,0.000013122208,0.00031682962,0.00014473088,0.00006366431,0.0052956264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995154,0.0002609099,0.00001467504,0.000068664696,0.00006090733,0.000079427075],"domain_scores_gemma":[0.999215,0.0005715621,0.000061449384,0.000032898108,0.00006813689,0.000050911472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008756855,0.00070446136,0.0011322043,0.00065158174,0.0005191965,0.0011459482,0.0008466984,0.0015691941,0.0027387517],"category_scores_gemma":[0.0019063135,0.00081670575,0.0010050534,0.0009047549,0.00084825413,0.0007784175,0.00066208857,0.0010345308,0.00020689123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015246705,0.000009574322,0.00010772705,0.0000101322985,0.0000064328387,0.000011213603,0.00000990102,0.99709773,0.00021647618,0.0011644312,0.000060976232,0.0012902865],"study_design_scores_gemma":[0.0000068139884,0.000017885342,0.00007576559,0.0000035228002,0.00000475635,0.0000034071454,0.000009038128,0.998623,0.000114440925,0.0009683388,0.00017099704,0.0000021089415],"about_ca_topic_score_codex":0.014588212,"about_ca_topic_score_gemma":0.0073597925,"teacher_disagreement_score":0.014588212,"about_ca_system_score_codex":0.0014375863,"about_ca_system_score_gemma":0.0016052986,"threshold_uncertainty_score":0.0290066},"labels":[],"label_agreement":null},{"id":"W4388091559","doi":"10.1016/j.ijpe.2023.109077","title":"Integrated planning and scheduling of engineer-to-order projects using a Lamarckian Layered Genetic Algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Resource-Constrained Project Scheduling","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; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Schedule; Robustness (evolution); Scheduling (production processes); Genetic algorithm; Machine learning; Mathematics","score_opus":0.12078553486253406,"score_gpt":0.3748450309318462,"score_spread":0.2540594960693121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388091559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0903641,0.0001348435,0.9039456,0.00019357244,0.0000294225,0.00012094637,0.00006373688,0.00049154885,0.0046561887],"genre_scores_gemma":[0.6103988,0.00011763342,0.3862761,0.00008644824,0.00001564685,0.00027577014,0.00013356793,0.000064628664,0.0026313718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993717,0.00021910077,0.000034597684,0.000080090744,0.00016080712,0.00013373335],"domain_scores_gemma":[0.99916184,0.00043853486,0.00010896879,0.00004756296,0.00017112945,0.00007191395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015270312,0.0005956747,0.0012497968,0.0012726258,0.000810185,0.0016083469,0.0019084321,0.0015497354,0.0017946621],"category_scores_gemma":[0.0029805694,0.00087787095,0.0010287435,0.0013584697,0.0007064389,0.0011585574,0.0014435248,0.0010814794,0.00027775808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003130914,0.000044169807,0.00033860144,0.000011751513,0.00002037781,0.000017038497,0.000027007829,0.986515,0.0007072459,0.0016637488,0.00009509576,0.010528657],"study_design_scores_gemma":[0.000005692579,0.000015808242,0.000046336227,0.0000015787547,0.0000052500645,0.0000018199989,0.0000044597955,0.99931383,0.0001425454,0.00041699264,0.000043119617,0.0000025369766],"about_ca_topic_score_codex":0.032222908,"about_ca_topic_score_gemma":0.026688837,"teacher_disagreement_score":0.032222908,"about_ca_system_score_codex":0.0020928395,"about_ca_system_score_gemma":0.0037638813,"threshold_uncertainty_score":0.0640707},"labels":[],"label_agreement":null},{"id":"W4389044384","doi":"10.1016/j.heliyon.2023.e22678","title":"On-site workshop investment problem: A novel mathematical approach and solution procedure","year":2023,"lang":"en","type":"article","venue":"Heliyon","topic":"Resource-Constrained Project Scheduling","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":"Concordia University","funders":"Qatar National Library","keywords":"Metaheuristic; Job shop scheduling; Simulated annealing; Mathematical optimization; Crossover; Particle swarm optimization; Tardiness; Computer science; Scheduling (production processes); Project management; Genetic algorithm; Operations research; Engineering; Mathematics; Schedule; Systems engineering; Artificial intelligence","score_opus":0.12847381373967748,"score_gpt":0.35692988778664003,"score_spread":0.22845607404696255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389044384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965575,0.0004033855,0.98840874,0.00044822125,0.00009843392,0.00019238672,0.00015699647,0.000082261795,0.0062439926],"genre_scores_gemma":[0.24555655,0.0024719804,0.7294173,0.0003819384,0.0004788457,0.0015461206,0.00081568974,0.00019858708,0.019132936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989794,0.00035351858,0.000050209703,0.00022056629,0.00022630584,0.00016994991],"domain_scores_gemma":[0.9993979,0.00033003517,0.000078288314,0.000040990173,0.00010034326,0.000052547963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001668694,0.0016887498,0.0016316567,0.0013717075,0.00067248003,0.0018630233,0.0034485708,0.0026914545,0.005782127],"category_scores_gemma":[0.0019767834,0.0007648822,0.0029129523,0.001953917,0.00091633684,0.0018603075,0.0019333408,0.003211512,0.0007236673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007227659,0.00018233554,0.00052478164,0.00042845175,0.00008638158,0.0003882053,0.000100683144,0.8569204,0.0024414507,0.09062901,0.007077637,0.041148417],"study_design_scores_gemma":[0.00002115895,0.000055826426,0.00012374109,0.000028315126,0.00002266675,0.00011935094,0.000037643866,0.98011154,0.00054706226,0.014118814,0.0047986708,0.000015094143],"about_ca_topic_score_codex":0.0056309244,"about_ca_topic_score_gemma":0.0048496188,"teacher_disagreement_score":0.005782127,"about_ca_system_score_codex":0.0017134104,"about_ca_system_score_gemma":0.0029690738,"threshold_uncertainty_score":0.019343138},"labels":[],"label_agreement":null},{"id":"W4389285739","doi":"10.1016/j.autcon.2023.105208","title":"Optimized variable resource allocation framework for scheduling of fast-track industrial construction projects","year":2023,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PCL Construction (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Resource allocation; Track (disk drive); Operations research; Resource (disambiguation); Industrial engineering; Engineering; Operations management","score_opus":0.12224588919194798,"score_gpt":0.3739379494972018,"score_spread":0.2516920603052538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389285739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033403233,0.0005867766,0.9605542,0.00018626597,0.00008235666,0.00012688506,0.00020398851,0.00033769544,0.004518752],"genre_scores_gemma":[0.78527033,0.00046409506,0.20999505,0.000090395595,0.00006554686,0.00029931983,0.00038052286,0.00013566285,0.003299018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855036,0.0006042243,0.000044916334,0.00018748295,0.0002626517,0.0003504681],"domain_scores_gemma":[0.9990023,0.00059024716,0.00010122819,0.000041110074,0.0001730921,0.00009216923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022653297,0.0010876507,0.0023374087,0.001148808,0.00064122234,0.0019266272,0.0020433443,0.001117635,0.0035461613],"category_scores_gemma":[0.0022444937,0.00088255794,0.00087617285,0.001885077,0.0006817573,0.00093089056,0.0009558649,0.0012867864,0.00034341146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041331572,0.000026539405,0.00007704608,0.000025692792,0.000015435411,0.000013611547,0.000010169389,0.99060845,0.0002566288,0.002973255,0.00031832696,0.005633475],"study_design_scores_gemma":[0.000008753576,0.000012208548,0.00004029895,0.00000219362,0.0000043370883,0.0000019710983,0.0000038162116,0.9985928,0.000054859123,0.0011348953,0.00014172803,0.000002068526],"about_ca_topic_score_codex":0.022613222,"about_ca_topic_score_gemma":0.0203001,"teacher_disagreement_score":0.022613222,"about_ca_system_score_codex":0.0021448224,"about_ca_system_score_gemma":0.004185154,"threshold_uncertainty_score":0.04496318},"labels":[],"label_agreement":null},{"id":"W4389832535","doi":"10.5267/j.jpm.2023.9.002","title":"Multi-mode multi-skill resource-constrained project scheduling problem with differentiated professional capabilities","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","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":"Science Foundation of Ministry of Education of China; Ministry of Education of the People's Republic of China","keywords":"Computer science; Scheduling (production processes); Integer programming; Schedule; Duration (music); Resource consumption; Distributed computing; Mathematical optimization; Algorithm; Operating system","score_opus":0.10238932933438215,"score_gpt":0.3957234782548167,"score_spread":0.2933341489204345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389832535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30538365,0.0007664209,0.68416953,0.0008234494,0.00011997039,0.0003628743,0.00052085036,0.00021318937,0.0076400284],"genre_scores_gemma":[0.86131823,0.000390599,0.13224012,0.00012206009,0.00005459656,0.00054103567,0.0004508568,0.00005463917,0.004827865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987955,0.00052660157,0.000051602496,0.00022217602,0.00012393112,0.00028022993],"domain_scores_gemma":[0.9984654,0.0008877929,0.00015556657,0.00005919887,0.00014316286,0.00028887473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017218523,0.00114315,0.0018295977,0.0007962055,0.00072090945,0.0011908092,0.0017993667,0.0014527943,0.0031886462],"category_scores_gemma":[0.0023000007,0.000660187,0.0011476163,0.0012316504,0.0005594533,0.0012993452,0.0009786171,0.0011711195,0.00021909627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017289909,0.00012384253,0.0009752531,0.00013664913,0.00006321253,0.0002241532,0.000048952577,0.9773441,0.0011940862,0.0054839477,0.0008980616,0.013334887],"study_design_scores_gemma":[0.000033809876,0.00008303214,0.00026518916,0.000007784241,0.000015754511,0.00004031944,0.000039117233,0.99568284,0.00032268304,0.0031429555,0.00035849857,0.000007963209],"about_ca_topic_score_codex":0.0055118664,"about_ca_topic_score_gemma":0.0036204727,"teacher_disagreement_score":0.0055118664,"about_ca_system_score_codex":0.0010962813,"about_ca_system_score_gemma":0.0019505129,"threshold_uncertainty_score":0.010959566},"labels":[],"label_agreement":null},{"id":"W4392456161","doi":"10.1061/9780784485231.019","title":"A Heuristic Algorithm for a Robust Resource-Constrained Project Scheduling Problem with Multi-Skilled Resources","year":2024,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Computer science; Heuristic; Scheduling (production processes); Mathematical optimization; Processor scheduling; Resource (disambiguation); Algorithm; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.10746551089511774,"score_gpt":0.371568029672705,"score_spread":0.2641025187775873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392456161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006002073,0.00015877868,0.98972297,0.0001242709,0.000037436104,0.00013526616,0.000076692384,0.00035129098,0.003391178],"genre_scores_gemma":[0.17838769,0.00028009634,0.81796384,0.0001211009,0.000048339545,0.00056783913,0.00033790045,0.0001298896,0.0021633313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.0001733655,0.000032353946,0.00015969883,0.00011246712,0.000119666634],"domain_scores_gemma":[0.99918836,0.0004991141,0.00009211548,0.000049836846,0.00011670602,0.00005390082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011062557,0.0012137752,0.0013385784,0.0012026608,0.00074609293,0.0012760037,0.0017868774,0.0018125259,0.0048319316],"category_scores_gemma":[0.0023851458,0.0006372726,0.0010848457,0.0013148254,0.0006561186,0.0009414442,0.001361197,0.0013683882,0.0007957117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007060824,0.00008049708,0.00019921488,0.00012004854,0.000040179486,0.00011414633,0.00006158131,0.926689,0.0013734964,0.013240094,0.0022087754,0.055802397],"study_design_scores_gemma":[0.000039447546,0.000029261382,0.000038557308,0.000012107005,0.0000089723135,0.00002800322,0.000020003497,0.99343324,0.00029492192,0.005087677,0.0010001891,0.000007654969],"about_ca_topic_score_codex":0.0063454546,"about_ca_topic_score_gemma":0.004970372,"teacher_disagreement_score":0.0063454546,"about_ca_system_score_codex":0.0012480519,"about_ca_system_score_gemma":0.002783268,"threshold_uncertainty_score":0.016164422},"labels":[],"label_agreement":null},{"id":"W4393162046","doi":"10.24818/18423264/58.1.24.07","title":"A Multi-Objective Water Cycle Algorithm for the BI-Objective Multi-Mode Project Resource Renting Problem","year":2024,"lang":"en","type":"article","venue":"ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH","topic":"Resource-Constrained Project Scheduling","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":"Renting; Computer science; Mode (computer interface); Mathematical optimization; Resource (disambiguation); Algorithm; Mathematics; Engineering; Civil engineering; Operating system; Computer network","score_opus":0.1571879295549604,"score_gpt":0.44979980770879024,"score_spread":0.29261187815382983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393162046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018298266,0.00030645903,0.9743333,0.00018590604,0.000054107782,0.00024306103,0.00009614126,0.00033184126,0.0061508585],"genre_scores_gemma":[0.33210602,0.00043408468,0.65860116,0.00016597462,0.000033279302,0.0010906074,0.00037899258,0.00013938182,0.0070505454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00010555938,0.0000185717,0.00007464601,0.000110621266,0.000064598455],"domain_scores_gemma":[0.99974614,0.00012193804,0.000027978213,0.000014980902,0.000067709574,0.000021268856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006793743,0.00093998195,0.0010315749,0.001055493,0.00063160574,0.0009236016,0.0013501857,0.0015316687,0.004448895],"category_scores_gemma":[0.001294595,0.00042675878,0.0008418186,0.0012366199,0.0003944028,0.00084125804,0.0008996187,0.0010582352,0.00047436522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004297523,0.000072000716,0.0002874812,0.00008858056,0.000031908286,0.000051773,0.000043923257,0.9154307,0.0012937519,0.006461866,0.0012223861,0.074972615],"study_design_scores_gemma":[0.000014673529,0.000028062363,0.000055019886,0.000006252143,0.000005334834,0.000011772255,0.000007871827,0.9977022,0.0002247773,0.0010731817,0.00086700247,0.000003851283],"about_ca_topic_score_codex":0.0096219545,"about_ca_topic_score_gemma":0.008451207,"teacher_disagreement_score":0.0096219545,"about_ca_system_score_codex":0.00095876434,"about_ca_system_score_gemma":0.0023149797,"threshold_uncertainty_score":0.019131899},"labels":[],"label_agreement":null},{"id":"W4399550361","doi":"10.1061/jcemd4.coeng-14821","title":"Mitigating Project Schedule Risks by Identifying Subcritical Paths and Variance-Critical Activities","year":2024,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","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 Alberta; Government of Alberta","funders":"","keywords":"Schedule; Variance (accounting); Critical path method; Computer science; Risk analysis (engineering); Operations research; Environmental science; Engineering; Business; Systems engineering; Accounting","score_opus":0.05827528747021198,"score_gpt":0.370713419999639,"score_spread":0.31243813252942704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399550361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07647622,0.0005358625,0.91570085,0.0003497975,0.000022404562,0.00023814202,0.000060342514,0.00018859438,0.0064277356],"genre_scores_gemma":[0.75134426,0.0008659963,0.24583225,0.000045472385,0.000022455166,0.0003218705,0.00010112214,0.000065651126,0.0014008417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522996,0.0019965973,0.00020582325,0.0005016636,0.0018265223,0.00023946058],"domain_scores_gemma":[0.9758959,0.013341852,0.0053872857,0.0011089956,0.003898765,0.00036724206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058734207,0.0009413541,0.0006043205,0.004051143,0.00085120177,0.0020144745,0.0010315389,0.00056793296,0.0014944588],"category_scores_gemma":[0.029541424,0.00048605315,0.0007111873,0.0021370659,0.0012819177,0.003221714,0.0021754298,0.0011886837,0.00015078479],"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.00020816867,0.0001611783,0.030478334,0.0008146783,0.00014560079,0.00033838156,0.001777135,0.2979381,0.008686236,0.21997555,0.0016135416,0.43786308],"study_design_scores_gemma":[0.000044587916,0.000550822,0.014263881,0.0004345076,0.00023499015,0.0005210015,0.0019109184,0.698883,0.015711756,0.25213844,0.015141825,0.00016423067],"about_ca_topic_score_codex":0.0034849904,"about_ca_topic_score_gemma":0.004671732,"teacher_disagreement_score":0.0058734207,"about_ca_system_score_codex":0.0019913286,"about_ca_system_score_gemma":0.007407406,"threshold_uncertainty_score":0.031062007},"labels":[],"label_agreement":null},{"id":"W4399681193","doi":"10.5267/j.ijiec.2024.5.002","title":"Ant colony algorithms for minimizing costs in multi-mode resource constrained project scheduling problems with spatial constraints","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Resource-Constrained Project Scheduling","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":"Mathematical optimization; Ant colony optimization algorithms; Scheduling (production processes); Computer science; Mode (computer interface); Resource constraints; Algorithm; Distributed computing; Mathematics","score_opus":0.13549378162218442,"score_gpt":0.3924922204413859,"score_spread":0.2569984388192015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053097676,0.0015628496,0.9362784,0.00047812593,0.000097359756,0.00017358306,0.00011320931,0.00030024775,0.007898673],"genre_scores_gemma":[0.58942646,0.0010471548,0.403952,0.00015228865,0.00008050674,0.0005282135,0.00019307957,0.000116971176,0.0045033484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.0003431138,0.000027445425,0.00007400209,0.00014524569,0.00006688197],"domain_scores_gemma":[0.99850047,0.0011027753,0.0001567889,0.000045238907,0.0001375146,0.00005727685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010594078,0.0011637694,0.0011305388,0.00091893575,0.00040082232,0.0010374824,0.0012735055,0.0012036425,0.0014344881],"category_scores_gemma":[0.0026281092,0.0005711921,0.0006012778,0.0013605633,0.0006308546,0.0008333304,0.0009312468,0.0010678205,0.00023997726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024121398,0.000019109842,0.00012996391,0.000046043147,0.000018594494,0.000023479877,0.000018998415,0.9868162,0.00025551065,0.0030258736,0.00025958903,0.009362494],"study_design_scores_gemma":[0.0000100131265,0.000014522251,0.000031014322,0.0000050333315,0.000003989466,0.0000062016106,0.0000069253474,0.9978358,0.00009038668,0.0017513722,0.00024269278,0.0000019540862],"about_ca_topic_score_codex":0.005858603,"about_ca_topic_score_gemma":0.0050710244,"teacher_disagreement_score":0.005858603,"about_ca_system_score_codex":0.0008501654,"about_ca_system_score_gemma":0.0012196869,"threshold_uncertainty_score":0.011649013},"labels":[],"label_agreement":null},{"id":"W4401282697","doi":"10.1016/j.autcon.2024.105647","title":"Virtual simulation environment for comparing and testing current modeling strategies in project planning and control","year":2024,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Schedule; Domain (mathematical analysis); Control (management); Systems engineering; Resource (disambiguation); Virtual machine; Markov chain; Operations research; Industrial engineering; Engineering; Machine learning; Artificial intelligence","score_opus":0.18487056802356963,"score_gpt":0.41831981777690835,"score_spread":0.23344924975333872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401282697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10760735,0.00023058313,0.86814326,0.00042016746,0.00014820207,0.0005068424,0.0007799742,0.0017115291,0.020452082],"genre_scores_gemma":[0.687142,0.00030830884,0.30925614,0.00007094018,0.000028432214,0.0012675083,0.0005855734,0.00021144355,0.001129589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997347,0.001986308,0.000098648714,0.00012697588,0.00031051665,0.00013049951],"domain_scores_gemma":[0.9893063,0.008937943,0.0003061457,0.0008444284,0.00038833058,0.00021687936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046116533,0.00071275054,0.00058181456,0.0009991195,0.0007075884,0.0014299693,0.0015619165,0.00077634805,0.0033766606],"category_scores_gemma":[0.009675689,0.00035686872,0.00058972207,0.00090943417,0.0011017129,0.0014952254,0.0016244821,0.0011540706,0.0002759834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021886936,0.00026832015,0.0017396657,0.0000885856,0.000050397546,0.00006532304,0.00016946398,0.9233822,0.0014216257,0.05518805,0.0009912705,0.016416254],"study_design_scores_gemma":[0.00012695225,0.00027160303,0.00037971602,0.00003521785,0.000022945515,0.000023845318,0.000107797554,0.9764199,0.0020281922,0.014234443,0.0063234842,0.000025872348],"about_ca_topic_score_codex":0.0034257618,"about_ca_topic_score_gemma":0.0032800974,"teacher_disagreement_score":0.0046116533,"about_ca_system_score_codex":0.00095454836,"about_ca_system_score_gemma":0.001570363,"threshold_uncertainty_score":0.024389088},"labels":[],"label_agreement":null},{"id":"W4402327536","doi":"10.1007/978-3-031-71645-4_36","title":"Multi-project Scheduling Problem with Limited Preemption and Ordinary Feeding Precedence Relations","year":2024,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Resource-Constrained Project Scheduling","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":"Preemption; Computer science; Scheduling (production processes); Mathematical optimization; Mathematics; Operating system","score_opus":0.04891808183050314,"score_gpt":0.34662521339754593,"score_spread":0.29770713156704276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402327536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07176158,0.0017069967,0.88610685,0.0011661829,0.00029636492,0.0002701912,0.0010462129,0.00035487997,0.037290726],"genre_scores_gemma":[0.486705,0.0022709407,0.4665126,0.00028538477,0.00030056867,0.00068459695,0.0011492581,0.00027896813,0.04181261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943894,0.0002311921,0.000029768022,0.000104852414,0.00009801191,0.000097118485],"domain_scores_gemma":[0.9993812,0.00039665418,0.000052132196,0.000041678795,0.000054543743,0.00007375934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431361,0.0010221442,0.0014208624,0.0007318869,0.00083981676,0.0012359327,0.0015764694,0.0014268958,0.006025495],"category_scores_gemma":[0.0019077192,0.0007558103,0.00085444376,0.0017618143,0.00055471173,0.0020343233,0.0009790726,0.0012520333,0.00066541624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003587881,0.00023404436,0.00055168767,0.0006487139,0.000109809815,0.0005137349,0.00012816259,0.7519612,0.006052263,0.082271345,0.012888711,0.14428166],"study_design_scores_gemma":[0.000114047376,0.00019221,0.00067802804,0.000048779857,0.00003993403,0.00030723098,0.00008902338,0.9021755,0.0021112938,0.08494278,0.0092732655,0.00002785809],"about_ca_topic_score_codex":0.0025588889,"about_ca_topic_score_gemma":0.0025878083,"teacher_disagreement_score":0.006025495,"about_ca_system_score_codex":0.00072689407,"about_ca_system_score_gemma":0.0011259897,"threshold_uncertainty_score":0.020157278},"labels":[],"label_agreement":null},{"id":"W4403242698","doi":"10.1016/j.ifacol.2024.09.120","title":"New visual resource-oriented margins for the Resource Constrained Project Scheduling Problem","year":2024,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Resource-Constrained Project Scheduling","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; Espace pour la vie","funders":"","keywords":"Computer science; Scheduling (production processes); Resource (disambiguation); Mathematical optimization; Mathematics; Computer network","score_opus":0.0734822709932052,"score_gpt":0.39384528560013937,"score_spread":0.32036301460693417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403242698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010079285,0.00031853403,0.98000896,0.0003066416,0.000106020816,0.00010477625,0.00023179702,0.00066062016,0.008183433],"genre_scores_gemma":[0.33767614,0.0006030295,0.6566273,0.00017150435,0.00011228708,0.00047866112,0.0005239014,0.00045783102,0.0033493815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988337,0.00046984435,0.00006690852,0.00015272004,0.0003912617,0.00008556677],"domain_scores_gemma":[0.99777204,0.0013499164,0.00035635006,0.00011476509,0.00027781195,0.0001290762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414414,0.0013076507,0.0007171507,0.0018158858,0.0003606643,0.0023228498,0.00094694254,0.0008780491,0.006096137],"category_scores_gemma":[0.008397335,0.0003537551,0.0006857223,0.0013443283,0.0009880963,0.0028630856,0.0016975786,0.0021738303,0.0007246051],"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.00041397783,0.00011518652,0.0013820834,0.000498722,0.0000386635,0.00020803342,0.00043551857,0.5757249,0.008140978,0.2189647,0.008626337,0.18545087],"study_design_scores_gemma":[0.000022883884,0.00011165161,0.00054354744,0.00007230057,0.000010542122,0.000060176117,0.000098317054,0.9118895,0.0019073305,0.076352365,0.008891775,0.000039717354],"about_ca_topic_score_codex":0.0019802586,"about_ca_topic_score_gemma":0.0021715858,"teacher_disagreement_score":0.006096137,"about_ca_system_score_codex":0.0015617879,"about_ca_system_score_gemma":0.0008773052,"threshold_uncertainty_score":0.02039355},"labels":[],"label_agreement":null},{"id":"W4404762497","doi":"10.28924/2291-8639-22-2024-221","title":"Decision-Making of a New Type of Stochastic Space and Its Associated Operator Ideal","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Resource-Constrained Project Scheduling","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":"University of Jeddah","keywords":"Mathematics; Ideal (ethics); Operator (biology); Type (biology); Space (punctuation); Mathematical economics; Calculus (dental); Epistemology; Computer science; Medicine","score_opus":0.05686529386802066,"score_gpt":0.4285911562950046,"score_spread":0.37172586242698397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404762497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05298446,0.00020582427,0.9397397,0.0006004956,0.00007485058,0.000037179347,0.000049907667,0.00003240747,0.006275084],"genre_scores_gemma":[0.8210208,0.0005070576,0.17296912,0.0001307644,0.00020770307,0.00010875844,0.000077080396,0.00001758628,0.0049611935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997964,0.00079368445,0.0001146701,0.00043719637,0.00049437553,0.00019604922],"domain_scores_gemma":[0.997858,0.0009877459,0.0003792778,0.000120955854,0.0003535305,0.00030056553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041456292,0.0006697062,0.0007724671,0.000784688,0.00060095434,0.0023225844,0.00079555594,0.000816986,0.0022242852],"category_scores_gemma":[0.003927816,0.0002679614,0.0009823804,0.00062780915,0.0028091471,0.0030724881,0.001509379,0.0013825735,0.00018612157],"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.000071985975,0.00004385935,0.0005479447,0.00006849404,0.00004396668,0.00015141934,0.00017708371,0.080264784,0.002243856,0.9061708,0.00039784753,0.009817922],"study_design_scores_gemma":[0.000024112082,0.00013779465,0.00020328406,0.000022925336,0.000019321167,0.00009038656,0.00010465374,0.4746514,0.0013177022,0.5211117,0.0022868572,0.00002978555],"about_ca_topic_score_codex":0.0007064113,"about_ca_topic_score_gemma":0.0005847232,"teacher_disagreement_score":0.0041456292,"about_ca_system_score_codex":0.0014314185,"about_ca_system_score_gemma":0.0016096131,"threshold_uncertainty_score":0.021924436},"labels":[],"label_agreement":null},{"id":"W4405398107","doi":"10.5267/j.jpm.2024.12.002","title":"Resource-constrained project scheduling problem: Review of recent developments","year":2024,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","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; Scheduling (production processes); Operations research; Mathematical optimization; Engineering; Mathematics","score_opus":0.13414712206995055,"score_gpt":0.4174762131630813,"score_spread":0.28332909109313076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405398107","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010021151,0.98886555,0.0052237,0.0008485393,0.00026175365,0.00001215281,0.000036898342,0.000018140787,0.003731124],"genre_scores_gemma":[0.0081975525,0.9857303,0.004504857,0.00023758644,0.000661281,0.000017261726,0.000105811705,0.0000112419575,0.00053401],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994986,0.00011345649,0.000065728986,0.00012798027,0.00015309143,0.000041065556],"domain_scores_gemma":[0.9981919,0.0012776981,0.00014037506,0.000035703095,0.00027811207,0.00007624392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407067,0.0012188248,0.0012963859,0.0018812349,0.0004232244,0.0018919376,0.0010267822,0.0010780297,0.0025616165],"category_scores_gemma":[0.0025527123,0.0005721628,0.00085224706,0.0048359022,0.0007147786,0.0019641472,0.00079039147,0.0015885335,0.0007342621],"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.000104500505,0.00016425508,0.0008520129,0.01710718,0.0001598511,0.00021611153,0.00017676632,0.020193992,0.0008924243,0.04182927,0.023369774,0.89493394],"study_design_scores_gemma":[0.000041026113,0.0003491482,0.0021093213,0.008682309,0.00035101347,0.0012591291,0.0005393046,0.022030879,0.0009966685,0.041786484,0.9217418,0.00011291756],"about_ca_topic_score_codex":0.0032514804,"about_ca_topic_score_gemma":0.0026814446,"teacher_disagreement_score":0.0032514804,"about_ca_system_score_codex":0.0010037597,"about_ca_system_score_gemma":0.002322831,"threshold_uncertainty_score":0.008569479},"labels":[],"label_agreement":null},{"id":"W4405654005","doi":"10.1080/00207543.2024.2442087","title":"A new MIP RCCP model for tackling tactical project planning","year":2024,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Resource-Constrained Project Scheduling","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":"Polytechnique Montréal","funders":"Mitacs","keywords":"Computer science; Engineering; Operations research","score_opus":0.5703865463259347,"score_gpt":0.6182063314675516,"score_spread":0.04781978514161689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405654005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022606307,0.00016349254,0.9932662,0.00020767665,0.0000477751,0.000059564398,0.0002377437,0.0001859137,0.0035709902],"genre_scores_gemma":[0.17824706,0.00080905086,0.8093284,0.00026122518,0.00014497046,0.00073572237,0.0010515761,0.0002496351,0.009172435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987563,0.00042529855,0.000054415785,0.00022637121,0.0003841347,0.00015350881],"domain_scores_gemma":[0.9990588,0.00049707975,0.00014144774,0.00007079598,0.00015855831,0.000073371484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736686,0.0012113451,0.0010610992,0.00096148904,0.00043090896,0.0020478014,0.0026229848,0.001371027,0.004593242],"category_scores_gemma":[0.00219665,0.00083937874,0.0017761852,0.0015866501,0.0006861243,0.0019605118,0.001121483,0.0026711302,0.0009109522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027505446,0.00002772916,0.00012609585,0.000090386566,0.000024749768,0.000059888305,0.000029700628,0.9536507,0.0006323297,0.031654645,0.0015031837,0.012173042],"study_design_scores_gemma":[0.0000071289064,0.000019230636,0.00003582317,0.000010470363,0.000008568879,0.000021349357,0.000008591446,0.98911536,0.00020510938,0.0072127236,0.0033482802,0.000007392818],"about_ca_topic_score_codex":0.007014532,"about_ca_topic_score_gemma":0.0080763195,"teacher_disagreement_score":0.007014532,"about_ca_system_score_codex":0.001504501,"about_ca_system_score_gemma":0.0022827436,"threshold_uncertainty_score":0.015365958},"labels":[],"label_agreement":null},{"id":"W4406499833","doi":"10.1109/dasa63652.2024.10836294","title":"Expert-Decision-Based Scheduling Strategies for Construction Projects Management","year":2024,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Scheduling (production processes); Process management; Knowledge management; Operations management; Engineering","score_opus":0.11813369149507438,"score_gpt":0.41013481851005,"score_spread":0.2920011270149756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406499833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01963485,0.0006093299,0.9729422,0.00048636572,0.00003367924,0.00031581032,0.00005984355,0.0001395449,0.0057784487],"genre_scores_gemma":[0.5433609,0.0005740006,0.4541184,0.00010772291,0.000033912107,0.00033308507,0.00010051265,0.00002928624,0.0013421959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99258065,0.0048410348,0.00042354883,0.00054374355,0.0014289159,0.00018207524],"domain_scores_gemma":[0.9850257,0.010343092,0.0018235212,0.00062624185,0.001875717,0.0003057734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0117130345,0.0009768928,0.0009164687,0.002539707,0.00063164724,0.0017531685,0.001471961,0.0009124172,0.00262429],"category_scores_gemma":[0.027234778,0.00048148283,0.00059309084,0.0015721979,0.0007069349,0.0024869568,0.001265572,0.00096600346,0.00033507112],"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.00022664134,0.00029513743,0.002042773,0.00080769655,0.00020784493,0.0001863459,0.0012253827,0.50038713,0.003388492,0.09349808,0.0022018848,0.39553264],"study_design_scores_gemma":[0.00008586548,0.00031788734,0.001172236,0.00015929095,0.000082472936,0.000082697,0.00057237275,0.8671046,0.0024620602,0.12004529,0.007853683,0.00006149453],"about_ca_topic_score_codex":0.0024598248,"about_ca_topic_score_gemma":0.0042579314,"teacher_disagreement_score":0.0117130345,"about_ca_system_score_codex":0.0019741755,"about_ca_system_score_gemma":0.003708019,"threshold_uncertainty_score":0.06194514},"labels":[],"label_agreement":null},{"id":"W4408086973","doi":"10.1007/978-3-031-80676-6_122","title":"Managing Bake Furnace Relines to Optimize Fire Startup","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œminerals, metals & materials series","topic":"Resource-Constrained Project Scheduling","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":"Aluminerie Alouette (Canada); Hatch (Canada)","funders":"","keywords":"Environmental science","score_opus":0.06575476229012436,"score_gpt":0.32224604995734046,"score_spread":0.2564912876672161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408086973","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090499945,0.001995221,0.8555016,0.00060339144,0.00020891924,0.0003364815,0.00059981144,0.0019746255,0.048280094],"genre_scores_gemma":[0.7631218,0.0013383875,0.20764092,0.00008755259,0.000062513034,0.00028368933,0.00072169333,0.00059003587,0.026153374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965787,0.00008523268,0.0000113422575,0.000059004837,0.000099994366,0.000086550295],"domain_scores_gemma":[0.9996111,0.00020953132,0.000041179246,0.000031398526,0.000064074746,0.000042719465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076873123,0.0011111071,0.0010029691,0.000638876,0.00058751024,0.001832329,0.0013647284,0.0007891828,0.009603033],"category_scores_gemma":[0.0016539508,0.0007979289,0.0005710263,0.0007685752,0.00028512106,0.0016635085,0.0008813891,0.0012189698,0.0013032269],"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.0001564581,0.00010515807,0.000579077,0.00010207123,0.000029479643,0.00006822026,0.00005810837,0.8602273,0.0064411107,0.007207716,0.004692085,0.120333225],"study_design_scores_gemma":[0.00001780973,0.00008074314,0.00044055155,0.000018628962,0.000012435521,0.000023797873,0.00006860599,0.9840307,0.0034016739,0.008062745,0.0038301165,0.000012173825],"about_ca_topic_score_codex":0.004206546,"about_ca_topic_score_gemma":0.008729764,"teacher_disagreement_score":0.009603033,"about_ca_system_score_codex":0.00091501814,"about_ca_system_score_gemma":0.0013313846,"threshold_uncertainty_score":0.032125294},"labels":[],"label_agreement":null},{"id":"W4410872146","doi":"10.5267/j.jpm.2025.5.001","title":"Optimizing stochastic multi-project scheduling with a simulation integrated multi-objective genetic algorithm","year":2025,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","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":"Computer science; Genetic algorithm; Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics; Machine learning","score_opus":0.0832241558811624,"score_gpt":0.39705636607974154,"score_spread":0.31383221019857915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410872146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06979109,0.00022867155,0.9245752,0.000194862,0.000031279327,0.00009184575,0.000051887804,0.0003104498,0.004724616],"genre_scores_gemma":[0.84043205,0.00026390402,0.15719134,0.000059578604,0.000012428426,0.00028618224,0.00012174732,0.000041558236,0.0015911746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960524,0.00019666945,0.0000137586085,0.000039523587,0.000088128814,0.0000567056],"domain_scores_gemma":[0.9993162,0.0004522902,0.00007372093,0.000023908495,0.0001007957,0.000033110886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000891384,0.00062796025,0.0008410267,0.0006324632,0.00035965073,0.0007244401,0.00072237634,0.0009064996,0.0010435077],"category_scores_gemma":[0.0016168054,0.00046359905,0.00086066936,0.0006867589,0.0004390855,0.0004063809,0.00065950776,0.0006922329,0.00012115599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066936263,0.000007063106,0.00008981582,0.0000047820954,0.000005327014,0.000005956819,0.000004133439,0.99756694,0.00014049577,0.00049744255,0.000026669486,0.0016446656],"study_design_scores_gemma":[0.0000030774038,0.0000066902476,0.000019802654,0.0000010159849,0.0000015686932,0.0000012470339,0.0000014778772,0.99968266,0.000048584126,0.00018980846,0.00004338612,8.241746e-7],"about_ca_topic_score_codex":0.011990753,"about_ca_topic_score_gemma":0.006492368,"teacher_disagreement_score":0.011990753,"about_ca_system_score_codex":0.0009007865,"about_ca_system_score_gemma":0.0021676465,"threshold_uncertainty_score":0.023841918},"labels":[],"label_agreement":null},{"id":"W4411658927","doi":"10.51847/euu83dkotl","title":"10.51847/Euu83Dkotl","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Resource-Constrained Project Scheduling","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":"Workload; Computer science; Scheduling (production processes); Genetic algorithm; Mathematical optimization; Algorithm; Mathematics; Machine learning; Operating system","score_opus":0.043009864741671726,"score_gpt":0.293252597696873,"score_spread":0.2502427329552013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411658927","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019581171,0.00044633745,0.0065765623,0.00070442626,0.0005058771,0.00014049452,0.001793536,0.0025927755,0.985282],"genre_scores_gemma":[0.0055934656,0.00024446144,0.0025024114,0.0002999884,0.00006248525,0.00007906555,0.001515124,0.00042710855,0.9892758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963355,0.00004035969,0.000029611336,0.0000914998,0.0001149255,0.00009016993],"domain_scores_gemma":[0.99907184,0.00025546955,0.000052974847,0.00018967058,0.00024476196,0.00018521804],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00061137264,0.0009139285,0.00062579743,0.0020488726,0.0008416737,0.0024456147,0.0010552648,0.0027815346,0.9269946],"category_scores_gemma":[0.0012097446,0.0003402332,0.0004492255,0.0021242364,0.00054996833,0.0016960608,0.0017512678,0.00078398956,0.92206264],"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.00031340984,0.00021252835,0.00077726925,0.00032407447,0.000017609516,0.00021753699,0.00007598382,0.00072621054,0.0043335236,0.010934119,0.21239749,0.7696703],"study_design_scores_gemma":[0.0000489462,0.000055626784,0.00071871135,0.00013318071,0.0000117007885,0.00018542439,0.000070844006,0.0010733198,0.0016774335,0.0019054002,0.99410444,0.000014891916],"about_ca_topic_score_codex":0.0034853283,"about_ca_topic_score_gemma":0.0025030333,"teacher_disagreement_score":0.07300538,"about_ca_system_score_codex":0.00084117986,"about_ca_system_score_gemma":0.00055392575,"threshold_uncertainty_score":0.10413331},"labels":[],"label_agreement":null},{"id":"W4412992173","doi":"10.1139/cjce-2024-0470","title":"Repetitive project rescheduling study considering crew size","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","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":"National Natural Science Foundation of China","keywords":"Crew; Computer science; Engineering; Aeronautics; Transport engineering; Operations research; Operations management","score_opus":0.04920953982348847,"score_gpt":0.32868096736238134,"score_spread":0.27947142753889287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412992173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81377155,0.00045033608,0.17739289,0.00025858197,0.000036932273,0.00008862921,0.000079343736,0.00007047153,0.007851237],"genre_scores_gemma":[0.9920278,0.00012264519,0.006933201,0.000013010498,0.000008723613,0.000016748067,0.000024512758,0.000009298034,0.0008440707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931216,0.0002475851,0.000021221582,0.000117605865,0.0001445948,0.00015677813],"domain_scores_gemma":[0.9986802,0.00069933094,0.00019728827,0.00007779686,0.00023817396,0.00010718585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010964313,0.0004779509,0.00071253936,0.00049945695,0.0005091065,0.00065234915,0.0010756939,0.00065395265,0.0011526144],"category_scores_gemma":[0.0028958374,0.00026523863,0.0006236498,0.00065637566,0.00040994736,0.00087439356,0.00048209046,0.00057720067,0.000053792937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005927351,0.00006144161,0.001765138,0.0000608328,0.000030069046,0.00029497655,0.00005299453,0.98061323,0.002382515,0.0034092555,0.0002667889,0.011003502],"study_design_scores_gemma":[0.0000058944693,0.000078630415,0.00086631195,0.0000034113987,0.00001441086,0.00003783318,0.000071353265,0.99743444,0.00047270642,0.0008520713,0.00015701093,0.000005856345],"about_ca_topic_score_codex":0.015315089,"about_ca_topic_score_gemma":0.00785081,"teacher_disagreement_score":0.015315089,"about_ca_system_score_codex":0.0007883053,"about_ca_system_score_gemma":0.001342608,"threshold_uncertainty_score":0.030451894},"labels":[],"label_agreement":null},{"id":"W4413958624","doi":"10.5267/j.jpm.2025.7.002","title":"A learnheuristic method for solving resource constrained project scheduling problem","year":2025,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","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":"Computer science; Mathematical optimization; Nurse scheduling problem; Scheduling (production processes); Dynamic priority scheduling; Mathematics; Two-level scheduling; Schedule","score_opus":0.08649245206811407,"score_gpt":0.4337959241406147,"score_spread":0.3473034720725006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413958624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017103355,0.0008681332,0.9723727,0.00030644645,0.00012094749,0.0001691911,0.00018806139,0.00071994145,0.008151205],"genre_scores_gemma":[0.24792525,0.0011623917,0.73995817,0.0003533608,0.00010650559,0.0008796127,0.0007526371,0.00021920093,0.008643008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970263,0.00010287427,0.0000168036,0.000048370486,0.00008444326,0.00004483204],"domain_scores_gemma":[0.9996598,0.00019487304,0.000036651407,0.000017290195,0.000072361836,0.000019065923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006055399,0.0010570046,0.0009912872,0.0010546312,0.0004978924,0.00085639296,0.0010401292,0.0012917689,0.0034287795],"category_scores_gemma":[0.0011306432,0.00041924743,0.0013282918,0.0011562064,0.0003940069,0.0006012385,0.0006813136,0.0012309976,0.00052259257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061395,0.00011348558,0.00067207887,0.0002018757,0.000088025154,0.00013584182,0.000059907277,0.88891554,0.0017126279,0.008178895,0.002582388,0.09727799],"study_design_scores_gemma":[0.000024362394,0.00004553027,0.00013311765,0.000023851162,0.000015143525,0.000035185483,0.000019887497,0.994011,0.00045357848,0.00297868,0.0022525226,0.0000070320043],"about_ca_topic_score_codex":0.0064568175,"about_ca_topic_score_gemma":0.0065078326,"teacher_disagreement_score":0.0064568175,"about_ca_system_score_codex":0.00076651626,"about_ca_system_score_gemma":0.0015220759,"threshold_uncertainty_score":0.012838483},"labels":[],"label_agreement":null},{"id":"W4414424354","doi":"10.1007/s00500-025-10922-3","title":"A Bi-objective mathematical model for resource constrained project scheduling problem: formulation and metaheuristics","year":2025,"lang":"en","type":"article","venue":"Soft Computing","topic":"Resource-Constrained Project Scheduling","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":"Dalhousie University","funders":"","keywords":"Metaheuristic; Pareto principle; Job shop scheduling; Evolutionary algorithm; Scheduling (production processes); Multi-objective optimization; Benchmark (surveying); Constraint programming; Sorting","score_opus":0.09119156281922379,"score_gpt":0.39098690471113234,"score_spread":0.29979534189190854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414424354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011874085,0.00079916586,0.97300434,0.00063937204,0.00011177634,0.00017837381,0.0005268422,0.00016994774,0.012696128],"genre_scores_gemma":[0.5342027,0.002636995,0.4334293,0.00042265048,0.00020796474,0.0019200827,0.0011061322,0.00020659956,0.02586762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987704,0.00048167174,0.000061022518,0.00019567003,0.00034862797,0.00014253691],"domain_scores_gemma":[0.9988776,0.00062259944,0.00017732181,0.000044935812,0.0002113305,0.00006620978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021950044,0.0018329665,0.0023378693,0.0018170843,0.00077011005,0.0032281976,0.0027092772,0.0031675429,0.00535453],"category_scores_gemma":[0.002773809,0.0012846942,0.0014213414,0.0042756763,0.0009786218,0.0020722758,0.0014155869,0.0026194917,0.0010006055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013989245,0.00003219953,0.00007148214,0.00005735202,0.000020245681,0.00003527329,0.000011264466,0.986102,0.00026969364,0.009395577,0.00046621793,0.0035247565],"study_design_scores_gemma":[0.0000053743897,0.000010162478,0.000031314674,0.0000054983934,0.0000058434894,0.0000087507005,0.000004764239,0.9976405,0.00005946307,0.0019306657,0.0002941089,0.0000035381966],"about_ca_topic_score_codex":0.010215783,"about_ca_topic_score_gemma":0.008756486,"teacher_disagreement_score":0.010215783,"about_ca_system_score_codex":0.0019190054,"about_ca_system_score_gemma":0.0026222027,"threshold_uncertainty_score":0.020312667},"labels":[],"label_agreement":null},{"id":"W4415764117","doi":"10.29173/mocs311","title":"Activity Sequencing Optimization in Petroleum Projects Using Simulation Modeling","year":2025,"lang":"","type":"article","venue":"Modular and Offsite Construction (MOC) Summit Proceedings","topic":"Resource-Constrained Project Scheduling","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":"Refinery; Scheduling (production processes); Upgrade; Simulation-based optimization; Baseline (sea); Interdependence; Simulation modeling; Task (project management)","score_opus":0.07642454252690692,"score_gpt":0.3343477742731084,"score_spread":0.25792323174620146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27697197,0.00034536875,0.7047203,0.00035291264,0.000033395812,0.00021173536,0.0003875695,0.00053674565,0.016440067],"genre_scores_gemma":[0.92678696,0.0003647662,0.06956714,0.000036769845,0.00000830559,0.00028557063,0.0002535905,0.000057261917,0.0026397533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.00021129,0.000015615373,0.000035935966,0.000056944777,0.00004403],"domain_scores_gemma":[0.9990478,0.0007158594,0.00009308205,0.00003033117,0.00007938666,0.000033412245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753053,0.00067835336,0.0006247379,0.0005346065,0.00033917357,0.0008200899,0.00060837326,0.00058797013,0.0013347422],"category_scores_gemma":[0.0016723999,0.00044276813,0.00068755326,0.00060408266,0.00043892502,0.0005011029,0.00054952345,0.0005575279,0.0001242243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006423081,0.000004864954,0.0001166228,0.0000033699196,0.0000023753798,0.0000036103413,0.000004189479,0.9986339,0.00007501981,0.00057314476,0.00001564635,0.0005607927],"study_design_scores_gemma":[0.0000028165828,0.000005252333,0.000033242715,0.0000015924456,0.0000014868048,0.0000010147592,0.0000029576115,0.99946064,0.00008573634,0.00029972306,0.000104328334,0.0000012458548],"about_ca_topic_score_codex":0.023334557,"about_ca_topic_score_gemma":0.014923297,"teacher_disagreement_score":0.023334557,"about_ca_system_score_codex":0.0014370682,"about_ca_system_score_gemma":0.0019567106,"threshold_uncertainty_score":0.046397507},"labels":[],"label_agreement":null},{"id":"W4415994659","doi":"10.2139/ssrn.5712098","title":"Adaptive job scheduling and resource allocation using digital twin and deep reinforcement learning method","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Resource-Constrained Project Scheduling","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 Alberta","funders":"","keywords":"Reinforcement learning; Scheduling (production processes); Markov decision process; Resource allocation; Job scheduler; Process (computing); Markov process; Dynamic priority scheduling","score_opus":0.04495937040205105,"score_gpt":0.35043781192089823,"score_spread":0.3054784415188472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415994659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050410997,0.0003051847,0.94574106,0.00034834276,0.000116159616,0.000032516327,0.000056513927,0.00033472077,0.002654548],"genre_scores_gemma":[0.90044117,0.00013044612,0.09602623,0.00015501073,0.000050658404,0.00008022119,0.0000800113,0.00004562673,0.0029906654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964416,0.0000975656,0.000017764678,0.0000892946,0.00007712474,0.00007410355],"domain_scores_gemma":[0.9984388,0.000908706,0.00013404015,0.000109211076,0.00026954655,0.00013969123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283517,0.0005527431,0.0009893993,0.00047343533,0.00032281142,0.0008990728,0.0012844647,0.0010847992,0.0024351105],"category_scores_gemma":[0.0044475896,0.00049534306,0.00040599465,0.0005513965,0.000828711,0.0012889729,0.0011043735,0.0014119335,0.00024245512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011634792,0.000062137784,0.0005339499,0.000039449445,0.000028260574,0.000026617156,0.00002018015,0.95692974,0.0011408465,0.006409941,0.00061363954,0.03407889],"study_design_scores_gemma":[0.0000028853885,0.000005056583,0.000023839923,9.042062e-7,0.0000014847525,0.0000013831459,8.6224435e-7,0.9988562,0.00007751061,0.0009983993,0.000030636038,9.356022e-7],"about_ca_topic_score_codex":0.006156956,"about_ca_topic_score_gemma":0.0053797127,"teacher_disagreement_score":0.006156956,"about_ca_system_score_codex":0.00105833,"about_ca_system_score_gemma":0.0015682464,"threshold_uncertainty_score":0.012242198},"labels":[],"label_agreement":null},{"id":"W4416893855","doi":"10.1111/mice.70175","title":"Time–cost combined optimization in planning infrastructure construction projects under environment induced time‐window constraints","year":2025,"lang":"en","type":"article","venue":"Computer-Aided Civil and Infrastructure Engineering","topic":"Resource-Constrained Project Scheduling","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":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Scheduling (production processes); Bridge (graph theory); Project planning; Function (biology); Project management; Schedule; Reduction (mathematics); Integrated business planning","score_opus":0.016344342378185467,"score_gpt":0.25696837244529097,"score_spread":0.2406240300671055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416893855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104731575,0.0004561951,0.88845986,0.00017896378,0.000037040398,0.00022611061,0.00013046328,0.00013785584,0.005641986],"genre_scores_gemma":[0.8331598,0.00045609474,0.16253288,0.000044711138,0.000025925683,0.00050582504,0.00014743138,0.00007654709,0.0030507178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984359,0.0008301442,0.00005860423,0.00014587921,0.00033430094,0.00019513666],"domain_scores_gemma":[0.9973558,0.0020903458,0.000203932,0.00007215775,0.0001811406,0.000096652824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002720076,0.0009984091,0.0012072168,0.0012639837,0.00040355694,0.0013800077,0.00085236813,0.00090659637,0.002223498],"category_scores_gemma":[0.0053259674,0.0008586445,0.0008247481,0.001680997,0.0007615108,0.0016900308,0.00085900084,0.00095527124,0.00016533196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000173916,0.000011539893,0.00013532242,0.00000825732,0.0000084943,0.000007728965,0.0000060095217,0.99571675,0.00010550113,0.0013241391,0.000025838981,0.0026329998],"study_design_scores_gemma":[0.000004066852,0.00002697335,0.00010855425,0.0000028861516,0.000005947967,0.000003168252,0.000007691943,0.99832314,0.00013936369,0.0012642583,0.00011140953,0.0000025835425],"about_ca_topic_score_codex":0.01148461,"about_ca_topic_score_gemma":0.012165957,"teacher_disagreement_score":0.01148461,"about_ca_system_score_codex":0.0016280017,"about_ca_system_score_gemma":0.0021385541,"threshold_uncertainty_score":0.022835553},"labels":[],"label_agreement":null},{"id":"W4417229414","doi":"10.1061/9780784486115.025","title":"Dynamic Allocation of Unionized Skilled Trades in Multi-Project Reactive Scheduling Context: Uber-Inspired Application Framework","year":2025,"lang":"","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scheduling (production processes); Idle; Work (physics); Resource allocation; Service (business); Decision support system; Project management","score_opus":0.05524295006901332,"score_gpt":0.40148552788495506,"score_spread":0.34624257781594175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417229414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053582467,0.00038374803,0.9348221,0.00036378525,0.00004936003,0.00011543818,0.00011548222,0.00076024735,0.009807432],"genre_scores_gemma":[0.6605291,0.00051499996,0.33287066,0.0000995046,0.000045551315,0.00015537991,0.00016024799,0.000094419716,0.005530098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993474,0.0002129683,0.000031302414,0.00014073176,0.00013228571,0.0001352786],"domain_scores_gemma":[0.99956805,0.00018886893,0.0000653524,0.000044897835,0.000067266265,0.00006556601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014536647,0.0005008603,0.000648882,0.0005194534,0.00057041465,0.0015021153,0.0018782807,0.0011246932,0.0023427722],"category_scores_gemma":[0.001525132,0.00028538378,0.00056683406,0.00068823766,0.00054676406,0.0008659872,0.0013173787,0.00065505516,0.00027442747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006361083,0.0000747756,0.0006149498,0.000062648774,0.00002034548,0.00020138742,0.00012234981,0.9427416,0.0020750363,0.027674142,0.00092329475,0.025425803],"study_design_scores_gemma":[0.0000038291428,0.000012656246,0.00006178774,0.0000026702728,0.0000030762099,0.000015875232,0.000019806375,0.99665666,0.00019797134,0.0021998598,0.0008230022,0.0000027559827],"about_ca_topic_score_codex":0.006638452,"about_ca_topic_score_gemma":0.007166442,"teacher_disagreement_score":0.006638452,"about_ca_system_score_codex":0.0009985227,"about_ca_system_score_gemma":0.0010556892,"threshold_uncertainty_score":0.013199568},"labels":[],"label_agreement":null},{"id":"W4417240584","doi":"10.5267/j.jpm.2025.9.003","title":"Introduction to the multi-skilled resource constrained multi project and multi type scheduling problem","year":2025,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Resource-Constrained Project Scheduling","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":"Scheduling (production processes); Dynamic priority scheduling; Fair-share scheduling; Job shop scheduling; Heuristic; Rate-monotonic scheduling","score_opus":0.08290173135990164,"score_gpt":0.3948822512101021,"score_spread":0.3119805198502005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417240584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009162,0.00283598,0.96109444,0.0021542327,0.0005341618,0.0004608332,0.001543614,0.00017124324,0.022043524],"genre_scores_gemma":[0.1473222,0.0055725896,0.8330015,0.00077101734,0.0008349447,0.0010527226,0.0013256957,0.00012180235,0.00999757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974452,0.0012656637,0.00014051374,0.0005298411,0.0004524112,0.00016628245],"domain_scores_gemma":[0.99630886,0.002736655,0.0003098549,0.00018519493,0.00029777887,0.00016165656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024856878,0.0014381277,0.001120902,0.0012642352,0.0007465062,0.0016720601,0.0016348796,0.002041348,0.009186781],"category_scores_gemma":[0.003854045,0.00062432716,0.0014521712,0.0035942257,0.0011691756,0.0015076553,0.0012805674,0.0035173215,0.0010683439],"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.000121431825,0.0004302905,0.0016411489,0.0011457405,0.000117228636,0.0005365396,0.00021495124,0.6524471,0.0017934133,0.19405898,0.019367851,0.12812538],"study_design_scores_gemma":[0.00009077266,0.00028244508,0.0015335002,0.00023920016,0.000048236263,0.0006585537,0.00018328713,0.7404228,0.0010349518,0.1783576,0.077067316,0.00008126493],"about_ca_topic_score_codex":0.0047446527,"about_ca_topic_score_gemma":0.0046175933,"teacher_disagreement_score":0.009186781,"about_ca_system_score_codex":0.00164539,"about_ca_system_score_gemma":0.002930901,"threshold_uncertainty_score":0.03073281},"labels":[],"label_agreement":null},{"id":"W6891661904","doi":"10.4230/lipics.cp.2024.30","title":"Learning Precedences for Scheduling Problems with Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Resource-Constrained Project Scheduling","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":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; European Commission; Institut de Valorisation des Données; Polytechnique Montréal","keywords":"Leverage (statistics); Scheduling (production processes); Artificial neural network; Graph; Job shop scheduling; Dynamic priority scheduling","score_opus":0.03480361908635707,"score_gpt":0.3029718832723857,"score_spread":0.2681682641860287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891661904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06810457,0.0012276792,0.9234743,0.0009831357,0.00013039303,0.00012914384,0.00040916883,0.00095245993,0.004589071],"genre_scores_gemma":[0.7310718,0.0010676708,0.2619336,0.0003884787,0.00013450121,0.00032669413,0.0011265322,0.00015451334,0.0037962277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952984,0.00016984162,0.000036908572,0.00012027482,0.000077490135,0.00006566325],"domain_scores_gemma":[0.99629635,0.0029563694,0.00028121515,0.00009485171,0.0002600815,0.00011108129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013231138,0.0014402543,0.0007967087,0.0013814067,0.0004910703,0.0009577505,0.0010869018,0.0011738121,0.0026290007],"category_scores_gemma":[0.008016641,0.00079074595,0.00075996306,0.0013247391,0.0006953073,0.001828848,0.0009612142,0.0022777412,0.00026219132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032662574,0.00003525,0.00038594598,0.000038699975,0.000010733064,0.00001542806,0.000012522366,0.9735931,0.0001469825,0.0034600876,0.0004887721,0.021779828],"study_design_scores_gemma":[0.0000039920365,0.0000045941133,0.000029146164,0.0000035011888,0.0000017307646,0.0000016536947,0.0000020595544,0.99498063,0.00005120734,0.004847409,0.000073088784,0.0000010146384],"about_ca_topic_score_codex":0.016391927,"about_ca_topic_score_gemma":0.021412432,"teacher_disagreement_score":0.016391927,"about_ca_system_score_codex":0.001975083,"about_ca_system_score_gemma":0.001924548,"threshold_uncertainty_score":0.03259307},"labels":[],"label_agreement":null},{"id":"W6891677303","doi":"10.4230/lipics.cp.2024.7","title":"Cumulative Scheduling with Calendars and Overtime","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Resource-Constrained Project Scheduling","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":"Overtime; Constraint (computer-aided design); Scheduling (production processes); Task (project management); Duration (music); Resource constraints; Constraint programming; Time constraint; Decomposition","score_opus":0.06126456549689985,"score_gpt":0.367827641617658,"score_spread":0.30656307612075817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891677303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12783487,0.0013957125,0.8422693,0.00077501324,0.00050167553,0.00037674443,0.0018162337,0.0017521539,0.023278264],"genre_scores_gemma":[0.76891017,0.00066645583,0.21912175,0.00020122313,0.00020525554,0.0002717973,0.0013819654,0.0003773706,0.008863987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985455,0.00033587485,0.00012840591,0.0003215073,0.00036534952,0.00030335056],"domain_scores_gemma":[0.99611086,0.0014814099,0.00066096743,0.00072917267,0.00045291445,0.0005647206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016000461,0.0010568917,0.0007945804,0.0008865606,0.00077760045,0.0018689388,0.0018275452,0.0005709888,0.0072076074],"category_scores_gemma":[0.0055906144,0.00047399843,0.00086933136,0.0022240016,0.00073890015,0.0022830854,0.0015197037,0.0014943925,0.0006282862],"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.0005755228,0.00021371878,0.0036537673,0.0006255737,0.000099804485,0.00039941294,0.0002775008,0.7044702,0.0080699865,0.11295775,0.009292649,0.15936406],"study_design_scores_gemma":[0.00012210966,0.00045348366,0.0023419901,0.00011632998,0.000096256255,0.0002966519,0.00019847024,0.8734995,0.008001403,0.06893618,0.04584733,0.00009028514],"about_ca_topic_score_codex":0.008328726,"about_ca_topic_score_gemma":0.011203205,"teacher_disagreement_score":0.008328726,"about_ca_system_score_codex":0.0011406791,"about_ca_system_score_gemma":0.003661309,"threshold_uncertainty_score":0.024111807},"labels":[],"label_agreement":null},{"id":"W6910399977","doi":"10.4230/lipics.cp.2022.10","title":"A Constraint Programming Approach to Ship Refit Project Scheduling","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Resource-Constrained Project Scheduling","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":"Université Laval; Thales (Canada)","funders":"","keywords":"Constraint programming; Scheduling (production processes); Project management; Baseline (sea); Speedup; Heuristic; Plan (archaeology); Work order; Constraint (computer-aided design)","score_opus":0.12577343677338768,"score_gpt":0.37385547381011147,"score_spread":0.2480820370367238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910399977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028592667,0.0006508089,0.9867732,0.00056979933,0.00008269034,0.00019964714,0.00042188083,0.00017235233,0.008270466],"genre_scores_gemma":[0.06598839,0.0017322925,0.92721844,0.00021781372,0.00012520615,0.0005959417,0.00047054584,0.0001142172,0.003537194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808323,0.0008304317,0.00012501681,0.00030167188,0.0004944048,0.00016522218],"domain_scores_gemma":[0.9969863,0.0022888437,0.00016338404,0.00010032391,0.0003612496,0.000099731325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021365313,0.0016875805,0.001051929,0.0015477703,0.0010655898,0.0026175005,0.0023095445,0.0013436364,0.005246847],"category_scores_gemma":[0.004746916,0.0010547332,0.0018630107,0.0040293443,0.0011923596,0.0014939522,0.0011521989,0.0032227766,0.00059721747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023838964,0.000058917656,0.00017244251,0.00018319493,0.0000553581,0.00010876239,0.00007533664,0.91628283,0.00051157194,0.049800944,0.0025631366,0.030163635],"study_design_scores_gemma":[0.000026619091,0.00002990748,0.000094493735,0.000053128504,0.000021757696,0.00004720302,0.000045126228,0.96063405,0.00041516204,0.02956798,0.009045004,0.00001958048],"about_ca_topic_score_codex":0.031571884,"about_ca_topic_score_gemma":0.03026054,"teacher_disagreement_score":0.031571884,"about_ca_system_score_codex":0.0022264842,"about_ca_system_score_gemma":0.0039821756,"threshold_uncertainty_score":0.06277627},"labels":[],"label_agreement":null},{"id":"W6911994253","doi":"10.5281/zenodo.15226095","title":"Example Production Schedule","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Resource-Constrained Project Scheduling","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":"Schedule; Production (economics); Production schedule; Publishing; Scheduling (production processes); Information system","score_opus":0.14088198982466676,"score_gpt":0.35089123007366785,"score_spread":0.21000924024900108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911994253","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012231683,0.00059368374,0.14747177,0.0017996522,0.0010083213,0.0039878055,0.085889734,0.012086299,0.7349311],"genre_scores_gemma":[0.10955274,0.001963984,0.28184417,0.00053395214,0.00015709765,0.0028525353,0.108690105,0.004907682,0.4894978],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991234,0.00012894053,0.00003842299,0.00008206313,0.00050176994,0.00012539832],"domain_scores_gemma":[0.99810517,0.0004601185,0.00007349367,0.00023289911,0.0009578258,0.00017039264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967524,0.0011541409,0.00046835377,0.0018617795,0.0012027365,0.0019716234,0.0013396963,0.0008825055,0.24878189],"category_scores_gemma":[0.0031964565,0.0006588974,0.0006082736,0.0033388692,0.000367616,0.0007099051,0.0006314269,0.0006658981,0.06651117],"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.0007786538,0.0002305554,0.0008505973,0.0010563711,0.000022887236,0.0010120898,0.00026618288,0.050231896,0.01044571,0.034564637,0.69589615,0.2046442],"study_design_scores_gemma":[0.00012281969,0.00011157389,0.0013535372,0.00013951154,0.000017097818,0.00021878611,0.00022818972,0.013298371,0.004857157,0.010112487,0.96949023,0.000050195657],"about_ca_topic_score_codex":0.077447005,"about_ca_topic_score_gemma":0.07636006,"teacher_disagreement_score":0.24878189,"about_ca_system_score_codex":0.0033876353,"about_ca_system_score_gemma":0.006888147,"threshold_uncertainty_score":0.83225834},"labels":[],"label_agreement":null},{"id":"W6925173897","doi":"10.15468/dl.yaqyuk","title":"Occurrence Download","year":2019,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Resource-Constrained Project Scheduling","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":"Range (aeronautics); Apidae; Synapomorphy; Matching (statistics)","score_opus":0.07232802384225913,"score_gpt":0.31534414743051525,"score_spread":0.24301612358825614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925173897","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061489205,0.00006684834,0.00012478187,0.00006316224,0.0000341354,0.000012885937,0.9955798,0.0017974443,0.002259527],"genre_scores_gemma":[0.00025006954,0.00008555665,0.0005951548,0.000103764134,0.000009835744,0.0000567239,0.9969741,0.0004599397,0.0014648489],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988084,0.00013312433,0.00016835202,0.0004336501,0.00025302992,0.0002034916],"domain_scores_gemma":[0.99771476,0.00059126643,0.0001700734,0.0005812182,0.000608892,0.0003338824],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079696754,0.0026343823,0.0022351334,0.0066503393,0.0012897803,0.0036881124,0.0025589229,0.002466564,0.33849815],"category_scores_gemma":[0.0055568167,0.0009703809,0.0018500393,0.010542617,0.00040298913,0.0033459968,0.0037104986,0.002133581,0.43456247],"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.000052328123,0.000017105034,0.00030105351,0.00066959724,0.000014902098,0.000023189461,0.00002908477,0.00012345269,0.000121725374,0.0004914078,0.99437344,0.003782698],"study_design_scores_gemma":[0.00007678514,0.000011938107,0.001234471,0.00017395445,0.000015407815,0.000046120473,0.000079264355,0.00027063527,0.00014996898,0.001052816,0.9968658,0.000022817556],"about_ca_topic_score_codex":0.022022568,"about_ca_topic_score_gemma":0.036260966,"teacher_disagreement_score":0.6615019,"about_ca_system_score_codex":0.0015719172,"about_ca_system_score_gemma":0.0026491524,"threshold_uncertainty_score":0.94355214},"labels":[],"label_agreement":null},{"id":"W6944151762","doi":"10.17632/b78bc94d95.1","title":"Real operational data for the Concrete Delivery Problem","year":2023,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Resource-Constrained Project Scheduling","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":"Université de Sherbrooke","funders":"","keywords":"Raw data; Benchmarking; Production (economics); Real-time data; Real world data; Information system","score_opus":0.15039188844930884,"score_gpt":0.38418578019663774,"score_spread":0.2337938917473289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944151762","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01603499,0.00047986407,0.0006846989,0.00049400504,0.00011345407,0.000102113394,0.97819775,0.000988866,0.0029042773],"genre_scores_gemma":[0.011887045,0.00015482123,0.0015039886,0.00008556884,0.000015208474,0.000108385684,0.9852899,0.000052775584,0.000902262],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856,0.00018270485,0.00012098601,0.0003603482,0.0004871335,0.00028886902],"domain_scores_gemma":[0.99717987,0.0005894315,0.00016884982,0.0005206382,0.0011952139,0.00034596567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882957,0.0022777922,0.0010774938,0.0027232377,0.0011578581,0.0014815694,0.0031451732,0.0021126964,0.009495104],"category_scores_gemma":[0.0044776485,0.00046394803,0.0011905511,0.00785944,0.00086513895,0.00071286503,0.0008932452,0.002244023,0.006678155],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029461033,0.00055361056,0.008329154,0.0009793539,0.00013953098,0.0003093514,0.000108451175,0.02295535,0.0007215335,0.0019402473,0.9506798,0.012989083],"study_design_scores_gemma":[0.0007747568,0.00020355766,0.08118832,0.00048956356,0.00012173881,0.0004552248,0.0010887301,0.06593982,0.0025685553,0.003964251,0.8430271,0.00017838781],"about_ca_topic_score_codex":0.51824003,"about_ca_topic_score_gemma":0.62188447,"teacher_disagreement_score":0.51824003,"about_ca_system_score_codex":0.0076152585,"about_ca_system_score_gemma":0.0071111526,"threshold_uncertainty_score":0.9691943},"labels":[],"label_agreement":null},{"id":"W7007900798","doi":"","title":"Agribusiness Students Win National Case Study Competition","year":2003,"lang":"en","type":"article","venue":"DigitalCommons@CalPoly","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":0,"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":"Stanford Graduate School of Business; University of Alberta","keywords":"Agribusiness; Competition (biology); Quality (philosophy); Scale (ratio); Market competition","score_opus":0.15429079270602253,"score_gpt":0.42867585507148354,"score_spread":0.274385062365461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007900798","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7187674,0.00010431764,0.0025595487,0.006536869,0.00027797723,0.00042267833,0.00055518834,0.00018323374,0.27059266],"genre_scores_gemma":[0.81128687,0.00013382339,0.004482242,0.000662338,0.000050422383,0.00020272605,0.0006754227,0.00006195521,0.18244424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998955,0.00029488088,0.000028120548,0.00012916887,0.00027691695,0.00031590604],"domain_scores_gemma":[0.9967417,0.00074131216,0.000077477205,0.00019618611,0.00055869203,0.0016846068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024581638,0.0003475308,0.00037717776,0.000704457,0.0064536827,0.002503949,0.0007739802,0.0014763128,0.0511844],"category_scores_gemma":[0.0032055108,0.00021323269,0.00028173253,0.0011466809,0.0006582355,0.0008875892,0.0016661913,0.001692857,0.0043320223],"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.004719683,0.022801219,0.04447079,0.00023775722,0.000103855054,0.0039605536,0.009429892,0.016684368,0.006063228,0.08516886,0.46871817,0.33764148],"study_design_scores_gemma":[0.00077774754,0.005232619,0.048396796,0.00013134225,0.00004952838,0.00065208995,0.049031094,0.046102524,0.0073127383,0.026086198,0.81611097,0.000116339594],"about_ca_topic_score_codex":0.01019754,"about_ca_topic_score_gemma":0.08495176,"teacher_disagreement_score":0.0511844,"about_ca_system_score_codex":0.0028755933,"about_ca_system_score_gemma":0.004509795,"threshold_uncertainty_score":0.17122889},"labels":[],"label_agreement":null},{"id":"W7007906938","doi":"","title":"Ant colony algorithms for minimizing costs in multi-mode resource constrained project scheduling problems with spatial constraints","year":2024,"lang":"en","type":"article","venue":"idUS (Universidad de Sevilla)","topic":"Resource-Constrained Project Scheduling","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":"Licensee; Scheduling (production processes); Ant colony optimization algorithms; Resource constraints; Job shop scheduling; Resource (disambiguation); Minification","score_opus":0.09377337398023551,"score_gpt":0.38509727374963454,"score_spread":0.29132389976939904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007906938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05682269,0.0011785089,0.92788464,0.0005962695,0.00011598856,0.00018979871,0.00017572203,0.00034547926,0.012690905],"genre_scores_gemma":[0.63174206,0.0009853225,0.3549635,0.0001524072,0.00007175908,0.00046887188,0.00025912264,0.00017340321,0.011183502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994485,0.00027957282,0.000020098916,0.000060314836,0.00011994775,0.00007145637],"domain_scores_gemma":[0.99868757,0.0009567181,0.000117014984,0.000037166632,0.00012361344,0.000077962766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009273,0.00093530514,0.000943961,0.0009003978,0.00045856152,0.0010288404,0.0011672176,0.0010325133,0.0026945996],"category_scores_gemma":[0.0027676392,0.0005117818,0.00048358418,0.0012775704,0.000571423,0.0008587369,0.0009308715,0.0010167127,0.0004025209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036840724,0.000030395931,0.00020298142,0.000042631294,0.000028727261,0.000029210109,0.000022552716,0.9765738,0.0003073598,0.0053847386,0.0008051817,0.016535522],"study_design_scores_gemma":[0.000011738911,0.000014617407,0.00004171855,0.0000054329344,0.000004599901,0.000006543266,0.000008469053,0.99620456,0.000077121345,0.0032868884,0.0003359999,0.0000022294846],"about_ca_topic_score_codex":0.010640899,"about_ca_topic_score_gemma":0.011610445,"teacher_disagreement_score":0.010640899,"about_ca_system_score_codex":0.0009123181,"about_ca_system_score_gemma":0.0013965047,"threshold_uncertainty_score":0.02115792},"labels":[],"label_agreement":null},{"id":"W7009852446","doi":"","title":"A FRAMEWORK FOR SPATIO-TEMPORAL UNCERTAINTY-AWARE SCHEDULING AND CONTROL OF LINEAR PROJECTS","year":2016,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Resource-Constrained Project Scheduling","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":"McMaster University","keywords":"Scheduling (production processes); Linear programming; Workspace; Duration (music); Linear model; Constrained optimization","score_opus":0.05198579701352941,"score_gpt":0.31431182731170954,"score_spread":0.26232603029818014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009852446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031798799,0.00014846357,0.99363977,0.00009943657,0.00003522118,0.00003843421,0.000043027896,0.00010460582,0.0027112872],"genre_scores_gemma":[0.6909485,0.00086251786,0.30147198,0.000098596196,0.00014224523,0.00060391007,0.00018625901,0.0000658669,0.0056200824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989937,0.00021809663,0.000055624743,0.00025162112,0.0003378317,0.00014312337],"domain_scores_gemma":[0.99918073,0.000343101,0.00015906159,0.000038587914,0.00020328944,0.00007518454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017976441,0.0010834009,0.0010390838,0.0006878056,0.00081237784,0.00210648,0.0022570707,0.0012457642,0.0018940874],"category_scores_gemma":[0.0019401348,0.0005476583,0.0013337662,0.00079971354,0.0014274252,0.0012827824,0.0016069853,0.0015484742,0.0002478458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019591804,0.000017306978,0.00009496398,0.000046397043,0.000016091482,0.000067438,0.00007214055,0.9468926,0.001025016,0.044068366,0.00037007203,0.0073099737],"study_design_scores_gemma":[0.0000056239674,0.000023641618,0.000041516756,0.000007363773,0.00000619801,0.0000074064183,0.00001268036,0.992486,0.00016251678,0.0064264648,0.0008130761,0.0000073877454],"about_ca_topic_score_codex":0.023259178,"about_ca_topic_score_gemma":0.013565678,"teacher_disagreement_score":0.023259178,"about_ca_system_score_codex":0.0020383932,"about_ca_system_score_gemma":0.0031502978,"threshold_uncertainty_score":0.046247542},"labels":[],"label_agreement":null},{"id":"W7105982770","doi":"10.7939/83219","title":"Advancing Construction Planning in Remote Regions: A Stochastic Time-Window Framework for Schedule and Cost Efficiency","year":2025,"lang":"en","type":"dissertation","venue":"University of Alberta Library","topic":"Resource-Constrained Project Scheduling","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":"Schedule; Critical path method; Scheduling (production processes); Context (archaeology); Stochastic programming; Duration (music); Stochastic modelling; Resource (disambiguation)","score_opus":0.023256634852224546,"score_gpt":0.294626563504588,"score_spread":0.2713699286523634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105982770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004587393,0.0003977498,0.99147815,0.00016565902,0.000038676128,0.00005878695,0.00008032756,0.000097001895,0.0030962436],"genre_scores_gemma":[0.44482276,0.002626032,0.54314333,0.00012445911,0.00022614884,0.0007408975,0.00045241805,0.00038017426,0.0074837417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812096,0.00079927256,0.00008423154,0.0002939765,0.00044686874,0.00025464437],"domain_scores_gemma":[0.9973117,0.0017009416,0.0003374013,0.00013498258,0.0002980536,0.00021695008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004285206,0.0019535192,0.0017135695,0.0013567946,0.0007016149,0.0023019484,0.0024699057,0.00133297,0.0059561147],"category_scores_gemma":[0.0063128034,0.0012752411,0.0020159034,0.001752869,0.0015247326,0.0028317284,0.0018684149,0.0027714046,0.0006513529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025598803,0.000023279674,0.0001738081,0.0000569455,0.000020648462,0.00004111935,0.00004405883,0.9437707,0.00039732328,0.04808966,0.00037382386,0.006982987],"study_design_scores_gemma":[0.000008866917,0.000028511247,0.00007422387,0.000014859929,0.000012934784,0.000010544636,0.000013550807,0.97998893,0.0001325515,0.01867475,0.0010316749,0.0000086722675],"about_ca_topic_score_codex":0.012047819,"about_ca_topic_score_gemma":0.0076039797,"teacher_disagreement_score":0.012047819,"about_ca_system_score_codex":0.002211421,"about_ca_system_score_gemma":0.003127391,"threshold_uncertainty_score":0.023955405},"labels":[],"label_agreement":null},{"id":"W7115034188","doi":"","title":"Capacity Planning Optimization Integrating Cut-Off Grade and Block Sequencing Under Economies of Scale, Cost Structures, and Grade Distribution Considerations","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Resource-Constrained Project Scheduling","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Capacity planning; Block (permutation group theory); Distribution (mathematics); Economies of scale; Sequence (biology)","score_opus":0.08109999520239963,"score_gpt":0.3243761806181061,"score_spread":0.24327618541570645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115034188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116536774,0.0016688695,0.847925,0.0010304032,0.000108919114,0.00040357516,0.0006398413,0.00033269828,0.03135388],"genre_scores_gemma":[0.86815584,0.001277992,0.12037949,0.00013532939,0.0000342663,0.0004751356,0.0004307536,0.00014544543,0.008965759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990637,0.0003140413,0.000037456022,0.00017391786,0.00018400911,0.00022703617],"domain_scores_gemma":[0.99850273,0.00088830723,0.0001790721,0.00005388716,0.0002260344,0.00014998623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908044,0.0013734493,0.0016843885,0.0012319349,0.00070725335,0.0022797892,0.0011378564,0.0014450689,0.004925438],"category_scores_gemma":[0.0034493085,0.0009558015,0.0011799515,0.0014360148,0.0010191659,0.0019217472,0.0015695146,0.0016659112,0.00033744256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031324966,0.000016834501,0.000272198,0.000060630307,0.000018417459,0.00006977514,0.00002392624,0.9878905,0.00039127117,0.0056401407,0.0003970195,0.0051879096],"study_design_scores_gemma":[0.000010290647,0.000043254855,0.0002596826,0.000017956572,0.000014008218,0.00002253694,0.000041809926,0.99126536,0.00025340499,0.0073622647,0.00070033316,0.000009141795],"about_ca_topic_score_codex":0.016727919,"about_ca_topic_score_gemma":0.011298866,"teacher_disagreement_score":0.016727919,"about_ca_system_score_codex":0.0022203,"about_ca_system_score_gemma":0.0035286457,"threshold_uncertainty_score":0.03326112},"labels":[],"label_agreement":null},{"id":"W7117306328","doi":"10.1016/j.procs.2025.12.089","title":"Use of graph network and hybrid simulation to understand schedule resiliency and capacity under disruptions","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Resource-Constrained Project Scheduling","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":"Royal Military College Saint-Jean; University of Alberta","funders":"","keywords":"Interdependence; Schedule; Resource (disambiguation); Scheduling (production processes); Identification (biology); Workstation; Exploit; Supply chain","score_opus":0.1378214207620819,"score_gpt":0.37371096692076466,"score_spread":0.23588954615868277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117306328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3671365,0.0006037365,0.60322475,0.0007957225,0.00011300607,0.00019843626,0.0009778839,0.0011094656,0.025840504],"genre_scores_gemma":[0.9552258,0.00033658333,0.04164445,0.000053813543,0.000017631584,0.00013475632,0.00029880807,0.00007823025,0.0022097507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997507,0.000116010364,0.00000867707,0.000038681166,0.000041657,0.000044191547],"domain_scores_gemma":[0.99864405,0.001049147,0.00010730757,0.000059227645,0.000080524784,0.000059853664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120443,0.00087036577,0.0005026876,0.0014387374,0.0004163859,0.00091775064,0.0007916877,0.0008341268,0.0021722866],"category_scores_gemma":[0.0020735147,0.00040154706,0.0007012309,0.000984399,0.0007714248,0.0009146529,0.0006936901,0.00053887395,0.00013781329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007241071,0.000004576234,0.00018989021,0.0000036146553,0.000005237649,0.000008005128,0.00000623556,0.9977763,0.00008234562,0.001366146,0.000031087304,0.0005193805],"study_design_scores_gemma":[0.0000016507626,0.0000028777733,0.000053326035,9.927238e-7,0.00000147159,0.0000014848357,0.000004682161,0.99871504,0.000036735793,0.0010997127,0.00008070434,0.0000012750363],"about_ca_topic_score_codex":0.034529366,"about_ca_topic_score_gemma":0.023564992,"teacher_disagreement_score":0.034529366,"about_ca_system_score_codex":0.002058348,"about_ca_system_score_gemma":0.0011298351,"threshold_uncertainty_score":0.06865674},"labels":[],"label_agreement":null},{"id":"W7127892449","doi":"10.22260/crc-csce-2025/0054","title":"Automated Master Scheduling for Supply Chain Management in Panelized Construction","year":2025,"lang":"","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Supply chain; Supply chain management; Automation; Job shop scheduling","score_opus":0.0654941962283653,"score_gpt":0.36527135769282093,"score_spread":0.29977716146445565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127892449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24980502,0.0001954581,0.74074215,0.00035922622,0.00006628359,0.00034896983,0.0006398378,0.0013238935,0.006519152],"genre_scores_gemma":[0.8985466,0.00007676328,0.098836176,0.000026612095,0.000019549363,0.0001184875,0.00043776727,0.00007058895,0.0018674535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.00032778387,0.000026100099,0.00016692762,0.00011521802,0.0001931422],"domain_scores_gemma":[0.9984628,0.00090964086,0.0001510558,0.00016665191,0.00013780085,0.00017206719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438491,0.00053569145,0.0012673065,0.00072255026,0.0009737436,0.0012916138,0.0010941963,0.0007532968,0.005322692],"category_scores_gemma":[0.002632757,0.00070508535,0.0005723946,0.0009987996,0.0005152389,0.0010931435,0.0011240639,0.0012063518,0.00044961108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023643156,0.00009632645,0.0006774359,0.000041099673,0.000026898408,0.000033347707,0.00006263139,0.9555233,0.0024247675,0.0024888553,0.0010532513,0.037335664],"study_design_scores_gemma":[0.000010594233,0.000032283773,0.00022449785,0.0000022013885,0.0000039617325,0.0000028417617,0.000018130204,0.9975115,0.00044918497,0.0014724691,0.00026863266,0.0000037560296],"about_ca_topic_score_codex":0.018464189,"about_ca_topic_score_gemma":0.018639544,"teacher_disagreement_score":0.018464189,"about_ca_system_score_codex":0.0014701246,"about_ca_system_score_gemma":0.003807085,"threshold_uncertainty_score":0.03671342},"labels":[],"label_agreement":null},{"id":"W7127988302","doi":"10.22260/crc-csce-2025/0080","title":"Optimizing Production Scheduling for Decarbonization in Off-Site Construction","year":2025,"lang":"","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","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":true,"ca_institutions":"","funders":"Ministry of Science and ICT, South Korea; Canada First Research Excellence Fund; National Research Foundation of Korea; National Research Foundation","keywords":"Scheduling (production processes); Production (economics); Job shop scheduling; Production planning","score_opus":0.04772083380949478,"score_gpt":0.35945168206316247,"score_spread":0.3117308482536677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127988302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24148299,0.0002915186,0.7503044,0.00030224922,0.000042556323,0.00018417525,0.0001916819,0.0002833134,0.0069171814],"genre_scores_gemma":[0.91764706,0.00019845212,0.08043346,0.000032753207,0.000009069668,0.00009057579,0.00016636132,0.000050208724,0.0013720085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952865,0.00018012595,0.000011957684,0.00007926777,0.000097060714,0.00010299183],"domain_scores_gemma":[0.999387,0.00035624736,0.000104163875,0.000025819398,0.000078164674,0.000048606365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086890743,0.0007518113,0.0007204074,0.000612451,0.00043160727,0.00094064133,0.0007049341,0.0006348898,0.0012584637],"category_scores_gemma":[0.0016495482,0.00039915126,0.00044988847,0.0007370207,0.00050000474,0.00060945074,0.00048000176,0.00067349314,0.000105208725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015592634,0.000024609408,0.00037947725,0.000012072827,0.0000057013317,0.00001317503,0.000009217235,0.99280035,0.00052286044,0.0008338394,0.00009268664,0.005290447],"study_design_scores_gemma":[0.0000046564383,0.000023839793,0.0002892211,0.0000021006956,0.000003033712,0.0000029186306,0.000019519211,0.9979358,0.00040284576,0.0010975407,0.00021620032,0.0000023247592],"about_ca_topic_score_codex":0.033183172,"about_ca_topic_score_gemma":0.035007622,"teacher_disagreement_score":0.033183172,"about_ca_system_score_codex":0.0017692492,"about_ca_system_score_gemma":0.004172459,"threshold_uncertainty_score":0.06598002},"labels":[],"label_agreement":null},{"id":"W7133432398","doi":"","title":"M-MACBETH for Multicriteria Resource Allocation","year":2015,"lang":"en","type":"article","venue":"ORBi UMONS","topic":"Resource-Constrained Project Scheduling","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 Moncton","funders":"","keywords":"Pairwise comparison; Portfolio; Resource allocation; Ranking (information retrieval); Context (archaeology); Selection (genetic algorithm); Multiple-criteria decision analysis; Resource (disambiguation); Component (thermodynamics)","score_opus":0.207259745332122,"score_gpt":0.4179770131203754,"score_spread":0.2107172677882534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133432398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059703714,0.00067817734,0.95629096,0.00035969258,0.0003727737,0.0003549837,0.0014625451,0.010034596,0.029849352],"genre_scores_gemma":[0.012646388,0.0006127055,0.96336657,0.00044654965,0.00022687406,0.0011708838,0.0016283155,0.0029604253,0.016941316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579275,0.0015424977,0.00040334486,0.0005853055,0.0013785161,0.0002974606],"domain_scores_gemma":[0.9947431,0.002483473,0.0005406893,0.0010997624,0.0009048858,0.00022798356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054621673,0.0023585798,0.001341997,0.0030609684,0.0008901928,0.003801602,0.0028374959,0.0022238037,0.11654425],"category_scores_gemma":[0.012948258,0.0016792365,0.002425446,0.0038993852,0.0011465526,0.0027584839,0.003543007,0.004198628,0.045854434],"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.00038769704,0.00017024345,0.00078370824,0.0012083403,0.0002150334,0.0004365518,0.00039987304,0.061633114,0.0039605726,0.43028966,0.18792279,0.31259242],"study_design_scores_gemma":[0.00017125282,0.0001178595,0.00048393273,0.0004266588,0.00004446722,0.00037719426,0.000053673117,0.18775724,0.0037396783,0.1749701,0.6317669,0.00009095976],"about_ca_topic_score_codex":0.0023956934,"about_ca_topic_score_gemma":0.0028969296,"teacher_disagreement_score":0.11654425,"about_ca_system_score_codex":0.0022102282,"about_ca_system_score_gemma":0.0026978333,"threshold_uncertainty_score":0.38987935},"labels":[],"label_agreement":null},{"id":"W817481","doi":"","title":"Generating Random Dynamic Resource Scheduling Problems","year":2008,"lang":"en","type":"article","venue":"Viaţa medicală; revistă de informare profesională şi ştiinţifică a cadrelor medii sanitare","topic":"Resource-Constrained Project Scheduling","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":"Simon Fraser University","funders":"","keywords":"Dynamic priority scheduling; Computer science; Scheduling (production processes); Fair-share scheduling; Two-level scheduling; Earliest deadline first scheduling; Distributed computing; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Real-time computing; Mathematical optimization; Schedule; Operating system","score_opus":0.06270053567341327,"score_gpt":0.33956291189655335,"score_spread":0.2768623762231401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W817481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19526097,0.0003407987,0.79336196,0.00084226386,0.0001883856,0.0008356487,0.0017042276,0.001862355,0.00560334],"genre_scores_gemma":[0.55284137,0.0001894802,0.43968666,0.00022963734,0.00005701619,0.001354602,0.0024321224,0.00028132857,0.0029277464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851197,0.0006832146,0.00007290513,0.00030651822,0.00026452212,0.00016090155],"domain_scores_gemma":[0.9913523,0.0067190863,0.00043736878,0.00060228835,0.00065167696,0.00023729558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031339,0.0007527142,0.0007495818,0.00068782887,0.00036079995,0.00060885015,0.0014827274,0.0008200251,0.003080192],"category_scores_gemma":[0.012320017,0.0004319246,0.00078726455,0.0006428197,0.0006240065,0.00091279764,0.0009982132,0.001083311,0.00028142487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001566886,0.00011551455,0.0012224057,0.00013240046,0.000038006652,0.00013658441,0.000049935185,0.9635069,0.0012588975,0.014438673,0.002442163,0.016501816],"study_design_scores_gemma":[0.00007503677,0.00004206902,0.00012337058,0.0000055419237,0.000007623888,0.000017483238,0.000020163792,0.98703814,0.0007337457,0.011057875,0.0008731892,0.0000058800806],"about_ca_topic_score_codex":0.002109488,"about_ca_topic_score_gemma":0.0028955415,"teacher_disagreement_score":0.0031339,"about_ca_system_score_codex":0.0008785663,"about_ca_system_score_gemma":0.0018151868,"threshold_uncertainty_score":0.016573787},"labels":[],"label_agreement":null},{"id":"W91616806","doi":"","title":"Project Schedule Compression Considering Multi-objective Decision Environment","year":2011,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Schedule; Computer science; Process (computing); Novelty; Operations research; Allowance (engineering); Duration (music); Harmony search; Iterative and incremental development; Industrial engineering; Risk analysis (engineering); Engineering; Operations management; Artificial intelligence; Software engineering","score_opus":0.1354679531133151,"score_gpt":0.37226458694989983,"score_spread":0.23679663383658472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91616806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045137867,0.00032749094,0.9491914,0.00018407818,0.00004293717,0.0002239348,0.00009902913,0.00019145283,0.004601841],"genre_scores_gemma":[0.590096,0.00047116567,0.4054278,0.00007439306,0.000059614136,0.00045428344,0.00019219269,0.00008381652,0.0031407094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790263,0.0010079284,0.00008270614,0.00023022773,0.0006062408,0.00017032637],"domain_scores_gemma":[0.99683595,0.0023677829,0.0002776879,0.00008848217,0.00032782072,0.000102211714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031432034,0.0011120685,0.001102577,0.0014115047,0.0004421525,0.0014852852,0.0010739885,0.0007490505,0.0028884602],"category_scores_gemma":[0.0052625947,0.00048070028,0.00093684637,0.0013034989,0.00050751003,0.0011990075,0.001010043,0.0014279819,0.00022059583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087685105,0.00008207557,0.0008207408,0.00025651025,0.000049249546,0.00012477991,0.00014991249,0.9147745,0.0009732935,0.014229128,0.0005270218,0.06792509],"study_design_scores_gemma":[0.000018518582,0.00007522612,0.00020620303,0.000021036438,0.000014949723,0.000024337827,0.0000486851,0.9931384,0.0005880522,0.005101087,0.00075600354,0.000007458175],"about_ca_topic_score_codex":0.004329853,"about_ca_topic_score_gemma":0.0030833257,"teacher_disagreement_score":0.004329853,"about_ca_system_score_codex":0.0013625817,"about_ca_system_score_gemma":0.0019392523,"threshold_uncertainty_score":0.01662308},"labels":[],"label_agreement":null}]}