{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005649089,0.0001102072,0.0001210972,0.00002413657,0.0004769502,0.0002497111,0.0006982546,0.00004692803,0.0001767885],"category_scores_gemma":[0.000009661182,0.00006573705,0.00007123184,0.0002486323,0.00002739355,0.0001892824,0.0001741294,0.00017189,0.0001079948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005133765,"about_ca_system_score_gemma":0.000005342288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001817958,"about_ca_topic_score_gemma":0.0000434225,"domain_scores_codex":[0.9988182,0.0002386348,0.000256057,0.0002065051,0.0002123446,0.0002682438],"domain_scores_gemma":[0.9986929,0.0001885687,0.00009065972,0.0009144608,0.00006953785,0.00004391467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007093557,0.0002126236,0.0001134718,0.000008399302,0.00007140734,0.00001046147,0.00528622,0.1587637,0.00009201391,0.6358821,0.1183139,0.08123866],"study_design_scores_gemma":[0.00007825522,0.00004269321,0.00004455788,0.0000501196,0.000001752864,0.00001361174,0.0001212242,0.9838229,0.00002655997,0.000663462,0.0150338,0.0001010834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01413649,0.0003431347,0.9640881,0.00349296,0.001071807,0.0002829267,7.786867e-7,0.0001771166,0.01640663],"genre_scores_gemma":[0.9799647,0.00003695718,0.01669585,0.001906876,0.0002861371,0.00001415794,8.069646e-7,0.000008402013,0.001086081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9658282,"threshold_uncertainty_score":0.3668363,"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."}}