{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001566338,0.000154354,0.0001515826,0.00004828244,0.0002333721,0.0002746483,0.0003151593,0.0000537931,0.000002341013],"category_scores_gemma":[0.000005508515,0.0001110306,0.00004575966,0.0001156818,0.0001013794,0.000262024,0.000105986,0.0001036869,0.00000196254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002601077,"about_ca_system_score_gemma":0.00007195667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001148639,"about_ca_topic_score_gemma":0.00002072713,"domain_scores_codex":[0.9989963,0.00001328985,0.0001331215,0.0003766768,0.0001510876,0.0003295195],"domain_scores_gemma":[0.9995294,0.00005128004,0.00004254436,0.000247728,0.00004645394,0.00008260313],"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.0003076821,0.000185793,0.0007956052,0.0000244514,0.0001574417,0.00007030257,0.0007868856,0.9369773,0.0001263488,0.04856165,0.002252463,0.009754052],"study_design_scores_gemma":[0.002018375,0.001356652,0.0001552912,0.00003193823,0.00001699445,0.00008004076,0.0003467302,0.994224,0.0001700985,0.0003723032,0.0009230409,0.0003045338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.111264,0.000192242,0.8861993,0.001399819,0.0001379002,0.000321113,0.000003299367,0.0002273662,0.0002549775],"genre_scores_gemma":[0.5381375,0.00004315235,0.4608959,0.00053732,0.00006666763,0.00006497902,0.000005298942,0.000009761214,0.0002393867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4268735,"threshold_uncertainty_score":0.4527698,"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."}}