{"id":"W2127112256","doi":"10.1109/pi.1999.806403","title":"On worst case analysis of permutation routing on data manipulators","year":2003,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Time complexity; Routing (electronic design automation); Computer science; Upper and lower bounds; Computational complexity theory; Asymptotically optimal algorithm; Mathematics; Algorithm; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.006550125,0.002144216,0.001959556,0.001898569,0.002251468,0.005309084,0.003563267,0.002426314,0.0128288],"category_scores_gemma":[0.03046972,0.001271308,0.00200311,0.002986964,0.00433486,0.01037361,0.002676999,0.004086897,0.001400066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004014142,"about_ca_system_score_gemma":0.002382584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004362869,"about_ca_topic_score_gemma":0.003958395,"domain_scores_codex":[0.9924124,0.002550515,0.0003290462,0.001380618,0.001607918,0.001719524],"domain_scores_gemma":[0.964256,0.02921887,0.002166979,0.00211001,0.00149658,0.0007514583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007592766,0.000147163,0.001392518,0.0003523822,0.0001113898,0.0003486128,0.0002049997,0.8036845,0.003060048,0.1608699,0.004632578,0.02443667],"study_design_scores_gemma":[0.00003057959,0.00007324073,0.000179841,0.00002573992,0.00004594877,0.0001151214,0.0000565483,0.8682661,0.001404634,0.128271,0.001510425,0.0000207671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09699008,0.002406307,0.86408,0.002754471,0.0002118364,0.0001918389,0.000527171,0.001101969,0.03173638],"genre_scores_gemma":[0.837726,0.001974796,0.1418527,0.0008084095,0.000493312,0.000491021,0.0008448362,0.0008858808,0.01492294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0128288,"threshold_uncertainty_score":0.0429166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06592905243281275,"score_gpt":0.2982802834711162,"score_spread":0.2323512310383035,"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."}}