{"id":"W2002043779","doi":"10.1007/s446-002-8031-5","title":"The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy","year":2002,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Carleton University; University of Toronto","funders":"","keywords":"Computer science; Consistency (knowledge bases); Mathematical optimization; Dynamic programming; Function (biology); Path (computing); Linear programming; Zero (linguistics); Optimization problem; Algorithm; Mathematics; Computer network","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.0007236183,0.0001080644,0.0001586269,0.00008953804,0.0002421369,0.0001805811,0.000696437,0.00005768031,0.000003916815],"category_scores_gemma":[0.0002610179,0.0000972987,0.00003925353,0.002390377,0.00006120014,0.00016903,0.0002589292,0.0001865506,0.000005285341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137441,"about_ca_system_score_gemma":0.00007241322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001366835,"about_ca_topic_score_gemma":0.000006781027,"domain_scores_codex":[0.9983698,0.0001718714,0.0004524949,0.0002930188,0.0002547074,0.0004581692],"domain_scores_gemma":[0.9986866,0.0002386204,0.0002071967,0.000542279,0.0002519783,0.00007330433],"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.000003735279,0.0000705622,0.0008436968,0.00001533522,0.00001329904,0.00000318542,0.0005477602,0.9461551,0.00009674331,0.03456974,0.0002578107,0.017423],"study_design_scores_gemma":[0.0002442732,0.00002998265,0.0008132493,0.00009114698,0.000002214435,0.000008238987,0.00003161954,0.9976645,0.00006417422,0.0004251558,0.000526243,0.00009917752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254611,0.0002887222,0.9848921,0.001553611,0.00006269715,0.0002080902,0.000002865346,0.0000916274,0.0003541572],"genre_scores_gemma":[0.9463887,0.00003041963,0.05330833,0.0001397404,0.00009476651,0.000003153832,0.00001341841,0.000007685759,0.00001381456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9338425,"threshold_uncertainty_score":0.3967726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05930555058723942,"score_gpt":0.3061084122070256,"score_spread":0.2468028616197862,"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."}}