{"id":"W2161887069","doi":"10.1109/hicss.1995.375483","title":"Fault tolerant communication algorithms on the star network using disjoint paths","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Disjoint sets; Computer science; Fault tolerance; Node (physics); Broadcasting (networking); Algorithm; Graph; Directed graph; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Computer network; Distributed computing; Discrete mathematics; Mathematics; Engineering; Artificial intelligence","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.0009220304,0.000667721,0.0007900022,0.001215632,0.0008184143,0.001143954,0.00115523,0.0007815567,0.003213411],"category_scores_gemma":[0.003757766,0.0003736813,0.0005492762,0.001396331,0.0009213085,0.002933183,0.00194106,0.0008628626,0.0009948551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089799,"about_ca_system_score_gemma":0.001057175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821381,"about_ca_topic_score_gemma":0.001368373,"domain_scores_codex":[0.9991948,0.0002478272,0.00005866226,0.0001408531,0.0002643985,0.00009345646],"domain_scores_gemma":[0.9985159,0.0006928241,0.0001499015,0.0002624346,0.0003056259,0.00007334477],"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.0002587266,0.0000650424,0.0004049935,0.0001977015,0.0000500684,0.00009208875,0.0003741864,0.5007964,0.003805957,0.3108941,0.008821458,0.1742393],"study_design_scores_gemma":[0.0000881218,0.00006625698,0.00008790491,0.00002143205,0.00001428141,0.00005576387,0.00005053783,0.7747942,0.00280913,0.2142577,0.007739366,0.00001541887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01812661,0.0004341937,0.9749839,0.0003059462,0.00005283472,0.00006367749,0.00009576479,0.0007837028,0.005153398],"genre_scores_gemma":[0.3243134,0.001173386,0.6645219,0.0002296707,0.00009782855,0.000354762,0.0006028276,0.0002860059,0.008420182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003213411,"threshold_uncertainty_score":0.01074994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05942943353055453,"score_gpt":0.2430585396939682,"score_spread":0.1836291061634137,"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."}}