{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35212496,0.000010284075,0.538847,0.00024183762,0.00014910959,0.00016895164,0.000002861304,0.000049420676,0.10840557],"genre_scores_gemma":[0.9855773,5.1145713e-7,0.013820023,0.0003549428,0.000048443628,0.000010009878,4.1004498e-7,0.0000075272756,0.00018083255],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534273,0.0000893191,0.00069153163,0.00087507,0.0025098713,0.0004914713],"domain_scores_gemma":[0.99721205,0.0008903163,0.0003441709,0.001041336,0.00032524246,0.0001868759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010054955,0.00016324218,0.000359327,0.00046869245,0.00025876425,0.00026604082,0.0027913032,0.00006443564,0.00015493952],"category_scores_gemma":[0.0031895726,0.000114506314,0.00009637356,0.0018101492,0.0018714453,0.0002321003,0.00049852853,0.00019031625,0.00021898796],"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.000053261047,0.000060006983,0.0013303845,0.000006601031,0.0000043720324,0.0000011268852,0.003037814,0.015944649,0.5881198,0.08999764,0.00012463205,0.30131972],"study_design_scores_gemma":[0.0003098143,0.00006585855,0.0015386889,0.000010998716,0.0000042755705,0.0000074601317,0.000688786,0.69161093,0.02050207,0.28398895,0.0010613792,0.00021077832],"about_ca_topic_score_codex":0.000018170489,"about_ca_topic_score_gemma":0.000008970116,"teacher_disagreement_score":0.6756663,"about_ca_system_score_codex":0.000051102263,"about_ca_system_score_gemma":0.0002063155,"threshold_uncertainty_score":0.6895418},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3684023,0.00023815404,0.6217889,0.00040795782,0.00027640964,0.00043143975,0.0000034706948,0.00010903982,0.008342312],"genre_scores_gemma":[0.8366541,8.551697e-7,0.16267571,0.00012643705,0.0003727077,0.0000030515444,0.0000016278648,0.000060339946,0.00010516447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99302506,0.0003431754,0.0023465895,0.00061451853,0.0027598548,0.00091079203],"domain_scores_gemma":[0.99515975,0.002064721,0.0008784479,0.00060256326,0.00052764086,0.0007669073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013847885,0.00042229437,0.001006303,0.001709061,0.00009947316,0.0006153588,0.0016318671,0.00020450601,0.00003207307],"category_scores_gemma":[0.0060621747,0.00038142988,0.00025518192,0.0016946598,0.00012363719,0.00033807286,0.00049101806,0.0011277208,0.000044528806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006876035,0.00013246777,0.0014771749,0.0000207649,0.000047469854,0.00009221967,0.0026861648,0.9682455,0.0013494242,0.00006870592,0.0006678172,0.025143508],"study_design_scores_gemma":[0.0045938645,0.0007502036,0.0027184703,0.0016925232,0.00007403121,0.003691635,0.006504907,0.95986825,0.0013824215,0.00047113365,0.016921053,0.0013314877],"about_ca_topic_score_codex":0.0000054470133,"about_ca_topic_score_gemma":0.0000026039727,"teacher_disagreement_score":0.46825182,"about_ca_system_score_codex":0.0003630541,"about_ca_system_score_gemma":0.00027976173,"threshold_uncertainty_score":0.99986374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16884485,0.00052685774,0.82770973,0.00019907107,0.0006846095,0.00026034727,0.0000023515684,0.000044592478,0.001727583],"genre_scores_gemma":[0.44047904,0.000024547657,0.5590968,0.000024816522,0.0002797748,0.00000764917,0.0000017448818,0.000017119699,0.00006851408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744034,0.00008144991,0.0009913942,0.000316116,0.00087581336,0.00029490096],"domain_scores_gemma":[0.99822587,0.00035095314,0.0006437384,0.00021913009,0.00030871274,0.00025159237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042005996,0.0002123945,0.00041962983,0.0008492983,0.00015456114,0.00040812563,0.00030245323,0.00009707675,0.0000064342166],"category_scores_gemma":[0.000622338,0.00018116517,0.000121352925,0.00046471215,0.000105658495,0.00047204498,0.00009634155,0.0003013441,0.0000013285988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001415374,0.000016092668,0.0012509506,0.00008355765,0.00014019497,0.000017114711,0.0010284759,0.91170686,0.00030647212,0.007144451,0.00033272113,0.077831574],"study_design_scores_gemma":[0.012512735,0.00084195874,0.002383305,0.0015765232,0.0006984828,0.012916392,0.15716428,0.64585924,0.0026743014,0.021103807,0.1403906,0.001878364],"about_ca_topic_score_codex":0.0000010596857,"about_ca_topic_score_gemma":5.228809e-8,"teacher_disagreement_score":0.2716342,"about_ca_system_score_codex":0.000079816156,"about_ca_system_score_gemma":0.00004688356,"threshold_uncertainty_score":0.7387701},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69737595,0.0002787095,0.30169395,0.00008589019,0.00020405091,0.0001709475,0.000014572313,0.000009042141,0.0001669012],"genre_scores_gemma":[0.8371211,0.000031254018,0.16262524,0.00007320863,0.00009241142,0.0000017745072,0.0000011023619,0.0000196926,0.000034195164],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99045044,0.0012079808,0.003648813,0.00056882924,0.003691682,0.00043225687],"domain_scores_gemma":[0.9897491,0.0028134855,0.0029661164,0.0011425337,0.0030628021,0.00026601215],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011241088,0.00035136638,0.0015339545,0.003897665,0.0002969774,0.00037029153,0.0026626578,0.00020498998,0.0010816029],"category_scores_gemma":[0.010480376,0.00018261069,0.0015134547,0.0067307297,0.0005298206,0.0007563351,0.00034211576,0.00062492164,0.000013106707],"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.009899345,0.00515465,0.5265268,0.000110300825,0.01034729,0.00073897623,0.04557044,0.062010046,0.041586243,0.0007946921,0.0014250807,0.29583612],"study_design_scores_gemma":[0.002032041,0.00027508926,0.027066275,0.0002807869,0.0020822026,0.00021662899,0.014115724,0.94351065,0.006176262,0.003390483,0.00046114888,0.00039269347],"about_ca_topic_score_codex":0.000071983544,"about_ca_topic_score_gemma":0.000019980409,"teacher_disagreement_score":0.8815006,"about_ca_system_score_codex":0.000067326,"about_ca_system_score_gemma":0.00038991394,"threshold_uncertainty_score":0.99983156},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022658458,0.00021518693,0.97000426,0.001056182,0.0005869165,0.0021011236,0.0005482675,0.00006726242,0.0027623326],"genre_scores_gemma":[0.39260232,0.000015778569,0.6043959,0.002038247,0.00044324217,0.00008202193,0.0003016449,0.000015679854,0.000105104475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478966,0.00013863425,0.0016781875,0.00046810525,0.0023956366,0.00052976486],"domain_scores_gemma":[0.9945111,0.0005316236,0.0010466124,0.0006637731,0.0028144526,0.00043240216],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017444428,0.00023123469,0.0004843507,0.0012917379,0.00031041403,0.0017348366,0.0013726426,0.00010345143,0.0000034403017],"category_scores_gemma":[0.0030320827,0.00017206318,0.00008512904,0.0020829877,0.0004742678,0.007578573,0.00036555156,0.00013030217,0.000029717747],"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.0003151524,0.00010867174,0.0016391075,0.0003183303,0.00008678253,0.0000028524855,0.04722374,0.035817705,0.00023081136,0.02625557,0.21178524,0.67621607],"study_design_scores_gemma":[0.0013512826,0.0004024538,0.00016558408,0.00016621593,0.000006967682,0.00007413273,0.005800777,0.7048216,0.00049385964,0.00042219082,0.28597966,0.0003152794],"about_ca_topic_score_codex":0.00013697706,"about_ca_topic_score_gemma":0.000002492652,"teacher_disagreement_score":0.67590076,"about_ca_system_score_codex":0.000027692264,"about_ca_system_score_gemma":0.0017158696,"threshold_uncertainty_score":0.99930143},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30334154,0.000046125748,0.6603527,0.010965232,0.00011070939,0.0060204305,0.000066699984,0.00037160536,0.018724969],"genre_scores_gemma":[0.93353057,0.000006825586,0.06288259,0.0005623701,0.00028003333,0.00268775,0.000006961707,0.000025485026,0.000017423714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961063,0.0005632922,0.0005331063,0.0009374584,0.0009333798,0.0009264285],"domain_scores_gemma":[0.99701726,0.0007969459,0.00021160016,0.0004089186,0.0009014858,0.0006637862],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.021709416,0.00024139028,0.000261965,0.00086510787,0.0012977738,0.001003408,0.0011863073,0.00045636087,0.000016071546],"category_scores_gemma":[0.014615064,0.00023674706,0.00007078051,0.0026823045,0.0016265565,0.0008021365,0.0001281217,0.00086880015,0.00001087679],"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.000013920196,0.00006476951,0.014564007,0.000051151375,0.000003786615,0.000016913169,0.005731631,0.0000093029585,0.44296426,0.46009302,0.000087093955,0.07640014],"study_design_scores_gemma":[0.0016673619,0.00046381424,0.041577585,0.00034168182,0.00010421853,0.002182319,0.01691088,0.24619454,0.26715606,0.30553028,0.113581754,0.0042895186],"about_ca_topic_score_codex":0.0049120835,"about_ca_topic_score_gemma":0.005332431,"teacher_disagreement_score":0.63018906,"about_ca_system_score_codex":0.0004652678,"about_ca_system_score_gemma":0.004004713,"threshold_uncertainty_score":0.9981558},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3294394,0.00021102758,0.6684068,0.00026859526,0.00027961438,0.00029507972,0.0000055514047,0.000039535877,0.001054416],"genre_scores_gemma":[0.21435401,0.00015300543,0.784848,0.00003869635,0.00020108324,0.000010148415,5.8033845e-7,0.000017632528,0.00037687673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980562,0.00003921431,0.0007690975,0.0002469114,0.00065046083,0.00023815774],"domain_scores_gemma":[0.9986889,0.00039105272,0.00034274295,0.00017740235,0.00025347061,0.00014648339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015533043,0.00017778257,0.00036191632,0.0005546131,0.0001290672,0.0002491895,0.00023812208,0.00005713431,0.00011194714],"category_scores_gemma":[0.00017912248,0.00012862489,0.00011785809,0.00037844724,0.0001356304,0.0002717489,0.000023335175,0.00017329781,0.000003347936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008771033,0.00001572554,0.00013375422,0.000022989945,0.00016482754,0.00003278223,0.00026057794,0.065393515,0.00008776467,0.00075768644,0.00003274074,0.9330099],"study_design_scores_gemma":[0.012301098,0.0010467714,0.0025942079,0.0008176974,0.0004356065,0.0065469514,0.010846906,0.7411351,0.0007078408,0.0023559213,0.22022201,0.0009898532],"about_ca_topic_score_codex":0.0000014113629,"about_ca_topic_score_gemma":3.8721512e-7,"teacher_disagreement_score":0.93202007,"about_ca_system_score_codex":0.000027616004,"about_ca_system_score_gemma":0.0000256375,"threshold_uncertainty_score":0.52451706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016291918,0.000015379797,0.94865197,0.0084548285,0.00017248705,0.001149205,0.00003477155,0.000023055076,0.02520639],"genre_scores_gemma":[0.8124049,0.000012235183,0.18559983,0.00026835705,0.00016620045,0.0006549976,0.000020011,0.000015250957,0.00085827516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944371,0.00069641956,0.0006881608,0.0007608049,0.0030529285,0.00036455874],"domain_scores_gemma":[0.99527025,0.0030807673,0.00007762824,0.0003270825,0.0011034865,0.00014079966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010484478,0.00016367166,0.00019668833,0.0010424219,0.000705052,0.0009434637,0.00086762896,0.00007656536,0.00045362185],"category_scores_gemma":[0.0025106084,0.000119357115,0.000058216272,0.0011311696,0.00024829034,0.00038435956,0.00008776577,0.000677671,0.00007195759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011345155,0.00013539213,0.0002449873,0.0000024949854,0.000026250116,0.0000010277566,0.001435358,0.96785146,0.00071063533,0.0093140695,0.00006769952,0.020097189],"study_design_scores_gemma":[0.000662713,0.00006925842,0.00079704676,0.00002241424,0.0000033741367,0.000030741463,0.002307665,0.9886553,0.0007798279,0.0019854854,0.004536535,0.00014958742],"about_ca_topic_score_codex":0.0001232913,"about_ca_topic_score_gemma":0.00009333847,"teacher_disagreement_score":0.7961129,"about_ca_system_score_codex":0.00035511624,"about_ca_system_score_gemma":0.00029204317,"threshold_uncertainty_score":0.9097842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005032935,0.00001211715,0.98949194,0.0005930385,0.00001734805,0.0021274786,0.000054294975,0.000045475954,0.0026253825],"genre_scores_gemma":[0.34067112,0.000004681659,0.65839297,0.00010215054,0.000031933105,0.00059344067,0.00008122089,0.000008910976,0.0001135796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854946,0.000041667834,0.00038906446,0.00047007296,0.0004240747,0.00012566736],"domain_scores_gemma":[0.99827087,0.0008121795,0.00019829541,0.00021559668,0.00041567913,0.00008735303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071141735,0.000121392644,0.00014431115,0.00017426019,0.00034978325,0.00030135943,0.00016058153,0.000044923763,0.00001630073],"category_scores_gemma":[0.00010540915,0.00009424625,0.00002201538,0.0004356937,0.00018525666,0.00012429945,0.0000720652,0.00009611833,0.0000025036788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045507408,0.00016515238,0.006519174,0.000041382544,0.000034338776,4.3321316e-7,0.0002869981,0.76305956,0.000023748544,0.17310303,0.000433771,0.05628692],"study_design_scores_gemma":[0.00090128666,0.0000659563,0.0040783617,0.000012404461,0.000028030227,0.000019047578,0.00040315662,0.9555837,0.000012212112,0.028130863,0.010579563,0.00018544885],"about_ca_topic_score_codex":0.0000031382826,"about_ca_topic_score_gemma":0.0000055018018,"teacher_disagreement_score":0.3356382,"about_ca_system_score_codex":0.000021487149,"about_ca_system_score_gemma":0.00007485901,"threshold_uncertainty_score":0.38432503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31583357,0.00012087624,0.6802236,0.0013049565,0.0002856315,0.00050763425,0.0000015521149,0.000033889384,0.0016882954],"genre_scores_gemma":[0.58574605,0.000014518568,0.41390648,0.00007899591,0.00016904545,0.000010024947,2.231804e-7,0.000021196749,0.00005349431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671346,0.00013126324,0.0013843297,0.00037861074,0.0009384262,0.00045388643],"domain_scores_gemma":[0.9934841,0.005233491,0.0006042555,0.00030626086,0.0002101047,0.00016178847],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010656703,0.00023562915,0.0005157086,0.0010082138,0.00008447627,0.00033409163,0.00047175138,0.0000986459,0.000013509899],"category_scores_gemma":[0.017002549,0.00019704804,0.00015803108,0.00060183794,0.000050924362,0.0005020112,0.00016234315,0.00044052297,0.0000031830932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003312455,0.00013985661,0.0033277378,0.00037442145,0.00024593418,0.00013759159,0.002202603,0.79347163,0.00332204,0.012788497,0.00023727026,0.18342118],"study_design_scores_gemma":[0.003077234,0.00019036242,0.002335196,0.00049305835,0.000071739785,0.00019562393,0.003910894,0.97429246,0.000488199,0.0027604706,0.011805708,0.000379046],"about_ca_topic_score_codex":0.000002119342,"about_ca_topic_score_gemma":0.0000018306889,"teacher_disagreement_score":0.26991245,"about_ca_system_score_codex":0.00007332802,"about_ca_system_score_gemma":0.000054185646,"threshold_uncertainty_score":0.99127764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5264812,0.000012940791,0.47198427,0.00028032137,0.0003716684,0.0001770801,0.0000032151236,0.0001143104,0.00057498517],"genre_scores_gemma":[0.8158844,0.0000010110971,0.18385608,0.000045052577,0.00015654175,0.000018897446,0.000013286395,0.000015588806,0.000009122599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965516,0.00033280533,0.0009559023,0.0007561912,0.0010887405,0.00031479335],"domain_scores_gemma":[0.99783224,0.0007225731,0.0004283088,0.00041590183,0.0004785916,0.00012239207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025501144,0.00024801024,0.00035946217,0.00084140984,0.00049879163,0.00040490887,0.00017414028,0.00020892391,0.00012854951],"category_scores_gemma":[0.0018168553,0.0002141428,0.00006376209,0.0009794245,0.0004634267,0.00090106874,0.000076208125,0.00039205677,0.000042700867],"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.00012990426,0.00003521771,0.19342457,0.00001657023,0.000028516035,0.0000027031022,0.00032107922,0.3261503,0.0009081983,0.014932908,0.0000063246066,0.4640437],"study_design_scores_gemma":[0.0009809139,0.00006820956,0.013545501,0.000081405575,0.000021999422,0.0004611856,0.00081450184,0.95364517,0.0001510194,0.029918673,0.00006200546,0.00024942902],"about_ca_topic_score_codex":0.00039298402,"about_ca_topic_score_gemma":0.00070696493,"teacher_disagreement_score":0.6274949,"about_ca_system_score_codex":0.00010078211,"about_ca_system_score_gemma":0.0001671311,"threshold_uncertainty_score":0.873249},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44982168,0.00037615525,0.54573727,0.00011989352,0.0008194331,0.00017349912,8.772115e-7,0.000019592091,0.0029315937],"genre_scores_gemma":[0.512991,0.00014195539,0.48674086,0.000009502225,0.00004575656,0.000001381289,7.477023e-8,0.0000072065304,0.0000622711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809253,0.000071303264,0.00087598374,0.000154923,0.00065333524,0.00015192089],"domain_scores_gemma":[0.9986925,0.00022370469,0.0005427504,0.0001748892,0.00027602422,0.000090141926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024872348,0.0001183324,0.000332237,0.00073937763,0.000051468625,0.00006700362,0.0001791858,0.000047623642,0.000035908874],"category_scores_gemma":[0.0010988358,0.00009296198,0.00011749606,0.00049350434,0.00006662005,0.00021622767,0.000036281454,0.00017148387,0.0000018753623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106795516,0.000056763234,0.0015926771,0.00016931884,0.00035571292,0.000064130596,0.00071801915,0.88134295,0.002642311,0.048364885,0.00009922672,0.06448723],"study_design_scores_gemma":[0.02546219,0.0016869367,0.006018401,0.0028923783,0.0011789647,0.0129345935,0.055500463,0.64241517,0.061751906,0.013556177,0.17401123,0.002591593],"about_ca_topic_score_codex":6.887681e-7,"about_ca_topic_score_gemma":4.7310056e-8,"teacher_disagreement_score":0.23892777,"about_ca_system_score_codex":0.000021172647,"about_ca_system_score_gemma":0.00004105227,"threshold_uncertainty_score":0.37908795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18498853,0.00020943707,0.7936593,0.0019008133,0.00024259034,0.0024309908,0.000025461297,0.00021728338,0.01632555],"genre_scores_gemma":[0.57620496,0.0000047425983,0.42246047,0.00017754319,0.0007352313,0.00017323621,0.0000050368885,0.00005470488,0.0001840568],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98389345,0.003524056,0.002195162,0.0017989192,0.0054808115,0.0031076078],"domain_scores_gemma":[0.98647946,0.007855517,0.00029689915,0.0020500228,0.0019069359,0.0014111561],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.055017143,0.0004839736,0.0007104573,0.0026404327,0.001290463,0.0017482021,0.0033283161,0.00036684968,0.0010083459],"category_scores_gemma":[0.014487801,0.00040255263,0.00027037464,0.007357828,0.000999418,0.0009882106,0.00073897856,0.001549414,0.0040281834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031930694,0.00048440887,0.001807588,0.000018593322,0.000043352426,0.000033671255,0.018075692,0.013848269,0.087206684,0.047172956,0.00041569825,0.8305738],"study_design_scores_gemma":[0.0002051315,0.0020951943,0.0006438619,0.0002630049,0.00004889107,0.00029269443,0.1639681,0.14647134,0.46664962,0.17419276,0.043095883,0.0020735452],"about_ca_topic_score_codex":0.00053513004,"about_ca_topic_score_gemma":0.00011480122,"teacher_disagreement_score":0.8285002,"about_ca_system_score_codex":0.00023598052,"about_ca_system_score_gemma":0.0009360151,"threshold_uncertainty_score":0.9999049},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027640373,0.00018802665,0.97088075,0.00020838327,0.0002839989,0.00013409255,0.000019654703,0.000019049638,0.0006256618],"genre_scores_gemma":[0.79080725,5.95979e-7,0.20874494,0.00006071167,0.00030267885,0.0000041475705,0.0000045625866,0.000028606391,0.00004653348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979862,0.00004005852,0.0008228551,0.00024039847,0.0004903501,0.00042015666],"domain_scores_gemma":[0.99764323,0.0004873811,0.00035916723,0.0002811226,0.000719483,0.00050960993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022823978,0.0001677649,0.00029915667,0.0011102252,0.00015150671,0.00040293369,0.00055611104,0.000109722845,0.00009633261],"category_scores_gemma":[0.0022122965,0.00015789286,0.00018205674,0.00058443606,0.00004475493,0.00053853344,0.0000056481085,0.00024347722,0.0000018752837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013375574,0.0000055178557,0.0006033859,0.0000050332496,0.0000075498883,0.000019632562,0.00015557538,0.9976252,0.00028180756,0.00073389127,0.00009953047,0.0004495271],"study_design_scores_gemma":[0.000410989,0.00005384959,0.00016461108,0.000092521186,0.000015605769,0.00003385448,0.00014907564,0.99753803,0.00017901933,0.0007855761,0.00040280668,0.00017409037],"about_ca_topic_score_codex":0.00021057803,"about_ca_topic_score_gemma":0.016762393,"teacher_disagreement_score":0.76316684,"about_ca_system_score_codex":0.00018306254,"about_ca_system_score_gemma":0.0011898755,"threshold_uncertainty_score":0.9353809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22199449,0.0010943267,0.7483436,0.0014024352,0.00026538092,0.00039530903,0.000028157583,0.00004270516,0.026433593],"genre_scores_gemma":[0.9519262,0.0000026431605,0.04744025,0.00026109008,0.00030292422,0.0000017278726,0.0000011240954,0.000020336476,0.00004371523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964751,0.00012357862,0.0010086745,0.00045153796,0.0010674149,0.0008736679],"domain_scores_gemma":[0.9970673,0.00032310223,0.00018845077,0.00037572632,0.0004143852,0.0016310607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004104277,0.00030089114,0.0005629867,0.0014308556,0.00019873984,0.00068133004,0.0009661307,0.0001688061,0.000048559814],"category_scores_gemma":[0.00320349,0.00026437352,0.00017763063,0.001933948,0.00015371619,0.0003750413,0.000043876677,0.00065158436,0.0000097399225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002968943,0.000013478655,0.001482706,0.000013560997,0.000036627578,0.00018919325,0.0016710784,0.9662351,0.00016862608,0.001912488,0.0009406628,0.027306814],"study_design_scores_gemma":[0.003112071,0.0012098018,0.022140328,0.0009075581,0.00011372307,0.010906649,0.019781867,0.90300673,0.0003031804,0.001850032,0.03468736,0.0019807252],"about_ca_topic_score_codex":0.00039151614,"about_ca_topic_score_gemma":0.0029920326,"teacher_disagreement_score":0.7299317,"about_ca_system_score_codex":0.00034794936,"about_ca_system_score_gemma":0.0017690072,"threshold_uncertainty_score":0.99998087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33744177,0.00027158044,0.5695383,0.019120675,0.0011251484,0.0029445372,0.00014866504,0.00006854735,0.069340765],"genre_scores_gemma":[0.9628687,0.000019949783,0.03427247,0.00011974125,0.00023419231,0.0003414125,0.0000151284385,0.00001860177,0.002109816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921712,0.0012238839,0.0011414025,0.00049163227,0.004411175,0.00056065375],"domain_scores_gemma":[0.9945625,0.0032958423,0.00021502547,0.0005973525,0.0012638104,0.00006547732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01023501,0.00020482996,0.00023001301,0.00071325595,0.00078087806,0.0005792686,0.0021332442,0.00015261918,0.00047839258],"category_scores_gemma":[0.0042404574,0.000116060844,0.00022404951,0.00227884,0.0009574548,0.001376106,0.00012744467,0.001243546,0.000029869216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035995172,0.00085667404,0.00879241,0.000021862159,0.00021247141,0.0000026850817,0.03180437,0.62253517,0.0065679722,0.16146128,0.00039103665,0.16699412],"study_design_scores_gemma":[0.0014082923,0.00012775493,0.0072633354,0.00037012575,0.000035293637,0.00010906005,0.059628665,0.85428274,0.010715414,0.032961387,0.032557078,0.0005408303],"about_ca_topic_score_codex":0.00037057398,"about_ca_topic_score_gemma":0.0003723165,"teacher_disagreement_score":0.6254269,"about_ca_system_score_codex":0.00024668558,"about_ca_system_score_gemma":0.0007380742,"threshold_uncertainty_score":0.6005962},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46347576,0.00003112894,0.5001367,0.00007756928,0.0007888544,0.0007173478,0.000009388211,0.000057617643,0.03470565],"genre_scores_gemma":[0.73269236,0.0000032877465,0.26703244,0.000011318491,0.00022700419,0.000009627434,4.4616763e-7,0.0000080449145,0.000015480684],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9958083,0.00037963485,0.0007097851,0.0006398964,0.0019984643,0.00046391276],"domain_scores_gemma":[0.9979502,0.00022569398,0.00065123016,0.0003942812,0.0006529805,0.00012559492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004445308,0.00016005253,0.00034464733,0.00042676824,0.00053427945,0.00017268378,0.0012366049,0.000099001176,0.00002039333],"category_scores_gemma":[0.0016464852,0.0001373319,0.000113184564,0.0040001334,0.0013137525,0.0005879311,0.0001956716,0.0001453927,0.0000050076274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016751013,0.00008657152,0.01865507,0.0000046094797,0.000010303382,0.000001036059,0.011056721,0.008769838,0.0011974071,0.0011568865,0.0000063474354,0.95903844],"study_design_scores_gemma":[0.0020436114,0.0014023101,0.63593996,0.00016846522,0.00006512273,0.0000260097,0.0438161,0.26218155,0.028467216,0.024650224,0.00020492627,0.0010345142],"about_ca_topic_score_codex":0.00022116072,"about_ca_topic_score_gemma":0.000006603709,"teacher_disagreement_score":0.95800394,"about_ca_system_score_codex":0.000074216696,"about_ca_system_score_gemma":0.000449797,"threshold_uncertainty_score":0.5600232},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113125056,0.0014850942,0.8822906,0.0005063302,0.00058056397,0.0005547724,0.00009288456,0.000028939117,0.001335738],"genre_scores_gemma":[0.86245835,0.000003593192,0.13694137,0.00011460957,0.00039049867,0.0000037976627,0.0000018101975,0.00003055203,0.00005539542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965833,0.00006756607,0.0015376594,0.000327245,0.0006615472,0.0008227243],"domain_scores_gemma":[0.99651545,0.0007306943,0.0007264794,0.00041571178,0.000781659,0.0008300309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003454605,0.00027959363,0.0006830626,0.0016614603,0.00014306825,0.00021208654,0.0009804859,0.00017803401,0.000113209586],"category_scores_gemma":[0.0055994634,0.00025111853,0.0004031614,0.00097643415,0.00007966742,0.00028362186,0.000019049365,0.00043374705,0.000002233461],"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.00013410446,0.00013590099,0.0021878248,0.00016485281,0.0004718089,0.00053202786,0.0098330565,0.3347124,0.052173335,0.0025125775,0.0022284382,0.59491366],"study_design_scores_gemma":[0.0034024862,0.0010369163,0.0029025185,0.0005506028,0.00011163958,0.00093318673,0.002873116,0.9579931,0.0067694727,0.0017826005,0.020851457,0.00079288386],"about_ca_topic_score_codex":0.000072807656,"about_ca_topic_score_gemma":0.0020127357,"teacher_disagreement_score":0.7493333,"about_ca_system_score_codex":0.00013666395,"about_ca_system_score_gemma":0.0016998844,"threshold_uncertainty_score":0.9999941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109111756,0.00009484873,0.8887622,0.00044812748,0.0002624044,0.00061564945,0.000008109285,0.000023673354,0.00067328126],"genre_scores_gemma":[0.65106386,0.000022609858,0.34859124,0.000030068884,0.00011381872,0.000017282475,0.000004356546,0.00002925724,0.00012747968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654806,0.00014339283,0.0016069326,0.00031158308,0.0010271517,0.00036289112],"domain_scores_gemma":[0.99744666,0.000973889,0.00094845047,0.00031747718,0.00022260896,0.00009091766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006392188,0.00022348018,0.0005546134,0.0013681658,0.000060765462,0.00013209233,0.0007204903,0.00010216096,0.000020154032],"category_scores_gemma":[0.0031355312,0.0001530726,0.00022608755,0.0008778888,0.000049646147,0.00038234767,0.00012738968,0.000260923,0.0000011242145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012212672,0.00007328653,0.00051355106,0.00010887878,0.000056963232,0.0000064303117,0.0005112301,0.9670683,0.0021339245,0.00030144624,0.00031352602,0.02879034],"study_design_scores_gemma":[0.0018915432,0.00019752662,0.00020287636,0.00042358792,0.000042188694,0.000013280267,0.0016951858,0.98931736,0.0011758028,0.00014677671,0.004691962,0.00020189563],"about_ca_topic_score_codex":0.000004792361,"about_ca_topic_score_gemma":0.0000014809806,"teacher_disagreement_score":0.54195213,"about_ca_system_score_codex":0.000099458644,"about_ca_system_score_gemma":0.000037817943,"threshold_uncertainty_score":0.62421197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021018216,0.000037624955,0.9774541,0.00023079812,0.00013278876,0.00055271643,0.0000054773363,0.00005288755,0.0005153533],"genre_scores_gemma":[0.5973728,0.0000064789406,0.40214878,0.00040653732,0.000042572123,0.000012097125,0.0000023509756,0.0000017785733,0.0000066657126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979713,0.000017965434,0.0005868281,0.0003153325,0.0007785781,0.0003299751],"domain_scores_gemma":[0.998643,0.00028521213,0.00022077268,0.00020114727,0.0004820434,0.00016785086],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002939696,0.00012659289,0.0001800931,0.00055399316,0.0004566961,0.0017495024,0.00046307637,0.000026339128,0.0000021839758],"category_scores_gemma":[0.00027157372,0.00009487057,0.000033917193,0.00082107965,0.0002907591,0.006634588,0.00014961592,0.000086280095,0.0000065346267],"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.0000036769525,0.0000048353063,0.000008799352,0.0000035051019,0.0000010485238,1.275855e-7,0.001793926,0.011543437,0.000018865785,0.003509004,0.000028226827,0.98308456],"study_design_scores_gemma":[0.00023953473,0.00014579206,0.0002088112,0.000030786574,0.000002326696,0.000044057364,0.00034552335,0.9849972,0.00018369261,0.0123493485,0.0013231328,0.00012980346],"about_ca_topic_score_codex":0.0000014425341,"about_ca_topic_score_gemma":8.767574e-8,"teacher_disagreement_score":0.98295474,"about_ca_system_score_codex":0.000028139293,"about_ca_system_score_gemma":0.00010102689,"threshold_uncertainty_score":0.9992868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43957746,0.00020695901,0.55755216,0.0002506439,0.00036511658,0.0005298977,0.000008533045,0.00003446229,0.0014747529],"genre_scores_gemma":[0.7364047,0.000012144579,0.26228583,0.00012971093,0.0008803246,0.000016342692,0.000001078066,0.000052899464,0.00021692975],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99365556,0.00062325445,0.0019119671,0.000568206,0.0021243142,0.0011166959],"domain_scores_gemma":[0.9891163,0.006664117,0.0024828278,0.00066107704,0.0006061473,0.0004695217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0138282655,0.00052314816,0.0011078133,0.0014565837,0.000384851,0.0005675982,0.0012061794,0.00021373111,0.00014779814],"category_scores_gemma":[0.0061663575,0.00034917248,0.00068467285,0.00058238115,0.00017786768,0.0012355109,0.00019151763,0.0010111474,0.000025718356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00612723,0.0009702261,0.009344218,0.00039018373,0.0016190088,0.00018308184,0.018058905,0.06545205,0.029072134,0.0014667122,0.0012151037,0.86610115],"study_design_scores_gemma":[0.004132569,0.001850251,0.0042318087,0.0014696884,0.0006806369,0.006040936,0.02556348,0.030521125,0.82747436,0.0039697606,0.09188115,0.0021842555],"about_ca_topic_score_codex":0.000023633631,"about_ca_topic_score_gemma":0.000005623607,"teacher_disagreement_score":0.8639169,"about_ca_system_score_codex":0.00028167458,"about_ca_system_score_gemma":0.00040551348,"threshold_uncertainty_score":0.99989605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29883775,0.00026347404,0.699823,0.00043783194,0.00031601652,0.00015689616,7.864897e-7,0.000018384819,0.00014583043],"genre_scores_gemma":[0.88396484,0.00008108608,0.11564591,0.000021470887,0.00023031169,0.0000023304797,2.3440677e-7,0.000010845869,0.00004298224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980895,0.00008252143,0.0008359121,0.000232185,0.0005927678,0.00016712028],"domain_scores_gemma":[0.9982812,0.0003902552,0.00059360935,0.00021147281,0.00041805042,0.00010545532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028424915,0.0001475385,0.00039729013,0.00069854944,0.00008249033,0.0001165765,0.00017490768,0.000057400135,0.000012540773],"category_scores_gemma":[0.0011491439,0.00011938203,0.00006615759,0.00042520033,0.00009941856,0.00028647584,0.00006040426,0.00019415031,0.0000026239193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016181979,0.00004970841,0.0058070417,0.0005992047,0.00047068056,0.000015509551,0.0014866425,0.75819725,0.011946059,0.010648566,0.000089530884,0.21052797],"study_design_scores_gemma":[0.0026179214,0.00027616226,0.0026373875,0.00070033874,0.0001883389,0.00060596934,0.0031796684,0.98086256,0.0027798607,0.0007254322,0.005111246,0.00031510612],"about_ca_topic_score_codex":0.0000024509432,"about_ca_topic_score_gemma":1.8459927e-7,"teacher_disagreement_score":0.58512706,"about_ca_system_score_codex":0.000026230186,"about_ca_system_score_gemma":0.000031504187,"threshold_uncertainty_score":0.4868258},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.301938,0.00085538445,0.41253752,0.010213044,0.00077936554,0.0021180601,0.00012735346,0.00045265394,0.27097863],"genre_scores_gemma":[0.93920285,0.00006219053,0.056213234,0.00027731314,0.0010531998,0.0000456338,0.00001991892,0.00004258843,0.003083094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882958,0.0015299006,0.0011317097,0.0011516458,0.0064734677,0.0014174628],"domain_scores_gemma":[0.98706955,0.008767525,0.00023642162,0.0012492026,0.0023100667,0.0003672482],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.021552527,0.00030082234,0.00047432605,0.0014893031,0.0008502078,0.0012667606,0.001962229,0.000319268,0.0009069263],"category_scores_gemma":[0.0459164,0.00023931838,0.00020345685,0.002870731,0.0012630639,0.0004404601,0.0006984018,0.001776328,0.003660538],"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.0007006005,0.00088175805,0.0059719477,0.0000836299,0.00014323975,0.00025841093,0.0029605082,0.08958638,0.02149918,0.60550815,0.013713225,0.25869298],"study_design_scores_gemma":[0.0034928434,0.0011775017,0.0053802775,0.00032399117,0.000048026104,0.00024072158,0.016121281,0.4055954,0.010484478,0.28913754,0.26629516,0.001702776],"about_ca_topic_score_codex":0.00019043694,"about_ca_topic_score_gemma":0.00018060394,"teacher_disagreement_score":0.63726485,"about_ca_system_score_codex":0.00044448712,"about_ca_system_score_gemma":0.001143556,"threshold_uncertainty_score":0.99977005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044082567,0.0002679372,0.94608074,0.0010131088,0.0012370799,0.00072116026,0.000017088181,0.000042115225,0.0065381783],"genre_scores_gemma":[0.48732814,0.0000022710528,0.5108064,0.0002578888,0.0015265017,0.000008202685,0.0000022969368,0.000025593015,0.000042713957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934519,0.00019086999,0.0023439697,0.0004945345,0.0030463117,0.0004724225],"domain_scores_gemma":[0.98818195,0.0060247686,0.0023623104,0.0003795136,0.002834478,0.00021695766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012892306,0.00030237203,0.00061707397,0.00071318774,0.00027184744,0.0009663693,0.0026670876,0.0001006505,0.000019403842],"category_scores_gemma":[0.0071611535,0.00019845499,0.00037963127,0.00062459346,0.00028555412,0.00016345544,0.0004002932,0.0005945342,0.000016823495],"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.0002805963,0.00009205561,0.0001916834,0.0000084487065,0.00046452275,0.00008423369,0.00469107,0.09029653,0.0006979715,0.004075793,0.0016025584,0.8975145],"study_design_scores_gemma":[0.0043069054,0.00026889943,0.00018544775,0.00020246541,0.00020793514,0.001731402,0.015284275,0.8872797,0.00086393673,0.047790173,0.04136126,0.0005176127],"about_ca_topic_score_codex":0.000010329029,"about_ca_topic_score_gemma":0.0000012769217,"teacher_disagreement_score":0.8969969,"about_ca_system_score_codex":0.00016862701,"about_ca_system_score_gemma":0.0009461845,"threshold_uncertainty_score":0.9318721},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2516102,0.00016809157,0.7475903,0.00004804223,0.0002228476,0.000087509565,3.4593927e-7,0.000011163851,0.00026148817],"genre_scores_gemma":[0.58975077,0.00005782097,0.4101051,0.000013871873,0.00003999495,5.527329e-7,1.4422257e-7,0.000007521536,0.000024207357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986598,0.00007252105,0.000558821,0.00015183221,0.0004407572,0.000116305426],"domain_scores_gemma":[0.99916196,0.00018559308,0.00031619766,0.000111295456,0.00013961406,0.00008533857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303987,0.000101990365,0.00018243158,0.00051504996,0.00008564014,0.00017863447,0.00007708313,0.000042108004,0.000017275903],"category_scores_gemma":[0.00036541413,0.000088492954,0.000040218252,0.00032479834,0.000048158,0.00020641263,0.000027641843,0.00010062105,3.794644e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010086429,0.000005137109,0.0007779078,0.000012087324,0.00003098803,0.000012190349,0.00008169018,0.97197336,0.00005485505,0.0011129173,0.0000050775534,0.025923718],"study_design_scores_gemma":[0.0006481069,0.00004936331,0.0011845867,0.000046157056,0.00004659368,0.0005583448,0.00063288346,0.99257195,0.000047932077,0.00044299004,0.003671282,0.0000998387],"about_ca_topic_score_codex":6.0582994e-7,"about_ca_topic_score_gemma":5.3745207e-8,"teacher_disagreement_score":0.3381406,"about_ca_system_score_codex":0.000028749899,"about_ca_system_score_gemma":0.000012563875,"threshold_uncertainty_score":0.3608638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21399501,0.0010628252,0.7814372,0.000111539215,0.00049708626,0.0018823335,0.000023032175,0.00032182477,0.00066913216],"genre_scores_gemma":[0.5038078,0.000020817231,0.49548072,0.0000593072,0.00023365757,0.00023490554,0.000029211184,0.000066617584,0.000066947265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951837,0.00012935142,0.0012185689,0.0012840492,0.0009494355,0.0012349179],"domain_scores_gemma":[0.9955403,0.0029499347,0.00019434822,0.0008733162,0.0002759367,0.00016615383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0047197146,0.00048422345,0.00070431456,0.0013306909,0.00014643057,0.00032228217,0.0013710543,0.00026419866,0.000039399758],"category_scores_gemma":[0.006998823,0.00043203824,0.0001904966,0.0021045867,0.00022057134,0.00086872635,0.00023151866,0.00158371,0.000009153653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103147664,0.000072040035,0.022033416,0.00012666466,0.000011400585,0.000021097578,0.0007937956,0.9067589,0.00049832504,0.00028958364,0.000025955944,0.06926565],"study_design_scores_gemma":[0.0014857618,0.00012151926,0.00071200397,0.00023573935,0.000009425165,0.00011907893,0.0008999451,0.9852714,0.00044839887,0.0007685466,0.009157256,0.00077093334],"about_ca_topic_score_codex":0.00002253497,"about_ca_topic_score_gemma":0.000031806754,"teacher_disagreement_score":0.2898128,"about_ca_system_score_codex":0.00010518799,"about_ca_system_score_gemma":0.00023361776,"threshold_uncertainty_score":0.99981314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83055454,0.00025709512,0.16656736,0.00020362154,0.00068942946,0.00040380843,0.00000970182,0.000037491795,0.0012769386],"genre_scores_gemma":[0.9595403,0.000022600541,0.038624804,0.00010760345,0.0009837043,0.0000087255985,0.000003685961,0.000048938466,0.00065965403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99475706,0.00014521714,0.0023171518,0.0005762588,0.0015179997,0.00068630953],"domain_scores_gemma":[0.9952737,0.002172524,0.0016372957,0.0003777077,0.00033052836,0.00020825294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040223706,0.0004100998,0.0007848135,0.001380712,0.0003592944,0.0008016053,0.0009492922,0.00018927146,0.000116469775],"category_scores_gemma":[0.0011146162,0.000310403,0.00045361186,0.00018556407,0.00014862359,0.0008161394,0.00023854428,0.00066335197,0.00002221857],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001782909,0.00038034402,0.023047173,0.00024213103,0.00059622555,0.0008155964,0.008650633,0.62108755,0.019407518,0.0016978682,0.00452998,0.31776208],"study_design_scores_gemma":[0.0015535109,0.0007974575,0.004792862,0.00041157566,0.00012247202,0.001576163,0.008837874,0.009178732,0.9224618,0.006700768,0.042760592,0.00080617407],"about_ca_topic_score_codex":0.000024202232,"about_ca_topic_score_gemma":0.0000066623725,"teacher_disagreement_score":0.9030543,"about_ca_system_score_codex":0.00014565246,"about_ca_system_score_gemma":0.0001949283,"threshold_uncertainty_score":0.9999348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078077674,0.0010121774,0.90319824,0.0061871824,0.00020319746,0.0012855625,0.000072860734,0.000027116532,0.009935957],"genre_scores_gemma":[0.5505399,0.0000046467044,0.4451248,0.00013411744,0.001427243,0.00001925812,0.000028335786,0.000052216204,0.0026694532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98769933,0.0048760623,0.0014056596,0.0005239033,0.004916381,0.0005786583],"domain_scores_gemma":[0.98633546,0.004900929,0.000396148,0.0003914137,0.007739631,0.00023639483],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.043376192,0.00018676146,0.0003123457,0.0013564938,0.0008058445,0.0012286454,0.0014292307,0.00005270435,0.00028778092],"category_scores_gemma":[0.009041531,0.00013709751,0.0002380221,0.0012867193,0.00049814733,0.00058384455,0.00016310689,0.0008332156,0.0001493984],"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.0010657118,0.0012476239,0.002481753,0.000029834604,0.00013576697,0.0006803904,0.0025959816,0.062485535,0.05165124,0.0027720167,0.032798436,0.84205574],"study_design_scores_gemma":[0.007890338,0.0025728538,0.03577762,0.00030283173,0.00002474041,0.00045112532,0.0065483777,0.7957063,0.03020231,0.0011537576,0.118735544,0.0006342245],"about_ca_topic_score_codex":0.0000096660615,"about_ca_topic_score_gemma":0.000003139859,"teacher_disagreement_score":0.8414215,"about_ca_system_score_codex":0.00016668461,"about_ca_system_score_gemma":0.0012004296,"threshold_uncertainty_score":0.9998082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19864517,0.00011121789,0.80018085,0.000023045115,0.00076531834,0.00015661394,0.0000033272727,0.000013490457,0.000100932106],"genre_scores_gemma":[0.7577748,0.00002315911,0.24188158,0.0000067259216,0.00025404806,0.0000030100143,4.1125656e-7,0.000010230787,0.000046049234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983855,0.000036473546,0.00072617125,0.00017418711,0.00048325447,0.00019443034],"domain_scores_gemma":[0.99866587,0.00034707817,0.0005805064,0.00013055028,0.00020406971,0.00007192749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015979109,0.00012877978,0.00024607056,0.0005022076,0.000118984026,0.00020255435,0.00016541308,0.00004897098,0.000008528166],"category_scores_gemma":[0.00021509167,0.00010662365,0.0001117175,0.00022410239,0.00004348381,0.00022607148,0.00004325994,0.00015877436,4.63441e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024652278,0.0000110616475,0.0006633455,0.000010314722,0.000065591914,0.000005589765,0.000015672467,0.93037224,0.00010389414,0.0019085174,0.00008142287,0.06673772],"study_design_scores_gemma":[0.00090903335,0.00005183174,0.003728868,0.000072619856,0.000102395155,0.00024559523,0.0003575894,0.99115753,0.00002254929,0.001521398,0.0017069253,0.00012365259],"about_ca_topic_score_codex":0.0000058881496,"about_ca_topic_score_gemma":5.769458e-7,"teacher_disagreement_score":0.5591296,"about_ca_system_score_codex":0.000055382385,"about_ca_system_score_gemma":0.000018254792,"threshold_uncertainty_score":0.43479863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044324435,0.0000014757615,0.53872454,0.0015921013,0.00018844294,0.00018559743,0.0000029039,0.000057897287,0.4548146],"genre_scores_gemma":[0.8085517,3.776205e-7,0.18912075,0.0018799194,0.00010306546,0.00002227815,5.0917936e-7,0.0000122623105,0.0003091275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328434,0.0008095939,0.0006565551,0.0011946298,0.0032319322,0.00082293205],"domain_scores_gemma":[0.9955817,0.0027544962,0.00032220906,0.0008600834,0.0002628031,0.00021873915],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0192797,0.00022742033,0.00039529506,0.00091988203,0.0014920528,0.0006251131,0.0027807981,0.00013739853,0.000089776244],"category_scores_gemma":[0.011151208,0.00018098757,0.00019826581,0.0033289988,0.0012162434,0.0003386345,0.0004203683,0.00030793183,0.00020854209],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003921746,0.00003676324,0.0000770062,0.0000012080518,0.0000037353598,0.0000057286493,0.0014608591,0.009947562,0.0004384085,0.2160518,0.0002822922,0.7716554],"study_design_scores_gemma":[0.0005676968,0.00007327596,0.005590243,0.000030294834,0.000015109047,0.0000037177294,0.0024201574,0.7483132,0.0002097202,0.24049821,0.0019395663,0.00033883352],"about_ca_topic_score_codex":0.000005904348,"about_ca_topic_score_gemma":0.0000061860887,"teacher_disagreement_score":0.8041192,"about_ca_system_score_codex":0.0001514867,"about_ca_system_score_gemma":0.00024818702,"threshold_uncertainty_score":0.9998079},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90387434,0.000055448912,0.004668319,0.00084746367,0.00034142047,0.00028030455,0.0000028981258,0.00006802506,0.08986179],"genre_scores_gemma":[0.80988634,0.0001565564,0.18655883,0.00038279832,0.00047733096,0.000016645998,0.0000034102623,0.000014393542,0.0025037215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855256,0.000042045132,0.00055225665,0.00047615072,0.00015152141,0.00022543762],"domain_scores_gemma":[0.9991998,0.00013743615,0.00022203561,0.00030923178,0.00005013448,0.00008134949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440563,0.00013723996,0.00019102999,0.00034040902,0.00025189627,0.0004741885,0.00026098327,0.00005817219,0.00029810859],"category_scores_gemma":[0.00012029558,0.00012620629,0.000059178285,0.00021155602,0.00014857527,0.00060552795,0.00018861075,0.000108372915,0.00023495169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015505839,0.000009264629,0.023169426,0.0000075182065,0.00003453571,0.0000014854253,0.00033541984,0.0025789582,0.000014361648,0.045359213,0.00044534088,0.928029],"study_design_scores_gemma":[0.0025645474,0.00008529531,0.010203134,0.000040563988,0.00007585933,0.00022186284,0.021189194,0.38753715,0.0010488464,0.026343023,0.5496757,0.0010148148],"about_ca_topic_score_codex":0.0000025839297,"about_ca_topic_score_gemma":0.0000109238445,"teacher_disagreement_score":0.9270142,"about_ca_system_score_codex":0.00004192564,"about_ca_system_score_gemma":0.000020185495,"threshold_uncertainty_score":0.5146543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4379901,0.000044140812,0.55920255,0.00009918374,0.00013402182,0.0010807834,0.000016533073,0.00023301644,0.0011996682],"genre_scores_gemma":[0.4837402,5.998334e-7,0.51522917,0.0002165357,0.0006034621,0.000017971424,0.000013289035,0.0000601795,0.00011860305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923077,0.0007257782,0.0017045697,0.0017808105,0.0019701675,0.0015109236],"domain_scores_gemma":[0.9939245,0.0031414907,0.0006174218,0.0010210725,0.00096351455,0.00033201475],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.007999549,0.00053890375,0.00084706565,0.0010475146,0.0018686122,0.0006818376,0.0015586668,0.00028396884,0.000056729354],"category_scores_gemma":[0.0021608938,0.00047830745,0.00041112842,0.0020523497,0.0006318945,0.0006591814,0.00046627506,0.00070854736,0.000049583374],"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.00011930399,0.000276835,0.0028404186,0.000063717394,0.000115528965,0.00006933017,0.022920055,0.087679535,0.028294034,0.00017894454,0.000140233,0.85730207],"study_design_scores_gemma":[0.0015094663,0.00022738722,0.0001380863,0.00017041346,0.000024274575,0.000449181,0.006291837,0.98009735,0.008815959,0.0008997784,0.0006884695,0.0006878093],"about_ca_topic_score_codex":0.00008911913,"about_ca_topic_score_gemma":0.0000055586233,"teacher_disagreement_score":0.8924178,"about_ca_system_score_codex":0.00015989925,"about_ca_system_score_gemma":0.001001268,"threshold_uncertainty_score":0.9997669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9034317,0.0016278065,0.077888854,0.0023035924,0.00033375554,0.00015681419,0.000018087168,0.000030410927,0.014208986],"genre_scores_gemma":[0.99488825,0.000004096819,0.0046574464,0.00021158539,0.000167483,7.390563e-7,0.0000013730703,0.000014667736,0.00005438517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9967293,0.00011631328,0.0013825704,0.00029648808,0.0008231839,0.0006521094],"domain_scores_gemma":[0.9972822,0.00065072975,0.00038632727,0.00043003028,0.0002943593,0.00095634745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133364,0.00023464405,0.00068911526,0.0057873265,0.00008629582,0.00036786628,0.0010358831,0.0001492036,0.0005858385],"category_scores_gemma":[0.0053510764,0.00020811918,0.00042703093,0.0043696375,0.00007865453,0.0003951239,0.000013779204,0.0006279742,0.000015439846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018211047,0.000014415585,0.03592595,0.0000038861785,0.00020063337,0.0011502034,0.0012716645,0.94378144,0.00051396666,0.0026288456,0.0004288195,0.014061975],"study_design_scores_gemma":[0.004154038,0.0007133492,0.44842118,0.0007224961,0.00079341716,0.0023202617,0.0067098066,0.42673746,0.0009940203,0.013284701,0.09270033,0.0024489611],"about_ca_topic_score_codex":0.00026223258,"about_ca_topic_score_gemma":0.05947915,"teacher_disagreement_score":0.517044,"about_ca_system_score_codex":0.00022589008,"about_ca_system_score_gemma":0.0009056383,"threshold_uncertainty_score":0.9576829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9008967,0.00015341627,0.093343616,0.0028375501,0.0008913263,0.0015456793,0.00012141142,0.00003499104,0.00017525587],"genre_scores_gemma":[0.9206522,0.00005618078,0.07861332,0.000017847993,0.0004006775,0.000060388465,0.000008659023,0.000044473123,0.00014624384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9841354,0.0021696438,0.003774751,0.0006561092,0.008290377,0.0009737244],"domain_scores_gemma":[0.97956336,0.006409158,0.0016712197,0.00079204614,0.011144171,0.00042003213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023851648,0.00029138415,0.00089380064,0.0023669028,0.00081749976,0.0002996833,0.00225314,0.00025576502,0.00016570177],"category_scores_gemma":[0.0015908974,0.00020232565,0.0008619317,0.003730203,0.0012149482,0.00058691733,0.000015694062,0.001665052,0.000025893583],"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.013831999,0.0010989205,0.16114382,0.0015293801,0.00080003624,0.00009549658,0.017426942,0.44034165,0.098139174,0.059811424,0.0036152338,0.20216593],"study_design_scores_gemma":[0.02131702,0.0034427433,0.61877346,0.003824646,0.00036035676,0.000022618833,0.058157448,0.116425015,0.11527613,0.01036801,0.050671663,0.0013608681],"about_ca_topic_score_codex":0.00083644496,"about_ca_topic_score_gemma":0.002130741,"teacher_disagreement_score":0.45762965,"about_ca_system_score_codex":0.00035769667,"about_ca_system_score_gemma":0.0010751976,"threshold_uncertainty_score":0.82665527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6166055,0.0001144869,0.38023546,0.0014762956,0.00024216359,0.0010347837,0.00014669633,0.000010696408,0.0001339167],"genre_scores_gemma":[0.8166552,0.00023343881,0.18271756,0.000017073084,0.000115563846,0.00006224349,0.000007362268,0.00003658899,0.0001549302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98473656,0.0022480257,0.0036099711,0.0007185471,0.0077520735,0.00093481515],"domain_scores_gemma":[0.96847063,0.011093097,0.0014545647,0.0007500671,0.017869227,0.00036243227],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02768991,0.0002796646,0.0009463613,0.00199756,0.00049920165,0.00013279177,0.0016347729,0.00026121596,0.00017294852],"category_scores_gemma":[0.010035917,0.0001993809,0.00076461973,0.0040870677,0.0017219655,0.00058944797,0.000015818008,0.0017183584,0.0000036892523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013557151,0.0011792156,0.23789805,0.0010091063,0.00034538074,0.000108679335,0.016656883,0.5723484,0.06202229,0.051564217,0.0006025366,0.042708065],"study_design_scores_gemma":[0.0058365203,0.0026738993,0.16394773,0.0020907316,0.00021530406,0.000013628599,0.028475577,0.6930949,0.038694832,0.06348996,0.0008798258,0.0005870994],"about_ca_topic_score_codex":0.000865457,"about_ca_topic_score_gemma":0.0013034306,"teacher_disagreement_score":0.20004974,"about_ca_system_score_codex":0.00015519607,"about_ca_system_score_gemma":0.0016411161,"threshold_uncertainty_score":0.998303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247312,0.000085167274,0.05867593,0.0033133714,0.0001453302,0.0010198351,0.000028283253,0.000009650082,0.011991247],"genre_scores_gemma":[0.9488988,0.00001735544,0.049026243,0.00006633135,0.00054378354,0.000010734339,0.00000520425,0.000029143835,0.001402388],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9888818,0.0049283057,0.0014749052,0.00039743257,0.003960268,0.00035724667],"domain_scores_gemma":[0.99078983,0.0029471566,0.0009069214,0.0004923839,0.004744756,0.000118980046],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02574607,0.0001528759,0.00033457484,0.0008101755,0.00094731984,0.00032098716,0.0013443696,0.000048973998,0.0000905361],"category_scores_gemma":[0.024535907,0.00009630304,0.00031791467,0.0019379576,0.0006853345,0.0006259099,0.00023672631,0.0006256354,0.00001037343],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037163117,0.0009445305,0.04225803,0.00011377165,0.00037300654,0.000206902,0.02313416,0.20281357,0.6100777,0.015435441,0.030306209,0.070620365],"study_design_scores_gemma":[0.020761875,0.0063127764,0.16081822,0.0017007404,0.00016933594,0.006323235,0.019268056,0.28237575,0.3626227,0.011506378,0.1261539,0.001986999],"about_ca_topic_score_codex":0.00001914201,"about_ca_topic_score_gemma":0.000005768103,"teacher_disagreement_score":0.24745499,"about_ca_system_score_codex":0.000098632474,"about_ca_system_score_gemma":0.0015112426,"threshold_uncertainty_score":0.98368084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104926854,0.00010488876,0.89388067,0.000014501482,0.00024522166,0.0006034901,0.000004612831,0.000039210725,0.00018056676],"genre_scores_gemma":[0.6707028,5.4786312e-8,0.32879114,0.000011708646,0.00045456883,0.000004109345,0.0000044462395,0.000028137441,0.0000029935134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565566,0.00023629588,0.0021450666,0.00027312394,0.0010857614,0.00060410326],"domain_scores_gemma":[0.9840479,0.013480738,0.0015689811,0.00028336488,0.0005103153,0.00010872313],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010970279,0.0002826341,0.0008387944,0.0014487896,0.0001049528,0.00012562958,0.0005908974,0.00014877768,0.000008422078],"category_scores_gemma":[0.014093488,0.00024375619,0.00031240072,0.0013754719,0.00007487372,0.00030718686,0.000076423064,0.00053300033,7.362099e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006817257,0.000088222376,0.0013776891,0.000073355455,0.000031373853,0.0000013646388,0.001344958,0.99419904,0.00028105418,0.000036769135,0.000028562148,0.0024694423],"study_design_scores_gemma":[0.0011105401,0.0001372278,0.00063678046,0.00046760592,0.0000309235,0.000036062745,0.00036907176,0.9968906,0.000032434957,0.000016119695,0.000049522412,0.00022310372],"about_ca_topic_score_codex":0.0000051465177,"about_ca_topic_score_gemma":5.5581324e-7,"teacher_disagreement_score":0.565776,"about_ca_system_score_codex":0.00013385007,"about_ca_system_score_gemma":0.00024044166,"threshold_uncertainty_score":0.9942112},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3412702,0.00041766083,0.6561175,0.00016048522,0.00031334464,0.00006818791,0.000006666718,0.00002646603,0.0016194512],"genre_scores_gemma":[0.93687475,0.0000031887964,0.06260389,0.000055649038,0.00038875022,8.060994e-7,8.6353765e-7,0.000033676028,0.00003844109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972643,0.0000799844,0.0010577743,0.00028652945,0.00081424875,0.000497141],"domain_scores_gemma":[0.9973014,0.00047470143,0.00042399683,0.00036799719,0.00050809275,0.0009238279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023144183,0.00021085965,0.00035563702,0.0014633302,0.00023265029,0.0005195319,0.0006828405,0.0001527621,0.0005593412],"category_scores_gemma":[0.0034302585,0.0002050737,0.00016850504,0.00075249345,0.0000802974,0.001021837,0.000015015049,0.00056699297,0.000019140609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057413736,0.000003824866,0.0004980103,0.0000037285552,0.000014930398,0.00004047786,0.0013212312,0.98706883,0.00063366944,0.00016843106,0.000053393123,0.01018771],"study_design_scores_gemma":[0.000283335,0.000047139863,0.00009964245,0.00008151649,0.000016339402,0.00028808496,0.0008670771,0.9956331,0.0001734081,0.00023495864,0.0020603903,0.00021499113],"about_ca_topic_score_codex":0.000049232538,"about_ca_topic_score_gemma":0.0013371615,"teacher_disagreement_score":0.59560454,"about_ca_system_score_codex":0.00020400796,"about_ca_system_score_gemma":0.00035319413,"threshold_uncertainty_score":0.8362662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401691,0.0005362523,0.04761151,0.0020249814,0.0012195488,0.006079452,0.000025952882,0.0001321829,0.0022010459],"genre_scores_gemma":[0.99637944,0.00002943031,0.0012779915,0.00007918773,0.0012502065,0.00056273973,0.000005523507,0.00004429453,0.0003711784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98888075,0.0039171916,0.001208438,0.0012927887,0.0034021293,0.0012987059],"domain_scores_gemma":[0.9835853,0.01017723,0.0005132649,0.0008309949,0.004621443,0.00027177506],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.027483705,0.00038422583,0.00075916067,0.000835393,0.0025171083,0.0025497063,0.0013451055,0.00030148478,0.000052880023],"category_scores_gemma":[0.01748538,0.00020650157,0.00022421122,0.0029616305,0.00565575,0.00065790943,0.00029408684,0.001254707,0.000020180209],"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.012084197,0.00034322523,0.24807073,0.0013773297,0.0015450224,0.000025182993,0.01343083,0.10957417,0.00027990135,0.40393203,0.03065941,0.17867796],"study_design_scores_gemma":[0.0019785287,0.00019843971,0.0002809964,0.00010642215,0.00008420458,0.00045857465,0.013162291,0.9676828,0.00006585975,0.011542967,0.00414581,0.00029310497],"about_ca_topic_score_codex":0.00024346191,"about_ca_topic_score_gemma":0.00005625296,"teacher_disagreement_score":0.85810864,"about_ca_system_score_codex":0.00014236903,"about_ca_system_score_gemma":0.0013191766,"threshold_uncertainty_score":0.9987815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7621028,0.0017015993,0.193898,0.010700349,0.00014498133,0.0021838914,0.00005385333,0.000047817575,0.0291667],"genre_scores_gemma":[0.9945761,0.000074509866,0.0025996845,0.00042604635,0.00017685468,0.000049889084,0.000011280757,0.00002207342,0.0020635657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926198,0.002082334,0.0012591988,0.00062033674,0.002403183,0.0010151207],"domain_scores_gemma":[0.9899639,0.007775846,0.00007248481,0.00080951006,0.0011143023,0.0002639667],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.053558987,0.00017801509,0.00042405736,0.0015188145,0.0004322874,0.00038932962,0.001255826,0.00020903679,0.001836507],"category_scores_gemma":[0.009463204,0.00014060737,0.0001670267,0.0026443554,0.00079307694,0.0005246805,0.00016531118,0.0008844687,0.00028267875],"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.0013353026,0.00054027856,0.004057089,0.000007260607,0.00008748705,0.00011641418,0.004168569,0.4609464,0.009652186,0.0048927874,0.009842463,0.50435376],"study_design_scores_gemma":[0.0012776697,0.00035435095,0.014633969,0.000059244932,0.0000052388514,0.000038070615,0.0039607934,0.9664142,0.0039481227,0.0011332323,0.007852233,0.00032288898],"about_ca_topic_score_codex":0.00008284338,"about_ca_topic_score_gemma":0.00017016985,"teacher_disagreement_score":0.5054678,"about_ca_system_score_codex":0.00003815317,"about_ca_system_score_gemma":0.00031197822,"threshold_uncertainty_score":0.99907595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22537658,0.00013473802,0.7729629,0.00046106055,0.00037368975,0.00034878092,0.0000020665382,0.00002038421,0.00031977313],"genre_scores_gemma":[0.28854528,0.000103344515,0.7110505,0.000037026413,0.000103840655,0.000018087158,6.915012e-7,0.0000118557955,0.00012938095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987315,0.000024376599,0.000512982,0.00018149018,0.00036678917,0.0001828738],"domain_scores_gemma":[0.9990826,0.00013358484,0.0002775056,0.00012138241,0.00027657842,0.00010831413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010352249,0.000115204944,0.00021462221,0.00036168154,0.00012110297,0.00044784733,0.0001225725,0.00004950851,0.00004930467],"category_scores_gemma":[0.00023180147,0.000091703885,0.00006154956,0.00024508816,0.00004905605,0.00048351398,0.00005990206,0.000109077635,0.000002346895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040147384,0.000036860292,0.0016782052,0.00014037138,0.00013730336,0.0000056677,0.000958625,0.8237261,0.00034454098,0.0038465199,0.00072409544,0.16836153],"study_design_scores_gemma":[0.0011233931,0.000109495944,0.0012181,0.00007490194,0.00004265554,0.00026619452,0.003699161,0.9855927,0.00011810677,0.00035682824,0.0072576785,0.00014074518],"about_ca_topic_score_codex":0.0000010576928,"about_ca_topic_score_gemma":2.6325296e-7,"teacher_disagreement_score":0.16822077,"about_ca_system_score_codex":0.00002014518,"about_ca_system_score_gemma":0.0000197884,"threshold_uncertainty_score":0.4318602},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6516803,0.000061846906,0.322132,0.0006699055,0.0003782025,0.0034477517,0.000012246279,0.00018398272,0.021433748],"genre_scores_gemma":[0.48122746,0.000002700287,0.51801926,0.000032989967,0.00003417142,0.00021269254,0.0000046235864,0.000015453268,0.00045066772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964082,0.0001783592,0.0012281605,0.0007576813,0.0009407639,0.00048681287],"domain_scores_gemma":[0.9950245,0.0021294723,0.000711662,0.000591052,0.0014097665,0.00013355608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027855488,0.0002361889,0.00054656324,0.00055114826,0.0001943328,0.0003737913,0.0005640786,0.00016313567,0.00040853032],"category_scores_gemma":[0.007399148,0.00017431703,0.0002845143,0.0009798585,0.00040584462,0.0006552609,0.00012526695,0.00018708862,0.00008414955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032987463,0.00018088787,0.007250281,0.00010879936,0.00016875431,0.000003713154,0.0031982034,0.00574258,0.021087132,0.025814919,0.0001952205,0.93591964],"study_design_scores_gemma":[0.011206226,0.0015256446,0.003107885,0.0005934521,0.00021084608,0.0003580985,0.15507554,0.585243,0.06278981,0.17485343,0.0028284334,0.0022076373],"about_ca_topic_score_codex":0.0000879273,"about_ca_topic_score_gemma":0.000011649949,"teacher_disagreement_score":0.933712,"about_ca_system_score_codex":0.000057056546,"about_ca_system_score_gemma":0.00023174015,"threshold_uncertainty_score":0.8858006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3440274,0.0000060864577,0.6513321,0.00030112438,0.0006837806,0.0019894594,0.000056707733,0.00023229254,0.0013710813],"genre_scores_gemma":[0.9747208,7.7881836e-8,0.023927791,0.00013756701,0.00050542306,0.00016996103,0.000057029123,0.00003779423,0.00044356356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528265,0.0004164464,0.0014651611,0.0010064696,0.0012328414,0.00059641036],"domain_scores_gemma":[0.98956627,0.0062985253,0.0008242571,0.00078096584,0.00230831,0.00022168066],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021605385,0.00037677714,0.0005720178,0.00062527286,0.0004363633,0.0011299424,0.0006990482,0.00037464162,0.0014091774],"category_scores_gemma":[0.005651974,0.0003251512,0.00026140592,0.0008097995,0.00017513036,0.0010217169,0.00010804517,0.00032692443,0.0009972955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015431487,0.000041005067,0.0065522105,0.00002530708,0.000024915606,7.621308e-7,0.0009143541,0.9743168,0.00069852034,0.00040589934,0.000071095514,0.016794816],"study_design_scores_gemma":[0.002547797,0.000107951426,0.00020517907,0.00017827448,0.00002874646,0.0000024821823,0.0037319313,0.9897268,0.0011879365,0.00048627396,0.0014324222,0.0003642011],"about_ca_topic_score_codex":0.00002012264,"about_ca_topic_score_gemma":0.000008896613,"teacher_disagreement_score":0.6306934,"about_ca_system_score_codex":0.00015842875,"about_ca_system_score_gemma":0.00046536952,"threshold_uncertainty_score":0.99992007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055057127,0.0003118012,0.9422775,0.00012926571,0.00037624303,0.00020247471,0.00000366152,0.000023679193,0.0016182566],"genre_scores_gemma":[0.37284526,0.000084538726,0.6268604,0.000040016297,0.00009500773,0.0000047062754,2.0275701e-7,0.000010928128,0.000058935322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843675,0.00006110057,0.0007250685,0.00021619252,0.0003772921,0.00018357314],"domain_scores_gemma":[0.99858814,0.00058754504,0.0004002773,0.00014144255,0.0001500535,0.00013251744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026193478,0.0001419384,0.00030677067,0.0005641038,0.00009700065,0.00013309535,0.00016507394,0.00005084522,0.000027519058],"category_scores_gemma":[0.0007210954,0.00011455183,0.00008235755,0.00020614752,0.00013053424,0.00018218193,0.000061600564,0.0001378109,6.919651e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012319132,0.000020330785,0.0030471662,0.00016984121,0.00026208154,0.000056287416,0.0012310358,0.0033071362,0.00051803095,0.044273086,0.0003480704,0.94664377],"study_design_scores_gemma":[0.018567037,0.0022081672,0.10465895,0.002538582,0.0021242478,0.031362277,0.06035517,0.39122376,0.004541721,0.09921406,0.2798968,0.003309235],"about_ca_topic_score_codex":0.000002206576,"about_ca_topic_score_gemma":4.4158446e-7,"teacher_disagreement_score":0.9433345,"about_ca_system_score_codex":0.000017827713,"about_ca_system_score_gemma":0.000017836257,"threshold_uncertainty_score":0.4671288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85697263,0.000006354384,0.1380498,0.001526112,0.00026306888,0.0023076124,0.000027297594,0.00005131813,0.0007958237],"genre_scores_gemma":[0.91468585,4.5286868e-7,0.08441165,0.0005922952,0.00013161544,0.00010886374,0.0000017717527,0.000025904974,0.000041584783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884028,0.00051896303,0.0014417917,0.0014455987,0.0072325002,0.00095835415],"domain_scores_gemma":[0.99057657,0.0059346985,0.0005557083,0.0015517505,0.0010867489,0.00029451377],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.020229463,0.00037055262,0.0006032973,0.0014664866,0.0008370869,0.0010494895,0.00385008,0.000090640424,0.000018689585],"category_scores_gemma":[0.007737126,0.00021541535,0.00022624305,0.004305232,0.0020312066,0.0006969082,0.0006220998,0.00047183805,0.000046419842],"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.0012474395,0.0014580784,0.0101925675,0.000013696134,0.000076103024,0.000041601335,0.037975326,0.049377374,0.24557325,0.00072356814,0.0021354523,0.6511855],"study_design_scores_gemma":[0.0051718163,0.004000676,0.001654195,0.000268863,0.00004816868,0.00011501868,0.0676069,0.8496728,0.06844528,0.0010076462,0.0010991066,0.0009095458],"about_ca_topic_score_codex":0.000024780526,"about_ca_topic_score_gemma":0.0000027035778,"teacher_disagreement_score":0.8002954,"about_ca_system_score_codex":0.00018183097,"about_ca_system_score_gemma":0.00069305365,"threshold_uncertainty_score":0.99998754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86015534,0.00019112979,0.032402568,0.001459722,0.00007455302,0.00090773666,0.00000894876,0.000101413636,0.1046986],"genre_scores_gemma":[0.99611235,0.0000011038662,0.0028014034,0.00024324945,0.00013600646,0.000009533877,0.0000026838354,0.000015374984,0.00067828124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650466,0.0006000814,0.0009689478,0.0004337468,0.00101525,0.00047731632],"domain_scores_gemma":[0.9971689,0.0019203733,0.00029677048,0.00040687472,0.00015506326,0.00005202488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00553969,0.00017137908,0.00038643257,0.00026586495,0.00020480211,0.00022629752,0.000674603,0.00013110175,0.003968552],"category_scores_gemma":[0.0022923367,0.00009702615,0.00012655489,0.0013552068,0.00044848898,0.00020594163,0.00018997019,0.00033750775,0.00024785136],"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.0009065982,0.00200724,0.12360612,0.00009544325,0.00015836222,0.00011079266,0.05905885,0.06950274,0.020657774,0.074488066,0.040023223,0.6093848],"study_design_scores_gemma":[0.00042920178,0.000040340325,0.0016784945,0.000041892396,0.0000065256318,0.00002023531,0.00068182795,0.99588406,0.00013636457,0.00047054767,0.00047891407,0.00013157814],"about_ca_topic_score_codex":0.00002524854,"about_ca_topic_score_gemma":0.000007801515,"teacher_disagreement_score":0.92638135,"about_ca_system_score_codex":0.000034848264,"about_ca_system_score_gemma":0.000049630413,"threshold_uncertainty_score":0.996942},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55010825,0.000042436743,0.4463824,0.0002390813,0.00040439566,0.00024260426,8.6834643e-7,0.00001767463,0.0025622838],"genre_scores_gemma":[0.8808571,0.00028650102,0.11857621,0.00001974207,0.00012143807,0.000008593569,3.7550623e-7,0.000009674735,0.00012037263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998749,0.000046391153,0.00044220162,0.00015145216,0.00047466476,0.0001362983],"domain_scores_gemma":[0.9992941,0.00014889565,0.00028244514,0.00010571349,0.00011400309,0.00005486917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018852,0.00010104085,0.00020139986,0.0007787927,0.00004159756,0.00015588704,0.0001084292,0.0000337511,0.00002952686],"category_scores_gemma":[0.00019276199,0.00007589082,0.00003346193,0.0005209105,0.000060243707,0.000419742,0.000029788729,0.00014022703,6.3301195e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029516337,0.000023728888,0.0053794864,0.00001920109,0.0000595457,0.00018860097,0.0005946686,0.93523425,0.00009463081,0.0015953374,0.000033239416,0.05648214],"study_design_scores_gemma":[0.019704342,0.0020430135,0.051049653,0.002792661,0.00036339663,0.024944717,0.0988516,0.7273409,0.0024976414,0.0011833131,0.0672655,0.0019632678],"about_ca_topic_score_codex":0.0000029903874,"about_ca_topic_score_gemma":0.0000034219154,"teacher_disagreement_score":0.33074883,"about_ca_system_score_codex":0.000052057123,"about_ca_system_score_gemma":0.00003324744,"threshold_uncertainty_score":0.3094738},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5402566,0.0020983682,0.43147916,0.0018065262,0.0033110518,0.0050137285,0.00017538137,0.00007136643,0.015787788],"genre_scores_gemma":[0.97186226,0.000028943774,0.02709494,0.00006468306,0.00087198894,0.00002667948,4.6189027e-7,0.000028155715,0.000021918875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759686,0.000080042504,0.0010443153,0.0002079396,0.00057501474,0.00049585005],"domain_scores_gemma":[0.9979907,0.0010440134,0.00030142828,0.00017711113,0.00024307493,0.00024365455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034049428,0.00020860738,0.00048289867,0.0012327291,0.00009685188,0.000081080776,0.0002794559,0.0001386614,0.0007281041],"category_scores_gemma":[0.0028787674,0.00017565697,0.00014479895,0.0007013193,0.000096946664,0.00038803564,0.000019707937,0.00042123697,9.3572373e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084788835,0.0002877662,0.032785855,0.0028335953,0.0014745238,0.00011449727,0.039339047,0.48850763,0.35349482,0.016287772,0.0019191828,0.06210741],"study_design_scores_gemma":[0.013614474,0.00294984,0.013413916,0.016770054,0.0012674343,0.0029226085,0.025456406,0.5112482,0.28268555,0.0014298032,0.12464787,0.003593875],"about_ca_topic_score_codex":0.00016664703,"about_ca_topic_score_gemma":0.0005530081,"teacher_disagreement_score":0.4316056,"about_ca_system_score_codex":0.00019560671,"about_ca_system_score_gemma":0.0002330909,"threshold_uncertainty_score":0.797223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8412006,0.000055637647,0.103689514,0.00033471317,0.000023275888,0.00018652616,0.000004383489,0.000022953955,0.05448238],"genre_scores_gemma":[0.9800078,0.000002549949,0.01927056,0.00010594597,0.000023827894,0.0000023906096,0.0000010371357,0.0000055063438,0.0005803377],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99813783,0.00010297328,0.0006316005,0.0003111476,0.00054869376,0.00026774444],"domain_scores_gemma":[0.9967748,0.00247152,0.000089790876,0.0003300048,0.00021171721,0.00012219415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004402002,0.00009506523,0.00023512478,0.00023774136,0.000061460916,0.00011270722,0.00022103547,0.00008341967,0.00042757532],"category_scores_gemma":[0.0015890633,0.00006125095,0.000032861117,0.0009118783,0.0002536466,0.00023151243,0.00007135761,0.0001458595,0.000019724428],"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.00067426084,0.00046107164,0.8104018,0.000022113572,0.00003809572,0.00013827048,0.0038589144,0.0062231896,0.007319145,0.03383876,0.0013920319,0.13563237],"study_design_scores_gemma":[0.0028686689,0.00058013725,0.71384835,0.00015301403,0.000035508197,0.00017696152,0.0072821467,0.23396476,0.00820699,0.031317726,0.00078281626,0.00078292453],"about_ca_topic_score_codex":0.000104271596,"about_ca_topic_score_gemma":0.000273449,"teacher_disagreement_score":0.22774157,"about_ca_system_score_codex":0.000013253466,"about_ca_system_score_gemma":0.000060782513,"threshold_uncertainty_score":0.46816498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5661624,0.00015642404,0.4318874,0.00021064816,0.0010824986,0.00018088051,0.0000031771685,0.000025589246,0.00029099965],"genre_scores_gemma":[0.692428,0.00013758517,0.30712894,0.000016534932,0.00021205762,0.0000069327866,3.9185463e-7,0.00001103103,0.00005852907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784416,0.000045325487,0.00091395894,0.00026856316,0.0007074599,0.00022055414],"domain_scores_gemma":[0.99826705,0.0003674637,0.00057825295,0.00019363857,0.00046056585,0.00013302972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016305093,0.00016420643,0.00034494232,0.00081150635,0.00020419966,0.00010472646,0.00019263713,0.00006586101,0.000020503448],"category_scores_gemma":[0.00075053406,0.00013780754,0.00014555562,0.00041854687,0.00018302185,0.00015308599,0.00005616574,0.00019055535,0.000003521043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023176998,0.00005481952,0.0020991021,0.000106596744,0.0003301499,0.00012665,0.0006593952,0.78963727,0.0014032237,0.07388553,0.00022902882,0.13123645],"study_design_scores_gemma":[0.019002507,0.0017304992,0.035016634,0.001621806,0.0009677558,0.040436927,0.029266696,0.76367307,0.011951328,0.017355105,0.07642144,0.002556229],"about_ca_topic_score_codex":0.0000016403719,"about_ca_topic_score_gemma":1.7525274e-7,"teacher_disagreement_score":0.12868023,"about_ca_system_score_codex":0.0000636451,"about_ca_system_score_gemma":0.000043471875,"threshold_uncertainty_score":0.56196284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84904677,0.000084681706,0.016034584,0.0015008796,0.00009458198,0.0007561408,0.000012572987,0.00007088014,0.13239893],"genre_scores_gemma":[0.9967236,0.0000013746112,0.0018311385,0.00028153972,0.0001297927,0.000007721604,0.0000029299993,0.000012401958,0.0010094836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966297,0.00071404374,0.0008917841,0.0003877344,0.00094153243,0.00043521062],"domain_scores_gemma":[0.99603164,0.00308752,0.00022135112,0.00049801095,0.00011094318,0.00005055979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005559107,0.00015268911,0.00036358502,0.00024150351,0.00013914901,0.00013787136,0.00068418426,0.0001252973,0.009014267],"category_scores_gemma":[0.0025014535,0.000085397754,0.00014758667,0.0011040847,0.00041410403,0.0001294479,0.00020178451,0.00030686543,0.0005588068],"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.0010620418,0.0022649427,0.17119054,0.00004057235,0.00027948152,0.00014095167,0.04522478,0.0794444,0.020695396,0.32810223,0.14174272,0.20981193],"study_design_scores_gemma":[0.0004614203,0.00004892087,0.0024557959,0.000017923692,0.0000056900963,0.000016885646,0.00046828046,0.99469453,0.00012070197,0.000631349,0.00095884484,0.00011967242],"about_ca_topic_score_codex":0.00003987252,"about_ca_topic_score_gemma":0.000010282022,"teacher_disagreement_score":0.9152501,"about_ca_system_score_codex":0.00002953434,"about_ca_system_score_gemma":0.00002866458,"threshold_uncertainty_score":0.9918916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972886,0.00006160143,0.00030823468,0.0001992292,0.0005050107,0.00017502949,0.000016227525,0.000004563836,0.0014415038],"genre_scores_gemma":[0.9977215,0.000013591541,0.0014256105,0.0000120629165,0.0006962753,0.0000020420243,4.3621992e-7,0.000015143835,0.000113316964],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980918,0.00009698006,0.00067270966,0.00018393705,0.00066895655,0.00028558253],"domain_scores_gemma":[0.9986882,0.00043047336,0.0003726324,0.00016780014,0.00015918427,0.00018168909],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011610078,0.00017719126,0.00037078658,0.0010627257,0.00009366971,0.00004949884,0.00023229637,0.00009411255,0.0027518214],"category_scores_gemma":[0.0011818439,0.00014033497,0.0001240077,0.0008766217,0.00009974471,0.00031424226,0.000020887546,0.00037631227,0.0000010212098],"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.000035814206,0.000060917064,0.7000851,0.00014143094,0.00018260974,0.0000029664739,0.014906258,0.2604946,0.016183354,0.0006660465,0.0002966433,0.0069442717],"study_design_scores_gemma":[0.0005599166,0.00018369427,0.97223467,0.0009802555,0.000067904795,0.00007508387,0.006195488,0.008178987,0.008989338,0.000047444086,0.0021821735,0.00030507654],"about_ca_topic_score_codex":0.00034052107,"about_ca_topic_score_gemma":0.0024485968,"teacher_disagreement_score":0.27214953,"about_ca_system_score_codex":0.0001483342,"about_ca_system_score_gemma":0.00014825283,"threshold_uncertainty_score":0.9981598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8892166,0.0005887047,0.102648646,0.0006323454,0.0013938651,0.0025244618,0.000106538704,0.00017452118,0.0027142935],"genre_scores_gemma":[0.8570555,0.00001048095,0.14069526,0.000044758526,0.00053679425,0.00065653207,0.000013149606,0.000051433806,0.0009361054],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928144,0.0009395302,0.0007503174,0.0008917503,0.0028912812,0.0017127289],"domain_scores_gemma":[0.986768,0.009352344,0.00041569464,0.0010445149,0.0020138219,0.00040560315],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009727415,0.00036107996,0.00055167585,0.0013935002,0.0011251997,0.0007104823,0.00092922954,0.00026455987,0.00032761053],"category_scores_gemma":[0.010319762,0.00027008544,0.00019428569,0.001612927,0.002009763,0.0022212502,0.00018860448,0.00082562235,0.00013803913],"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.0035787835,0.0005693312,0.5280178,0.00022091465,0.00020597025,0.000016488,0.0029018892,0.009345886,0.010397708,0.012978712,0.0039976514,0.42776883],"study_design_scores_gemma":[0.01994754,0.0015416997,0.019277457,0.0010058398,0.00012848373,0.00049466983,0.056113996,0.4308968,0.20459583,0.0042788843,0.25847045,0.0032483537],"about_ca_topic_score_codex":0.00006476823,"about_ca_topic_score_gemma":0.00008213837,"teacher_disagreement_score":0.50874037,"about_ca_system_score_codex":0.0001877023,"about_ca_system_score_gemma":0.0009599691,"threshold_uncertainty_score":0.99997514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2272073,0.000012387323,0.7688859,0.00032990763,0.00017789252,0.0014462175,0.000016033297,0.00007325905,0.0018510814],"genre_scores_gemma":[0.90778464,0.0000028090687,0.09104098,0.00044841474,0.000114098795,0.00017002574,0.000009351259,0.000029083747,0.0004006191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946838,0.0011195195,0.0014016175,0.0013402543,0.0009641311,0.0004906476],"domain_scores_gemma":[0.9881874,0.009508446,0.00038900785,0.00093275635,0.00085441745,0.00012799719],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052142586,0.00038863465,0.00061285996,0.0018568556,0.00018517322,0.0007938797,0.00089053257,0.00023001603,0.00017775247],"category_scores_gemma":[0.00993711,0.000311982,0.000121060424,0.0016638762,0.00017539335,0.00062454445,0.0004333763,0.00040965324,0.00014003593],"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.0003770732,0.00006625343,0.016876062,0.00002041426,0.0000214255,0.00000428401,0.0056608277,0.36645827,0.00060249696,0.0052094827,0.00005027719,0.6046531],"study_design_scores_gemma":[0.0006581991,0.00015739263,0.024866633,0.00016326892,0.000015616972,0.000010950143,0.002145423,0.93796545,0.00008792672,0.018716583,0.014812025,0.00040055797],"about_ca_topic_score_codex":0.00009442258,"about_ca_topic_score_gemma":0.0003457264,"teacher_disagreement_score":0.68057734,"about_ca_system_score_codex":0.00013013,"about_ca_system_score_gemma":0.00015723638,"threshold_uncertainty_score":0.99993324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25145012,0.00027276334,0.7457772,0.00029832308,0.00019761645,0.00025890098,0.00001293876,0.000017220002,0.001714916],"genre_scores_gemma":[0.88983357,0.0000031080983,0.10986847,0.00005137706,0.00016980594,0.0000041841895,3.363769e-7,0.000026416516,0.000042712534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974761,0.000055676584,0.0010157983,0.00027153792,0.00078126375,0.00039963264],"domain_scores_gemma":[0.9973787,0.00035458058,0.0005212836,0.00036266568,0.00054887007,0.00083390425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147691,0.00019831912,0.0004688415,0.001277948,0.00009650783,0.00014547784,0.0006025737,0.0000978201,0.00048307006],"category_scores_gemma":[0.0017327514,0.00015341854,0.00009517317,0.0012583059,0.00021934371,0.00020783285,0.000017065515,0.00032581948,0.000018303666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005065147,0.000014149646,0.04407187,0.000033812114,0.00010181921,0.00015024027,0.0029269392,0.77995735,0.0024300741,0.0002813526,0.00022002449,0.16976172],"study_design_scores_gemma":[0.0029504106,0.0011078834,0.013391061,0.0012102807,0.00016725648,0.010906457,0.008424105,0.922948,0.0032885983,0.0003365972,0.034021575,0.0012477769],"about_ca_topic_score_codex":0.00019648159,"about_ca_topic_score_gemma":0.0057941135,"teacher_disagreement_score":0.63838345,"about_ca_system_score_codex":0.00012985362,"about_ca_system_score_gemma":0.00043866542,"threshold_uncertainty_score":0.6256227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5023365,0.000097917065,0.4922121,0.0002545143,0.00027549846,0.000102406775,0.0000011850804,0.00003012217,0.004689784],"genre_scores_gemma":[0.9494264,0.00013580959,0.049778923,0.000051746847,0.00009834697,0.0000012017091,2.2326962e-7,0.000008129896,0.00049921055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984469,0.000026193884,0.0006328597,0.00015168435,0.0006034951,0.00013889933],"domain_scores_gemma":[0.9992634,0.00016245215,0.00019476132,0.00015660602,0.00012803343,0.000094745694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010162661,0.00010690112,0.00020141914,0.0004273646,0.00006668315,0.00015834735,0.0001698477,0.000043625754,0.00014296971],"category_scores_gemma":[0.00014726557,0.000085510816,0.00008442355,0.000281762,0.000038076596,0.00031694546,0.00002437401,0.00013557589,0.0000102133745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021015081,0.0000054912384,0.000060118397,0.000006766075,0.000027503962,0.000006968879,0.00009417764,0.76669276,0.0000945117,0.0012960836,0.000055078828,0.23163953],"study_design_scores_gemma":[0.00047798015,0.000030581443,0.0007774518,0.000036355206,0.000029026096,0.00017544568,0.00027793847,0.9784319,0.000043670712,0.0018721133,0.017743994,0.00010357985],"about_ca_topic_score_codex":6.0466226e-7,"about_ca_topic_score_gemma":1.0058651e-7,"teacher_disagreement_score":0.4470899,"about_ca_system_score_codex":0.000028157072,"about_ca_system_score_gemma":0.000015019223,"threshold_uncertainty_score":0.34870297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036208645,0.000027724429,0.87058085,0.00067513203,0.00040694524,0.0015435987,0.000029729748,0.00035581493,0.09017157],"genre_scores_gemma":[0.16133858,7.210819e-7,0.82276386,0.00042646905,0.0006487974,0.00009049592,0.0000211405,0.00005690077,0.014653033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943131,0.0002057442,0.001380277,0.0016240798,0.0014828166,0.0009939816],"domain_scores_gemma":[0.99384105,0.0031676171,0.0004416137,0.001625634,0.00043481315,0.0004892489],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0077812825,0.00047342377,0.0006994945,0.0009471352,0.000492548,0.0010563963,0.0021692063,0.0004404049,0.0014175132],"category_scores_gemma":[0.016231079,0.00035013453,0.00055991765,0.0016106856,0.0003346997,0.00046177418,0.00028943905,0.00088729867,0.0002934752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006977403,0.0005449576,0.007192893,0.00006594197,0.00024973435,0.000022498587,0.0074682133,0.004122965,0.11395985,0.050896488,0.03248701,0.7822917],"study_design_scores_gemma":[0.008472569,0.00022192324,0.0005057898,0.000030524538,0.00009864807,0.00034742887,0.019319719,0.76027095,0.0119562885,0.0075035356,0.18946992,0.0018027028],"about_ca_topic_score_codex":0.00014946911,"about_ca_topic_score_gemma":0.0000894336,"teacher_disagreement_score":0.780489,"about_ca_system_score_codex":0.000030836254,"about_ca_system_score_gemma":0.0008752023,"threshold_uncertainty_score":0.9999806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5889698,0.000036064743,0.37614834,0.000044114924,0.0001537716,0.00022979265,0.000004224293,0.00012012398,0.03429376],"genre_scores_gemma":[0.7876636,0.0000011476725,0.21009843,0.000105027466,0.0001312663,0.0000044019807,0.0000069787493,0.000018719613,0.0019704313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734914,0.00028143253,0.0007790341,0.00047876977,0.00073156,0.00038004614],"domain_scores_gemma":[0.99793684,0.0007474705,0.00029641396,0.00062283216,0.00026204914,0.00013436619],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021321198,0.00017415675,0.00027260452,0.0003956601,0.00038542395,0.00018273258,0.0004647182,0.00015805142,0.004725566],"category_scores_gemma":[0.00047542175,0.00013910852,0.00019502208,0.0019001208,0.00015328117,0.00045474852,0.00011632639,0.00017519886,0.0005649552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003577131,0.000035252036,0.06441311,9.70129e-7,0.000026312971,0.000002234536,0.0010656705,0.923288,0.00013126832,0.0029587424,0.0002804141,0.007762244],"study_design_scores_gemma":[0.00027044312,0.00002348769,0.0054834755,0.000009268174,0.00002272079,0.0000066001758,0.00023807262,0.98073345,0.000023387724,0.012555501,0.00045061813,0.00018297549],"about_ca_topic_score_codex":0.00015170529,"about_ca_topic_score_gemma":0.00015984249,"teacher_disagreement_score":0.1986938,"about_ca_system_score_codex":0.00007137449,"about_ca_system_score_gemma":0.00008999786,"threshold_uncertainty_score":0.99618423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71824616,0.00006094031,0.2746641,0.00014503175,0.000818954,0.00063754164,0.000016988648,0.000035498648,0.0053748004],"genre_scores_gemma":[0.74045324,0.00004069142,0.2591629,0.00004399699,0.00008801432,0.000046813984,0.000008200978,0.00001223469,0.00014390644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810135,0.000058392638,0.0008251449,0.00055519224,0.00020862762,0.0002513022],"domain_scores_gemma":[0.99830556,0.0003391124,0.00061276637,0.00036825644,0.0002789884,0.00009532693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014978958,0.00018276053,0.00037597716,0.0005044161,0.00014307348,0.00019206938,0.00025781064,0.00009245379,0.000022041026],"category_scores_gemma":[0.0005784917,0.00017936056,0.00010553218,0.00032063658,0.00043939272,0.00032863492,0.00008595345,0.00008436189,0.000013815535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007142656,0.000059623384,0.019083561,0.0002018323,0.00015182777,0.0000020550758,0.000833729,0.070914194,0.0001783789,0.20158708,0.00029859514,0.7059749],"study_design_scores_gemma":[0.013375996,0.0006888048,0.0024960297,0.00023364685,0.00030920425,0.00009945983,0.047795974,0.63189477,0.019285524,0.25855538,0.023783816,0.001481408],"about_ca_topic_score_codex":0.000004574949,"about_ca_topic_score_gemma":0.000004804473,"teacher_disagreement_score":0.70449346,"about_ca_system_score_codex":0.00006774721,"about_ca_system_score_gemma":0.00013569092,"threshold_uncertainty_score":0.73141116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14322262,0.00017044674,0.849729,0.0012754422,0.0001487419,0.00072880153,0.0000016195735,0.000051904462,0.004671451],"genre_scores_gemma":[0.2532785,0.00000820902,0.7458724,0.00017422084,0.000059375147,0.00006230897,0.000004256042,0.000012063674,0.0005286804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733096,0.0006415109,0.00065783894,0.00057507557,0.00050299946,0.00029158653],"domain_scores_gemma":[0.99553275,0.0034266314,0.00019633565,0.00030911982,0.00043346317,0.00010171833],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012564774,0.0001426956,0.00031103284,0.00059860386,0.000074819,0.00023911292,0.00032967768,0.00016116905,0.000033647542],"category_scores_gemma":[0.022640686,0.00011088561,0.000045408164,0.001010895,0.000097902914,0.00041739058,0.00010388466,0.00013501331,0.0000119064825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004012252,0.00005355775,0.027189473,0.000016289696,0.000021417834,0.0000030931412,0.008012652,0.8414128,0.00086533907,0.010595836,0.00074163347,0.11068671],"study_design_scores_gemma":[0.0015267481,0.00013959354,0.0006384806,0.000023777726,0.000011171342,0.000024272123,0.012552407,0.968897,0.00097053737,0.013442283,0.0015292148,0.0002445112],"about_ca_topic_score_codex":0.0001131711,"about_ca_topic_score_gemma":0.00011848845,"teacher_disagreement_score":0.12748423,"about_ca_system_score_codex":0.00005447367,"about_ca_system_score_gemma":0.00026847312,"threshold_uncertainty_score":0.985592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029936222,0.00013822703,0.95694447,0.0018990902,0.00056820427,0.0010426734,0.0000046110936,0.00019587248,0.009270642],"genre_scores_gemma":[0.017328102,0.0000026151913,0.98043567,0.0007574468,0.00012098327,0.00014652968,0.000005613711,0.000035854177,0.0011671622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952577,0.000812498,0.0011434646,0.0009837146,0.001075337,0.0007272968],"domain_scores_gemma":[0.99054694,0.0070885764,0.00037080754,0.00075107644,0.0009778426,0.00026477102],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.020861702,0.0003121695,0.00057394133,0.00070858997,0.00024695552,0.00076197815,0.0012564546,0.0001870665,0.000041709503],"category_scores_gemma":[0.04139137,0.00022111893,0.0002509312,0.0018256501,0.0001708294,0.00051066367,0.00025356357,0.00024158036,0.00008969366],"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.00030446204,0.00006009924,0.0036440697,0.000036539917,0.00014338308,0.000012342764,0.005966192,0.11282235,0.00095480174,0.035862442,0.0036392582,0.83655405],"study_design_scores_gemma":[0.0022742904,0.00029030853,0.000063225314,0.00008522342,0.00004870774,0.00009426386,0.038585577,0.7491976,0.013314683,0.113786966,0.08111509,0.0011440917],"about_ca_topic_score_codex":0.00013329163,"about_ca_topic_score_gemma":0.000024013729,"teacher_disagreement_score":0.83541,"about_ca_system_score_codex":0.00021377664,"about_ca_system_score_gemma":0.0013923546,"threshold_uncertainty_score":0.9666834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9207766,0.0066969004,0.05850369,0.00016662212,0.0008726922,0.00064308924,0.000019723295,0.00004904661,0.012271607],"genre_scores_gemma":[0.9946693,0.0011355075,0.0032325191,0.0001642759,0.00019624454,0.000012916999,0.0000109266475,0.000049566195,0.0005287136],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9919775,0.000689188,0.003139717,0.0007952252,0.0027349931,0.00066333916],"domain_scores_gemma":[0.990938,0.0034508258,0.0028903014,0.0010682539,0.0012824256,0.00037020922],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013197427,0.00039940636,0.0011459986,0.0022573622,0.00033775604,0.0018748606,0.005404983,0.00025619386,0.011986381],"category_scores_gemma":[0.005643808,0.00032316553,0.000394399,0.00393413,0.00035347964,0.002878201,0.0010368595,0.0006412591,0.000025709473],"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.0010469541,0.0003529966,0.5051791,0.000035882684,0.000256263,0.00011125385,0.0014446876,0.0035394898,0.16741727,0.00014434395,0.013411243,0.30706048],"study_design_scores_gemma":[0.00093994464,0.000028052396,0.9552721,0.00036499044,0.00007110118,0.000077800054,0.0019779806,0.01674099,0.015447003,0.0060006552,0.0024200333,0.0006593884],"about_ca_topic_score_codex":0.00028889166,"about_ca_topic_score_gemma":0.00014557938,"teacher_disagreement_score":0.45009294,"about_ca_system_score_codex":0.00014755706,"about_ca_system_score_gemma":0.00023010733,"threshold_uncertainty_score":0.9999763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89687365,0.0005993664,0.051623095,0.003736077,0.0015897454,0.0017981074,0.00022403494,0.00027775762,0.043278173],"genre_scores_gemma":[0.97933394,0.00002630648,0.01857998,0.00024108442,0.00065888185,0.00012656144,0.00001948071,0.000047125723,0.00096661923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.993717,0.0012706474,0.0007975536,0.0011023637,0.0022104883,0.00090192095],"domain_scores_gemma":[0.9865263,0.010852512,0.00033112668,0.00084025465,0.0010721396,0.0003776676],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012457524,0.0002973633,0.00050755095,0.0012303296,0.0011616003,0.0024643017,0.0008967447,0.00024401872,0.00017256234],"category_scores_gemma":[0.009971103,0.00023617329,0.000111828194,0.0006865295,0.0015672147,0.0006152335,0.0002629506,0.00084735564,0.000086233915],"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.0028727234,0.00012173973,0.026602797,0.00023643172,0.00023586457,0.000070361326,0.006315469,0.022553915,0.008604623,0.4634416,0.102847,0.36609745],"study_design_scores_gemma":[0.004555406,0.0014525373,0.0025202269,0.000676529,0.000036817375,0.00043517502,0.07427762,0.13711807,0.004114086,0.10450231,0.6691299,0.0011813253],"about_ca_topic_score_codex":0.000024654208,"about_ca_topic_score_gemma":0.000009555857,"teacher_disagreement_score":0.56628287,"about_ca_system_score_codex":0.00007257306,"about_ca_system_score_gemma":0.00030097453,"threshold_uncertainty_score":0.9985712},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65120137,0.0006317498,0.32876194,0.00049226556,0.00015495681,0.00034173677,0.0000032405612,0.0000671982,0.018345544],"genre_scores_gemma":[0.724066,0.0000029091755,0.27433786,0.00043340234,0.000053327993,0.00002755656,9.2311535e-7,0.000012682889,0.0010652886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980139,0.00014540038,0.00050088734,0.0005061871,0.0004840364,0.00034958567],"domain_scores_gemma":[0.99738175,0.0019241819,0.00013274542,0.00032417345,0.00008756304,0.00014956496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033367516,0.00014607997,0.00027733808,0.00023113082,0.0002458713,0.0004254031,0.00026220974,0.00008299309,0.00022964978],"category_scores_gemma":[0.005486645,0.000104781095,0.0000936339,0.00037527215,0.00008629117,0.00020903334,0.000037636488,0.00009908222,0.000029810844],"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.00017234807,0.000059043683,0.06938576,0.000022314594,0.00008960326,0.000023400484,0.004243146,0.013090838,0.0075176666,0.8640458,0.0023869814,0.038963076],"study_design_scores_gemma":[0.00642703,0.0002769643,0.0021949364,0.00007776998,0.000057539615,0.0003331539,0.00946755,0.18706566,0.0200974,0.51850957,0.25421897,0.0012734722],"about_ca_topic_score_codex":0.0000058675073,"about_ca_topic_score_gemma":0.000002259793,"teacher_disagreement_score":0.34553626,"about_ca_system_score_codex":0.000012157114,"about_ca_system_score_gemma":0.00007560915,"threshold_uncertainty_score":0.6568423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049668036,0.00023250325,0.9472827,0.00033972375,0.0004803467,0.00052193576,0.000056225865,0.00003758122,0.0013809506],"genre_scores_gemma":[0.8026971,0.0000015997382,0.19656754,0.00013018743,0.00039684167,0.000019635663,0.0000024380263,0.000068464135,0.00011617063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560475,0.000063501604,0.0017575371,0.0005233696,0.0010709829,0.0009798709],"domain_scores_gemma":[0.9926165,0.0040874514,0.00068244763,0.0006088986,0.0009481662,0.0010565737],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007097604,0.000394127,0.000764628,0.0021644286,0.00029451124,0.0006139719,0.0013404255,0.00023956521,0.000063766485],"category_scores_gemma":[0.034541007,0.0003363738,0.00049802905,0.0010514179,0.00013076962,0.0005276399,0.000049417824,0.0006363132,0.000009473723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033152122,0.000013028721,0.00055094174,0.000026153588,0.000048897087,0.000011854504,0.0015136834,0.98320895,0.002645532,0.0006795829,0.0006363109,0.01063191],"study_design_scores_gemma":[0.001522225,0.00010988581,0.00011494273,0.00038692486,0.00003173377,0.00037605828,0.0004400733,0.96943724,0.00011213656,0.0018227674,0.025261976,0.00038402533],"about_ca_topic_score_codex":0.00021348473,"about_ca_topic_score_gemma":0.02544393,"teacher_disagreement_score":0.7530291,"about_ca_system_score_codex":0.00022192133,"about_ca_system_score_gemma":0.002114766,"threshold_uncertainty_score":0.9999088},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20037438,0.000025555255,0.79320604,0.00032396807,0.00003937666,0.00048397234,0.000004577273,0.00005732724,0.0054848273],"genre_scores_gemma":[0.96909183,0.0000024671667,0.029839225,0.00013278694,0.000036043573,0.00010088207,4.6939695e-7,0.000019885725,0.0007764262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559677,0.00004365813,0.00077788066,0.0011443057,0.0015853078,0.00085209066],"domain_scores_gemma":[0.9969932,0.0016451032,0.00014549919,0.000794919,0.00021469632,0.00020662125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007515819,0.00021637428,0.0003813213,0.0005618762,0.0003110864,0.00037002648,0.0018988921,0.00011353209,0.00021530315],"category_scores_gemma":[0.0016243944,0.00013214412,0.000104604034,0.0012048262,0.00065496104,0.00045735616,0.00034834852,0.00015155549,0.000603887],"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.00020297641,0.00009407686,0.00008411284,0.0000073489996,0.000005839954,0.0000052887267,0.0015541908,0.16982245,0.31414592,0.005294048,0.00004127024,0.50874245],"study_design_scores_gemma":[0.00043873757,0.000020740832,0.000019868312,0.000034755478,0.0000029631503,0.000008031818,0.00013138921,0.8965151,0.00023833419,0.10235906,0.00003494254,0.00019609819],"about_ca_topic_score_codex":0.0000021737078,"about_ca_topic_score_gemma":0.0000065179715,"teacher_disagreement_score":0.7687174,"about_ca_system_score_codex":0.00018722202,"about_ca_system_score_gemma":0.00027706215,"threshold_uncertainty_score":0.77619475},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5822941,0.0016522435,0.40985495,0.0003037635,0.0008083727,0.00010087295,0.0000066064654,0.000017062055,0.0049620126],"genre_scores_gemma":[0.9848061,0.0000029638434,0.014782714,0.00003361373,0.00028868997,7.590889e-7,7.7495116e-7,0.000024999563,0.0000593707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969733,0.00010051531,0.0013436477,0.00020749932,0.00097447966,0.00040058617],"domain_scores_gemma":[0.99662244,0.0005328224,0.0006833192,0.00031921588,0.00096589216,0.0008763094],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0047997744,0.0001768101,0.0004379267,0.0013396044,0.00008142007,0.00023341742,0.00069459004,0.00010902609,0.000092460024],"category_scores_gemma":[0.0138823185,0.00015863676,0.00016143106,0.0008944024,0.000076618046,0.00053939543,0.000026318403,0.00037607588,0.000010519074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046304016,0.000014047484,0.0027589654,0.00003987107,0.000099345474,0.0001596045,0.007072074,0.91980815,0.025677068,0.0027069352,0.0008782599,0.040739402],"study_design_scores_gemma":[0.008197159,0.0015311975,0.01871349,0.0060838885,0.00035954264,0.003600398,0.055925753,0.46540818,0.23879725,0.02391921,0.17364565,0.003818289],"about_ca_topic_score_codex":0.0001734562,"about_ca_topic_score_gemma":0.007197149,"teacher_disagreement_score":0.45439994,"about_ca_system_score_codex":0.00020589509,"about_ca_system_score_gemma":0.0016998566,"threshold_uncertainty_score":0.99442416},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8025401,0.0006320629,0.106014125,0.015316309,0.0007909525,0.0010622211,0.000110762856,0.0006277341,0.07290573],"genre_scores_gemma":[0.3168613,0.0000033125127,0.6774356,0.0024676716,0.0005551087,0.000022644903,0.000054571883,0.000043967797,0.0025558246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994243,0.00048699658,0.0010949677,0.0010318201,0.0024824855,0.0006607255],"domain_scores_gemma":[0.9958307,0.0016943272,0.00046217395,0.0010399808,0.0005690651,0.00040375674],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006607111,0.0003851743,0.00053661806,0.00053371006,0.00027085855,0.00058843906,0.0011776512,0.0002603798,0.00048578382],"category_scores_gemma":[0.010501884,0.0002988863,0.00025912886,0.0014367967,0.00022101337,0.0004774465,0.00015722882,0.00045663747,0.00088730286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001359252,0.0007670966,0.013806628,0.00005251767,0.00014969638,0.000384993,0.015348477,0.47676438,0.024549743,0.0053671026,0.001589384,0.45986074],"study_design_scores_gemma":[0.0078078285,0.0009313567,0.0021237428,0.00021595863,0.00013445369,0.00021038976,0.024721272,0.82878214,0.0063316934,0.023050008,0.10326788,0.0024232871],"about_ca_topic_score_codex":0.00003998049,"about_ca_topic_score_gemma":0.000018346507,"teacher_disagreement_score":0.57142144,"about_ca_system_score_codex":0.00016576311,"about_ca_system_score_gemma":0.00047129064,"threshold_uncertainty_score":0.9999463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35499755,0.000012911813,0.64098626,0.0016065212,0.00051321683,0.000111575915,0.0000017493439,0.000026654,0.0017435951],"genre_scores_gemma":[0.90349936,0.00003511124,0.095363304,0.000032030566,0.00012148409,0.000004478296,1.2663763e-7,0.000008145334,0.0009359329],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985166,0.000037026188,0.00051575643,0.00018269915,0.00058893533,0.00015896084],"domain_scores_gemma":[0.99899143,0.00019693511,0.0002620733,0.0001856588,0.00021273494,0.00015115153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014490625,0.00010672641,0.00019123095,0.00075071154,0.00008697621,0.0001748757,0.00018163153,0.000044794808,0.00017086862],"category_scores_gemma":[0.0004758567,0.00007197885,0.00007431908,0.0004198669,0.000036288406,0.0006357049,0.000072248484,0.00010518125,0.00003964007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088698296,0.00003587211,0.0025152562,0.000018940045,0.00013509725,0.00002476209,0.00022009177,0.057581816,0.020307127,0.018795187,0.0019126788,0.8983645],"study_design_scores_gemma":[0.012429984,0.0028454545,0.15927982,0.0015043544,0.0005750011,0.005047484,0.005152884,0.044034448,0.091527686,0.014791102,0.66020966,0.0026021458],"about_ca_topic_score_codex":6.1967535e-7,"about_ca_topic_score_gemma":4.010088e-7,"teacher_disagreement_score":0.8957623,"about_ca_system_score_codex":0.0000680774,"about_ca_system_score_gemma":0.000035349145,"threshold_uncertainty_score":0.29352126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6839693,0.00018456676,0.30892292,0.0038454009,0.000013537895,0.0018700295,0.00022986757,0.00001848227,0.00094587123],"genre_scores_gemma":[0.8875474,0.00003188702,0.11160949,0.000085702275,0.000047025747,0.00040155073,0.0000068395802,0.00001963652,0.00025051952],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991067,0.0036103053,0.0013106519,0.0008560625,0.0024270483,0.0007289121],"domain_scores_gemma":[0.98037183,0.015120002,0.00020556846,0.0015182527,0.0026243043,0.00016003089],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.030926015,0.0002030708,0.0004932801,0.0010906094,0.0004858337,0.00034148333,0.0025953706,0.00017806745,0.00010094675],"category_scores_gemma":[0.020929474,0.00011335793,0.00016623281,0.0020443178,0.0013165371,0.00066127133,0.00025994267,0.0004036242,0.000011205878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010390839,0.0013478183,0.0070165223,0.00008770683,0.00012870962,0.000008386475,0.03425513,0.12738073,0.64975387,0.06284706,0.0010839921,0.115050994],"study_design_scores_gemma":[0.0023737496,0.0010679131,0.0053979815,0.00042387686,0.000013075831,0.000013008784,0.05238738,0.64224786,0.27849784,0.012165638,0.0049762754,0.00043540067],"about_ca_topic_score_codex":0.0011684237,"about_ca_topic_score_gemma":0.0007061215,"teacher_disagreement_score":0.5148671,"about_ca_system_score_codex":0.000027636077,"about_ca_system_score_gemma":0.00041380394,"threshold_uncertainty_score":0.9978656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62760276,0.0000470748,0.36987525,0.00047341976,0.0004892438,0.00041676732,0.000008101367,0.00014906417,0.0009383425],"genre_scores_gemma":[0.7374533,0.000027550188,0.2622936,0.000016580825,0.00007596381,0.000028641358,0.0000013114596,0.000020489675,0.000082556064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969283,0.00013738206,0.0008988943,0.0007684728,0.0008377741,0.0004292147],"domain_scores_gemma":[0.9979118,0.00087017287,0.0003758249,0.00051076064,0.00018854499,0.00014287853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011891624,0.0003256588,0.00046408788,0.0009210047,0.00014795488,0.0001374441,0.0003408147,0.000089322304,0.00012278381],"category_scores_gemma":[0.00086811284,0.00022556471,0.0001487228,0.0007323535,0.0004722014,0.0002928905,0.00029620537,0.00021302722,0.000010836343],"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.00019900576,0.000014250431,0.0021090554,0.00010018368,0.0002381031,0.000014134201,0.00058077945,0.43529594,0.014894321,0.04376792,0.0000044591848,0.50278187],"study_design_scores_gemma":[0.031856496,0.0014465156,0.09185801,0.0075772814,0.0009950841,0.0076308823,0.053322624,0.5952608,0.09711899,0.09921881,0.0060792803,0.007635259],"about_ca_topic_score_codex":0.000019496392,"about_ca_topic_score_gemma":0.00000197586,"teacher_disagreement_score":0.4951466,"about_ca_system_score_codex":0.00012770682,"about_ca_system_score_gemma":0.000036760575,"threshold_uncertainty_score":0.9198262},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05252145,0.00007873997,0.94438034,0.0008356131,0.00053317583,0.00018647169,0.000005883249,0.000053540065,0.0014047868],"genre_scores_gemma":[0.6257902,0.00020543997,0.37329736,0.000030024661,0.00027449278,0.000006359783,8.971506e-7,0.000019688003,0.00037553703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775845,0.00008354888,0.00083175645,0.0002846733,0.0008113907,0.00023020754],"domain_scores_gemma":[0.99841136,0.00029144925,0.00052532286,0.00024226055,0.00035760406,0.00017197689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016364278,0.00019315239,0.00035009717,0.00076001225,0.000104823164,0.00016495827,0.00021280615,0.000088030036,0.00021503336],"category_scores_gemma":[0.000470356,0.00012785204,0.00013074258,0.00047506086,0.0001634307,0.0004951694,0.000071384835,0.00017133474,0.000016052363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058532307,0.00002164535,0.0009948842,0.00004002674,0.00019490332,0.00002533986,0.00010778924,0.8393546,0.0008737574,0.006618148,0.0002783449,0.15143208],"study_design_scores_gemma":[0.004777819,0.0003124925,0.0021524173,0.000594759,0.0002289583,0.004187458,0.004052393,0.95947444,0.00066252425,0.0011018352,0.021682877,0.00077202526],"about_ca_topic_score_codex":0.0000015479294,"about_ca_topic_score_gemma":1.6883749e-7,"teacher_disagreement_score":0.5732688,"about_ca_system_score_codex":0.00008669659,"about_ca_system_score_gemma":0.000049445815,"threshold_uncertainty_score":0.52136546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8954298,0.00007483879,0.008293144,0.0004698505,0.000114505856,0.0006674964,0.0000065371946,0.00012003401,0.09482382],"genre_scores_gemma":[0.95876235,0.000002884067,0.04007537,0.00008674516,0.0001190459,0.000021224747,0.0000021924473,0.00002174062,0.0009084613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962716,0.00026409316,0.00089996436,0.00077706424,0.0013819974,0.000405242],"domain_scores_gemma":[0.9958835,0.0016071894,0.0010389445,0.0012042954,0.0001885946,0.00007746074],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0050257854,0.0002584819,0.0004887238,0.00081916165,0.0008909891,0.0011413592,0.0010837342,0.00015246868,0.000032350727],"category_scores_gemma":[0.011394089,0.00018777525,0.00012673746,0.0004357549,0.00031443298,0.00078051834,0.00033359506,0.00031103604,0.000024808638],"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.0012263573,0.00037154707,0.36969313,0.0002969927,0.0003062976,0.00016134566,0.058441177,0.014134869,0.020706695,0.041683473,0.0062696827,0.48670843],"study_design_scores_gemma":[0.0053998465,0.0015660112,0.09541627,0.0023702467,0.00012388558,0.000336136,0.043585103,0.7729053,0.03899024,0.015095296,0.022124283,0.0020873798],"about_ca_topic_score_codex":0.00016525766,"about_ca_topic_score_gemma":0.000007442848,"teacher_disagreement_score":0.7587704,"about_ca_system_score_codex":0.00003851513,"about_ca_system_score_gemma":0.00015522756,"threshold_uncertainty_score":0.9998956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04466831,0.000902892,0.94582415,0.0024460254,0.0006463053,0.00023418065,0.0000064353717,0.000006552501,0.0052651246],"genre_scores_gemma":[0.9273415,0.00001600117,0.07237371,0.000032930122,0.00016429728,0.000002499166,1.254256e-7,0.000011417067,0.000057513418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828875,0.00012669101,0.00068546174,0.0001540985,0.0004958186,0.00024919392],"domain_scores_gemma":[0.99747384,0.0011562391,0.00038086585,0.00041339977,0.0003379931,0.00023763726],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0070709824,0.00012265427,0.00034391053,0.0006368549,0.00029939666,0.0004225617,0.0008205997,0.000060258688,0.000037022353],"category_scores_gemma":[0.015215045,0.00007862068,0.00013084653,0.00019901239,0.00025097883,0.0003385905,0.00005280084,0.00034691888,0.0000013700783],"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.0003657162,0.000041738283,0.005614806,0.000401103,0.0007516695,0.0009948795,0.030727752,0.33352026,0.006769178,0.33723494,0.0010351415,0.28254282],"study_design_scores_gemma":[0.0026800258,0.00015027908,0.0072670416,0.0011228515,0.00017172194,0.00077777257,0.0060560913,0.9567718,0.0018580852,0.0130808465,0.009624789,0.00043867753],"about_ca_topic_score_codex":0.00056168396,"about_ca_topic_score_gemma":0.0059313783,"teacher_disagreement_score":0.8826732,"about_ca_system_score_codex":0.00004399376,"about_ca_system_score_gemma":0.00027641785,"threshold_uncertainty_score":0.9930802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4944202,0.00001831288,0.4997674,0.00017851725,0.0009120843,0.0013649316,0.000023874933,0.000029388159,0.00328529],"genre_scores_gemma":[0.7787375,0.0000037344148,0.22091882,0.000026223299,0.00016051148,0.000063795735,0.0000053972167,0.0000120712675,0.00007195906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982946,0.00011051945,0.0006556097,0.0005531956,0.0001714319,0.00021467247],"domain_scores_gemma":[0.9956376,0.002480828,0.0011214475,0.0005320512,0.00015810353,0.000069949674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141494,0.00017963606,0.0003862024,0.00044874882,0.0006198677,0.00055880944,0.00036053435,0.0001442255,0.000029405786],"category_scores_gemma":[0.0019617942,0.00017384575,0.00012522841,0.00012312006,0.000417705,0.00048335956,0.00012825338,0.000122056015,0.0000037193463],"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.00030985242,0.000010074005,0.10745554,0.000026489895,0.00009803105,6.4716124e-7,0.00018818531,0.2330521,0.000012270819,0.011084224,0.000030618445,0.64773196],"study_design_scores_gemma":[0.004199188,0.00012867255,0.005409925,0.000109091285,0.00012577222,0.000006651372,0.004397727,0.9531263,0.0009729824,0.025855212,0.0053213746,0.0003471032],"about_ca_topic_score_codex":0.000011479198,"about_ca_topic_score_gemma":0.0000037303323,"teacher_disagreement_score":0.7200742,"about_ca_system_score_codex":0.00005369746,"about_ca_system_score_gemma":0.000058589965,"threshold_uncertainty_score":0.7089224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009065554,0.00007564791,0.98996615,0.0006345416,0.0019340992,0.0013240804,0.00020747175,0.00015678766,0.0047946665],"genre_scores_gemma":[0.12203653,0.000007421191,0.87215835,0.0017087251,0.002658638,0.000052754593,0.000026713347,0.00014330444,0.0012075412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98945755,0.00012126261,0.0019320247,0.0033739598,0.0036911874,0.0014240348],"domain_scores_gemma":[0.9845472,0.010842775,0.0011576738,0.0018912408,0.0011210376,0.00044005166],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061386167,0.0010746464,0.0013733748,0.0020452766,0.00088769157,0.0016932783,0.0046244673,0.00070540747,0.00038733555],"category_scores_gemma":[0.004379728,0.00089722837,0.0005111111,0.00106212,0.0042307028,0.00057687983,0.0017042572,0.0012617204,0.000201664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007587154,0.00002426024,0.000022500906,0.000027878648,0.000040599818,0.00008802594,0.0028270741,0.030669624,0.00036573876,0.0011353875,0.00012353527,0.9645995],"study_design_scores_gemma":[0.0011747598,0.0010601232,0.00009738692,0.0010697366,0.00004631891,0.00032137663,0.000022341714,0.89209235,0.0036671774,0.07658914,0.022150986,0.0017083341],"about_ca_topic_score_codex":0.000019333858,"about_ca_topic_score_gemma":0.00017450447,"teacher_disagreement_score":0.96289116,"about_ca_system_score_codex":0.00053233246,"about_ca_system_score_gemma":0.000981958,"threshold_uncertainty_score":0.99934787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83288866,0.00014597518,0.16430546,0.00025507685,0.00013858716,0.00020400395,0.000006408016,0.000024703997,0.0020310949],"genre_scores_gemma":[0.979821,0.0000020922453,0.019842021,0.000046767298,0.00024204733,0.0000010165959,8.9481796e-7,0.000032917284,0.000011246273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747396,0.0001608449,0.00085595937,0.00037557867,0.00058710715,0.00054657203],"domain_scores_gemma":[0.99733424,0.00081378204,0.000555507,0.00025297538,0.0005168737,0.0005265934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034743121,0.0002403202,0.00044469562,0.0017537206,0.000226545,0.0004237517,0.00033872674,0.0001542994,0.0000874563],"category_scores_gemma":[0.0051391283,0.00021198875,0.000060717473,0.0014872524,0.00042114462,0.00058452826,0.000029630473,0.0005900897,0.000001366267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000657139,0.000003901913,0.01033283,0.000016574326,0.000028246435,0.00013241141,0.0029186185,0.9738726,0.0006250656,0.00007159001,0.00002059001,0.011911852],"study_design_scores_gemma":[0.0015956624,0.00025957293,0.0029159193,0.0011243535,0.000031333624,0.0019501906,0.0063347467,0.9825407,0.001047269,0.000082039354,0.0016599823,0.00045821752],"about_ca_topic_score_codex":0.00038924938,"about_ca_topic_score_gemma":0.009292972,"teacher_disagreement_score":0.1469323,"about_ca_system_score_codex":0.00022244525,"about_ca_system_score_gemma":0.0008998006,"threshold_uncertainty_score":0.86446506},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009363772,0.9877714,0.008548856,0.0010307766,0.0005642565,0.0017696773,0.00003985107,0.00000750056,0.00025831014],"genre_scores_gemma":[0.0000067891147,0.927069,0.07088617,0.00003193899,0.001737085,0.00008890722,0.000004170376,0.000021222395,0.00015468725],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.992337,0.0024713941,0.002332249,0.0005375245,0.0020824037,0.00023944919],"domain_scores_gemma":[0.97927547,0.008950094,0.0023587607,0.00034278363,0.0089811385,0.00009176606],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.058622144,0.00021349579,0.00144942,0.0023857167,0.00010769137,0.0005319965,0.0012006778,0.00016803292,0.000025814465],"category_scores_gemma":[0.08522212,0.00013699515,0.0003781032,0.0007592941,0.00051367935,0.00070057984,0.00024015599,0.00078079413,0.0000016414708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008821477,0.000022613325,0.000004854507,0.007999649,0.00023576556,0.00000766089,0.00010096835,1.3004009e-7,0.000029360399,0.00009376107,0.007393991,0.98402303],"study_design_scores_gemma":[0.00019038064,0.00029602705,8.8763767e-7,0.075303115,0.00010722876,0.0019772397,0.00019186009,0.000007659746,0.00017939325,0.0011499552,0.9204927,0.000103552986],"about_ca_topic_score_codex":0.000004750395,"about_ca_topic_score_gemma":2.5894798e-7,"teacher_disagreement_score":0.9839195,"about_ca_system_score_codex":0.000106432875,"about_ca_system_score_gemma":0.0010018261,"threshold_uncertainty_score":0.9693466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027179517,0.0007732838,0.96618444,0.0008621799,0.0012235079,0.00019474735,0.000053024432,0.000035602337,0.0034936732],"genre_scores_gemma":[0.97394735,0.0000010697903,0.024788655,0.000098762976,0.001019237,0.0000021865674,0.0000018512799,0.000035369918,0.00010549402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973276,0.00015909986,0.0008416394,0.00028698414,0.00080411363,0.00058053416],"domain_scores_gemma":[0.9968097,0.0007422621,0.00029499098,0.00043551694,0.00033315294,0.0013843412],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032069606,0.00021583155,0.00039966987,0.0012687679,0.00021351573,0.0002983753,0.0010680448,0.00011764287,0.0015303195],"category_scores_gemma":[0.0035226655,0.00018573605,0.00018593945,0.00087192986,0.00014459786,0.00068513904,0.000019161276,0.00045158554,0.00010223551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051326133,0.000019319632,0.0012373044,0.000011122205,0.00014734859,0.00036915732,0.0047628093,0.92236817,0.007180213,0.000976961,0.010381016,0.05249523],"study_design_scores_gemma":[0.000641318,0.0004384293,0.009310524,0.00020629984,0.000060483017,0.0021798876,0.0007127503,0.9359728,0.00030326596,0.0018576233,0.04773902,0.00057758176],"about_ca_topic_score_codex":0.00018236182,"about_ca_topic_score_gemma":0.0066142487,"teacher_disagreement_score":0.94676787,"about_ca_system_score_codex":0.00021920732,"about_ca_system_score_gemma":0.0011915688,"threshold_uncertainty_score":0.99938244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746733,0.00032116266,0.004817881,0.00020740207,0.00024296566,0.0010372582,0.000008243227,0.000014322586,0.018677501],"genre_scores_gemma":[0.9596675,0.000048743117,0.03859892,0.00014036312,0.0001562713,0.000010479062,0.0000010010033,0.000025319314,0.0013514191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507576,0.00026278806,0.001586296,0.00044219257,0.002244941,0.0003880131],"domain_scores_gemma":[0.9964729,0.0007572187,0.001837424,0.000432967,0.00041724215,0.00008226542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056310096,0.00025442403,0.0007441204,0.0009745899,0.00008350121,0.00024711122,0.000783788,0.000061430845,0.000041644496],"category_scores_gemma":[0.00072132534,0.00017677448,0.00029448,0.000969344,0.00010408693,0.00050634437,0.00042447183,0.0003425979,0.0000144009055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016538668,0.0018598026,0.07831292,0.0015507111,0.002114776,0.00027501571,0.019167159,0.010142002,0.07071713,0.01726521,0.011485232,0.7854562],"study_design_scores_gemma":[0.036271248,0.01699903,0.01686074,0.0061490345,0.0016431957,0.0008181177,0.2114216,0.40260038,0.07882725,0.046474956,0.17676196,0.0051725167],"about_ca_topic_score_codex":0.00003141781,"about_ca_topic_score_gemma":0.0000021047535,"teacher_disagreement_score":0.78028363,"about_ca_system_score_codex":0.00007836864,"about_ca_system_score_gemma":0.00012250716,"threshold_uncertainty_score":0.7208654},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89482707,0.00007486867,0.002436635,0.00015524142,0.0010627793,0.002538755,0.00012262151,0.00044958867,0.09833244],"genre_scores_gemma":[0.8633087,0.000037148035,0.038134634,0.000016531878,0.001296212,0.000038404076,0.00033910084,0.00029285287,0.09653638],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.9856748,0.0026097598,0.0014812375,0.003300727,0.004589312,0.0023441778],"domain_scores_gemma":[0.99205285,0.0015411224,0.0012681889,0.002271791,0.0021188525,0.000747175],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0052812765,0.0011043368,0.0015045832,0.005679457,0.002672157,0.0022652182,0.0042147026,0.0011426414,0.00031023007],"category_scores_gemma":[0.0018592466,0.0010011113,0.00052857696,0.0054410505,0.001877509,0.0009850548,0.00074069423,0.0029768527,0.00021357735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.06417602,0.0040648333,0.11571165,0.0036426864,0.0067727156,0.036196917,0.0679306,0.005188862,0.6444567,0.0053871754,0.008507163,0.03796468],"study_design_scores_gemma":[0.023831794,0.0068030753,0.023725256,0.0057439758,0.0010130808,0.001596608,0.32301784,0.04666994,0.29927316,0.0009055284,0.2572416,0.010178133],"about_ca_topic_score_codex":0.012792175,"about_ca_topic_score_gemma":0.03055269,"teacher_disagreement_score":0.34518352,"about_ca_system_score_codex":0.001089125,"about_ca_system_score_gemma":0.005394513,"threshold_uncertainty_score":0.9993233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2301482,0.00018846717,0.768297,0.0000880657,0.00087021396,0.00017968827,0.000015701564,0.000015308755,0.00019734711],"genre_scores_gemma":[0.6957934,8.564513e-7,0.30394536,0.00003107726,0.000099698955,0.0000019180839,0.0000022336824,0.000028524339,0.00009694483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775815,0.00003947642,0.000843228,0.00028272707,0.0006200196,0.0004563706],"domain_scores_gemma":[0.997684,0.00039967572,0.000514197,0.00024224225,0.00063971564,0.0005201852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016077767,0.00020659393,0.00038879592,0.0010281156,0.00016339096,0.00043099633,0.00040954028,0.00014232498,0.00021234159],"category_scores_gemma":[0.0019928983,0.0001923889,0.00020599554,0.00047182746,0.000064366584,0.0008292073,0.000019096968,0.00036437044,0.000006028636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015739983,0.0000035932687,0.02276096,0.0000115486555,0.000029002147,0.000006337707,0.00038927444,0.9742733,0.0010809426,0.000075510616,0.00006252001,0.0012912498],"study_design_scores_gemma":[0.0008373916,0.000027888194,0.00070582575,0.00031063013,0.000020043964,0.000149919,0.0005452767,0.99678326,0.00015009016,0.00007888426,0.0001833363,0.00020746212],"about_ca_topic_score_codex":0.00008441442,"about_ca_topic_score_gemma":0.0037613614,"teacher_disagreement_score":0.4656452,"about_ca_system_score_codex":0.00022420437,"about_ca_system_score_gemma":0.0012304109,"threshold_uncertainty_score":0.7845392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28617522,0.000024693549,0.71039957,0.00025219208,0.0010380744,0.0011387977,0.000012715857,0.00020554692,0.00075319014],"genre_scores_gemma":[0.5370542,0.0000029083565,0.46234462,0.000055753706,0.00009037171,0.000075030905,0.000012807762,0.000025950201,0.00033837295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713564,0.00009188893,0.0006846149,0.0008815442,0.00073102704,0.00047526244],"domain_scores_gemma":[0.998025,0.00077748235,0.0002642904,0.00055109215,0.00026593384,0.00011621871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011538758,0.0003181984,0.00035921278,0.0007942283,0.00018384974,0.0002839768,0.00045025736,0.00009105472,0.0002675976],"category_scores_gemma":[0.00070370414,0.000278976,0.0002318761,0.00083810044,0.00009655113,0.00026580755,0.0001829494,0.00027651206,0.00007541415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059715385,0.000010676516,0.00039748722,0.00003415448,0.00010043712,0.00000181548,0.00031176026,0.9611736,0.0005875981,0.0051920707,0.000004283041,0.03212643],"study_design_scores_gemma":[0.0012959357,0.00007075221,0.0020264206,0.00008996367,0.0000337822,0.000052787578,0.0029650726,0.9909971,0.0003837079,0.0009998804,0.00070746517,0.00037717435],"about_ca_topic_score_codex":0.000012149704,"about_ca_topic_score_gemma":0.0000032227013,"teacher_disagreement_score":0.25087896,"about_ca_system_score_codex":0.00019745654,"about_ca_system_score_gemma":0.00003522651,"threshold_uncertainty_score":0.99996626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98577857,0.00014923808,0.0047953017,0.00023321161,0.00029296693,0.0022697526,0.000013881021,0.000010858387,0.0064562294],"genre_scores_gemma":[0.9977678,0.00015450128,0.0016475007,0.000027631428,0.00007990838,0.000022237464,4.887908e-7,0.00002905598,0.00027088876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928508,0.0009930686,0.002203654,0.00048935064,0.0028607848,0.00060235825],"domain_scores_gemma":[0.99165654,0.0030293108,0.0035528836,0.0011267626,0.0005873539,0.000047139925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0145284785,0.00037574038,0.0009387126,0.0015651952,0.00018350183,0.00030424542,0.0021616095,0.000113710616,0.000022183127],"category_scores_gemma":[0.0026876363,0.00017974962,0.0007017337,0.0021578697,0.000223325,0.00042409365,0.0004423788,0.00084211613,0.000009503773],"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.011098976,0.003721384,0.12083781,0.0009151659,0.002870065,0.0002448888,0.039004862,0.08018388,0.052547503,0.0067720264,0.0015917467,0.6802117],"study_design_scores_gemma":[0.009555051,0.009175541,0.21402073,0.004855312,0.00040746195,0.00028809012,0.034421112,0.6996119,0.011426276,0.012064464,0.0022719982,0.0019020489],"about_ca_topic_score_codex":0.00015411928,"about_ca_topic_score_gemma":0.00000922936,"teacher_disagreement_score":0.6783097,"about_ca_system_score_codex":0.00030638225,"about_ca_system_score_gemma":0.00085876614,"threshold_uncertainty_score":0.73299766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57956,0.0005383001,0.4019891,0.0013123698,0.012661772,0.0014734918,0.0000055054625,0.00048859324,0.0019709088],"genre_scores_gemma":[0.935128,0.000017442275,0.061463483,0.00009532083,0.003070133,0.000023121263,0.000005152617,0.000057840076,0.0001395098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627155,0.00020287382,0.0010424074,0.00066088635,0.0010577922,0.0007644875],"domain_scores_gemma":[0.995604,0.003011775,0.00029777823,0.0007287253,0.00016360095,0.00019414246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041777855,0.0003296968,0.0004793254,0.00024335514,0.00037007418,0.00088978175,0.0011819107,0.0002925377,0.00009969563],"category_scores_gemma":[0.00079870457,0.00024256977,0.00025899883,0.0014233228,0.000119592005,0.00037544544,0.00017973158,0.00095071655,0.00018193224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041320436,0.0000046373534,0.0009421107,0.0000036130257,0.000051739084,0.0000038604453,0.00023166089,0.76178306,0.00050553406,0.0022383237,0.00038167957,0.23381245],"study_design_scores_gemma":[0.0025503065,0.00016510693,0.00029157603,0.00028432213,0.000033693326,0.00012877838,0.0010377332,0.8719915,0.00079208397,0.0008306941,0.121185385,0.000708786],"about_ca_topic_score_codex":0.00001039446,"about_ca_topic_score_gemma":0.0000013062686,"teacher_disagreement_score":0.35556802,"about_ca_system_score_codex":0.00009240741,"about_ca_system_score_gemma":0.00016934345,"threshold_uncertainty_score":0.98917085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81700873,0.00011479538,0.094184354,0.00038367743,0.00012063515,0.0018851941,0.000008280583,0.00014231143,0.08615203],"genre_scores_gemma":[0.69744563,6.242299e-7,0.30121678,0.00050337164,0.00004982673,0.000052414493,0.000005736619,0.000030449854,0.0006952024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554336,0.00032560708,0.00090192154,0.001256801,0.0012425933,0.0007297145],"domain_scores_gemma":[0.9971184,0.0016618764,0.00018800309,0.00069880305,0.000105350155,0.00022755028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050966195,0.0003422506,0.00061846554,0.0012653721,0.00013761374,0.0007154121,0.0008054475,0.00018861136,0.00019851958],"category_scores_gemma":[0.0016808752,0.00026546337,0.00011478515,0.0019257443,0.0000760133,0.00051257527,0.00021228874,0.00046292928,0.00036648387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005889826,0.0004030133,0.1959031,0.00012799418,0.000050655646,0.00006510344,0.019653782,0.7053515,0.029680852,0.0011722207,0.00115096,0.04585187],"study_design_scores_gemma":[0.0016151726,0.00012958104,0.0027115226,0.00020005206,0.000008881205,0.00003735943,0.010101872,0.98103625,0.0019039935,0.00014472031,0.0015056946,0.0006048779],"about_ca_topic_score_codex":0.000057164252,"about_ca_topic_score_gemma":0.0000024952012,"teacher_disagreement_score":0.2756848,"about_ca_system_score_codex":0.00007405095,"about_ca_system_score_gemma":0.0002382632,"threshold_uncertainty_score":0.99997973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056770057,0.00035562596,0.9864869,0.00251312,0.00012661486,0.0040266193,0.000034639175,0.000054210304,0.00072523905],"genre_scores_gemma":[0.019530201,0.000038719714,0.9786933,0.0009483059,0.00031240843,0.00023250787,0.0000053167228,0.00007730428,0.00016191433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99127215,0.0008991461,0.00322957,0.0011713649,0.0024396016,0.0009881686],"domain_scores_gemma":[0.995131,0.0016479805,0.00202945,0.0006210705,0.0002916246,0.000278873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010003237,0.00058623037,0.0011675305,0.0020352555,0.00023624468,0.0005322968,0.0018265664,0.00019608316,0.00006435182],"category_scores_gemma":[0.0019421142,0.00046882697,0.00068992714,0.0018338138,0.00016110505,0.00038662617,0.0003819119,0.0007629427,0.000018508028],"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.001006919,0.0005596265,0.0017840958,0.00045664638,0.0004371916,0.00072065403,0.008878698,0.48815876,0.0027252408,0.00021211096,0.0014409651,0.49361908],"study_design_scores_gemma":[0.00673762,0.0009220143,0.00031120054,0.00034252682,0.00017983012,0.00007659729,0.0120850485,0.9530516,0.0007640427,0.0007461448,0.024172056,0.0006112996],"about_ca_topic_score_codex":0.00006797476,"about_ca_topic_score_gemma":0.000007222014,"teacher_disagreement_score":0.49300778,"about_ca_system_score_codex":0.00042693416,"about_ca_system_score_gemma":0.0006627995,"threshold_uncertainty_score":0.99977636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9062441,0.000056731533,0.07289582,0.005851283,0.000023297496,0.00015683575,0.000004176393,0.00005801065,0.014709741],"genre_scores_gemma":[0.9983912,0.0000030029016,0.0007728423,0.00032146336,0.000053621698,0.0000016774707,0.0000011098775,0.000009075424,0.00044600453],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966621,0.00089189794,0.00047283198,0.00041971885,0.0012868426,0.00026663803],"domain_scores_gemma":[0.9954631,0.0036110852,0.00017450289,0.00026971893,0.00035735194,0.0001242839],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007220744,0.00011153832,0.00026595223,0.00008735574,0.0002163733,0.0002025593,0.0005332183,0.00005240263,0.00041841765],"category_scores_gemma":[0.010075935,0.00006231647,0.000108838234,0.0015715652,0.000212501,0.00019483552,0.00018210057,0.00043202715,0.00010899596],"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.00017227551,0.00007604651,0.40030235,0.000060615654,0.00009620633,0.000035039186,0.051482026,0.06539426,0.20096661,0.0009614112,0.004465836,0.27598733],"study_design_scores_gemma":[0.0004942621,0.00023180856,0.0038486551,0.000030744115,0.00002681049,0.000025799536,0.06944406,0.7466824,0.17305133,0.0006736185,0.0051015313,0.00038895567],"about_ca_topic_score_codex":0.00006818321,"about_ca_topic_score_gemma":0.000008948766,"teacher_disagreement_score":0.6812882,"about_ca_system_score_codex":0.0000086695245,"about_ca_system_score_gemma":0.00010426445,"threshold_uncertainty_score":0.99826264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6733833,0.00024332781,0.2670666,0.007288342,0.00019820686,0.009339018,0.00041788825,0.00042698914,0.041636355],"genre_scores_gemma":[0.9677886,0.0000064975848,0.030797228,0.0005370454,0.00022827358,0.00025116384,0.00009917559,0.000016189017,0.0002758782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99337614,0.0004536184,0.0015868818,0.0004311845,0.0035896958,0.0005624791],"domain_scores_gemma":[0.9944127,0.0014685179,0.00039063644,0.00024305834,0.0031413352,0.00034376042],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007175636,0.00025179717,0.00040075206,0.00080606656,0.00096794544,0.0037052592,0.00048807947,0.00019717669,0.000058794216],"category_scores_gemma":[0.005613248,0.00017505947,0.00006361962,0.001844767,0.00033391555,0.0040025497,0.0001457371,0.00073915086,0.00021947084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004845702,0.0002558644,0.07697884,0.0012468713,0.00064181746,0.00004553299,0.12226681,0.51271105,0.015703512,0.15006654,0.013254543,0.101982936],"study_design_scores_gemma":[0.002552656,0.00046206755,0.0014013505,0.00013957809,0.000007528885,0.00017585827,0.025757708,0.8126702,0.0004443603,0.00002760867,0.15598048,0.00038059958],"about_ca_topic_score_codex":0.0004903671,"about_ca_topic_score_gemma":0.000050807415,"teacher_disagreement_score":0.29995915,"about_ca_system_score_codex":0.00011114931,"about_ca_system_score_gemma":0.0014191524,"threshold_uncertainty_score":0.997329},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564586,0.000035804744,0.73985434,0.0008750855,0.00035840078,0.0010526862,0.000010930101,0.00022682748,0.0011273519],"genre_scores_gemma":[0.5448115,0.0000033149608,0.45485267,0.00005408642,0.00014480676,0.00006603533,0.000004121671,0.000019802425,0.00004367896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972665,0.00008744148,0.0008542884,0.0006852844,0.0007425044,0.00036400775],"domain_scores_gemma":[0.9983958,0.00059528404,0.00034798868,0.00026861718,0.0002456583,0.00014666696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361425,0.00026205543,0.00043207823,0.0005469832,0.00013122744,0.00013766957,0.00041978352,0.00006842096,0.00008880627],"category_scores_gemma":[0.0020627931,0.0002323043,0.00025072793,0.0012247685,0.00010439282,0.00018727127,0.00015304571,0.00024443716,0.000013213377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002974916,0.000012805506,0.00046151993,0.00021363696,0.00017295466,0.000003212758,0.001238178,0.8781381,0.005843398,0.00821845,0.000037089238,0.10536312],"study_design_scores_gemma":[0.002444295,0.00034905644,0.0011742408,0.00017217838,0.00011358462,0.000107079766,0.002924833,0.9667542,0.01999214,0.0014303947,0.003962459,0.0005755187],"about_ca_topic_score_codex":0.0000067140877,"about_ca_topic_score_gemma":5.134043e-7,"teacher_disagreement_score":0.28835288,"about_ca_system_score_codex":0.000057056328,"about_ca_system_score_gemma":0.000040402847,"threshold_uncertainty_score":0.9473095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26937228,0.00043201505,0.72262686,0.0055128983,0.00031425786,0.0013196024,0.000071068775,0.00005248337,0.00029852163],"genre_scores_gemma":[0.6424372,0.00002370574,0.35655615,0.00031768513,0.0005633586,0.000038371218,0.000015060308,0.000028616663,0.00001982512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959692,0.00018045974,0.0016852376,0.000422793,0.0013773396,0.00036496576],"domain_scores_gemma":[0.99362034,0.003211307,0.0015641876,0.00021704604,0.0011567485,0.00023039278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027245292,0.0002525805,0.0005317311,0.00024844005,0.00038010796,0.00014522822,0.00070385105,0.00011397495,0.00003709499],"category_scores_gemma":[0.0018571601,0.00016821462,0.000501994,0.0009227903,0.0001892806,0.0009065986,0.000010320599,0.0005201901,0.0000069166754],"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.00068567594,0.00006134638,0.001353842,0.00004177003,0.00014904422,0.00004030947,0.015215953,0.38202545,0.016935172,0.0009936577,0.00022761559,0.58227015],"study_design_scores_gemma":[0.027658544,0.007587948,0.15813355,0.0015134613,0.0014226321,0.00047121235,0.17051922,0.44533664,0.024367414,0.09820261,0.06193759,0.0028491702],"about_ca_topic_score_codex":0.000004029916,"about_ca_topic_score_gemma":0.0000059100703,"teacher_disagreement_score":0.579421,"about_ca_system_score_codex":0.00007927365,"about_ca_system_score_gemma":0.00026383417,"threshold_uncertainty_score":0.68595934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5615421,0.000033739456,0.4368894,0.00027761387,0.00061855436,0.0004794988,0.000019809544,0.0000705467,0.00006869422],"genre_scores_gemma":[0.70945126,0.000010154137,0.2902335,0.00003361521,0.000115355186,0.000051656803,0.00007764531,0.00001587899,0.000010954536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962145,0.00060142,0.0014422995,0.00078879384,0.0006345913,0.0003183947],"domain_scores_gemma":[0.99627876,0.0021385818,0.0005640077,0.00032628587,0.0006057708,0.00008661828],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026467585,0.00022680989,0.00040739944,0.0010625414,0.00022134933,0.00043888608,0.00014720064,0.00027711806,0.00011045165],"category_scores_gemma":[0.010319629,0.0002476134,0.00008419408,0.0013105791,0.00020894069,0.001245053,0.00005933974,0.00030215536,0.000006737624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106517975,0.000030696643,0.040606536,0.0000125172655,0.0000070572028,0.0000035332487,0.00034466173,0.83452576,0.00042834246,0.0011805507,0.000003900854,0.12274992],"study_design_scores_gemma":[0.0030265904,0.000028212442,0.0040860446,0.00009879929,0.000013032924,0.00013811121,0.0023365205,0.982708,0.0031421327,0.004102492,0.000081401035,0.00023870304],"about_ca_topic_score_codex":0.00005957574,"about_ca_topic_score_gemma":0.00009707503,"teacher_disagreement_score":0.1481822,"about_ca_system_score_codex":0.00023631148,"about_ca_system_score_gemma":0.00034685392,"threshold_uncertainty_score":0.9999976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98442316,0.000834943,0.0063093146,0.005448471,0.00017169824,0.00053034385,0.0001270099,0.000093280345,0.0020617961],"genre_scores_gemma":[0.6105606,0.00001599537,0.38878396,0.00036785536,0.00019778743,0.000008119643,0.000010736801,0.000017221508,0.00003773015],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669147,0.0002710647,0.00087109394,0.00076724624,0.0010380298,0.00036110994],"domain_scores_gemma":[0.9972991,0.0011241464,0.00054948946,0.00029154102,0.00047733154,0.00025844207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013257241,0.00028020435,0.00061303866,0.00029722747,0.00019765041,0.00018943744,0.00041709206,0.00016185599,0.00014946508],"category_scores_gemma":[0.0058434308,0.00022853064,0.00009759941,0.0017649948,0.00047160746,0.00037883237,0.00016645849,0.00036019817,0.000025170944],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015634447,0.00018868227,0.37002063,0.0002584472,0.00036695332,0.00021434136,0.13179952,0.016045,0.28990933,0.0058486797,0.00006375016,0.18372121],"study_design_scores_gemma":[0.008584764,0.0021867398,0.021089261,0.0008552001,0.00021297976,0.00041424163,0.4317583,0.43531823,0.09095582,0.0025627618,0.0038188114,0.002242866],"about_ca_topic_score_codex":0.000016619904,"about_ca_topic_score_gemma":0.0000071973323,"teacher_disagreement_score":0.41927323,"about_ca_system_score_codex":0.000026535065,"about_ca_system_score_gemma":0.00030322614,"threshold_uncertainty_score":0.9319209},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86912215,0.0067070867,0.12200035,0.001017191,0.000119717806,0.00013192711,0.0000012698363,0.000041552306,0.0008587626],"genre_scores_gemma":[0.985906,0.000546183,0.012707883,0.00006243071,0.00016209455,0.0000026573637,0.0000066048424,0.000018457029,0.0005877011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967904,0.00020545685,0.00061041577,0.000448377,0.00072732806,0.0012179918],"domain_scores_gemma":[0.9984049,0.00020340635,0.0003385974,0.00016583578,0.0007611106,0.00012614008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005972653,0.00017911526,0.00026050085,0.00029474768,0.0004987077,0.00054870406,0.00020864545,0.00017769683,0.000025250883],"category_scores_gemma":[0.0018597301,0.00013493186,0.00004875832,0.00094910513,0.00008842592,0.00067756354,0.000074007374,0.0020945685,0.0000097643215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025325952,0.000083027386,0.060748663,0.000034845278,0.00025182607,0.000060704187,0.0052200546,0.0062827617,0.018088665,0.029723592,0.000023553004,0.87922907],"study_design_scores_gemma":[0.0018702255,0.0005176442,0.0033174644,0.00028288178,0.000084171974,0.008799308,0.035992943,0.15861666,0.0024804948,0.78602284,0.0013895808,0.00062575634],"about_ca_topic_score_codex":0.000017038143,"about_ca_topic_score_gemma":0.00006743051,"teacher_disagreement_score":0.8786033,"about_ca_system_score_codex":0.00028099667,"about_ca_system_score_gemma":0.002282386,"threshold_uncertainty_score":0.90999734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032112442,0.0001423221,0.95682037,0.0011913909,0.00096939603,0.0013776331,0.00004405001,0.00047134983,0.0068710465],"genre_scores_gemma":[0.065359905,0.000005866603,0.9327806,0.00014987474,0.0002744426,0.00023302979,0.000052192594,0.000057366735,0.00108667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952666,0.00037627906,0.0011750858,0.0012395591,0.0011973162,0.0007451483],"domain_scores_gemma":[0.9963659,0.0018069202,0.00033478573,0.0009793217,0.00031324738,0.00019982985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002367509,0.00047486377,0.00067606725,0.0010038896,0.0003698007,0.00055080204,0.00074326276,0.00014321755,0.00021068644],"category_scores_gemma":[0.0015163325,0.00040945152,0.00047466505,0.0015370229,0.00015814602,0.00022104898,0.00044595692,0.0004459678,0.000024851957],"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.00025668883,0.00005016249,0.00009182891,0.00016170711,0.00032557972,0.00006911571,0.000635655,0.46952173,0.008687925,0.022527799,0.0006675008,0.49700433],"study_design_scores_gemma":[0.006537768,0.00016649446,0.0006908244,0.00042031074,0.0002269751,0.0016802074,0.005848948,0.7864229,0.028736616,0.0049673766,0.16283157,0.0014700158],"about_ca_topic_score_codex":0.0000074045406,"about_ca_topic_score_gemma":0.0000016155814,"teacher_disagreement_score":0.4955343,"about_ca_system_score_codex":0.000110659785,"about_ca_system_score_gemma":0.00011031038,"threshold_uncertainty_score":0.9998357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1400582,0.000025497191,0.85682076,0.0010620087,0.00023678497,0.0002522841,0.000030181058,0.000027446926,0.0014868266],"genre_scores_gemma":[0.47689965,0.000008385018,0.52243584,0.00007874308,0.00023301507,0.0000062240842,0.000009709695,0.000024299457,0.00030412147],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99506325,0.00060882734,0.0013290452,0.00061792735,0.0019122908,0.0004686521],"domain_scores_gemma":[0.990039,0.0032928097,0.00200464,0.00062645925,0.0037739717,0.0002631136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004711088,0.00036380196,0.0009744669,0.00025919845,0.0006203445,0.00077172514,0.0008177025,0.00017539812,0.00033411587],"category_scores_gemma":[0.005108475,0.0002609225,0.0003758296,0.0009771531,0.00027418215,0.001836441,0.00028640032,0.0005659972,0.000004116099],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028153239,0.0003767685,0.0007000193,0.000048187656,0.00021737254,0.000100982434,0.0037732527,0.13950497,0.10308899,0.008528428,0.00045874147,0.74038696],"study_design_scores_gemma":[0.00500693,0.0021831265,0.00059508625,0.0008759697,0.00024058991,0.0010095583,0.012431713,0.15464349,0.7806544,0.034720484,0.006737933,0.00090074603],"about_ca_topic_score_codex":0.0000027048059,"about_ca_topic_score_gemma":0.00001096281,"teacher_disagreement_score":0.7394862,"about_ca_system_score_codex":0.000067654095,"about_ca_system_score_gemma":0.0015012315,"threshold_uncertainty_score":0.9999843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36076766,0.000025437352,0.6352997,0.00021482163,0.00079693116,0.0005439747,0.000036766996,0.0000986411,0.0022160779],"genre_scores_gemma":[0.5586229,0.0000012453131,0.44097418,0.000027219086,0.0001791702,0.00007471784,0.00004784105,0.000018729503,0.000053995678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604684,0.00023002503,0.0015777805,0.00076315243,0.0010544228,0.00032779848],"domain_scores_gemma":[0.9942034,0.0007310079,0.00077839015,0.0005133378,0.0037279187,0.00004596333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023273432,0.00025382623,0.00046768753,0.0011749906,0.0003469817,0.00024098871,0.00025217384,0.00017875561,0.000033652068],"category_scores_gemma":[0.0035603377,0.00021170996,0.000101733225,0.004280192,0.0004919528,0.0005103083,0.00008319731,0.0002750635,0.0000072350904],"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.00027882602,0.000056882545,0.008853019,0.00052396563,0.0001500739,0.000020779054,0.00058539497,0.005078313,0.019103805,0.85494095,0.000057632344,0.11035035],"study_design_scores_gemma":[0.007741939,0.00077200786,0.0015104276,0.003500449,0.00038395944,0.00449323,0.30766502,0.36999616,0.27056277,0.024773201,0.0067941234,0.0018066962],"about_ca_topic_score_codex":0.0000065226136,"about_ca_topic_score_gemma":0.000004941436,"teacher_disagreement_score":0.8301678,"about_ca_system_score_codex":0.0001327665,"about_ca_system_score_gemma":0.00033863526,"threshold_uncertainty_score":0.86332816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072796844,0.000074403644,0.92298377,0.0011367002,0.00033634176,0.0009249657,0.000032855092,0.0003426266,0.0013715066],"genre_scores_gemma":[0.08810785,0.00003680069,0.9108935,0.00012374105,0.0001493295,0.00020579221,0.00027147896,0.000028243989,0.00018329317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518085,0.0013961404,0.0013557476,0.00090627314,0.00085752667,0.0003034905],"domain_scores_gemma":[0.9961276,0.0018623713,0.00069840066,0.00055225607,0.0006744406,0.00008495059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003827629,0.00025132808,0.00044421668,0.00096922833,0.00026591218,0.0004085408,0.0002514063,0.00030402574,0.0002925112],"category_scores_gemma":[0.0045831255,0.00024857075,0.00008413351,0.0025816213,0.0002511709,0.0010344738,0.00008328479,0.00025507473,0.00007686086],"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.000019633144,0.00005190531,0.005285975,0.000015794105,0.000024359568,0.0000052281666,0.0011547569,0.039425977,0.0028095178,0.0022014396,0.00019527778,0.94881016],"study_design_scores_gemma":[0.00090431946,0.000026774496,0.008054679,0.00003228917,0.000025507723,0.00038371532,0.0020227004,0.97733766,0.0032022488,0.006905567,0.0008463718,0.00025816972],"about_ca_topic_score_codex":0.000055471613,"about_ca_topic_score_gemma":0.000024276369,"teacher_disagreement_score":0.94855195,"about_ca_system_score_codex":0.00015665378,"about_ca_system_score_gemma":0.0004033217,"threshold_uncertainty_score":0.99999666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005551664,0.0870658,0.74846977,0.010544388,0.0013912382,0.01537305,0.00027717435,0.00026178587,0.1310651],"genre_scores_gemma":[0.013332394,0.005588949,0.97636366,0.0013331416,0.00044876625,0.00023198989,0.000028120472,0.000066854394,0.0026061288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919871,0.00079712115,0.0036740701,0.0006422255,0.002403149,0.0004963503],"domain_scores_gemma":[0.99154735,0.0014912345,0.0032845058,0.0007310814,0.0028340626,0.000111750196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.016071228,0.0003606357,0.0012843298,0.0014192101,0.00016525964,0.00024033977,0.0012522803,0.00011921657,0.00021402334],"category_scores_gemma":[0.006430232,0.00027236147,0.0011089068,0.0022047502,0.00022522957,0.00040086225,0.00035472238,0.0004251643,0.000007473899],"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.0016750051,0.002537579,0.0011951899,0.05058196,0.005245818,0.0012633151,0.0022090247,0.0005437349,0.0071040266,0.07194663,0.21124493,0.6444528],"study_design_scores_gemma":[0.0032723586,0.0011069543,0.000094894785,0.025259253,0.0013422337,0.0013075223,0.00667045,0.0011861001,0.010555296,0.01656139,0.9318503,0.0007932346],"about_ca_topic_score_codex":0.000004887523,"about_ca_topic_score_gemma":0.0000019577137,"teacher_disagreement_score":0.7206054,"about_ca_system_score_codex":0.00013161842,"about_ca_system_score_gemma":0.0010744922,"threshold_uncertainty_score":0.9999729},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006602232,0.9873434,0.00036223306,0.00054182915,0.0007924843,0.003703396,0.000025699926,0.00003780781,0.007186554],"genre_scores_gemma":[5.5662946e-7,0.95955646,0.03744685,0.0003922384,0.00068566256,0.00014935274,0.000011362887,0.00007730598,0.0016802211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9910413,0.0015664638,0.0034162893,0.0012397048,0.0021250413,0.0006111885],"domain_scores_gemma":[0.9938062,0.00088756386,0.0032493263,0.0010364281,0.0008136587,0.00020681904],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005146251,0.000919713,0.004317381,0.0030637933,0.00037599853,0.0010502858,0.0012368723,0.00029094145,0.000110423476],"category_scores_gemma":[0.00042722526,0.0006201083,0.0011211575,0.0037301918,0.00020565074,0.00052044325,0.0013293121,0.0012998763,0.000021937263],"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.0000089249415,0.00007141627,0.0000034422721,0.041773126,0.0016754521,0.0006513693,0.00025169837,9.791718e-7,4.596658e-8,0.0007832721,0.0061236834,0.9486566],"study_design_scores_gemma":[0.00047794692,0.000111801295,0.000010643306,0.04101157,0.0060163676,0.002256756,0.003115748,0.00001130268,7.782902e-8,0.00012377136,0.9463204,0.000543601],"about_ca_topic_score_codex":0.0000076182864,"about_ca_topic_score_gemma":0.000002158157,"teacher_disagreement_score":0.94811296,"about_ca_system_score_codex":0.00019688395,"about_ca_system_score_gemma":0.00035678805,"threshold_uncertainty_score":0.9999867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99286693,0.00011758464,0.0007050165,0.0010842917,0.0010629137,0.00028214516,0.0000700388,0.00016271093,0.003648363],"genre_scores_gemma":[0.9959211,0.000060072634,0.0033875778,0.000081715414,0.00011028453,0.00009957119,0.0000035736703,0.000020290674,0.0003158152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99526983,0.00013006295,0.0006933248,0.0009832104,0.0022033385,0.0007202166],"domain_scores_gemma":[0.9979684,0.00031596588,0.00023540815,0.00068079296,0.00054384803,0.00025560605],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006269498,0.00029088298,0.00047523054,0.00077049126,0.0010057297,0.0014281861,0.0014216132,0.000058996142,0.0017705831],"category_scores_gemma":[0.0041293614,0.00025253146,0.000048921378,0.0018168956,0.0007606896,0.0014165035,0.0011053592,0.0002648299,0.000052914063],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009060949,0.000039283546,0.00014679543,0.00003692056,0.000016464826,0.0000665625,0.006285546,0.000982396,0.8906731,0.0948495,0.000061174214,0.006751672],"study_design_scores_gemma":[0.0015921163,0.0014869954,0.007159367,0.00023024253,0.00004667072,0.0007683875,0.06865175,0.0106072,0.8153314,0.018314678,0.07324009,0.0025710808],"about_ca_topic_score_codex":0.00003879727,"about_ca_topic_score_gemma":0.0000048040515,"teacher_disagreement_score":0.076534815,"about_ca_system_score_codex":0.00012836728,"about_ca_system_score_gemma":0.00050694495,"threshold_uncertainty_score":0.99999267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21202397,0.000041453433,0.77975124,0.0012070006,0.0012696271,0.0007118619,0.000039636972,0.00009305932,0.0048621185],"genre_scores_gemma":[0.8887124,0.0000031328998,0.10862384,0.00032157294,0.0011921482,0.00006638758,0.000060463353,0.00003630529,0.0009837317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456793,0.00060328457,0.0014239014,0.0013923546,0.001393553,0.0006189987],"domain_scores_gemma":[0.98974836,0.0061021238,0.0007403536,0.0010703227,0.0021077578,0.00023109344],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021483279,0.00039038243,0.00065970933,0.000448605,0.0004106111,0.0013356684,0.000722996,0.0005623167,0.003030487],"category_scores_gemma":[0.028184742,0.00036622302,0.00035398357,0.0015243342,0.00025227133,0.0006766819,0.00026110926,0.0007430715,0.00020875088],"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.000970762,0.00020101361,0.006096399,0.0000479048,0.00024211932,0.000036085075,0.0096869115,0.2484811,0.012905067,0.04880343,0.0005835561,0.67194563],"study_design_scores_gemma":[0.0044311723,0.00032403247,0.0005504344,0.00094351463,0.00013044682,0.00005333459,0.030340394,0.75060195,0.081567325,0.0885323,0.04108252,0.001442557],"about_ca_topic_score_codex":0.0000061874603,"about_ca_topic_score_gemma":0.000014055948,"teacher_disagreement_score":0.67668843,"about_ca_system_score_codex":0.00011550986,"about_ca_system_score_gemma":0.00094251084,"threshold_uncertainty_score":0.99987894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95558304,0.000760155,0.02642343,0.0011219955,0.0021205912,0.0023885467,0.00025808974,0.00011792311,0.0112262145],"genre_scores_gemma":[0.98249245,0.000029725219,0.015971683,0.00004043363,0.00009390504,0.00043385712,0.000045442237,0.000028283348,0.0008642173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900886,0.0029554707,0.0011508358,0.0008381737,0.004396885,0.0005700819],"domain_scores_gemma":[0.9945759,0.002440623,0.0004896084,0.0007534481,0.0016451228,0.00009528433],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013557068,0.00016362914,0.0003700472,0.0033998168,0.00075117464,0.00023012812,0.001225705,0.0000845062,0.0024459183],"category_scores_gemma":[0.011130685,0.0001602355,0.00009453219,0.008468866,0.00070743175,0.000417319,0.0007257077,0.0010301775,0.0000149546895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002914686,0.00014669336,0.064014725,0.000022894379,0.00001934448,0.000032419997,0.0029455419,0.8586437,0.0022091318,0.0021261878,0.0024284192,0.06711948],"study_design_scores_gemma":[0.0015640798,0.0003296596,0.004344708,0.00005305807,0.000007082955,0.00010277036,0.05078752,0.927461,0.0017595643,0.0015182954,0.011760307,0.00031192158],"about_ca_topic_score_codex":0.000106668995,"about_ca_topic_score_gemma":0.000009068749,"teacher_disagreement_score":0.06881733,"about_ca_system_score_codex":0.00032270415,"about_ca_system_score_gemma":0.0010695792,"threshold_uncertainty_score":0.99846596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762111,0.0028464154,0.018838547,0.00025768287,0.0002525719,0.00084055925,0.00013648771,0.00004505357,0.00057158223],"genre_scores_gemma":[0.93482345,0.00016962858,0.06450262,0.00007840271,0.00009323705,0.000012410702,0.000025050636,0.000038598173,0.00025661828],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9928319,0.00072338444,0.002586287,0.0016340481,0.0017808791,0.00044352852],"domain_scores_gemma":[0.99241984,0.0029599771,0.0019035524,0.0016399983,0.0009035733,0.00017304489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055572256,0.0005669845,0.0019048323,0.0007066884,0.00018194945,0.00032497363,0.00082070363,0.00049771153,0.00012334909],"category_scores_gemma":[0.0047788024,0.00040485626,0.00024604917,0.0005107149,0.0007253402,0.00017203712,0.0046513043,0.0007090225,0.0000021848207],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021038593,0.0019291841,0.10291452,0.008334208,0.0017827577,0.00016580801,0.08897512,0.085154906,0.40025732,0.008728811,0.0016927326,0.29796076],"study_design_scores_gemma":[0.0039198003,0.00089442637,0.04088895,0.007974819,0.0003830687,0.00018120577,0.078886695,0.3204477,0.5234826,0.019189404,0.001012854,0.0027384649],"about_ca_topic_score_codex":0.0002074266,"about_ca_topic_score_gemma":0.000035986108,"teacher_disagreement_score":0.2952223,"about_ca_system_score_codex":0.00008519492,"about_ca_system_score_gemma":0.00041324543,"threshold_uncertainty_score":0.9998403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9008967,0.00015341627,0.093343616,0.0028375501,0.0008913263,0.0015456793,0.00012141142,0.00003499104,0.00017525587],"genre_scores_gemma":[0.9206522,0.00005618078,0.07861332,0.000017847993,0.0004006775,0.000060388465,0.000008659023,0.000044473123,0.00014624384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9841354,0.0021696438,0.003774751,0.0006561092,0.008290377,0.0009737244],"domain_scores_gemma":[0.97956336,0.006409158,0.0016712197,0.00079204614,0.011144171,0.00042003213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023851648,0.00029138415,0.00089380064,0.0023669028,0.00081749976,0.0002996833,0.00225314,0.00025576502,0.00016570177],"category_scores_gemma":[0.0015908974,0.00020232565,0.0008619317,0.003730203,0.0012149482,0.00058691733,0.000015694062,0.001665052,0.000025893583],"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.013831999,0.0010989205,0.16114382,0.0015293801,0.00080003624,0.00009549658,0.017426942,0.44034165,0.098139174,0.059811424,0.0036152338,0.20216593],"study_design_scores_gemma":[0.02131702,0.0034427433,0.61877346,0.003824646,0.00036035676,0.000022618833,0.058157448,0.116425015,0.11527613,0.01036801,0.050671663,0.0013608681],"about_ca_topic_score_codex":0.00083644496,"about_ca_topic_score_gemma":0.002130741,"teacher_disagreement_score":0.45762965,"about_ca_system_score_codex":0.00035769667,"about_ca_system_score_gemma":0.0010751976,"threshold_uncertainty_score":0.82665527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8300156,0.0029798695,0.0041127745,0.0037761412,0.0015309046,0.0016509164,0.00006717279,0.00052424305,0.15534239],"genre_scores_gemma":[0.71050215,0.000015449767,0.26229334,0.0005660535,0.0013251991,0.00014482476,0.00017938273,0.00009421398,0.024879405],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99132603,0.00034882448,0.0013410216,0.0022989896,0.0038416854,0.0008434233],"domain_scores_gemma":[0.99133664,0.0049315034,0.00050537765,0.0012544171,0.0015795821,0.00039245747],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020400463,0.0006585143,0.0008208496,0.0008726381,0.00034927588,0.00076332793,0.0017451594,0.0004188055,0.0031767169],"category_scores_gemma":[0.04324866,0.00048235033,0.00029483484,0.00080241245,0.0001414698,0.00043179834,0.00012564084,0.0009732131,0.0032586013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017849199,0.00078487693,0.013697129,0.00009296396,0.00065862475,0.00014499667,0.045352902,0.00023191576,0.00102595,0.26014715,0.0040628775,0.6720157],"study_design_scores_gemma":[0.0017150497,0.00056433043,0.1999723,0.0064179664,0.0003315417,0.00004065393,0.46310243,0.00074375287,0.14726342,0.15238126,0.021598238,0.005869061],"about_ca_topic_score_codex":0.0003342332,"about_ca_topic_score_gemma":0.0012420841,"teacher_disagreement_score":0.66614664,"about_ca_system_score_codex":0.0008997234,"about_ca_system_score_gemma":0.00240005,"threshold_uncertainty_score":0.99976283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762111,0.0028464154,0.018838547,0.00025768287,0.0002525719,0.00084055925,0.00013648771,0.00004505357,0.00057158223],"genre_scores_gemma":[0.93482345,0.00016962858,0.06450262,0.00007840271,0.00009323705,0.000012410702,0.000025050636,0.000038598173,0.00025661828],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9928319,0.00072338444,0.002586287,0.0016340481,0.0017808791,0.00044352852],"domain_scores_gemma":[0.99241984,0.0029599771,0.0019035524,0.0016399983,0.0009035733,0.00017304489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055572256,0.0005669845,0.0019048323,0.0007066884,0.00018194945,0.00032497363,0.00082070363,0.00049771153,0.00012334909],"category_scores_gemma":[0.0047788024,0.00040485626,0.00024604917,0.0005107149,0.0007253402,0.00017203712,0.0046513043,0.0007090225,0.0000021848207],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021038593,0.0019291841,0.10291452,0.008334208,0.0017827577,0.00016580801,0.08897512,0.085154906,0.40025732,0.008728811,0.0016927326,0.29796076],"study_design_scores_gemma":[0.0039198003,0.00089442637,0.04088895,0.007974819,0.0003830687,0.00018120577,0.078886695,0.3204477,0.5234826,0.019189404,0.001012854,0.0027384649],"about_ca_topic_score_codex":0.0002074266,"about_ca_topic_score_gemma":0.000035986108,"teacher_disagreement_score":0.2952223,"about_ca_system_score_codex":0.00008519492,"about_ca_system_score_gemma":0.00041324543,"threshold_uncertainty_score":0.9998403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.132432,0.00018211004,0.82435095,0.029724259,0.0014209809,0.0035670684,0.00004063298,0.00008696218,0.008195058],"genre_scores_gemma":[0.89103067,0.000054798125,0.105256714,0.0020677291,0.001090838,0.000048716083,0.000007785168,0.000033419317,0.00040931688],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99564385,0.0002618581,0.0011991805,0.00042663116,0.0021602265,0.00030824653],"domain_scores_gemma":[0.99571687,0.001412542,0.00082641834,0.0003218019,0.001653655,0.000068739806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077224574,0.00021683727,0.0002665005,0.0011034396,0.0003687614,0.0009690935,0.0013047145,0.00008140366,0.00013928182],"category_scores_gemma":[0.0009820586,0.00013603637,0.00019616324,0.0005511142,0.0003498352,0.00034392654,0.00023949464,0.0002650721,0.000022127291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045484966,0.0007902779,0.013670405,0.0003131393,0.0027240878,0.00017748935,0.040861752,0.0043401904,0.0067309896,0.044083003,0.030259166,0.851501],"study_design_scores_gemma":[0.018509138,0.003382183,0.006196648,0.0014423445,0.00065951137,0.0009995184,0.07808401,0.18974249,0.018352546,0.016579598,0.6644565,0.0015955267],"about_ca_topic_score_codex":0.000025397396,"about_ca_topic_score_gemma":0.000013563711,"teacher_disagreement_score":0.8499055,"about_ca_system_score_codex":0.0001431568,"about_ca_system_score_gemma":0.00041975643,"threshold_uncertainty_score":0.93449914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26835772,0.00029259644,0.7302039,0.0004001771,0.00015192751,0.000073678275,0.000007769066,0.000013850486,0.0004983506],"genre_scores_gemma":[0.7435083,0.00005057623,0.25633675,0.0000074241334,0.000040843184,0.0000013068436,2.880377e-7,0.00000702685,0.00004750988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985947,0.000113622424,0.00049637695,0.00015557895,0.0004939191,0.00014582275],"domain_scores_gemma":[0.99879,0.00070407864,0.00020868595,0.00010633744,0.00010632572,0.00008452377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018157358,0.00011131273,0.00024370609,0.00030010912,0.00005626639,0.0000999532,0.000104058316,0.00004946923,0.000009720893],"category_scores_gemma":[0.00042392768,0.000066335146,0.00004829182,0.00019609978,0.00018048994,0.00016971646,0.000044765977,0.00016628964,1.7433818e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006107695,0.00040783666,0.066930205,0.0009867138,0.0004765247,0.0004792419,0.0023102656,0.10891711,0.05038728,0.040116694,0.0052715093,0.72310585],"study_design_scores_gemma":[0.018102914,0.0021650584,0.15941563,0.003414099,0.0013189432,0.022837885,0.0338315,0.4556722,0.031596173,0.01877422,0.25050196,0.0023693957],"about_ca_topic_score_codex":0.000008806334,"about_ca_topic_score_gemma":7.027587e-7,"teacher_disagreement_score":0.72073644,"about_ca_system_score_codex":0.000022702267,"about_ca_system_score_gemma":0.00001864472,"threshold_uncertainty_score":0.2705069},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45168272,0.000010075114,0.5439575,0.0005477029,0.00015353473,0.0015659649,0.000010592474,0.00004160234,0.0020303235],"genre_scores_gemma":[0.9557809,0.0000031830134,0.043379907,0.00025126192,0.000095883435,0.00012769073,0.0000015615843,0.00002693541,0.0003326448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960133,0.00024294676,0.0013431761,0.0009896818,0.0010079156,0.00040300336],"domain_scores_gemma":[0.99254453,0.004516712,0.0007533561,0.0005176558,0.0015785011,0.00008924771],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0058676996,0.00034123115,0.0005950939,0.0012797234,0.00017430997,0.0005483383,0.0013515367,0.00020056307,0.00006698676],"category_scores_gemma":[0.011153618,0.00022885101,0.00015509008,0.0014114405,0.0002383713,0.0006527201,0.00066000345,0.00038079705,0.00003835428],"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.0011935419,0.00019339795,0.14765832,0.00016448036,0.00007976758,6.79852e-7,0.017248178,0.20331421,0.010775648,0.023604,0.0005410916,0.5952267],"study_design_scores_gemma":[0.0007605111,0.00018860657,0.042710517,0.0004098695,0.000035373345,0.000010719469,0.004007626,0.8978422,0.0011879695,0.045234967,0.0071835076,0.00042810076],"about_ca_topic_score_codex":0.000059546102,"about_ca_topic_score_gemma":0.00006419038,"teacher_disagreement_score":0.69452804,"about_ca_system_score_codex":0.0000951457,"about_ca_system_score_gemma":0.00009818366,"threshold_uncertainty_score":0.9971759},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45576257,0.000013004447,0.5371452,0.0008773418,0.000926083,0.0031072625,0.00020023382,0.00032144834,0.001646891],"genre_scores_gemma":[0.96929604,2.0830709e-7,0.028815104,0.00018393797,0.0005520301,0.00026033784,0.0001127751,0.000055742883,0.0007238205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456286,0.00039904303,0.0017414073,0.001186756,0.0012811346,0.00082878623],"domain_scores_gemma":[0.9898487,0.00511175,0.00087896653,0.001162518,0.0027043405,0.00029374112],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017601552,0.00050031766,0.00073373836,0.0009883072,0.0007162858,0.0014594807,0.0009997513,0.00048430474,0.0025754836],"category_scores_gemma":[0.0037509839,0.00043255562,0.00034969178,0.0011327189,0.00028527636,0.001388883,0.00016280165,0.00045864712,0.0018759265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013320085,0.00010963192,0.014410818,0.000035027093,0.00006781183,0.0000012926558,0.0013806493,0.9684343,0.0012073859,0.00086574315,0.0007792601,0.0125749055],"study_design_scores_gemma":[0.0027599216,0.00011905158,0.00029239478,0.0001945678,0.000053522595,0.0000047404865,0.004315482,0.98665434,0.0008552915,0.00074840797,0.003511864,0.0004904407],"about_ca_topic_score_codex":0.000074491836,"about_ca_topic_score_gemma":0.00005574718,"teacher_disagreement_score":0.5135335,"about_ca_system_score_codex":0.00019518791,"about_ca_system_score_gemma":0.0006910827,"threshold_uncertainty_score":0.9998126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58441204,0.00011987659,0.37925276,0.02825822,0.007298533,0.00048296238,0.00006310278,0.000012826299,0.000099700956],"genre_scores_gemma":[0.97764367,0.000004621754,0.019286703,0.0009784779,0.0010424064,0.00007652872,0.0000037081138,0.000017235896,0.0009466702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978175,0.00008220983,0.001010856,0.00028949734,0.00063742313,0.00016251317],"domain_scores_gemma":[0.9971818,0.0004147126,0.00074055255,0.00023831906,0.0013158438,0.0001088048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004203428,0.00010706393,0.00022113195,0.00063874834,0.00019982329,0.00024903956,0.0013330363,0.000023587167,0.00004194205],"category_scores_gemma":[0.004402264,0.00008287854,0.000120262026,0.00028599484,0.00002284715,0.00032442817,0.00016570094,0.0002455044,0.000017980328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031886427,0.000022008455,0.00016004371,8.283322e-7,0.00007361476,0.0000014953181,0.0024150813,0.97591525,0.00052325515,0.0009343578,0.0031814205,0.016453777],"study_design_scores_gemma":[0.0006724375,0.00016377759,0.00007942298,0.000021222953,0.000013505514,0.00047404633,0.008881389,0.8396714,0.00046697183,0.0016806924,0.14771833,0.00015681074],"about_ca_topic_score_codex":0.000004168125,"about_ca_topic_score_gemma":0.0000044572093,"teacher_disagreement_score":0.39323163,"about_ca_system_score_codex":0.00032604617,"about_ca_system_score_gemma":0.00027109208,"threshold_uncertainty_score":0.5270239},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21726826,0.00013572756,0.7778899,0.00091666664,0.0006942692,0.00090558286,0.000079206984,0.00011262721,0.0019977847],"genre_scores_gemma":[0.5202082,0.0000010143967,0.47929195,0.00011125263,0.00023214117,0.000055755216,0.0000054243424,0.00003840149,0.00005585573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933751,0.00014059199,0.001638693,0.0005915855,0.0036613797,0.00059262814],"domain_scores_gemma":[0.9965812,0.0007483497,0.00091142964,0.00034213212,0.0011098523,0.00030704078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0051932177,0.00036782748,0.0005783148,0.0020654795,0.00022736107,0.0005635082,0.0022082324,0.000074200594,0.0000835426],"category_scores_gemma":[0.002479109,0.00029640552,0.00032814406,0.0013203112,0.00013242326,0.00044346962,0.00048392505,0.0011527316,0.000006377783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003549396,0.0003266381,0.0011310391,0.000016226768,0.00043241275,0.00041242098,0.007668206,0.9448815,0.0030849038,0.0017865975,0.0001379045,0.0397672],"study_design_scores_gemma":[0.0139711,0.003093283,0.0015071293,0.0012325954,0.00025162884,0.035329767,0.103271976,0.6343677,0.0032776587,0.00049702026,0.2000629,0.003137258],"about_ca_topic_score_codex":0.000021636772,"about_ca_topic_score_gemma":0.0000030404155,"teacher_disagreement_score":0.31051382,"about_ca_system_score_codex":0.00044370905,"about_ca_system_score_gemma":0.00068034575,"threshold_uncertainty_score":0.9999488},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047759176,0.00088489626,0.8840846,0.0006436712,0.001440842,0.0011256286,0.0000758719,0.00035242233,0.106616154],"genre_scores_gemma":[0.953805,0.000033565364,0.04192061,0.00037533962,0.0008690223,0.00010526694,0.000047292964,0.00022186285,0.0026219876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943081,0.00006366272,0.0014762117,0.001471794,0.0019618033,0.0007184415],"domain_scores_gemma":[0.99380827,0.004123962,0.00046165808,0.0010795997,0.00031258762,0.00021392752],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021951774,0.0007853884,0.0010346939,0.0020506808,0.00018335695,0.0002888148,0.0011123691,0.0005840788,0.0021080417],"category_scores_gemma":[0.012033027,0.00076204777,0.00037075373,0.0008418149,0.000039312916,0.00030398974,0.00052283856,0.0012621889,0.00008065056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043564127,0.000007693591,0.0000426208,0.000038085367,0.00004464854,0.00005038612,0.001368798,0.96216524,0.0032660686,0.01582543,0.000015810661,0.01713165],"study_design_scores_gemma":[0.002806416,0.00080857414,0.00036684336,0.0044046026,0.0002699511,0.0002765428,0.0002573462,0.5242964,0.03830204,0.20521834,0.21502848,0.007964467],"about_ca_topic_score_codex":0.000025667225,"about_ca_topic_score_gemma":0.0008660434,"teacher_disagreement_score":0.94902915,"about_ca_system_score_codex":0.0005204734,"about_ca_system_score_gemma":0.00018323975,"threshold_uncertainty_score":0.99948305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9532623,0.0006013674,0.044562466,0.00045710622,0.0002355836,0.00034572362,0.000026801417,0.000010252162,0.0004983678],"genre_scores_gemma":[0.98967725,0.0000035976389,0.010049416,0.000073253985,0.00013382215,0.000014791151,0.0000025092959,0.00002247492,0.000022886356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980236,0.0000938994,0.0008130866,0.00028381438,0.00040420287,0.00038135034],"domain_scores_gemma":[0.9977167,0.0012166852,0.00037586875,0.00013694314,0.0002313537,0.00032241017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039339666,0.0001593891,0.00035104062,0.0012520717,0.00025392708,0.0001618301,0.0002553227,0.000057533114,0.000043069434],"category_scores_gemma":[0.006455511,0.00015498116,0.00007217636,0.0005627277,0.00006490941,0.00027991986,0.000050588747,0.0003861886,2.5711122e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015456088,0.000016483888,0.022410221,0.00012307457,0.00008138216,0.00019906994,0.018564463,0.912936,0.016951911,0.0014999241,0.000097430275,0.026965525],"study_design_scores_gemma":[0.005005294,0.0006288245,0.014000701,0.0011964667,0.000069859845,0.0019332656,0.03276198,0.9282347,0.0046821283,0.0020586206,0.008360511,0.0010676434],"about_ca_topic_score_codex":0.00014412496,"about_ca_topic_score_gemma":0.007869714,"teacher_disagreement_score":0.036414918,"about_ca_system_score_codex":0.00015262638,"about_ca_system_score_gemma":0.0005323693,"threshold_uncertainty_score":0.7728316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74160403,0.00028304703,0.22165279,0.027288506,0.0023865262,0.0048036245,0.00009999646,0.00032069095,0.0015608183],"genre_scores_gemma":[0.8340466,0.0000037233665,0.15005328,0.013983927,0.0006752693,0.0008533838,0.0000074730274,0.00007232901,0.0003039986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9837495,0.0007529747,0.0021824094,0.0026498411,0.008391144,0.0022741426],"domain_scores_gemma":[0.9789306,0.016510319,0.0011091542,0.0024688686,0.0005777185,0.00040334705],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03792244,0.0006261241,0.000791319,0.0015975188,0.007264666,0.0026928359,0.008215837,0.00011646587,0.00035202198],"category_scores_gemma":[0.012154619,0.00040942864,0.000741101,0.01040068,0.0023322806,0.0011917314,0.002409106,0.001281381,0.00009204404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000656902,0.00007211822,0.002744955,0.0000050685185,0.000038594477,0.000043887805,0.0035817644,0.6383714,0.011173126,0.0009106681,0.025455222,0.31694633],"study_design_scores_gemma":[0.0024996088,0.00037476714,0.0018280519,0.000052577318,0.00006543334,0.0004098811,0.013183151,0.7126494,0.00056120014,0.004428526,0.2628809,0.0010664797],"about_ca_topic_score_codex":0.000051065894,"about_ca_topic_score_gemma":0.000015564654,"teacher_disagreement_score":0.31587982,"about_ca_system_score_codex":0.00037450477,"about_ca_system_score_gemma":0.00081652973,"threshold_uncertainty_score":0.9998357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2693552,0.00040328954,0.7279479,0.00017461064,0.0014162455,0.00045541496,0.000029506751,0.000031544474,0.00018631038],"genre_scores_gemma":[0.9124508,0.0000010575434,0.08713236,0.00004011931,0.00027899453,0.000030661125,0.000006290991,0.00003639441,0.000023356031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754035,0.00009949556,0.00091190566,0.00025298237,0.00072007935,0.00047519084],"domain_scores_gemma":[0.9977304,0.0005309743,0.00053224806,0.00022690085,0.0003911941,0.0005883023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028672349,0.00018354537,0.0003535034,0.0012495756,0.00045442948,0.0004474028,0.0006130667,0.00006828476,0.00038652806],"category_scores_gemma":[0.0038562424,0.00018066428,0.00021566408,0.00065209065,0.000041984524,0.0005308922,0.00003203654,0.00057557435,0.0000016377617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021779026,0.000006336694,0.0028784166,0.000010192198,0.000039039427,0.000052838062,0.0014511294,0.98918885,0.0005458747,0.00009743972,0.00007217759,0.0056359563],"study_design_scores_gemma":[0.0010138726,0.00014924565,0.00044711068,0.00009424316,0.000029829334,0.0007315042,0.006089092,0.98260593,0.00009110532,0.00032607108,0.008152107,0.00026985595],"about_ca_topic_score_codex":0.00032187806,"about_ca_topic_score_gemma":0.0012241186,"teacher_disagreement_score":0.64309555,"about_ca_system_score_codex":0.00041558323,"about_ca_system_score_gemma":0.0010227257,"threshold_uncertainty_score":0.73672754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80539787,0.00003341814,0.18876924,0.0009426964,0.001963039,0.0009893469,0.000025804626,0.0013598321,0.0005187794],"genre_scores_gemma":[0.9917762,0.000006063383,0.0062534786,0.00005721826,0.001422268,0.00008734653,0.000027036427,0.00009487196,0.00027550518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942303,0.0003416385,0.0012017706,0.0012366188,0.0017419601,0.0012477421],"domain_scores_gemma":[0.9942754,0.003821118,0.00040367505,0.0009867275,0.00016556341,0.00034751205],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0036778965,0.0006158635,0.00084823306,0.0019297632,0.00048706093,0.0011214125,0.0013907488,0.00048451306,0.00006664454],"category_scores_gemma":[0.0034940979,0.0005448499,0.00043373238,0.0036383695,0.00016023028,0.0005586693,0.0007198307,0.001448525,0.00017151888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003542778,0.000055471446,0.0010251404,0.000021915028,0.00013433753,0.00003293986,0.00090734486,0.92305255,0.011544745,0.0005960606,0.0010356079,0.061558444],"study_design_scores_gemma":[0.0019681028,0.00012079949,0.0029142825,0.00041884443,0.000047895643,0.000056188863,0.0009540045,0.98297143,0.001772177,0.00041218303,0.0074574137,0.0009066848],"about_ca_topic_score_codex":0.00004092952,"about_ca_topic_score_gemma":0.0000064111073,"teacher_disagreement_score":0.18637836,"about_ca_system_score_codex":0.00027779557,"about_ca_system_score_gemma":0.00029706064,"threshold_uncertainty_score":0.99991554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2760144,0.00015710166,0.6874399,0.027880052,0.0013751729,0.003821915,0.000055977405,0.00054957776,0.002705886],"genre_scores_gemma":[0.40141982,0.000012482825,0.5836289,0.010544993,0.0022517575,0.0004981202,0.000034068376,0.000095156494,0.001514749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9873416,0.00035589046,0.0017404669,0.0023597975,0.0061418093,0.0020604269],"domain_scores_gemma":[0.9800818,0.016350089,0.0006954481,0.0018571573,0.0005413775,0.0004741369],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.030304536,0.0005155858,0.00065182825,0.0016898488,0.0029212714,0.0026655882,0.0056626485,0.00017433066,0.00009737643],"category_scores_gemma":[0.01762625,0.00032107477,0.0005610511,0.01528772,0.0026472358,0.0011099981,0.0009470578,0.00069012353,0.00045331617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004050662,0.000041833122,0.002773215,0.00000841797,0.000044746357,0.0000231711,0.0028080044,0.56277406,0.006195831,0.005686085,0.19342199,0.22581759],"study_design_scores_gemma":[0.0017005615,0.00008881067,0.0036656149,0.000070887196,0.000036928643,0.00019063376,0.004258273,0.8895346,0.00010560851,0.012366968,0.08731639,0.00066471077],"about_ca_topic_score_codex":0.000053207375,"about_ca_topic_score_gemma":0.000009622395,"teacher_disagreement_score":0.32676056,"about_ca_system_score_codex":0.00017498048,"about_ca_system_score_gemma":0.0013699688,"threshold_uncertainty_score":0.9999241},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7996751,0.00007043621,0.19046065,0.0010322016,0.00019376371,0.0019760993,0.000057414716,0.00065622845,0.0058781067],"genre_scores_gemma":[0.88490564,0.000017807022,0.11422179,0.000115307244,0.00017723323,0.000045895933,0.000059444446,0.00012319205,0.00033369285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99078304,0.0012862916,0.0019616277,0.0028441818,0.0021539223,0.0009709241],"domain_scores_gemma":[0.9910651,0.005110052,0.0016182732,0.0013202585,0.00059856835,0.0002877432],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009692232,0.0008317475,0.0013274896,0.0023771522,0.00046015283,0.0016455242,0.00092434813,0.0009432048,0.000099812874],"category_scores_gemma":[0.010131584,0.0006914218,0.00017374883,0.0027507937,0.0010956451,0.00049402786,0.0014793165,0.0022558088,0.000016577837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032176153,0.00003093712,0.013014026,0.00010789013,0.00006705518,0.00008680249,0.003015853,0.943902,0.0001615147,0.00012086718,0.00003342053,0.039137837],"study_design_scores_gemma":[0.001645299,0.000091377544,0.0013703222,0.0015009155,0.000057536487,0.00017889393,0.0213174,0.9710322,0.00057338295,0.0011167104,0.00015609432,0.0009598692],"about_ca_topic_score_codex":0.0005008183,"about_ca_topic_score_gemma":0.0001458981,"teacher_disagreement_score":0.085230544,"about_ca_system_score_codex":0.00027914988,"about_ca_system_score_gemma":0.00075650477,"threshold_uncertainty_score":0.9995537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7996751,0.00007043621,0.19046065,0.0010322016,0.00019376371,0.0019760993,0.000057414716,0.00065622845,0.0058781067],"genre_scores_gemma":[0.88490564,0.000017807022,0.11422179,0.000115307244,0.00017723323,0.000045895933,0.000059444446,0.00012319205,0.00033369285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99078304,0.0012862916,0.0019616277,0.0028441818,0.0021539223,0.0009709241],"domain_scores_gemma":[0.9910651,0.005110052,0.0016182732,0.0013202585,0.00059856835,0.0002877432],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009692232,0.0008317475,0.0013274896,0.0023771522,0.00046015283,0.0016455242,0.00092434813,0.0009432048,0.000099812874],"category_scores_gemma":[0.010131584,0.0006914218,0.00017374883,0.0027507937,0.0010956451,0.00049402786,0.0014793165,0.0022558088,0.000016577837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032176153,0.00003093712,0.013014026,0.00010789013,0.00006705518,0.00008680249,0.003015853,0.943902,0.0001615147,0.00012086718,0.00003342053,0.039137837],"study_design_scores_gemma":[0.001645299,0.000091377544,0.0013703222,0.0015009155,0.000057536487,0.00017889393,0.0213174,0.9710322,0.00057338295,0.0011167104,0.00015609432,0.0009598692],"about_ca_topic_score_codex":0.0005008183,"about_ca_topic_score_gemma":0.0001458981,"teacher_disagreement_score":0.085230544,"about_ca_system_score_codex":0.00027914988,"about_ca_system_score_gemma":0.00075650477,"threshold_uncertainty_score":0.9995537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91506433,0.00008460382,0.08135584,0.0012260149,0.0020372658,0.00014779002,0.000015700494,0.000018626826,0.00004981626],"genre_scores_gemma":[0.64178157,0.00003615567,0.35735562,0.00004647453,0.00068119325,0.000001980919,0.0000025858892,0.000018565344,0.00007587212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976571,0.000090553694,0.0012143875,0.00032933772,0.0005187068,0.00018986582],"domain_scores_gemma":[0.99702996,0.00028045048,0.00087713427,0.00018454774,0.0015145976,0.00011332664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511634,0.00014640459,0.0003256357,0.0017713453,0.0000605189,0.00021601505,0.0005547044,0.00006964666,0.000030286621],"category_scores_gemma":[0.0042025857,0.0001304552,0.00009452328,0.0007778449,0.00007555114,0.00046422976,0.00013208424,0.00024427543,0.0000129681175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010437484,0.000029726332,0.011207043,0.000006003518,0.0001820954,0.000026988568,0.0025603895,0.85948104,0.011626027,0.000063856816,0.000052230676,0.1146602],"study_design_scores_gemma":[0.001326248,0.00024054323,0.016795391,0.00036852376,0.000045934255,0.0019296629,0.011255439,0.93624336,0.024862463,0.0041432898,0.002344522,0.00044460403],"about_ca_topic_score_codex":0.000015683485,"about_ca_topic_score_gemma":0.0000025409774,"teacher_disagreement_score":0.27599978,"about_ca_system_score_codex":0.00012656007,"about_ca_system_score_gemma":0.00032993685,"threshold_uncertainty_score":0.5319808},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8494313,0.0004777013,0.06475605,0.004383555,0.00015458796,0.001842078,0.0000266415,0.00055176823,0.07837636],"genre_scores_gemma":[0.8924235,0.00009346121,0.095890895,0.00200616,0.00024859887,0.00038777207,0.000032266475,0.0000740857,0.008843234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996978,0.00009392683,0.0005410291,0.0006984189,0.0012536389,0.00043499056],"domain_scores_gemma":[0.99812716,0.0009720809,0.00015689997,0.0004588665,0.000101720805,0.00018328344],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025380289,0.00020471984,0.00029301236,0.00044285675,0.00020643116,0.00033339308,0.00032184276,0.00015671225,0.00008320995],"category_scores_gemma":[0.002626105,0.00014494041,0.00007857656,0.0014213086,0.00015808108,0.00018063161,0.00022007972,0.00027479776,0.0010619706],"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.000799765,0.0027011286,0.0075540277,0.0038372884,0.0003245283,0.00012317071,0.072720155,0.018026061,0.05541129,0.7085313,0.041166928,0.08880431],"study_design_scores_gemma":[0.005920172,0.00081876974,0.013906888,0.003496106,0.0001591348,0.0007216043,0.015108849,0.6036026,0.0026648291,0.3367404,0.014449614,0.0024110079],"about_ca_topic_score_codex":0.0000012061183,"about_ca_topic_score_gemma":0.000002984493,"teacher_disagreement_score":0.58557653,"about_ca_system_score_codex":0.00003750131,"about_ca_system_score_gemma":0.0000843303,"threshold_uncertainty_score":0.9997158},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5287602,0.000013818005,0.46597314,0.0006396694,0.001443406,0.0014545902,0.000038057045,0.0003950467,0.0012820523],"genre_scores_gemma":[0.43009245,0.0000061606524,0.569159,0.000031275187,0.0003218111,0.00020184754,0.0000908452,0.00003114658,0.000065497385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485826,0.0005479215,0.0020206454,0.00082364056,0.0012694043,0.00048011105],"domain_scores_gemma":[0.992899,0.0042104707,0.0014267141,0.0006391669,0.0007264489,0.000098191755],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006035557,0.00028624714,0.0006132372,0.0019691095,0.0002862656,0.0002877248,0.0004821326,0.00060273707,0.00015117724],"category_scores_gemma":[0.017371967,0.00027819545,0.00017585933,0.005278829,0.00038424344,0.000880088,0.000074347634,0.0004453423,0.00005724467],"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.0007726145,0.000098357246,0.020091858,0.00012572359,0.00010709047,0.0000026859495,0.0047680107,0.32810265,0.008542016,0.20093589,0.00058969064,0.4358634],"study_design_scores_gemma":[0.005521801,0.00022867486,0.0028373452,0.0007228577,0.00008337916,0.00012982327,0.038829427,0.7624558,0.017007178,0.16924189,0.0022059854,0.00073579233],"about_ca_topic_score_codex":0.000044186465,"about_ca_topic_score_gemma":0.000003928453,"teacher_disagreement_score":0.43512762,"about_ca_system_score_codex":0.00017384402,"about_ca_system_score_gemma":0.000522871,"threshold_uncertainty_score":0.99996704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9522789,0.00020183426,0.035202455,0.0014726324,0.00097006117,0.005009021,0.00007955388,0.0004903171,0.004295238],"genre_scores_gemma":[0.6457545,0.00006177458,0.33875927,0.00019407974,0.00032377607,0.00023125009,0.000032076838,0.00013459346,0.014508667],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.98920995,0.0011859599,0.0029768918,0.0011490341,0.004217607,0.0012605697],"domain_scores_gemma":[0.9939421,0.0013047613,0.0022978128,0.001009198,0.0011762172,0.00026992083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008821728,0.00073785585,0.0012282202,0.0041554077,0.0005961222,0.0007905246,0.0021084563,0.00024546104,0.00013096888],"category_scores_gemma":[0.0018407885,0.00046397944,0.0005724065,0.0045150835,0.000527754,0.0008826196,0.0007520782,0.0011490341,0.00011331244],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015528299,0.014596124,0.17966913,0.005819348,0.013725922,0.011867509,0.257459,0.14231627,0.026058335,0.008288032,0.07290722,0.2517648],"study_design_scores_gemma":[0.043961924,0.004484998,0.061224945,0.0073858523,0.0014876958,0.0019983375,0.47793296,0.32774422,0.0033648189,0.0039188573,0.06131224,0.0051831515],"about_ca_topic_score_codex":0.000077364064,"about_ca_topic_score_gemma":0.00008200081,"teacher_disagreement_score":0.30652437,"about_ca_system_score_codex":0.00028938276,"about_ca_system_score_gemma":0.00085813866,"threshold_uncertainty_score":0.9997812},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014704649,0.0008361022,0.96019185,0.0014757745,0.00026302232,0.0040272414,0.00017263825,0.0013649612,0.016963793],"genre_scores_gemma":[0.057500046,0.000008210889,0.9289506,0.00028115103,0.0005218077,0.000717062,0.000034688026,0.00017758057,0.01180883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913004,0.00049324066,0.0019088546,0.0025190045,0.0023559122,0.0014225856],"domain_scores_gemma":[0.9906521,0.006604937,0.00041524952,0.0012149074,0.000719782,0.0003930162],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0074643996,0.0008305661,0.0010853548,0.0018826101,0.00070051197,0.0031327913,0.0016347676,0.00035850986,0.00036469635],"category_scores_gemma":[0.0038471448,0.00053044496,0.00056606974,0.0037143566,0.00073109305,0.0006555886,0.0003036376,0.0008101236,0.00020976287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007545814,0.0005113184,0.0008093744,0.00044290946,0.000860474,0.0006200556,0.018232247,0.02158129,0.00097207393,0.0051620994,0.0058077015,0.9442459],"study_design_scores_gemma":[0.002692179,0.0006270204,0.00003996817,0.00062866654,0.00015128538,0.0005350111,0.01312454,0.9219872,0.0003265843,0.0015911247,0.05730222,0.0009942234],"about_ca_topic_score_codex":0.0001171908,"about_ca_topic_score_gemma":0.000103331506,"teacher_disagreement_score":0.94325167,"about_ca_system_score_codex":0.00015169715,"about_ca_system_score_gemma":0.00097244384,"threshold_uncertainty_score":0.99971473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85608083,0.018798456,0.105207406,0.008106275,0.0017102485,0.0069304076,0.00031548654,0.00023818736,0.0026126993],"genre_scores_gemma":[0.9379809,0.0017831712,0.05497621,0.000072075316,0.0006291554,0.0004857519,0.000016453054,0.000073845724,0.003982424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676776,0.0003438528,0.000842213,0.0011518827,0.00023512443,0.0006591464],"domain_scores_gemma":[0.9936818,0.00560442,0.00013185541,0.00026355984,0.0002141892,0.00010420996],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006819753,0.0002798363,0.00047777288,0.00059180893,0.0012324045,0.0014072077,0.00034974288,0.00010615461,0.000018809535],"category_scores_gemma":[0.00034493586,0.00016813923,0.00014975811,0.00016541917,0.0007793683,0.00024144899,0.0007743033,0.0004479262,0.000103466904],"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.00013763388,0.00006994796,0.0006199159,0.00018462096,0.0012770612,0.000009951312,0.11669161,0.04506291,0.00024567053,0.0014590524,0.0072788238,0.82696277],"study_design_scores_gemma":[0.0009227994,0.00013310649,0.00038951397,0.00006674076,0.00003661702,0.00002721939,0.040459413,0.9418038,0.00020429287,0.0065628462,0.0091562895,0.00023736393],"about_ca_topic_score_codex":0.0007109341,"about_ca_topic_score_gemma":0.0007273624,"teacher_disagreement_score":0.8967409,"about_ca_system_score_codex":0.00033737477,"about_ca_system_score_gemma":0.00019568144,"threshold_uncertainty_score":0.99962944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4667275,0.003542302,0.5259488,0.0008772162,0.0016860674,0.00017306655,0.000010684478,0.00008327289,0.00095105055],"genre_scores_gemma":[0.9290463,0.00035701308,0.070281595,0.000023533043,0.00019843614,0.00000599922,3.867547e-7,0.000015552274,0.00007121027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798703,0.00008723788,0.0006778992,0.00028992372,0.00070933544,0.00024857977],"domain_scores_gemma":[0.9985534,0.0009961596,0.00010202613,0.00012097926,0.000100638936,0.00012681258],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021313287,0.00016250514,0.00028457915,0.0006143451,0.00012878481,0.001068299,0.00014551189,0.00007429477,0.00002249246],"category_scores_gemma":[0.0010382286,0.00013507839,0.000089965615,0.00038700804,0.00020043591,0.00073928526,0.00009875838,0.00042243893,0.0000021230644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008686864,0.000079307334,0.0022379328,0.0019467437,0.0007375061,0.0009598143,0.0029180036,0.0024631103,0.017471597,0.25172493,0.0025473703,0.7168268],"study_design_scores_gemma":[0.004784638,0.001112887,0.0057941265,0.009547296,0.0015202526,0.030917784,0.09779729,0.64378405,0.014727472,0.048931308,0.1381279,0.002955024],"about_ca_topic_score_codex":0.00000322073,"about_ca_topic_score_gemma":2.1081193e-7,"teacher_disagreement_score":0.7138718,"about_ca_system_score_codex":0.000040611863,"about_ca_system_score_gemma":0.000039725903,"threshold_uncertainty_score":0.9999687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111545935,0.00013390194,0.8835423,0.0013707755,0.0021683336,0.00084066374,0.00017847995,0.000080781625,0.00013882242],"genre_scores_gemma":[0.83305794,0.000004273302,0.16587104,0.000038088452,0.000902506,0.00003381636,0.000025836005,0.000041388037,0.000025104575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956579,0.00014473821,0.001824936,0.00046836754,0.0015039219,0.00040012915],"domain_scores_gemma":[0.9934314,0.004477438,0.00059164054,0.00015942579,0.0011810947,0.00015903659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030531914,0.0003066742,0.00053533306,0.0022226397,0.00009004778,0.0009280261,0.00090318685,0.0002088219,0.000024372212],"category_scores_gemma":[0.005747854,0.00025033866,0.00024285086,0.0010590324,0.0002062066,0.0005202884,0.00008352749,0.00090312003,0.0000048828165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021587245,0.00010716866,0.0006785769,0.000014523094,0.00031265442,0.00028327067,0.0016524087,0.90765077,0.0011556662,0.0008428585,0.00015161672,0.0869346],"study_design_scores_gemma":[0.004423234,0.00030696663,0.00012997261,0.00168988,0.000044135668,0.0009344957,0.0015241912,0.98639756,0.000413169,0.00015204726,0.0036738275,0.00031049908],"about_ca_topic_score_codex":0.00009338938,"about_ca_topic_score_gemma":0.000042546064,"teacher_disagreement_score":0.721512,"about_ca_system_score_codex":0.00047538005,"about_ca_system_score_gemma":0.001486821,"threshold_uncertainty_score":0.9999949},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696129,0.0003167104,0.42939553,0.000029599767,0.00014047185,0.00038176193,0.0000031712518,0.000055502223,0.0000643246],"genre_scores_gemma":[0.9851317,0.000006182377,0.0147231575,0.0000042540278,0.000058385227,0.000060676855,0.0000049482865,0.000009460737,0.0000012457393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981711,0.00013530342,0.0007190178,0.00045108036,0.00034319572,0.00018029004],"domain_scores_gemma":[0.99751323,0.0021763856,0.00013506602,0.00009816566,0.0000488055,0.000028338387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018617181,0.00013450386,0.00022206339,0.00076803664,0.00011561434,0.0006434932,0.00006848279,0.00007008698,0.000002978012],"category_scores_gemma":[0.0008542454,0.0001251791,0.000023457238,0.0004094491,0.00008878406,0.0009241366,0.00003367216,0.00018117763,0.0000016875993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018454035,0.0000045723878,0.0340186,0.000029253733,0.0000035259645,8.9004254e-7,0.001663427,0.73941064,0.00026929632,0.0015453721,5.0252396e-7,0.22303545],"study_design_scores_gemma":[0.00064322585,0.000036500875,0.0070152297,0.000281984,0.000008287023,0.00002194349,0.0057234033,0.97881013,0.000018758303,0.0072665783,0.000050292918,0.00012364495],"about_ca_topic_score_codex":0.000035687754,"about_ca_topic_score_gemma":0.000010364538,"teacher_disagreement_score":0.41551876,"about_ca_system_score_codex":0.000087925015,"about_ca_system_score_gemma":0.00009661352,"threshold_uncertainty_score":0.62052196},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014374006,0.06863484,0.06494962,0.00799396,0.00034588066,0.0051764143,0.00012426279,0.0018143816,0.83658665],"genre_scores_gemma":[0.32795364,0.043918323,0.59521824,0.00021353645,0.00004458507,0.0006087922,0.0002593526,0.00009722967,0.03168633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734676,0.000062648054,0.0013472777,0.0004681646,0.000529177,0.00024596],"domain_scores_gemma":[0.9968596,0.00072142045,0.0009690823,0.0009719549,0.00042518816,0.000052752523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014962031,0.00035128676,0.00044487492,0.003037547,0.00035359172,0.0004441906,0.00083514827,0.0006309848,0.00003540172],"category_scores_gemma":[0.0007664918,0.00029412613,0.000046133402,0.00087534596,0.00077404507,0.0030266077,0.0006615986,0.001332792,0.000085797634],"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.00009152327,0.00002043119,0.0017970174,0.00018517357,0.000041807372,0.0000027607016,0.003545512,0.0018876237,0.000035943922,0.5073199,0.0000342001,0.4850381],"study_design_scores_gemma":[0.0017596291,0.0004450302,0.00040173734,0.0043814564,0.00010163874,0.00049473287,0.013771417,0.08230173,0.00006779764,0.48394066,0.41104525,0.0012889227],"about_ca_topic_score_codex":0.000012037411,"about_ca_topic_score_gemma":0.00014757933,"teacher_disagreement_score":0.8049003,"about_ca_system_score_codex":0.00012440978,"about_ca_system_score_gemma":0.00013445222,"threshold_uncertainty_score":0.99995106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14216028,0.011083852,0.68483907,0.08046384,0.0027719743,0.013233241,0.0012734737,0.003313462,0.06086081],"genre_scores_gemma":[0.04896545,0.000044352153,0.91229403,0.0017932797,0.0036953199,0.00031373338,0.00018991738,0.00025573498,0.03244817],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918446,0.0004760344,0.0017983152,0.001991111,0.002501421,0.0013885231],"domain_scores_gemma":[0.9873589,0.010137201,0.00043086408,0.0012364824,0.00040405942,0.0004324757],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006960051,0.00077928207,0.00087187084,0.0009459891,0.0009444789,0.0017571818,0.0018926814,0.00040044574,0.00056385604],"category_scores_gemma":[0.0062060347,0.00049223023,0.000828927,0.003535348,0.0005877131,0.0004970447,0.0004173416,0.0011358884,0.00029205647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016968774,0.0003402744,0.00091667887,0.00032671474,0.0010891584,0.00027918819,0.02397615,0.0074375113,0.02110516,0.022191752,0.009954814,0.9106857],"study_design_scores_gemma":[0.001962052,0.00047496022,0.00012363264,0.00042547623,0.00021453944,0.0002629358,0.022140147,0.30993056,0.0008049508,0.0012609212,0.6615336,0.00086624984],"about_ca_topic_score_codex":0.00014325017,"about_ca_topic_score_gemma":0.00010922677,"teacher_disagreement_score":0.9098195,"about_ca_system_score_codex":0.00018669857,"about_ca_system_score_gemma":0.0015442349,"threshold_uncertainty_score":0.99975294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348493,0.0021473465,0.36176306,0.00082391495,0.00009022221,0.00007208898,0.000037000726,0.0000043833197,0.00021263049],"genre_scores_gemma":[0.9955567,0.00007156033,0.004148298,0.000025349538,0.000100710175,0.0000011915541,0.0000015953342,0.0000046004825,0.00009000594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979516,0.000043008644,0.0008403736,0.00017402628,0.0009232315,0.00006774552],"domain_scores_gemma":[0.99645716,0.0015035326,0.0005540251,0.000108032094,0.0013066402,0.00007060587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012879106,0.00007532906,0.0003156492,0.00101078,0.00003733756,0.00018675458,0.00039521,0.000043926168,0.00013478278],"category_scores_gemma":[0.0020220114,0.00005476182,0.00017235099,0.0015353912,0.00005296315,0.00017505813,0.0000823489,0.000120495235,0.000003653554],"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.00044148922,0.00043536988,0.04046181,0.000033003525,0.013946721,0.000053002772,0.00682564,0.07896337,0.034223977,0.100948736,0.0026653837,0.7210015],"study_design_scores_gemma":[0.0024123825,0.00064153905,0.10383394,0.001923038,0.00543395,0.00049480854,0.006925784,0.6783494,0.0033761407,0.18446167,0.0112700965,0.0008772545],"about_ca_topic_score_codex":0.000015462523,"about_ca_topic_score_gemma":0.000018123656,"teacher_disagreement_score":0.72012424,"about_ca_system_score_codex":0.000024723397,"about_ca_system_score_gemma":0.00019208653,"threshold_uncertainty_score":0.24206825},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026819421,0.1469918,0.07370947,0.017574396,0.0047764108,0.014546442,0.00009142839,0.00053601287,0.7149546],"genre_scores_gemma":[0.065349944,0.07470676,0.8480217,0.0024049394,0.0010146655,0.00021307886,0.00002453799,0.00022655871,0.008037801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98936915,0.0007623088,0.00428376,0.00078829675,0.0041322126,0.00066425715],"domain_scores_gemma":[0.9950598,0.0008676312,0.0019782186,0.0007544676,0.0011804231,0.00015945507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.019817546,0.00047080676,0.0011785267,0.0030373137,0.00014748414,0.0005123375,0.0018812079,0.00013305902,0.0005145711],"category_scores_gemma":[0.002692722,0.00032394886,0.00063551735,0.004947708,0.00021117393,0.00069024286,0.0005284347,0.0007589186,0.00008033224],"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.000264817,0.00033171175,0.00043938425,0.012507031,0.0014046992,0.0010110642,0.0033055085,0.00028533913,0.00051283184,0.0052788346,0.053029265,0.9216295],"study_design_scores_gemma":[0.0010543963,0.00043541295,0.0001315686,0.027599454,0.0004017305,0.0006759841,0.0047769635,0.000752618,0.00076133467,0.0023473762,0.96052045,0.0005427113],"about_ca_topic_score_codex":0.000009543837,"about_ca_topic_score_gemma":0.0000021426831,"teacher_disagreement_score":0.9210868,"about_ca_system_score_codex":0.00031265512,"about_ca_system_score_gemma":0.001443608,"threshold_uncertainty_score":0.99992126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08562773,0.0010913353,0.8613697,0.0433001,0.0058206534,0.0006229632,0.000016779424,0.000055028708,0.0020956723],"genre_scores_gemma":[0.8658249,0.000042971573,0.11172228,0.0000647317,0.00727873,0.000019892408,0.0000031783786,0.00003652346,0.015006824],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927073,0.00031224248,0.0011011737,0.0005323671,0.0049638683,0.00038302198],"domain_scores_gemma":[0.9918448,0.0027721687,0.00025875663,0.00026075583,0.0046920115,0.00017150844],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017786345,0.00013321359,0.00024122153,0.0027020574,0.00017456012,0.0015522871,0.0013378923,0.00009973086,0.00014589028],"category_scores_gemma":[0.029357143,0.00009775926,0.00027209148,0.001096149,0.00012942984,0.0011074182,0.00016813935,0.0010626626,0.00006327288],"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.002446752,0.00020015138,0.0010313311,0.00006897182,0.00067804236,0.00044144198,0.014206987,0.15288639,0.03799328,0.016997542,0.38813102,0.3849181],"study_design_scores_gemma":[0.0007734443,0.00030300464,0.00008174636,0.00061680767,0.000027786004,0.0019653921,0.0038706982,0.7125483,0.0103146965,0.10201125,0.1672345,0.00025238973],"about_ca_topic_score_codex":0.000015540396,"about_ca_topic_score_gemma":0.000002673599,"teacher_disagreement_score":0.78019714,"about_ca_system_score_codex":0.00027549156,"about_ca_system_score_gemma":0.0022638866,"threshold_uncertainty_score":0.9994842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043986004,0.0004452114,0.9097186,0.00110114,0.0014940898,0.0011920627,0.000014494377,0.00051824946,0.04153017],"genre_scores_gemma":[0.5221001,0.00000885337,0.47634116,0.00028221708,0.00020809055,0.00018849371,0.000005122721,0.00002903709,0.0008369398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958524,0.000101399695,0.00094236096,0.001117171,0.0014817484,0.00050491944],"domain_scores_gemma":[0.99508584,0.003660835,0.00012368125,0.0006869265,0.00030446827,0.00013823457],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003054362,0.00029764758,0.00033761727,0.0010888248,0.0002973688,0.0029208339,0.0007343164,0.00014445231,0.0007299122],"category_scores_gemma":[0.0009893383,0.00020787625,0.0002645603,0.0014846278,0.00021212164,0.0007668217,0.000112824055,0.00019238805,0.00029990647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112934016,0.00003389088,0.00008570043,0.00007594427,0.000061231134,0.0000389068,0.00077592157,0.009335278,0.0014980258,0.15055692,0.0029179994,0.8345072],"study_design_scores_gemma":[0.0013564419,0.0002651357,0.00006114503,0.00045427788,0.00005049103,0.00006708318,0.0600312,0.5960565,0.008430346,0.22417457,0.10826985,0.0007829168],"about_ca_topic_score_codex":0.000011064296,"about_ca_topic_score_gemma":0.000011123537,"teacher_disagreement_score":0.8337243,"about_ca_system_score_codex":0.00008923243,"about_ca_system_score_gemma":0.00046592776,"threshold_uncertainty_score":0.9981142},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0458807,0.011764958,0.0047958633,0.0455135,0.019886,0.007975842,0.0043111774,0.0015740523,0.8582979],"genre_scores_gemma":[0.008117696,0.00090319605,0.015853439,0.0024583014,0.001737856,0.00018231527,0.0001317529,0.00021689599,0.97039855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99012464,0.00071412383,0.0034625016,0.0020160638,0.0026057719,0.0010769145],"domain_scores_gemma":[0.9920086,0.0019150128,0.0016503822,0.0031518033,0.0009400912,0.0003340662],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.007946778,0.0014631846,0.0028505758,0.00094367156,0.0007603162,0.00307799,0.0035045792,0.00065560837,0.0076459614],"category_scores_gemma":[0.0020251228,0.000980128,0.0006827787,0.00050704705,0.0005993847,0.00077528093,0.001802113,0.0005966274,0.0016502241],"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.0036618505,0.00013560217,0.000021269723,0.0010105227,0.0027396886,0.0009753786,0.005832292,0.011496364,0.22782557,0.13875958,0.5544983,0.053043555],"study_design_scores_gemma":[0.00044116096,0.0001543936,0.00001005014,0.00071014307,0.00038542636,0.00013363735,0.00076642033,0.00013514214,0.008625843,0.05833854,0.9289299,0.0013693178],"about_ca_topic_score_codex":0.00021594307,"about_ca_topic_score_gemma":0.00023901506,"teacher_disagreement_score":0.3744316,"about_ca_system_score_codex":0.00011385835,"about_ca_system_score_gemma":0.00037294114,"threshold_uncertainty_score":0.99981177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02755952,0.00048659832,0.9687801,0.00010135655,0.0005011953,0.0016725808,0.000008471206,0.00006758666,0.0008225668],"genre_scores_gemma":[0.30013317,0.00002245018,0.69867927,0.00011439344,0.00008978457,0.000030682055,0.0000019619827,0.0000330482,0.0008952278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940718,0.0006212694,0.0019944918,0.0007992897,0.0018952359,0.00061792746],"domain_scores_gemma":[0.9949284,0.0011224877,0.0015889409,0.0006462459,0.0016009129,0.00011296922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004216682,0.0004949352,0.00086256757,0.0039612562,0.0003521141,0.00077012606,0.0012307854,0.00015198419,0.00003085194],"category_scores_gemma":[0.0018991628,0.0003375775,0.00034137265,0.0040766066,0.00018620626,0.0006503887,0.0003498265,0.00079598447,0.000019368334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003788462,0.00029061796,0.0003769341,0.000045337503,0.00061174855,0.00022324933,0.0034697198,0.8184192,0.0000976015,0.00004585901,0.00007082096,0.17597006],"study_design_scores_gemma":[0.004387605,0.00042674274,0.0016596232,0.0007391106,0.00033059472,0.00007953691,0.028046513,0.96292347,0.0001442552,0.00017598394,0.00069567637,0.0003908948],"about_ca_topic_score_codex":0.00008163743,"about_ca_topic_score_gemma":0.000026182825,"teacher_disagreement_score":0.27257365,"about_ca_system_score_codex":0.00046295917,"about_ca_system_score_gemma":0.0007353994,"threshold_uncertainty_score":0.9999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014494553,0.000048917234,0.000017410282,0.00085959374,0.0000058239766,0.00021770262,0.000012002362,0.0001472014,0.9841968],"genre_scores_gemma":[0.003591054,1.749038e-7,0.0015820205,0.00021017014,0.00016363722,0.000013154663,0.000002096893,0.000021658521,0.99441606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715495,0.00016684036,0.00053643587,0.00055807555,0.0011584079,0.00042531817],"domain_scores_gemma":[0.99793875,0.00075199513,0.000078303536,0.00081174634,0.00014168197,0.0002775462],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018379042,0.00017837419,0.00028732934,0.00028716304,0.00015274298,0.00034334348,0.0010575458,0.00009019893,0.9970815],"category_scores_gemma":[0.001500938,0.00014226584,0.00013149236,0.0010812647,0.00008782511,0.00021489587,0.000103604434,0.0001564998,0.99609476],"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.000052065137,0.000019835044,0.0000025180498,5.7640915e-7,0.000006733919,0.000009936246,0.00007232048,0.0004768682,0.000114058865,0.0000031549982,0.022197766,0.97704417],"study_design_scores_gemma":[0.00019309617,0.00008541811,0.000099743265,0.000011034396,0.0000060354946,0.00002373578,0.000012036742,0.0012958308,0.0000829229,0.000075905125,0.99792236,0.00019188617],"about_ca_topic_score_codex":0.000014899355,"about_ca_topic_score_gemma":1.842303e-7,"teacher_disagreement_score":0.9768523,"about_ca_system_score_codex":0.000029923152,"about_ca_system_score_gemma":0.0000716858,"threshold_uncertainty_score":0.5801433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9258937,0.0017232288,0.029743202,0.000952446,0.002490958,0.00075002934,0.000013974784,0.00006444073,0.03836797],"genre_scores_gemma":[0.9951296,0.0000051457664,0.0040867347,0.00012543814,0.0002075504,0.000006511179,1.8105592e-7,0.00002664947,0.00041222989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966298,0.00018736921,0.0014061056,0.0003876747,0.00079583237,0.0005932302],"domain_scores_gemma":[0.9949047,0.0028768852,0.0004127532,0.00052149,0.0007880459,0.00049614895],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005172424,0.0002645484,0.0006216774,0.0020513097,0.00022627387,0.0006055441,0.00093982817,0.00010912659,0.0002908965],"category_scores_gemma":[0.033030972,0.00023709165,0.0002351575,0.0018589684,0.00008756169,0.00042274033,0.00006548919,0.0007557842,0.000011135614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027455378,0.00023480794,0.3284182,0.00025473707,0.0020558068,0.011216447,0.046156827,0.5438995,0.008025624,0.008535131,0.013038214,0.037890192],"study_design_scores_gemma":[0.018508011,0.0031294916,0.22343974,0.0105407275,0.0012718195,0.0059493873,0.23517771,0.11661063,0.010356986,0.016701933,0.3520469,0.0062666624],"about_ca_topic_score_codex":0.0013479512,"about_ca_topic_score_gemma":0.055756148,"teacher_disagreement_score":0.42728886,"about_ca_system_score_codex":0.00029125257,"about_ca_system_score_gemma":0.003421465,"threshold_uncertainty_score":0.9751142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004185896,0.00058772764,0.9281378,0.0022692324,0.00056908495,0.00331785,0.000013913403,0.00008920327,0.06082933],"genre_scores_gemma":[0.05444024,0.000045568737,0.9352012,0.0006798195,0.00033512656,0.00014796207,0.0000033394829,0.00005130143,0.009095408],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926326,0.0007201411,0.00294772,0.0008647159,0.0020049175,0.0008298969],"domain_scores_gemma":[0.99197644,0.003909905,0.002064938,0.0007774411,0.0011471424,0.0001241564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.021062862,0.0004560487,0.001078399,0.0036733446,0.0004767649,0.0009885881,0.001954401,0.00017759357,0.000046718036],"category_scores_gemma":[0.006966693,0.0003444052,0.000751591,0.002978456,0.00018873192,0.0004735635,0.0005107834,0.00071751303,0.0000137499455],"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.0025522064,0.0007461498,0.0014683567,0.0015840875,0.0025293392,0.00047192283,0.006620972,0.022062661,0.0031363114,0.06702915,0.07240862,0.81939024],"study_design_scores_gemma":[0.0096271355,0.001460496,0.0003088556,0.0024289628,0.0012002378,0.0005157809,0.049294993,0.11732134,0.001738015,0.05521747,0.7596502,0.0012365151],"about_ca_topic_score_codex":0.000024495544,"about_ca_topic_score_gemma":0.0000074987984,"teacher_disagreement_score":0.81815374,"about_ca_system_score_codex":0.00026688515,"about_ca_system_score_gemma":0.00093987683,"threshold_uncertainty_score":0.9999008},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08444046,0.0001096953,0.9041755,0.00041341168,0.000058139813,0.0015319734,0.00001904255,0.00018367631,0.009068085],"genre_scores_gemma":[0.5896408,5.7068183e-7,0.4097319,0.00015290186,0.00005996676,0.000026329799,0.0000053325557,0.000018773919,0.00036345003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962616,0.00021283799,0.0012886478,0.0009062692,0.00074564386,0.00058501767],"domain_scores_gemma":[0.99069613,0.007682777,0.00048458026,0.0004507073,0.00058454886,0.00010124016],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0058167423,0.00032141214,0.00064221513,0.0007230072,0.00067381235,0.00060749135,0.0004993098,0.00019156626,0.000005296593],"category_scores_gemma":[0.013343142,0.00026682822,0.00019845135,0.0011417792,0.00024050563,0.00022342204,0.00036487862,0.0003518489,0.0000060524844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042052768,0.00022582285,0.0038616655,0.00065618806,0.00036662482,0.00000954225,0.021167593,0.3645039,0.00226026,0.31731075,0.00072668,0.28849047],"study_design_scores_gemma":[0.0007915452,0.00004467612,0.000047062535,0.00018972607,0.00006109233,0.00001826211,0.002226852,0.8242817,0.00019193145,0.17170213,0.00022642355,0.00021858301],"about_ca_topic_score_codex":0.000005932453,"about_ca_topic_score_gemma":0.000003650365,"teacher_disagreement_score":0.5052003,"about_ca_system_score_codex":0.00007557993,"about_ca_system_score_gemma":0.00046098157,"threshold_uncertainty_score":0.99997836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5877736,0.00042136322,0.4086948,0.00017259775,0.0006427793,0.00091456063,0.000011359083,0.0001015615,0.0012673846],"genre_scores_gemma":[0.9421784,0.00017584297,0.05702173,0.000100550016,0.00022528337,0.000032363023,0.000007800665,0.00006116334,0.00019681247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99249053,0.00024911432,0.002137017,0.0024082111,0.001569521,0.0011456027],"domain_scores_gemma":[0.9962519,0.00042244574,0.0010614143,0.00047911427,0.0014952582,0.0002898608],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038790784,0.0009072115,0.0012420389,0.0036531852,0.0012879345,0.0021922404,0.00060978945,0.00086076214,0.00008429295],"category_scores_gemma":[0.0022975246,0.00097612746,0.00030860404,0.0044766865,0.0006251384,0.003989866,0.00048793704,0.0012156719,0.0000068962945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033583704,0.000058067595,0.04542244,0.00026022882,0.00007344076,0.000008594239,0.0014808531,0.90117276,0.006611028,0.0006882339,0.000002981627,0.04388553],"study_design_scores_gemma":[0.0019211866,0.00008347992,0.0003993477,0.0011598569,0.00018608569,0.000055291228,0.011773733,0.97998506,0.0022507203,0.0012728998,0.00009488844,0.00081744057],"about_ca_topic_score_codex":0.0003945136,"about_ca_topic_score_gemma":0.000042499116,"teacher_disagreement_score":0.35440487,"about_ca_system_score_codex":0.0011938702,"about_ca_system_score_gemma":0.0010270152,"threshold_uncertainty_score":0.9992689},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13176428,0.016588643,0.8463194,0.0006708859,0.00034344554,0.000966661,0.00000534915,0.0000622124,0.0032791153],"genre_scores_gemma":[0.9334632,0.008478793,0.053969134,0.00013659589,0.00067025656,0.000020212809,0.00001586177,0.00009227147,0.003153633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9837041,0.0022674233,0.0034353577,0.002521672,0.002823175,0.0052482793],"domain_scores_gemma":[0.99082536,0.0034752544,0.003098131,0.0008687365,0.0010857515,0.0006467867],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.030291375,0.001345478,0.0017437501,0.0021727695,0.0026168202,0.0046374276,0.0015032183,0.0009917102,0.00006242883],"category_scores_gemma":[0.0072604083,0.0012843889,0.0005843634,0.0014938487,0.0006396735,0.0015718475,0.0026237322,0.015656622,0.000014245289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005403297,0.0000347912,0.002001211,0.000058496353,0.00091109046,0.00001455534,0.005013795,0.5479933,0.0002840591,0.015157096,0.0000012880508,0.42799],"study_design_scores_gemma":[0.0017833343,0.0007180505,0.00011234881,0.0012146264,0.000504846,0.0025577652,0.07594003,0.828601,0.00010781977,0.08603913,0.001222163,0.0011988647],"about_ca_topic_score_codex":0.00021267693,"about_ca_topic_score_gemma":0.00011055675,"teacher_disagreement_score":0.801699,"about_ca_system_score_codex":0.0031103066,"about_ca_system_score_gemma":0.0099345045,"threshold_uncertainty_score":0.9999296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4994295,0.00009171899,0.49746156,0.00017141475,0.0006092883,0.0007991794,0.000016264537,0.00017997147,0.0012411186],"genre_scores_gemma":[0.926281,0.00001284742,0.0730647,0.0002652316,0.00019361396,0.000034721787,0.000045047967,0.000042909985,0.000059974398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616313,0.00019730037,0.0011792941,0.0010584511,0.00073797966,0.00066382583],"domain_scores_gemma":[0.9979495,0.0007955528,0.0003432675,0.00058390095,0.00011977472,0.00020800706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009335363,0.00060433144,0.0008028217,0.0013973158,0.0002252418,0.0005036455,0.00061783305,0.0004536702,0.00043686098],"category_scores_gemma":[0.0005035198,0.0005544934,0.00011838041,0.0013128462,0.00031771197,0.0005747711,0.00042187845,0.0008797525,0.000020279507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042709216,0.000016023629,0.0042797965,0.000032342883,0.000062619816,0.00001661426,0.0006677454,0.95488644,0.005241504,0.0005256674,0.00026420978,0.033964306],"study_design_scores_gemma":[0.0020117625,0.000107027605,0.049550593,0.00035194145,0.000028779617,0.0001249341,0.00042774907,0.9436593,0.0008616211,0.0018617052,0.00044774334,0.0005668137],"about_ca_topic_score_codex":0.0000040118935,"about_ca_topic_score_gemma":7.299423e-7,"teacher_disagreement_score":0.42685145,"about_ca_system_score_codex":0.00025392132,"about_ca_system_score_gemma":0.00020921811,"threshold_uncertainty_score":0.99969065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37737408,0.0011704044,0.61279464,0.0017220651,0.00045228525,0.0033389647,0.00002754046,0.00011398798,0.0030060296],"genre_scores_gemma":[0.81745297,0.00023331218,0.18092623,0.00029777162,0.000025360916,0.00028284863,0.00003056793,0.00004673225,0.0007042311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98902506,0.0016608612,0.004354968,0.002290638,0.00169881,0.00096965715],"domain_scores_gemma":[0.98620117,0.008404464,0.0019308467,0.0020076323,0.0012764655,0.00017939777],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007389577,0.0008410943,0.001828369,0.0034246054,0.00042419968,0.00045851344,0.0020277621,0.0012040277,0.00017560304],"category_scores_gemma":[0.016127678,0.00078244356,0.00056438526,0.009475876,0.0009442062,0.000929443,0.00038059463,0.0014748898,0.000072068615],"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.002693405,0.003511549,0.026329855,0.00045499793,0.00074652437,0.000016239215,0.030425344,0.01989614,0.08113739,0.08867016,0.00002716361,0.74609125],"study_design_scores_gemma":[0.005687756,0.00018954684,0.013036467,0.0017881147,0.00016031861,0.0000073852007,0.053840723,0.8976321,0.014948541,0.011620234,0.00028873896,0.0008000225],"about_ca_topic_score_codex":0.0022178986,"about_ca_topic_score_gemma":0.0015491862,"teacher_disagreement_score":0.87773603,"about_ca_system_score_codex":0.0007352937,"about_ca_system_score_gemma":0.0021634572,"threshold_uncertainty_score":0.99946266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17965454,0.0025501996,0.73736334,0.05165296,0.0039759,0.0131912995,0.0000253925,0.00027983915,0.0113065215],"genre_scores_gemma":[0.16837066,0.00013811643,0.813919,0.0012184399,0.00090341456,0.00009117021,0.000003545241,0.00005200227,0.015303619],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944108,0.0008048634,0.001930214,0.000840672,0.0014375737,0.00057587645],"domain_scores_gemma":[0.9963683,0.0006698968,0.0010651447,0.0008319825,0.0009323755,0.00013229996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010063741,0.00039992874,0.0006833589,0.0022577199,0.00044735117,0.00083989557,0.0013703023,0.0001347774,0.000042429558],"category_scores_gemma":[0.0049148686,0.00024675392,0.00024634952,0.0033927811,0.00024341191,0.00039616437,0.00069071376,0.0006918406,0.000042651016],"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.0035197851,0.0025213417,0.008287675,0.00063728093,0.002754359,0.0004092771,0.028450174,0.037641533,0.011217551,0.0058070035,0.12726803,0.771486],"study_design_scores_gemma":[0.009846804,0.0010868212,0.0034840778,0.0008056313,0.00052805606,0.00040437217,0.061669417,0.06269424,0.0015252995,0.00038719538,0.856655,0.00091309304],"about_ca_topic_score_codex":0.000040258095,"about_ca_topic_score_gemma":0.000058456928,"teacher_disagreement_score":0.7705729,"about_ca_system_score_codex":0.0002051237,"about_ca_system_score_gemma":0.0003210416,"threshold_uncertainty_score":0.99999845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18937114,0.0034827853,0.8005256,0.002765898,0.00030333313,0.0015313332,0.000015516465,0.0013452163,0.00065916876],"genre_scores_gemma":[0.8706636,0.00008199659,0.12614948,0.00040542893,0.000391702,0.0010254274,0.000017053233,0.000113552924,0.0011517925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994445,0.00039158037,0.0011239736,0.0013598476,0.0013741784,0.0013054037],"domain_scores_gemma":[0.9950651,0.0028480082,0.0003893514,0.00087791134,0.000401238,0.0004183699],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005699729,0.00055697013,0.0006420019,0.0012967015,0.0007379698,0.0028320705,0.0014045825,0.000385651,0.00006884055],"category_scores_gemma":[0.0023651063,0.00040902745,0.00041893905,0.0029029893,0.00031964527,0.0010799787,0.0002552392,0.0012232553,0.000019923767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001555721,0.000047779402,0.03249319,0.000061553874,0.00009279295,0.000050907125,0.000998573,0.8441467,0.0010521797,0.0065195668,0.0004691249,0.113912],"study_design_scores_gemma":[0.0003536057,0.0005506293,0.001380442,0.0002604127,0.000055022367,0.0002640157,0.0011232941,0.9845581,0.00078843936,0.0073992205,0.0027136528,0.0005531495],"about_ca_topic_score_codex":0.0006567493,"about_ca_topic_score_gemma":0.0010857299,"teacher_disagreement_score":0.6812924,"about_ca_system_score_codex":0.00018770626,"about_ca_system_score_gemma":0.0003480725,"threshold_uncertainty_score":0.99983615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85008645,0.00045241852,0.12939568,0.0009149711,0.0007560254,0.0014803361,0.0008569161,0.00038852033,0.015668688],"genre_scores_gemma":[0.9532938,0.000024476296,0.04448489,0.0005933753,0.00019334613,0.00006993625,0.00008269641,0.00007296882,0.0011844813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951026,0.00008576239,0.0016760136,0.00062736444,0.0016462306,0.0008620193],"domain_scores_gemma":[0.9963326,0.0017103546,0.00038774087,0.0007518356,0.000461997,0.0003555064],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002767213,0.00051948224,0.0006630492,0.0007996129,0.00045976826,0.0020277544,0.00081566273,0.00025989398,0.00021886583],"category_scores_gemma":[0.0011428152,0.00035445872,0.00025447342,0.0010427138,0.0004674301,0.0024114568,0.0003659421,0.00072432635,0.0003440857],"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.002744912,0.00067646295,0.09806982,0.0032589214,0.0029065493,0.0003651594,0.240678,0.01982963,0.0010235673,0.07511989,0.017837463,0.53748965],"study_design_scores_gemma":[0.0038169557,0.00075369945,0.0019055152,0.0011526,0.00016733224,0.000641775,0.019143423,0.7882156,0.0013591646,0.0070067984,0.17438725,0.0014498889],"about_ca_topic_score_codex":0.000018663175,"about_ca_topic_score_gemma":0.000017738543,"teacher_disagreement_score":0.76838595,"about_ca_system_score_codex":0.00011909912,"about_ca_system_score_gemma":0.00024311332,"threshold_uncertainty_score":0.99989074},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65166074,0.000099386845,0.26856765,0.0012172168,0.0018084893,0.010726803,0.0017560265,0.0008412248,0.063322455],"genre_scores_gemma":[0.7105038,0.0000020271787,0.28471643,0.0016795383,0.0002366814,0.0017774414,0.00032460265,0.000098416705,0.0006610199],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9894607,0.00037771434,0.0034393815,0.0010809094,0.0037402352,0.0019010815],"domain_scores_gemma":[0.99455804,0.0011467129,0.0012607937,0.0017425045,0.0007351348,0.0005568393],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010631741,0.0007668986,0.0011108277,0.0017894917,0.0018723699,0.0019689526,0.0034007868,0.00026084017,0.0002066452],"category_scores_gemma":[0.0037101419,0.00066609576,0.0007166619,0.0030131617,0.00036399715,0.0012838749,0.0019276987,0.001550355,0.00024695354],"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.0026540132,0.0036510108,0.038109608,0.0013725187,0.0011507345,0.00008400716,0.26003644,0.06151406,0.00063007756,0.059171528,0.014904907,0.5567211],"study_design_scores_gemma":[0.0061422875,0.0014082686,0.00038189904,0.00018201188,0.00012321165,0.0011174704,0.19918832,0.17795125,0.0004540192,0.002351642,0.6083327,0.002366899],"about_ca_topic_score_codex":0.000045629255,"about_ca_topic_score_gemma":0.000010320905,"teacher_disagreement_score":0.59342784,"about_ca_system_score_codex":0.00049983326,"about_ca_system_score_gemma":0.0006609384,"threshold_uncertainty_score":0.999579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20614053,0.00018201556,0.06910026,0.0071507064,0.0008042242,0.0011315986,0.00007081291,0.0017513683,0.71366847],"genre_scores_gemma":[0.98611206,0.000017034256,0.002850639,0.00027428122,0.0002189856,7.5565445e-8,0.00018912039,0.00056327606,0.00977454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966851,0.0006755602,0.0005089862,0.0007943335,0.0009414606,0.00039457995],"domain_scores_gemma":[0.9973501,0.00015200983,0.00016209902,0.0009961554,0.0012053886,0.00013422358],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004358117,0.0001463876,0.00019462038,0.00077341055,0.0026381568,0.0019267921,0.0018812347,0.000079247424,0.01150494],"category_scores_gemma":[0.012590549,0.0001347843,0.000080737234,0.002434313,0.00026428438,0.00044302008,0.0012983653,0.00032926194,0.011888126],"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.0000989244,0.0001644486,0.000061579914,0.00003130322,0.000052692154,0.000008335259,0.0018318784,0.00057225395,0.021386966,0.029689232,0.34935263,0.5967498],"study_design_scores_gemma":[0.00028518905,0.00006415297,0.00071024604,0.000026960151,0.00000861143,0.00005057133,0.0012432605,0.00070268824,0.0040874938,0.0039047913,0.9887771,0.00013890548],"about_ca_topic_score_codex":0.000017675393,"about_ca_topic_score_gemma":4.995689e-7,"teacher_disagreement_score":0.77997154,"about_ca_system_score_codex":0.00012707288,"about_ca_system_score_gemma":0.00001273362,"threshold_uncertainty_score":0.9991093},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011949965,0.000019218154,0.000042885134,0.00026286833,0.0012729687,0.0005843096,0.9958027,0.00007396585,0.000746085],"genre_scores_gemma":[0.00005999034,0.000018670977,0.000008618518,0.0007328384,0.0000032146497,0.0000028548397,0.99917287,1.9949471e-8,9.0868195e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99443585,0.00028950733,0.0012455342,0.0006132232,0.0028995927,0.00051630253],"domain_scores_gemma":[0.99562407,0.00035875756,0.0010841321,0.001718264,0.0009421817,0.0002725896],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027682038,0.00044999566,0.0006454774,0.00038855636,0.00037140257,0.001019065,0.0026049172,0.0006378702,0.0075690625],"category_scores_gemma":[0.0042934376,0.00038753476,0.00039360917,0.0012313367,0.0003527223,0.0021030658,0.0009978688,0.00060850044,0.70374244],"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.0000620959,0.000021727657,0.0029946372,0.000047097223,0.000024843635,0.0000024964463,0.00009029818,0.00010140129,4.7071094e-8,1.2122817e-7,0.9918199,0.004835343],"study_design_scores_gemma":[0.0003969952,0.000042216852,0.00012800454,0.0000035629114,0.000034645152,0.00001202354,0.00065748754,0.0000021961173,0.0000023079492,0.0000062121953,0.9983135,0.00040084706],"about_ca_topic_score_codex":0.00023465365,"about_ca_topic_score_gemma":0.000010279931,"teacher_disagreement_score":0.69617337,"about_ca_system_score_codex":0.00035570102,"about_ca_system_score_gemma":0.00047088106,"threshold_uncertainty_score":0.99985766},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000861715,0.0005139151,0.001621696,0.0006541784,0.0007227977,0.0011027158,0.99428403,0.000101020945,0.00013794827],"genre_scores_gemma":[0.00010054238,0.0027937202,0.0059222877,0.00052375864,0.0019233677,0.000091932656,0.98831767,0.000058860136,0.00026786656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99315065,0.00069033046,0.0013004119,0.002448878,0.00162443,0.0007852798],"domain_scores_gemma":[0.9739017,0.017104473,0.0007001831,0.007891486,0.0001761261,0.00022602144],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.010602824,0.0005835841,0.000759499,0.0002792725,0.0013998064,0.0021265976,0.017491916,0.00025783814,0.00004037872],"category_scores_gemma":[0.0008301839,0.0003669041,0.000102594786,0.0007414431,0.00040588906,0.0009621791,0.010925075,0.0008176268,0.00024817517],"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.000113926166,0.000006182421,0.00013624177,0.00015921949,0.00020118534,0.000014607016,0.0003422824,0.001021592,0.000012528352,0.000025836162,0.98983043,0.008135993],"study_design_scores_gemma":[0.00027747088,0.000034338354,0.0003087969,0.00026374808,0.00017074874,0.00002603649,0.0009017266,0.3497413,3.281377e-7,0.0003213344,0.64762294,0.0003312131],"about_ca_topic_score_codex":0.0068583386,"about_ca_topic_score_gemma":0.009944167,"teacher_disagreement_score":0.34871972,"about_ca_system_score_codex":0.00002204862,"about_ca_system_score_gemma":0.00038320897,"threshold_uncertainty_score":0.9999002},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8830436,0.000051778643,0.001693825,0.00018991622,0.00039964958,0.00065688614,0.000072086616,0.000121862206,0.113770396],"genre_scores_gemma":[0.99851096,5.9041247e-7,0.00056026765,0.00026594577,0.000112562804,0.00005387121,0.000019585279,0.00003263632,0.00044358146],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99283695,0.0006183223,0.0011849859,0.0008782873,0.003959103,0.00052232365],"domain_scores_gemma":[0.9957468,0.0019690888,0.00035355292,0.00080025045,0.0008588836,0.0002714532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00406532,0.00035888085,0.00049711834,0.0006398648,0.00043240856,0.0019121971,0.0011137663,0.000120621204,0.00034357808],"category_scores_gemma":[0.0054873046,0.0002952101,0.00020636676,0.0019080664,0.00022763081,0.0010510385,0.00029607536,0.00032518277,0.000694239],"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.000098721895,0.0048672883,0.9060539,0.00001202323,0.00025174243,0.005788048,0.0031123182,0.0011695075,0.00019942316,0.049573988,0.003322938,0.025550075],"study_design_scores_gemma":[0.02263368,0.0022571222,0.49799776,0.00029487192,0.00029846575,0.04091429,0.19283977,0.0034115177,0.0024083015,0.08639064,0.14430235,0.006251235],"about_ca_topic_score_codex":0.00008354677,"about_ca_topic_score_gemma":0.00012601622,"teacher_disagreement_score":0.40805617,"about_ca_system_score_codex":0.00013828467,"about_ca_system_score_gemma":0.00023060276,"threshold_uncertainty_score":0.99995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49381906,0.0008616686,0.47605482,0.0028449409,0.00058669824,0.0054484187,0.00058571954,0.0007265098,0.01907216],"genre_scores_gemma":[0.8464771,0.000016990296,0.15240072,0.00017290494,0.00015528558,0.00008290116,0.00003734006,0.00008533335,0.00057141023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405974,0.00048008733,0.0010241265,0.0017105084,0.0013941561,0.0013313624],"domain_scores_gemma":[0.9945782,0.0035293817,0.00039608413,0.0006954736,0.0004551477,0.00034570202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040469696,0.00059891253,0.00089575665,0.0020571775,0.0004355839,0.0009837551,0.0011177188,0.0004255594,0.00012161599],"category_scores_gemma":[0.0020509346,0.00052276754,0.00031551172,0.0028457497,0.0011021541,0.0006605492,0.00022592541,0.0008106696,0.00005219331],"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.0026115493,0.0007133971,0.019009735,0.0008550642,0.0010486142,0.0053512338,0.06666783,0.06571125,0.024914369,0.008593942,0.002118813,0.8024042],"study_design_scores_gemma":[0.0067132185,0.0007175247,0.00073445414,0.0017530911,0.00013392913,0.00094148016,0.058385007,0.9098761,0.0009988213,0.00051298056,0.017947942,0.0012854642],"about_ca_topic_score_codex":0.0006702849,"about_ca_topic_score_gemma":0.0015735361,"teacher_disagreement_score":0.84416485,"about_ca_system_score_codex":0.00076598127,"about_ca_system_score_gemma":0.0020400435,"threshold_uncertainty_score":0.99972236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18711062,0.0006115783,0.6934029,0.0006482521,0.0015429361,0.0048037576,0.0011090612,0.00023630042,0.11053462],"genre_scores_gemma":[0.76684684,0.00003089986,0.045525815,0.00009414879,0.00038291715,0.00001459302,0.00019663302,0.00010298096,0.1868052],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962082,0.00030566717,0.0008416833,0.00111848,0.0010009574,0.00052502315],"domain_scores_gemma":[0.9942064,0.0026796996,0.0013117788,0.0006025922,0.0009838871,0.00021560151],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010392574,0.0005139736,0.0010242304,0.00076840125,0.0003364106,0.00017161595,0.0010453273,0.0007667558,0.009473842],"category_scores_gemma":[0.0019629002,0.00042450847,0.00038887814,0.0009715218,0.00021249733,0.0003810534,0.00011757814,0.0004749418,0.000028990262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00675502,0.0001420528,0.022455625,0.0008478766,0.0006115996,0.000087236585,0.007630358,0.0010283961,0.0007025975,0.012941824,0.00016923175,0.94662815],"study_design_scores_gemma":[0.028942565,0.0030418255,0.0024157253,0.011023641,0.0021783682,0.00005087863,0.22609892,0.07409984,0.009012378,0.063499495,0.57332575,0.006310629],"about_ca_topic_score_codex":0.000107712396,"about_ca_topic_score_gemma":0.0004540448,"teacher_disagreement_score":0.9403176,"about_ca_system_score_codex":0.00011130633,"about_ca_system_score_gemma":0.0005739465,"threshold_uncertainty_score":0.99982065},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76551765,0.0009319623,0.19372004,0.00095838413,0.00069417345,0.0022615085,0.000056262354,0.00009387142,0.035766166],"genre_scores_gemma":[0.26889086,0.00015485764,0.65637296,0.00026282275,0.00023308561,0.000005366947,0.0012381892,0.0001307618,0.0727111],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9977725,0.00015298754,0.00052643794,0.0007639195,0.0004486517,0.00033550212],"domain_scores_gemma":[0.9916899,0.0070000547,0.00065112143,0.00042535402,0.000117902375,0.000115629795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004844074,0.0002735098,0.0006361062,0.0014022612,0.00028729954,0.000120496465,0.0007084556,0.00049326353,0.00014876529],"category_scores_gemma":[0.0043216124,0.00030771233,0.00017051514,0.0011272425,0.00018329096,0.00064359984,0.0001407254,0.00051544444,0.000009974418],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016503919,0.0006739919,0.030480443,0.0028673832,0.0008849095,0.00026486965,0.1881701,0.081272885,0.0012870685,0.17077672,0.007571051,0.49924666],"study_design_scores_gemma":[0.009691181,0.0008580922,0.008582734,0.027721405,0.0006969772,0.0001048355,0.32490036,0.3184465,0.0016078991,0.2852438,0.018649472,0.003496727],"about_ca_topic_score_codex":0.00020985687,"about_ca_topic_score_gemma":0.00021970524,"teacher_disagreement_score":0.49662676,"about_ca_system_score_codex":0.000044907858,"about_ca_system_score_gemma":0.00063542393,"threshold_uncertainty_score":0.9999375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98973787,0.0005229289,0.00016375037,0.00006028398,0.00061633176,0.0010415136,0.002831867,0.00012135578,0.004904112],"genre_scores_gemma":[0.98729503,0.00013338005,0.010845648,0.00010702889,0.000038393257,0.0000643728,0.0011449943,0.000059807946,0.0003113159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99409276,0.0006832921,0.0020970653,0.0015056875,0.0010359652,0.000585203],"domain_scores_gemma":[0.9930857,0.0034254964,0.0016546573,0.0006753176,0.0008675306,0.000291298],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025596763,0.0007778243,0.0011794198,0.00089087506,0.0020306406,0.0007436061,0.00048036824,0.0008630134,0.00006561697],"category_scores_gemma":[0.008867542,0.00074719253,0.00022810073,0.00087527756,0.000334662,0.0011904152,0.00020121227,0.0015817943,0.0000030766184],"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.00045246363,0.00019598036,0.0034173348,0.0010835109,0.00096957246,0.00006462779,0.0011337802,0.3366562,0.053730473,0.5054717,0.0000512305,0.09677309],"study_design_scores_gemma":[0.004973253,0.00043934232,0.014887701,0.0050501167,0.0014862271,0.00080341403,0.046386644,0.087141,0.27321208,0.5570478,0.003486313,0.005086126],"about_ca_topic_score_codex":0.0004992834,"about_ca_topic_score_gemma":0.0021962633,"teacher_disagreement_score":0.24951522,"about_ca_system_score_codex":0.0006294773,"about_ca_system_score_gemma":0.00026928657,"threshold_uncertainty_score":0.9994979},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5157246,0.000055885284,0.48342136,0.0003670343,0.00014249039,0.00018376144,0.0000033292126,0.000020148276,0.00008139006],"genre_scores_gemma":[0.8669749,0.0000062347467,0.13260654,0.00033883218,0.000039245104,0.0000032522405,2.7322793e-7,0.0000037571695,0.000026961914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973991,0.000081359634,0.00048863766,0.00080406637,0.00086460845,0.00036225817],"domain_scores_gemma":[0.9970498,0.0016682701,0.00015170882,0.0004363167,0.00048988854,0.00020403165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022886512,0.00014821571,0.00024222845,0.0006404155,0.00050483574,0.0007113639,0.00053657213,0.000040519917,0.0000051613624],"category_scores_gemma":[0.0016346226,0.0001218416,0.00003714051,0.0030163538,0.0011210638,0.00096155086,0.0005257703,0.00013157248,0.0000031698728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004978865,0.000070280854,0.07826493,0.000042436357,0.00001451384,0.0000022080876,0.0032217463,0.82152104,0.002678662,0.041605756,0.00034229681,0.052186362],"study_design_scores_gemma":[0.00026192822,0.000110164285,0.08492395,0.00011874568,0.0000142058425,0.000013666169,0.00035733625,0.8258256,0.0012373484,0.08672196,0.00017773263,0.00023741169],"about_ca_topic_score_codex":0.0000146932125,"about_ca_topic_score_gemma":0.000021420425,"teacher_disagreement_score":0.3512503,"about_ca_system_score_codex":0.000038532915,"about_ca_system_score_gemma":0.00024248194,"threshold_uncertainty_score":0.6859698},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43353572,0.0008757781,0.4420306,0.009061902,0.0048872773,0.008524553,0.00008190908,0.0010134574,0.099988796],"genre_scores_gemma":[0.6689359,0.000116592615,0.32023934,0.0008674316,0.00008480375,0.00030824295,0.00001655828,0.00003796839,0.0093931435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915615,0.00061875186,0.0031823474,0.0019829625,0.0012853292,0.0013691075],"domain_scores_gemma":[0.99509054,0.0024324304,0.0005962296,0.0011832744,0.00048357435,0.00021397498],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0070835836,0.00069209066,0.0011373498,0.0034493501,0.00047512093,0.0013657354,0.0014098234,0.0005155053,0.0017725384],"category_scores_gemma":[0.0017991827,0.00062909245,0.00046485336,0.004560642,0.0005504776,0.0006240393,0.00061476027,0.000510747,0.00023448208],"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.0020427564,0.00043752417,0.022829788,0.0006608426,0.0006945489,0.00009688279,0.0027033892,0.017227972,0.0020957016,0.11696359,0.0019401602,0.83230686],"study_design_scores_gemma":[0.008985565,0.00012184378,0.0031182547,0.00090294715,0.00015973089,0.000028156452,0.03468124,0.9234532,0.0022868116,0.01655797,0.008924395,0.0007798495],"about_ca_topic_score_codex":0.00007171564,"about_ca_topic_score_gemma":0.000055484208,"teacher_disagreement_score":0.90622526,"about_ca_system_score_codex":0.0003420617,"about_ca_system_score_gemma":0.00046150121,"threshold_uncertainty_score":0.9996709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4113254,0.0015750873,0.5672431,0.0036809796,0.004479886,0.002539759,0.000012519563,0.00013530282,0.00900798],"genre_scores_gemma":[0.6588397,0.00023965191,0.33807495,0.00021220835,0.00031566274,0.00011410056,0.000016617121,0.00003294708,0.0021541733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927994,0.0004948934,0.0026728727,0.0020503965,0.0010587565,0.00092369516],"domain_scores_gemma":[0.9949433,0.0018196885,0.00078115234,0.0009792312,0.0013276474,0.0001489751],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007397236,0.00053727085,0.00083659077,0.0031064628,0.00070020574,0.0011700119,0.00070701935,0.0005441106,0.0002247874],"category_scores_gemma":[0.015269102,0.0005350485,0.0003173861,0.0064422097,0.00048564665,0.0014435372,0.0002614703,0.00059499545,0.00005080347],"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.0006066902,0.00018639224,0.037235692,0.00019088492,0.000097851385,0.000004085736,0.0037313031,0.31382844,0.011176167,0.018661844,0.00016530853,0.61411536],"study_design_scores_gemma":[0.002678735,0.00012452072,0.0011692845,0.001124621,0.00013812569,0.00003777329,0.016033996,0.9328122,0.028853638,0.012062979,0.0041830447,0.0007810528],"about_ca_topic_score_codex":0.000076918885,"about_ca_topic_score_gemma":0.00019519682,"teacher_disagreement_score":0.6189838,"about_ca_system_score_codex":0.00047501057,"about_ca_system_score_gemma":0.0011655211,"threshold_uncertainty_score":0.99986684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296319,0.0002650666,0.17395706,0.017821448,0.0012294375,0.0017321792,0.00011949022,0.00038647852,0.07485693],"genre_scores_gemma":[0.9491633,0.0000018994549,0.046131924,0.000418696,0.00030493402,0.00007119207,0.000020805464,0.00002842459,0.0038587828],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974374,0.00021933275,0.0005594731,0.0005240409,0.00089267374,0.00036707433],"domain_scores_gemma":[0.99675286,0.0015900733,0.00019783864,0.00072196306,0.00045721192,0.00028006596],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0041775363,0.00015777566,0.00025268734,0.00026329237,0.00016389202,0.00035176842,0.00074703683,0.00011010376,0.00010352025],"category_scores_gemma":[0.012097542,0.0001254106,0.00012441761,0.0005704461,0.00013065184,0.0002447661,0.000118706994,0.00013160483,0.00045741975],"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.00089483394,0.000430102,0.021370374,0.00003716535,0.000118473625,0.00004182466,0.029990232,0.005649558,0.04420382,0.019445855,0.514216,0.36360174],"study_design_scores_gemma":[0.0015878647,0.00020188274,0.0012849018,0.000028751003,0.000029636234,0.00003631644,0.008405325,0.037138145,0.0056125163,0.014609668,0.9306561,0.00040890888],"about_ca_topic_score_codex":0.00003262531,"about_ca_topic_score_gemma":0.00002812802,"teacher_disagreement_score":0.41644007,"about_ca_system_score_codex":0.00006030356,"about_ca_system_score_gemma":0.0001766873,"threshold_uncertainty_score":0.996224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8980935,0.009590159,0.064963415,0.009711814,0.0020336655,0.0055694617,0.00040881187,0.0014403706,0.008188788],"genre_scores_gemma":[0.941404,0.0010871297,0.04476687,0.005521817,0.0019499647,0.00093570945,0.00073978683,0.0003343479,0.0032603624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97554713,0.0021452308,0.00663149,0.0025375048,0.009930267,0.003208393],"domain_scores_gemma":[0.9813248,0.008461682,0.0026849983,0.0029390177,0.0020723308,0.0025171859],"candidate_categories":["metaresearch","metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.020873634,0.0017033238,0.0027340264,0.0018894118,0.0031439238,0.000924826,0.004847705,0.0015059871,0.0041959924],"category_scores_gemma":[0.050638687,0.001323774,0.001290387,0.004027718,0.0020905107,0.0016846962,0.0015325656,0.004620572,0.0012266198],"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.007604474,0.002868678,0.081878826,0.0043472126,0.0027410698,0.0061470144,0.1387231,0.038357746,0.025818726,0.005326708,0.17093877,0.51524764],"study_design_scores_gemma":[0.017974323,0.001173081,0.0065285075,0.0072021894,0.00055183517,0.0062831207,0.046032973,0.33777767,0.0010891751,0.0026030047,0.56679577,0.0059883236],"about_ca_topic_score_codex":0.0000896205,"about_ca_topic_score_gemma":0.000053988333,"teacher_disagreement_score":0.50925934,"about_ca_system_score_codex":0.00092930684,"about_ca_system_score_gemma":0.003511459,"threshold_uncertainty_score":0.99979025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83039254,0.0004266868,0.0019575788,0.000040970317,0.001539181,0.0020718887,0.00003670912,0.0001950954,0.16333935],"genre_scores_gemma":[0.9135992,0.00022069752,0.0036853792,0.000007946902,0.00036339948,0.000024647978,0.00007590143,0.00013980301,0.08188303],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9865952,0.002837327,0.0012931481,0.0028533405,0.004815677,0.0016053162],"domain_scores_gemma":[0.9912976,0.00380036,0.0010363447,0.002337762,0.0008756878,0.0006522429],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004713305,0.0008352819,0.0012346307,0.0057188305,0.0021488788,0.00084247586,0.0033985842,0.001048444,0.0006036514],"category_scores_gemma":[0.0026208158,0.0007899841,0.0007060443,0.0027638767,0.0009139891,0.0009373526,0.0011108628,0.0032924823,0.00072457176],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.034292288,0.005881921,0.41708368,0.0011333145,0.0040818583,0.030722423,0.0579563,0.0024065445,0.23335513,0.012982707,0.01583967,0.18426417],"study_design_scores_gemma":[0.010327793,0.0029968454,0.20156422,0.0030940543,0.0005285195,0.00050599896,0.14873967,0.007506721,0.38981992,0.010967444,0.21813764,0.0058111907],"about_ca_topic_score_codex":0.00849009,"about_ca_topic_score_gemma":0.0064840084,"teacher_disagreement_score":0.21551944,"about_ca_system_score_codex":0.0013042537,"about_ca_system_score_gemma":0.0026641476,"threshold_uncertainty_score":0.9994551},"labels":[],"label_agreement":null}]}