{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000236794,0.00009548099,0.0001311791,0.00002864493,0.0001696535,0.0001733147,0.0003816095,0.00004841438,0.0002309947],"category_scores_gemma":[0.00002346935,0.00007556457,0.00007563777,0.000250711,0.000009614518,0.0002480336,0.00009669996,0.0000974513,0.0003586984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001821469,"about_ca_system_score_gemma":0.000003431735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000515844,"about_ca_topic_score_gemma":0.00006377007,"domain_scores_codex":[0.9989329,0.00005039856,0.0002798524,0.0002574199,0.0001508522,0.0003285494],"domain_scores_gemma":[0.9993802,0.00008633258,0.00007283654,0.0003386897,0.00005202774,0.00006986599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005990185,0.000142621,0.008887779,0.00002106637,0.00007087814,0.00007968886,0.003041755,0.0869049,0.0001849757,0.2920428,0.4266196,0.1819979],"study_design_scores_gemma":[0.0001590506,0.00002570073,0.0001202342,0.00001898972,8.731661e-7,0.00003541201,0.00002119939,0.9596717,0.00002962135,0.0003179226,0.03948555,0.0001137809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004601988,0.0001938937,0.9155636,0.0007289877,0.002085217,0.0001149608,1.04387e-7,0.0003664152,0.07634486],"genre_scores_gemma":[0.9803334,0.000004974264,0.01098688,0.0009532081,0.00063703,0.00001141684,2.058686e-7,0.000006065573,0.00706679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9757314,"threshold_uncertainty_score":0.4610462,"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."}}