{"id":"W2942755285","doi":"10.1007/s00453-020-00728-0","title":"Online Bin Covering with Advice","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Advice (programming); Bin; Competitive analysis; Online algorithm; Bin packing problem; Binary logarithm; Mathematics; Theory of computation; Combinatorics; Computer science; Algorithm; Discrete mathematics; Upper and lower bounds","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740676,0.001177147,0.001280991,0.001066995,0.001013731,0.001609014,0.001699918,0.001712124,0.04409591],"category_scores_gemma":[0.006990307,0.000573846,0.0009826289,0.001819658,0.0006903519,0.002975495,0.002560828,0.00196086,0.007815674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009932994,"about_ca_system_score_gemma":0.001982025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004018256,"about_ca_topic_score_gemma":0.008803337,"domain_scores_codex":[0.9987088,0.0002753285,0.00004757977,0.0002399612,0.0004110935,0.0003171315],"domain_scores_gemma":[0.9972717,0.001153403,0.00009301951,0.001075418,0.0002555948,0.0001508268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001784638,0.0007255591,0.002934431,0.0004627071,0.0001124976,0.0003345167,0.0001722718,0.1173831,0.005861565,0.04368151,0.1350844,0.6914628],"study_design_scores_gemma":[0.0002131458,0.0001207838,0.0006631648,0.00006111403,0.00007445812,0.0002627957,0.00007463315,0.8028854,0.005805732,0.1645578,0.02525694,0.0000239768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1268762,0.001717642,0.7000688,0.004470019,0.001160118,0.0005099005,0.004524438,0.03360043,0.1270724],"genre_scores_gemma":[0.5940423,0.0004473539,0.3528437,0.0008537732,0.0003568249,0.0002309416,0.003553113,0.002043691,0.0456283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04409591,"threshold_uncertainty_score":0.1475155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02001191323843362,"score_gpt":0.2351358559611555,"score_spread":0.2151239427227219,"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."}}