{"id":"W2021931635","doi":"10.1016/j.ipl.2010.10.002","title":"Developing fault-tolerant distributed loops","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Circulant matrix; Computer science; Fault tolerance; Loop (graph theory); Distributed computing; Node (physics); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Engineering","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.0002923206,0.0001124517,0.0001046761,0.0001184099,0.0002803227,0.0008642741,0.0004499764,0.00006518028,0.000007571961],"category_scores_gemma":[0.00003788271,0.00009879375,0.00003617209,0.0003616574,0.00002820485,0.003797554,0.00006407798,0.0002297776,0.0001151798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004437565,"about_ca_system_score_gemma":0.00007672142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001258031,"about_ca_topic_score_gemma":0.000004884163,"domain_scores_codex":[0.9990025,0.00001656484,0.0003976652,0.0001191742,0.0002335551,0.0002304995],"domain_scores_gemma":[0.999326,0.00002189303,0.0002116977,0.0002134252,0.0001745074,0.00005247332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002367374,0.00004343665,0.001426868,0.0004840318,0.00005371011,0.00001770666,0.0184196,0.01386416,0.01283473,0.1622574,0.03815368,0.752421],"study_design_scores_gemma":[0.0005015944,0.00001434544,0.001533077,0.0001389352,0.00000361216,0.0001643623,0.000182118,0.7441759,0.002664429,0.0004882983,0.2496601,0.0004732546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05318709,0.000004734873,0.9379524,0.006482888,0.001313292,0.00008849589,0.000001879925,0.0002826897,0.0006865368],"genre_scores_gemma":[0.9707412,4.124381e-7,0.02222775,0.006845779,0.0001270095,0.0000173503,0.0000240121,0.000004050705,0.00001251271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.917554,"threshold_uncertainty_score":0.8334215,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0102807948615451,"score_gpt":0.2269768062843992,"score_spread":0.2166960114228541,"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."}}