{"id":"W4398138850","doi":"10.3390/a17050219","title":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Bipartite graph; Multipartite; Mathematics; Combinatorics; Integer programming; Discrete mathematics; Mathematical optimization; Computer science; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.0001244369,0.0001233286,0.00008720992,0.00005429541,0.0001296448,0.0001700579,0.00005459558,0.00004352797,0.00004732142],"category_scores_gemma":[0.000005582794,0.00007569139,0.00002377532,0.0002078071,0.0001529795,0.00006163187,0.00001059109,0.0001617553,0.00005937254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009216124,"about_ca_system_score_gemma":0.00001427739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003773558,"about_ca_topic_score_gemma":0.000006676643,"domain_scores_codex":[0.9994191,0.00001513022,0.000116352,0.0001523584,0.0001074389,0.0001896219],"domain_scores_gemma":[0.9996242,0.0001265293,0.00000963933,0.0001395891,0.00002796646,0.00007206642],"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.00002787507,0.0000599764,0.0005410276,0.000368411,0.0006924368,0.0002342778,0.003709422,0.141487,0.0005867811,0.09380694,0.0497874,0.7086985],"study_design_scores_gemma":[0.0005321958,0.0002332802,0.0005895472,0.0005118856,0.00005358518,0.0001904561,0.000181376,0.6212844,0.0005915863,0.001564102,0.3738063,0.0004612665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.134336,0.06927741,0.2555664,0.02781514,0.01275378,0.009413163,0.0007054426,0.0271434,0.4629893],"genre_scores_gemma":[0.9837795,0.002181983,0.01102994,0.0003230942,0.00008535988,0.00008708487,0.00002591622,0.0001051376,0.002381964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8494436,"threshold_uncertainty_score":0.3086605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01311561027935585,"score_gpt":0.2225104173048545,"score_spread":0.2093948070254986,"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."}}