{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002013281,0.0003156627,0.0003200694,0.0001829567,0.00022333,0.0001555797,0.002340228,0.0002969951,0.00003730186],"category_scores_gemma":[0.00001527382,0.0003212723,0.0002092557,0.000281186,0.00006603097,0.0005249964,0.003154788,0.0004386672,0.00004430842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001040617,"about_ca_system_score_gemma":0.0002129422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000140945,"about_ca_topic_score_gemma":0.00003725253,"domain_scores_codex":[0.9980519,0.00004885882,0.0002170957,0.001197293,0.00008603183,0.0003988414],"domain_scores_gemma":[0.9978512,0.0000695062,0.0002506319,0.001423363,0.0002344107,0.0001708923],"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.0002503251,0.001714376,0.00072631,0.0006626145,0.0004274306,0.0006221823,0.0007793238,0.05375949,0.0002829205,0.8984395,0.01526831,0.02706725],"study_design_scores_gemma":[0.000837728,0.0001599687,0.0001752057,0.0002863171,0.00008057456,0.000004701475,0.00001555349,0.7779612,0.0001644122,0.1867204,0.03282708,0.0007668897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01991201,0.0001213434,0.9762521,0.00006934129,0.001155428,0.0004453076,0.0001252103,0.0002936605,0.001625609],"genre_scores_gemma":[0.6116881,0.0003537702,0.3786078,0.0002951366,0.0004796929,0.000006001271,0.0003588239,0.00006209706,0.008148514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7242017,"threshold_uncertainty_score":0.9999239,"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."}}