{"id":"W1554277184","doi":"10.1007/978-3-540-73545-8_49","title":"Priority Algorithms for the Subset-Sum Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Key (lock); Greedy algorithm; Algorithm; Approximation algorithm; Power (physics); Simple (philosophy); Order (exchange); Mathematical optimization; Theoretical computer science; Mathematics","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.00290977,0.0007074192,0.000620035,0.0007486737,0.0009507586,0.000932968,0.007047702,0.0004183058,0.00001803794],"category_scores_gemma":[0.0001032491,0.0005297816,0.0003504981,0.001038026,0.001484181,0.0005910992,0.001958941,0.001282423,0.00002636056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002869293,"about_ca_system_score_gemma":0.0006608829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005135192,"about_ca_topic_score_gemma":0.0002491952,"domain_scores_codex":[0.9947352,0.00003270834,0.0007325579,0.00192439,0.001383819,0.001191279],"domain_scores_gemma":[0.9946157,0.002121312,0.0003731025,0.002198064,0.0004731854,0.0002186412],"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.000006110049,0.00003092485,0.00001315221,0.00004104183,0.00001939228,0.0000270385,0.0004430762,0.002431742,0.000008996905,0.1070016,0.00006530747,0.8899116],"study_design_scores_gemma":[0.0003160731,0.0001879576,0.0001083445,0.0001769365,0.00001470835,0.0000757021,2.415077e-7,0.5178714,0.0003314492,0.4514709,0.02876133,0.0006849667],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004482583,0.001223849,0.9892521,0.00177476,0.003591249,0.001361863,0.00002105578,0.0002540936,0.002516567],"genre_scores_gemma":[0.002462498,0.0001097401,0.9932265,0.002066667,0.00137996,0.00004620531,0.000007741219,0.00004922281,0.00065148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8892267,"threshold_uncertainty_score":0.9997154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04608305401403921,"score_gpt":0.287027869965869,"score_spread":0.2409448159518298,"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."}}