{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008093539,0.0001266755,0.000333529,0.00008620736,0.0001386612,0.0002243997,0.0005398532,0.00004925408,0.000004342726],"category_scores_gemma":[0.00005838307,0.0001021828,0.00003498107,0.0002098371,0.00004311308,0.0004525094,0.0002988999,0.0002245761,0.000001096313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000315822,"about_ca_system_score_gemma":0.00001226959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002378366,"about_ca_topic_score_gemma":0.00001669538,"domain_scores_codex":[0.9986132,0.0001207983,0.0005872988,0.0002437678,0.0002057579,0.0002292195],"domain_scores_gemma":[0.999011,0.0001964596,0.000317893,0.0002658471,0.0000703546,0.0001384774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001219683,0.0005442335,0.6162103,0.0004127395,0.0005679972,0.0006893473,0.005391991,0.03289097,0.0002377883,0.02294535,0.1021222,0.2178652],"study_design_scores_gemma":[0.001271495,0.0001646473,0.05590341,0.0003746733,0.0000182172,0.0002957894,0.0002506646,0.9248545,0.000003972668,0.0009532548,0.01568148,0.0002279381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.151435,0.003660646,0.8432568,0.001099004,0.0003163145,0.00006891126,0.00003213124,0.00001734673,0.0001138299],"genre_scores_gemma":[0.994077,0.0001922527,0.005337481,0.00004678294,0.0003119343,3.475179e-7,0.00001132546,0.000004127598,0.00001871078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8919635,"threshold_uncertainty_score":0.4166895,"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."}}