{"id":"W2471701653","doi":"10.48550/arxiv.1112.5636","title":"Tight lower bounds for online labeling problem","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Akademie Věd České Republiky; Grantová Agentura České Republiky; National Science Foundation","keywords":"Upper and lower bounds; Combinatorics; Integer (computer science); Order (exchange); Constant (computer programming); Range (aeronautics); Space (punctuation); Online algorithm; Binary logarithm; Mathematics; Computer science; Algorithm; Class (philosophy); Discrete mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007803726,0.005687471,0.00599004,0.003444402,0.004515128,0.01041017,0.01004251,0.006785695,0.03193009],"category_scores_gemma":[0.05297849,0.002196971,0.003441484,0.0067519,0.004430695,0.02976556,0.00743992,0.01575417,0.008078001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007267616,"about_ca_system_score_gemma":0.004353117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004212715,"about_ca_topic_score_gemma":0.005362457,"domain_scores_codex":[0.9877698,0.00268451,0.0004567158,0.002385266,0.00323149,0.003472212],"domain_scores_gemma":[0.9379755,0.04928868,0.002227611,0.005829114,0.002540658,0.002138455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002882612,0.00231011,0.005184529,0.003258511,0.0003493927,0.0005437739,0.001134846,0.2607324,0.009338918,0.431611,0.09702737,0.1856266],"study_design_scores_gemma":[0.00022029,0.0002559487,0.0008797125,0.0002700099,0.0001759062,0.0003562531,0.0002616067,0.5150245,0.002729006,0.4625333,0.01722573,0.00006764821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0575943,0.01453561,0.782486,0.01670817,0.001247752,0.0006157517,0.004308098,0.005700774,0.1168034],"genre_scores_gemma":[0.5290911,0.01061025,0.3866646,0.007338073,0.003590016,0.002321593,0.01068276,0.005388779,0.0443128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03193009,"threshold_uncertainty_score":0.1068168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1012411393191449,"score_gpt":0.2007730196404807,"score_spread":0.09953188032133588,"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."}}