{"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,"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","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005559107,0.0001526891,0.000363585,0.0002415035,0.000139149,0.0001378714,0.0006841843,0.0001252973,0.009014267],"category_scores_gemma":[0.002501454,0.00008539775,0.0001475867,0.001104085,0.000414104,0.0001294479,0.0002017845,0.0003068654,0.0005588068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002953434,"about_ca_system_score_gemma":0.00002866458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003987252,"about_ca_topic_score_gemma":0.00001028202,"domain_scores_codex":[0.9966297,0.0007140437,0.0008917841,0.0003877344,0.0009415324,0.0004352106],"domain_scores_gemma":[0.9960316,0.00308752,0.0002213511,0.000498011,0.0001109432,0.00005055979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001062042,0.002264943,0.1711905,0.00004057235,0.0002794815,0.0001409517,0.04522478,0.0794444,0.0206954,0.3281022,0.1417427,0.2098119],"study_design_scores_gemma":[0.0004614203,0.00004892087,0.002455796,0.00001792369,0.000005690096,0.00001688565,0.0004682805,0.9946945,0.000120702,0.000631349,0.0009588448,0.0001196724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8490468,0.00008468171,0.01603458,0.00150088,0.00009458198,0.0007561408,0.00001257299,0.00007088014,0.1323989],"genre_scores_gemma":[0.9967236,0.000001374611,0.001831139,0.0002815397,0.0001297927,0.000007721604,0.000002929999,0.00001240196,0.001009484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9152501,"threshold_uncertainty_score":0.9918916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06570568339862448,"score_gpt":0.351189822817973,"score_spread":0.2854841394193485,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}