{"id":"W4380590274","doi":"10.36227/techrxiv.23511708.v1","title":"Shard-based and Reputation-enhanced Byzantine Fault-tolerant Scheme for Secure Data Sharing in Latency-sensitive Computing Services","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Latency (audio); Computer science; Reputation; Byzantine fault tolerance; Scheme (mathematics); Fault tolerance; Low latency (capital markets); Computer network; Data sharing; Distributed computing; Telecommunications","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.00188979,0.0004098641,0.001210481,0.0007624312,0.001756561,0.001701602,0.001774617,0.001063364,0.002583863],"category_scores_gemma":[0.003272237,0.0002503381,0.0004720087,0.001133975,0.001243445,0.00383856,0.002766354,0.001437941,0.0006268902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262062,"about_ca_system_score_gemma":0.002187397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001179507,"about_ca_topic_score_gemma":0.001348406,"domain_scores_codex":[0.998245,0.0004179158,0.0001469068,0.0002583454,0.00065497,0.0002767869],"domain_scores_gemma":[0.9977442,0.0004616836,0.0002529474,0.0007999682,0.0005007725,0.0002404243],"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.002514973,0.00046121,0.002720441,0.0007202955,0.0001987305,0.001268648,0.001326279,0.2023332,0.07670888,0.4629976,0.01094108,0.2378087],"study_design_scores_gemma":[0.0001598481,0.0005093438,0.0004997991,0.00005017617,0.00007440591,0.0005904385,0.0001436574,0.8529739,0.02280986,0.1056378,0.01643799,0.0001127805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09981424,0.0008311642,0.8890451,0.0008020703,0.0003088485,0.0003158282,0.0002634648,0.001239299,0.007380021],"genre_scores_gemma":[0.9359312,0.0003546938,0.05746175,0.000116711,0.0000879396,0.0001072381,0.0001839924,0.00005081159,0.005705673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002583863,"threshold_uncertainty_score":0.009994328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05248126645975412,"score_gpt":0.3168580509540428,"score_spread":0.2643767844942887,"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."}}