{"id":"W4412171603","doi":"10.1109/tc.2025.3587623","title":"A High-Efficiency Parallel Mechanism for Canonical Polyadic Decomposition on Heterogeneous Computing Platform","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Decomposition; Mechanism (biology); Supercomputer; Computational science; Theoretical computer science; Distributed computing; Chemistry; Physics","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.0007391513,0.001158099,0.0008860264,0.00110263,0.001212746,0.001507216,0.001604242,0.0004910792,0.004394326],"category_scores_gemma":[0.002065703,0.0004104099,0.0008268,0.001976437,0.0007002652,0.00177832,0.001889076,0.00122361,0.001950214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000804189,"about_ca_system_score_gemma":0.002034709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004633702,"about_ca_topic_score_gemma":0.006311478,"domain_scores_codex":[0.9991629,0.0001535408,0.00006855635,0.0001719399,0.0003266806,0.0001163301],"domain_scores_gemma":[0.9991903,0.00009993197,0.00005332658,0.0002668204,0.0003027678,0.00008680906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006302281,0.0002941031,0.002492882,0.0004277548,0.000194642,0.0005089669,0.0003756342,0.2176628,0.06104092,0.09494103,0.04689322,0.5745379],"study_design_scores_gemma":[0.00005978696,0.00006622662,0.0002340634,0.00001251853,0.00002428948,0.0001237375,0.00006044195,0.9628415,0.01235941,0.01384669,0.01033415,0.00003726705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005319004,0.000182803,0.9905918,0.0001122539,0.0001089498,0.00006670004,0.00008472236,0.001613534,0.001920313],"genre_scores_gemma":[0.1998331,0.0003845161,0.7938498,0.0001811745,0.0001632295,0.0003516485,0.000732452,0.0004419237,0.004062141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004633702,"threshold_uncertainty_score":0.01470047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01391536690226055,"score_gpt":0.2733420441649771,"score_spread":0.2594266772627166,"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."}}