{"id":"W2093197865","doi":"10.1007/s00446-005-0145-4","title":"Relationships between broadcast and shared memory in reliable anonymous distributed systems","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Asynchronous communication; Atomic broadcast; Shared memory; Identifier; Robustness (evolution); Distributed computing; Distributed shared memory; Computer network; Broadcasting (networking); Parallel computing; Memory management; Operating system; Uniform memory access","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001322771,0.0004040768,0.0006513553,0.000204246,0.0005205976,0.0007810615,0.001023044,0.0002861564,0.000004515872],"category_scores_gemma":[0.0001945537,0.0004280769,0.00008924981,0.001546399,0.0000755189,0.000877623,0.0003734344,0.0007351555,0.00005982436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003213934,"about_ca_system_score_gemma":0.0001262483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002546481,"about_ca_topic_score_gemma":0.00002169947,"domain_scores_codex":[0.9962919,0.0002993442,0.0011026,0.0009414016,0.0004722442,0.000892534],"domain_scores_gemma":[0.9978272,0.0003750561,0.0003883021,0.0008643924,0.0002107431,0.0003343103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004984299,0.0006385157,0.4488809,0.0005245027,0.0002380827,0.0003272289,0.003651124,0.3827451,0.0005578961,0.05015256,0.02263045,0.08960379],"study_design_scores_gemma":[0.001576964,0.00005447723,0.1388661,0.0004436175,0.00001925078,0.00009168097,0.0004186073,0.83775,0.00009422353,0.000224289,0.01971736,0.0007433891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654086,0.001814289,0.8287727,0.0008952623,0.0003697582,0.0005655261,0.001000474,0.0005819259,0.0005914707],"genre_scores_gemma":[0.9936332,0.00001136007,0.00480121,0.00003566832,0.0003070481,0.00002219187,0.00111898,0.00002420206,0.00004611657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8282246,"threshold_uncertainty_score":0.9998171,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0257461129592839,"score_gpt":0.2450974354943919,"score_spread":0.219351322535108,"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."}}