{"id":"W2090342193","doi":"10.1006/jpdc.2001.1772","title":"Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Gray code; Computer science; Routing algorithm; Algorithm; Port (circuit theory); Code (set theory); Path length; Parallel computing; Routing (electronic design automation); Topology (electrical circuits); Combinatorics; Mathematics; Computer network; Routing protocol","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.000343821,0.0001920306,0.0003889196,0.0004719498,0.0007543406,0.0009149017,0.0008231547,0.0003254653,0.004457969],"category_scores_gemma":[0.002415318,0.0001691583,0.00021755,0.001123156,0.0008504008,0.00153134,0.001166875,0.0004349928,0.0004771315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007652164,"about_ca_system_score_gemma":0.0006603112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289734,"about_ca_topic_score_gemma":0.002376976,"domain_scores_codex":[0.9996738,0.00007086092,0.00002657829,0.00005094286,0.0001077627,0.00007004123],"domain_scores_gemma":[0.9989288,0.0003595891,0.000147577,0.0003238675,0.0001727616,0.00006737979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002635106,0.0001483552,0.002775294,0.0002234461,0.00004732885,0.0004634789,0.001068476,0.1299459,0.05423659,0.5658977,0.007248302,0.2353101],"study_design_scores_gemma":[0.0001713592,0.0006498137,0.002025336,0.00009353289,0.00005402747,0.0006493893,0.001101023,0.5117922,0.08786439,0.3741112,0.02137424,0.0001133241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6498111,0.001080963,0.3224427,0.0007430121,0.0002769273,0.000115985,0.0002057923,0.001012862,0.02431061],"genre_scores_gemma":[0.9430163,0.0002168007,0.04935921,0.0001782519,0.00003504871,0.00006273245,0.0001701818,0.000155723,0.006805829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004457969,"threshold_uncertainty_score":0.01491344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05587485102720893,"score_gpt":0.2706970786035242,"score_spread":0.2148222275763152,"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."}}