{"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,"ca_institutions":"McMaster University","funders":"","keywords":"Duration (music); Time complexity; Computer science; Polynomial; Mathematical optimization; Computational complexity theory; Mathematics; Algorithm","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.00553969,0.0001713791,0.0003864326,0.0002658649,0.0002048021,0.0002262975,0.000674603,0.0001311018,0.003968552],"category_scores_gemma":[0.002292337,0.00009702615,0.0001265549,0.001355207,0.000448489,0.0002059416,0.0001899702,0.0003375078,0.0002478514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003484826,"about_ca_system_score_gemma":0.00004963041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002524854,"about_ca_topic_score_gemma":0.000007801515,"domain_scores_codex":[0.9965047,0.0006000814,0.0009689478,0.0004337468,0.00101525,0.0004773163],"domain_scores_gemma":[0.9971689,0.001920373,0.0002967705,0.0004068747,0.0001550633,0.00005202488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009065982,0.00200724,0.1236061,0.00009544325,0.0001583622,0.0001107927,0.05905885,0.06950274,0.02065777,0.07448807,0.04002322,0.6093848],"study_design_scores_gemma":[0.0004292018,0.00004034032,0.001678495,0.0000418924,0.000006525632,0.00002023531,0.000681828,0.9958841,0.0001363646,0.0004705477,0.0004789141,0.0001315781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8601553,0.0001911298,0.03240257,0.001459722,0.00007455302,0.0009077367,0.00000894876,0.0001014136,0.1046986],"genre_scores_gemma":[0.9961123,0.000001103866,0.002801403,0.0002432495,0.0001360065,0.000009533877,0.000002683835,0.00001537498,0.0006782812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9263813,"threshold_uncertainty_score":0.996942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06484969735203121,"score_gpt":0.3548422319852788,"score_spread":0.2899925346332476,"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."}}