{"id":"W2919974563","doi":"10.1007/s10878-007-9126-9","title":"Priority algorithms for the subset-sum problem","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Algorithm; Computer science; Subset sum problem; Mathematics; Combinatorics; Discrete mathematics; Knapsack problem","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.001091401,0.0001255625,0.0002238289,0.0001325133,0.0004350379,0.0001670467,0.0008648168,0.00008695423,0.00001415534],"category_scores_gemma":[0.0002431139,0.00008712402,0.000149239,0.0005061924,0.00006572744,0.001001939,0.00008503571,0.00022415,0.000002582608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007791138,"about_ca_system_score_gemma":0.0003702406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003849925,"about_ca_topic_score_gemma":1.490248e-7,"domain_scores_codex":[0.9983497,0.0001222246,0.000565976,0.0001524727,0.0005782848,0.0002312863],"domain_scores_gemma":[0.9974913,0.0003148159,0.0005175599,0.0002677811,0.001289682,0.0001188645],"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.00008201629,0.0002708755,0.0001815732,0.00001830382,0.00007046378,0.00001036118,0.001006323,0.9027239,0.00003161264,0.08399241,0.006947532,0.004664611],"study_design_scores_gemma":[0.002662363,0.0005078315,0.0001204439,0.00001971435,0.00001959662,0.0001152969,0.00001889237,0.9740924,0.0002541255,0.008611847,0.01342388,0.0001536365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001098331,0.0001729264,0.9929973,0.002482282,0.003415599,0.0004706081,0.000001488607,0.00003965972,0.0003102606],"genre_scores_gemma":[0.03822669,0.0007684382,0.9596705,0.0002111239,0.0008272452,0.00002260676,0.000004521866,0.00002159598,0.0002472863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07538057,"threshold_uncertainty_score":0.3552814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0313018334077141,"score_gpt":0.2772436833332365,"score_spread":0.2459418499255224,"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."}}