{"id":"W1559493324","doi":"10.1007/978-3-540-39724-3_21","title":"On the Correctness of an Intrusion-Tolerant Group Communication Protocol","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Intrusion tolerance; Correctness; Byzantine fault tolerance; Computer science; Fault tolerance; Robustness (evolution); Quantum Byzantine agreement; Intrusion; Distributed computing; Protocol (science); Theoretical computer science; Computer security; Algorithm; Intrusion detection system","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.005410686,0.0009648974,0.001504825,0.001086249,0.002224197,0.004147723,0.003015473,0.002987864,0.003220423],"category_scores_gemma":[0.02696004,0.001159257,0.0009920468,0.001506732,0.006746169,0.008965117,0.00501939,0.005351719,0.001112201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144319,"about_ca_system_score_gemma":0.001836543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766773,"about_ca_topic_score_gemma":0.000827566,"domain_scores_codex":[0.9931786,0.001810094,0.0004753709,0.0005423506,0.003341901,0.0006517167],"domain_scores_gemma":[0.97926,0.0134009,0.000881866,0.003713062,0.002401995,0.0003423005],"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.0005053005,0.00007499559,0.000779887,0.0002436977,0.00005429111,0.0003644445,0.0008422397,0.04780936,0.004445584,0.8967054,0.005871964,0.04230274],"study_design_scores_gemma":[0.0002097241,0.0001334255,0.0002356681,0.00008772853,0.0000776942,0.0002303635,0.000139378,0.1516372,0.005570532,0.8286699,0.0129669,0.00004146501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04763763,0.001268773,0.9066646,0.004844022,0.0009585755,0.0002627494,0.0001801517,0.001395185,0.03678836],"genre_scores_gemma":[0.8252745,0.002020824,0.1558105,0.001081092,0.0008843408,0.0005301732,0.0005321173,0.0006068121,0.01325959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005410686,"threshold_uncertainty_score":0.02861476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01637180660454774,"score_gpt":0.2594534385205328,"score_spread":0.2430816319159851,"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."}}