{"id":"W2008126942","doi":"10.1007/s00453-001-0039-1","title":"On-Line Competitive Algorithms for Call Admission in Optical Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Computer science; Logarithm; Network topology; Competitive analysis; Telecommunications network; Line (geometry); Algorithm; Computer network; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539039,0.0001563093,0.0002018064,0.0001451843,0.0001026236,0.0001003542,0.0005376295,0.0001107388,0.00004174661],"category_scores_gemma":[0.0001143656,0.0001398666,0.00006720279,0.0004759754,0.0000476908,0.0002097879,0.0001459863,0.0002446227,0.00003897584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006794401,"about_ca_system_score_gemma":0.00007151971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215185,"about_ca_topic_score_gemma":0.000007211533,"domain_scores_codex":[0.9984811,0.0000636394,0.0002795306,0.0004502888,0.0002533139,0.000472135],"domain_scores_gemma":[0.9988772,0.0003870048,0.00004673821,0.0003257844,0.0001318752,0.0002314026],"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.00009655642,0.0007015927,0.00006439104,0.00001199341,0.00002476749,0.0001332901,0.0003203342,0.1754716,0.00003034174,0.3594545,0.003733158,0.4599575],"study_design_scores_gemma":[0.001079345,0.0003905645,0.0001137025,0.00004012105,0.000001817556,0.00001478206,0.00001164065,0.9833426,0.0001048952,0.003440867,0.01128081,0.0001788194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001379453,0.0000357242,0.9914486,0.003466199,0.0002737164,0.0004482094,0.000003851159,0.0001163348,0.004069372],"genre_scores_gemma":[0.1773255,0.0001982121,0.8151641,0.003543202,0.0004653259,0.0001988801,0.00007560979,0.00004654169,0.002982586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8078711,"threshold_uncertainty_score":0.5703593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03568695878688269,"score_gpt":0.311284834257148,"score_spread":0.2755978754702653,"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."}}