{"id":"W1521404434","doi":"10.1109/glocom.1994.513317","title":"A merging network scheme that builds large sorting networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Sorting network; Sorting; Scheme (mathematics); Computer science; Limit (mathematics); Sorting algorithm; Chip; Algorithm; Theoretical computer science; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228017,0.0001882567,0.0002360629,0.00005908401,0.0004174849,0.0003542909,0.0006588312,0.0001215359,0.0004528442],"category_scores_gemma":[0.00001661599,0.0001616314,0.0001404516,0.0005421294,0.00001494125,0.0005265186,0.0002968748,0.000259826,0.0001465738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003707313,"about_ca_system_score_gemma":0.000005734417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002155732,"about_ca_topic_score_gemma":0.00003710892,"domain_scores_codex":[0.9980339,0.00009759736,0.0003647597,0.000445772,0.0002553131,0.0008026989],"domain_scores_gemma":[0.9989938,0.0001052757,0.0001571013,0.0005549719,0.00006105041,0.0001277837],"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.000003762371,0.0001035353,0.01495459,0.0000165576,0.0001040697,0.00005533133,0.0009663054,0.07595698,0.00002763628,0.6423872,0.2464674,0.01895666],"study_design_scores_gemma":[0.0002011649,0.00002255971,0.0001191903,0.00004622521,0.000001817287,0.00003464357,0.0000547823,0.9507793,0.00001480594,0.0004013203,0.04811044,0.0002137233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001693672,0.0008577305,0.9410951,0.0006858082,0.002215719,0.0001232053,1.249136e-7,0.0004964637,0.05283219],"genre_scores_gemma":[0.9762097,0.00003881664,0.01591803,0.001484534,0.001322175,0.00001747176,6.598622e-7,0.00001698804,0.004991638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.974516,"threshold_uncertainty_score":0.6591138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02651107372174305,"score_gpt":0.227147550024365,"score_spread":0.2006364763026219,"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."}}