{"id":"W2950744132","doi":"10.1016/j.tcs.2018.02.020","title":"Scheduling maintenance jobs in networks","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Preemption; Scheduling (production processes); Computer science; Time complexity; Mathematical optimization; Job shop scheduling; Simple (philosophy); Distributed computing; Mathematics; Algorithm; Computer network","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":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003941069,0.0003592419,0.0004245075,0.000493446,0.000313334,0.00142067,0.006666301,0.0002404521,0.00006064661],"category_scores_gemma":[0.0002102269,0.000313786,0.0001053392,0.001795391,0.00389898,0.0005769495,0.009732799,0.001186772,0.00009637651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001986796,"about_ca_system_score_gemma":0.0005135368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009308749,"about_ca_topic_score_gemma":0.000002938643,"domain_scores_codex":[0.99534,0.0002592317,0.000574622,0.001664627,0.0009756744,0.001185855],"domain_scores_gemma":[0.996955,0.0002137087,0.0001591398,0.001760069,0.0005003902,0.0004117164],"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.000004441714,0.00004643638,0.0001292727,0.00001609839,0.000002652517,0.0000194142,0.0002766202,0.1765801,0.000005270451,0.8134941,0.00007508057,0.009350528],"study_design_scores_gemma":[0.0001735942,0.00007278253,0.000546488,0.0002382266,0.000001360198,0.00001055575,0.000001795665,0.8129842,0.0000551283,0.1855478,0.00004938322,0.0003187201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003399085,0.00006090597,0.9879591,0.001796955,0.002090021,0.0004123532,0.000001170692,0.000291705,0.003988663],"genre_scores_gemma":[0.5714592,0.0000370344,0.4275052,0.000725098,0.0002312172,0.00001690871,0.000001604014,0.00001137614,0.00001226593],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6364041,"threshold_uncertainty_score":0.9999314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711956884023272,"score_gpt":0.2766118358970304,"score_spread":0.2594922670567976,"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."}}