{"id":"W2119978482","doi":"10.1109/icdcsw.2003.1203667","title":"Optimal and near optimal web proxy placement algorithms for networks with planar graph topologies","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Network topology; Topology (electrical circuits); Algorithm; Graph; Cache; Planar graph; Planar; Minimax; Distributed computing; Computer network; Theoretical computer science; Mathematical optimization; Mathematics; Combinatorics","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.001007964,0.001074094,0.00118227,0.001119172,0.0006629217,0.001213805,0.001410896,0.001156988,0.002364527],"category_scores_gemma":[0.004532896,0.0008585206,0.0007554556,0.001195425,0.0009341234,0.001888281,0.001367981,0.0009603194,0.000563352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001623808,"about_ca_system_score_gemma":0.001470426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003682545,"about_ca_topic_score_gemma":0.004434896,"domain_scores_codex":[0.9993815,0.0002133889,0.0000364956,0.0001250797,0.0001323017,0.0001111677],"domain_scores_gemma":[0.9983038,0.001099405,0.0002182135,0.000108166,0.0001641573,0.0001062642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009229546,0.00005004607,0.0003823012,0.00008736835,0.00002118332,0.00003432819,0.00008051942,0.9316781,0.00118548,0.01690925,0.001056365,0.04842266],"study_design_scores_gemma":[0.00002303485,0.00005379155,0.0001030317,0.000009290435,0.000008795771,0.00003127682,0.00005588989,0.9800709,0.0008206544,0.01813406,0.0006799199,0.000009454519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02210254,0.0002636579,0.9744179,0.0001593608,0.0000209681,0.00008124517,0.00007547165,0.0003135907,0.002565176],"genre_scores_gemma":[0.3625604,0.000571912,0.6332105,0.00009244084,0.00004413511,0.0002503281,0.0003219101,0.0001786804,0.002769542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003682545,"threshold_uncertainty_score":0.01178163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01593739023686659,"score_gpt":0.2306693298070191,"score_spread":0.2147319395701525,"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."}}