{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00355649,0.001168609,0.002965158,0.001225172,0.001505602,0.002600981,0.002607567,0.003205569,0.003711203],"category_scores_gemma":[0.01716458,0.001190048,0.0006323179,0.001815147,0.00196043,0.005682991,0.00183982,0.001119719,0.0006779543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001856863,"about_ca_system_score_gemma":0.002722177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003355413,"about_ca_topic_score_gemma":0.004644971,"domain_scores_codex":[0.9982547,0.0008120571,0.0001264027,0.0003308504,0.0001949045,0.0002811074],"domain_scores_gemma":[0.9907444,0.006297998,0.0007494726,0.0009182171,0.0007130801,0.0005767577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001953335,0.000234244,0.001723279,0.0003687256,0.00009132398,0.0001996861,0.0002427867,0.9055181,0.006151845,0.02896929,0.004886084,0.04966129],"study_design_scores_gemma":[0.0001549518,0.0001055454,0.0002361512,0.00001594958,0.00003778905,0.00005622921,0.0001461934,0.9763001,0.002300446,0.02023035,0.0003957146,0.00002056472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.315156,0.001899949,0.669498,0.003584258,0.0002926263,0.0004138192,0.0005159753,0.001127659,0.00751169],"genre_scores_gemma":[0.8684052,0.0004542724,0.1268047,0.0001556628,0.00009730137,0.0001500257,0.0001485712,0.000153114,0.003631143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003711203,"threshold_uncertainty_score":0.01880872,"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."}}