{"id":"W6966637108","doi":"10.4224/8913444","title":"View planning as a set covering problem","year":2001,"lang":"en","type":"report","venue":"NPARC","topic":"","field":"","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Integer programming; Set cover problem; Set (abstract data type); Constraint (computer-aided design); Field (mathematics); Constraint programming; Integer (computer science)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001401298,0.0006229231,0.0009848026,0.0003421306,0.0001342862,0.0001891582,0.0004725658,0.0005177641,0.003946959],"category_scores_gemma":[0.0005745321,0.0006366313,0.0002558272,0.0005140555,0.00006243457,0.0001520652,0.0002752931,0.001059757,0.01493508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001239407,"about_ca_system_score_gemma":0.003080997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002423584,"about_ca_topic_score_gemma":0.00001434385,"domain_scores_codex":[0.9955752,0.00009584097,0.0007215309,0.0008144234,0.001953551,0.0008394761],"domain_scores_gemma":[0.9977099,0.00007739173,0.0007246065,0.0008138564,0.00034952,0.0003247501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000376542,0.00005651385,0.001463674,0.001563533,0.0003418713,0.002423492,0.0004031995,0.0001885159,0.00316235,0.00009937601,0.9803228,0.009937014],"study_design_scores_gemma":[0.000251249,0.00005808887,0.00008706278,0.003739902,0.000174357,0.002199812,0.00002848465,0.00003081379,0.0001005415,0.001646582,0.9910012,0.0006819136],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001877731,0.002502004,0.00003877062,0.00005040264,0.0005346649,0.00077961,0.0003410921,0.0006817093,0.993194],"genre_scores_gemma":[0.1318717,0.01928763,0.03523533,0.001685063,0.01638012,0.003061752,0.01292806,0.0094019,0.7701484],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2230456,"threshold_uncertainty_score":0.9996085,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08532242208140617,"score_gpt":0.356335935963752,"score_spread":0.2710135138823458,"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."}}