{"id":"W1558936245","doi":"10.1007/0-306-47015-2_38","title":"An Efficient Transposition Algorithm for Distributed Memory Computers","year":2005,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Data exchange; Hypercube; Intel iPSC; Algorithm; Transposition (logic); Ethernet; Computer network","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":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005632889,0.0008964025,0.0007947176,0.0006708518,0.0003070837,0.0006207575,0.005182468,0.001840035,0.00001886528],"category_scores_gemma":[0.00003847133,0.0009430904,0.0003435099,0.00009753366,0.0004731381,0.002211499,0.0005155486,0.002176969,0.00002980177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006969121,"about_ca_system_score_gemma":0.0002433774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000483807,"about_ca_topic_score_gemma":0.000002190038,"domain_scores_codex":[0.9954472,0.00003924925,0.0009151931,0.00180689,0.0008318383,0.0009596195],"domain_scores_gemma":[0.9965019,0.0002153136,0.0006039415,0.002023413,0.0002946989,0.0003607352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001575604,0.00002724454,2.149931e-7,0.00003802273,0.00009998312,0.00003315575,0.0002896708,0.001217347,0.0001018066,0.1079955,0.03298564,0.8571956],"study_design_scores_gemma":[0.00180891,0.000371622,0.000005724999,0.0003230231,0.0001552312,0.00010918,0.00005813684,0.2273364,0.000981162,0.06693818,0.6997169,0.002195571],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001002958,0.0004673874,0.9572424,0.0009027474,0.00140165,0.001401283,0.001398318,0.002846619,0.03432961],"genre_scores_gemma":[0.001485932,0.00004619094,0.8984313,0.003062929,0.001769135,0.0005076312,0.004847035,0.0003982176,0.08945161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8550001,"threshold_uncertainty_score":0.9994558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01723482872307918,"score_gpt":0.2518102786940013,"score_spread":0.2345754499709221,"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."}}