{"id":"W2046102647","doi":"10.1016/j.tcs.2009.08.006","title":"A sublinear-time approximation scheme for bin packing","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bin packing problem; Sublinear function; Mathematics; Constant (computer programming); Approximation algorithm; Combinatorics; Exponential function; Sampling (signal processing); Function (biology); Running time; Bin; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","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.0005086848,0.00008954479,0.00009549785,0.0001004142,0.0001257624,0.0001837093,0.0002619789,0.00003463385,0.00004687518],"category_scores_gemma":[0.00003949525,0.00008004402,0.00003013681,0.0004745215,0.0002603425,0.0002184666,0.0000245528,0.00006742987,0.00004350078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002590736,"about_ca_system_score_gemma":0.00001509955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.591226e-8,"about_ca_topic_score_gemma":1.66718e-8,"domain_scores_codex":[0.9992263,0.00001011212,0.0001388956,0.0001798768,0.0001796855,0.0002651677],"domain_scores_gemma":[0.9995902,0.00005381037,0.00001516909,0.0001684106,0.00008285447,0.00008962589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005273423,0.00001932118,0.000006599989,0.0000149764,0.00000205228,3.311193e-7,0.0002028362,0.04954891,0.005589296,0.9166477,0.0001989024,0.02776375],"study_design_scores_gemma":[0.0001548909,0.00006282792,0.00005011458,0.00001834303,0.000001780513,0.000002951247,9.138117e-7,0.9665317,0.004706321,0.02815903,0.0001989269,0.0001121878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009467225,0.00001098685,0.9856887,0.0003325909,0.0001656757,0.0001708458,0.000001488575,0.0003680193,0.003794396],"genre_scores_gemma":[0.716029,0.000001400705,0.2837018,0.0001675623,0.00007757374,0.000003131981,0.000003711931,0.000006601323,0.000009180398],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9169828,"threshold_uncertainty_score":0.32641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008633049583876605,"score_gpt":0.228430810156687,"score_spread":0.2197977605728104,"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."}}