{"id":"W2156885983","doi":"10.1007/978-3-319-18263-6_22","title":"Primal-Dual Algorithms for Precedence Constrained Covering Problems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Knapsack problem; Combinatorics; Mathematics; Cover (algebra); Bounded function; Upper and lower bounds; Antichain; Order (exchange); Discrete mathematics; Integer (computer science); Algorithm; Partially ordered set; Computer science","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"],"consensus_categories":[],"category_scores_codex":[0.001980598,0.000549537,0.0005723308,0.00063126,0.0002990279,0.0009191557,0.002789613,0.0003402721,0.00002734118],"category_scores_gemma":[0.0002584258,0.0005130053,0.000132376,0.0005880072,0.0008306286,0.0009973824,0.001262602,0.0006627464,0.00002941592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004020431,"about_ca_system_score_gemma":0.001681583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001161524,"about_ca_topic_score_gemma":0.00002860222,"domain_scores_codex":[0.9954228,0.00004151853,0.0006424806,0.001679736,0.001294592,0.0009188475],"domain_scores_gemma":[0.996825,0.0004985628,0.0003279033,0.001084324,0.000902412,0.0003617786],"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.000009538337,0.00004654566,0.000009596238,0.000132806,0.00001909841,0.00002682589,0.001269924,0.4138995,0.0001620463,0.05356215,0.0001422443,0.5307198],"study_design_scores_gemma":[0.0005930192,0.0003581883,0.0000036818,0.0003363587,0.000005106388,0.00007107959,2.279959e-7,0.8715338,0.0003506506,0.1203586,0.005770958,0.0006183329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000319176,0.0003118093,0.989921,0.0008829045,0.001378163,0.001464786,0.00002599658,0.0002721072,0.005740067],"genre_scores_gemma":[0.007420831,0.00005399611,0.9898379,0.0007008679,0.000407989,0.00007042872,0.00002095837,0.00005068094,0.001436283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5301014,"threshold_uncertainty_score":0.9997321,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05693307988904808,"score_gpt":0.2951510142718861,"score_spread":0.238217934382838,"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."}}