{"id":"W2120279149","doi":"10.1007/s11590-008-0085-6","title":"On a posterior evaluation of a simple greedy method for set packing","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Set packing; Mathematics; Mathematical optimization; Set (abstract data type); Upper and lower bounds; Greedy algorithm; Relaxation (psychology); Packing problems; Function (biology); Linear programming relaxation; Combinatorics; Computer science; Linear programming","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":[],"consensus_categories":[],"category_scores_codex":[0.0004099752,0.0001290271,0.0001578638,0.0001646467,0.00008160668,0.0000178427,0.00007631887,0.00005909,0.0001860234],"category_scores_gemma":[0.0000983754,0.0001387926,0.00006418573,0.0002317258,0.00001940713,0.0001326012,0.000007906264,0.0000544521,0.000004638245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006564155,"about_ca_system_score_gemma":0.00001998886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005007127,"about_ca_topic_score_gemma":0.00000192307,"domain_scores_codex":[0.9990788,0.00007203167,0.0002656768,0.0001527666,0.0002757547,0.0001550337],"domain_scores_gemma":[0.9994174,0.0001094905,0.00008359153,0.0001727712,0.0001784855,0.00003828573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001462573,0.00001013308,0.00007859829,0.00003538449,0.00002651382,2.937884e-7,0.0005423995,0.9930232,0.001875679,0.00006335241,0.002782199,0.001547646],"study_design_scores_gemma":[0.0009116404,0.00003882946,0.00008106905,0.0000259635,0.0000373968,0.00000699419,0.00001636747,0.9966922,0.001644166,0.00003907544,0.0003595704,0.0001467733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0234649,0.00001889248,0.9746751,0.0003057939,0.0001989282,0.0005331555,0.00003351172,0.0001437064,0.0006260549],"genre_scores_gemma":[0.6091647,0.0000215557,0.3889181,0.001212386,0.00007085023,0.0001263702,0.0003708962,0.0000802572,0.00003490403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.585757,"threshold_uncertainty_score":0.5659797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04883040661566376,"score_gpt":0.2983069939448683,"score_spread":0.2494765873292046,"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."}}