{"id":"W2157697203","doi":"10.1109/ftcs.1991.146673","title":"A multiple-fault tolerant sorting network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Fault tolerance; Redundancy (engineering); Sorting network; Sorting; Computer science; sort; Sorting algorithm; Theoretical computer science; Algorithm; Distributed computing; Information retrieval; Operating 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.0002556494,0.0002768148,0.0002645903,0.0005067516,0.0005124857,0.0006222685,0.000634898,0.0005002174,0.002478836],"category_scores_gemma":[0.0006023581,0.0001321888,0.0001817556,0.000570515,0.0003272366,0.0009050083,0.0003619137,0.0002653391,0.0005278934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006340134,"about_ca_system_score_gemma":0.0005467002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008687198,"about_ca_topic_score_gemma":0.001175893,"domain_scores_codex":[0.9998013,0.00003534191,0.00001355785,0.00005503646,0.00006754497,0.00002715577],"domain_scores_gemma":[0.9996729,0.00006279162,0.0000669865,0.00005744433,0.0001097145,0.00003013378],"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.0007500495,0.0001633548,0.001481282,0.0004230273,0.00007314602,0.0004297571,0.0001571431,0.1515139,0.2233043,0.1367746,0.007199318,0.4777302],"study_design_scores_gemma":[0.0001070029,0.0009382094,0.001179042,0.00005955298,0.00009978413,0.000810131,0.00005856973,0.7184647,0.1391538,0.08039492,0.05867118,0.00006318842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1590779,0.000817671,0.8206628,0.0007643682,0.0002346083,0.0001357526,0.0003130882,0.001643625,0.01635014],"genre_scores_gemma":[0.6944885,0.0006723991,0.2883434,0.0003415309,0.00008896197,0.0001288192,0.000388271,0.00005705377,0.01549108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002478836,"threshold_uncertainty_score":0.008292556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02714891930288977,"score_gpt":0.219092877595444,"score_spread":0.1919439582925543,"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."}}