{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004844797,0.00006724328,0.0001399554,0.0002199722,0.00007760114,0.00006387556,0.0002798269,0.00003078751,0.00006486152],"category_scores_gemma":[0.00006287418,0.00005352314,0.00005548121,0.0008113343,0.000006230826,0.0001789134,0.00004439458,0.00005234546,0.00001582995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002650288,"about_ca_system_score_gemma":0.000009992592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002059014,"about_ca_topic_score_gemma":0.0002407547,"domain_scores_codex":[0.9991232,0.00009969274,0.0002307044,0.0002872317,0.0001543889,0.0001047705],"domain_scores_gemma":[0.9989238,0.0001396901,0.00009629413,0.0007652267,0.00004313813,0.00003185394],"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.000002955674,0.00005098511,0.001630487,0.000003350146,0.0001882325,0.00008210861,0.0004767715,0.06660949,0.00001302603,0.9281052,0.0007607791,0.002076566],"study_design_scores_gemma":[0.00007714348,0.00005032086,0.0004375153,0.00001123059,0.00003928599,0.00005293842,0.0001986759,0.9985934,0.0001365769,0.0001690253,0.0001606454,0.00007323423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3350881,0.000004538087,0.645987,0.00004409683,0.0003898434,0.00006170118,0.000002510272,0.00004265688,0.01837957],"genre_scores_gemma":[0.9984676,3.651997e-7,0.001057985,0.0001314122,0.00001774027,0.000001114745,0.000007368987,0.000002989086,0.0003134634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9319839,"threshold_uncertainty_score":0.218261,"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."}}