{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001161441,0.0002270846,0.0002074673,0.0001042042,0.0003676892,0.00004592516,0.0002454227,0.0001959945,0.000003719672],"category_scores_gemma":[0.000005355163,0.0002039668,0.0002326319,0.000127533,0.00005281925,0.000003189673,0.000007149291,0.000158968,0.000006515807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005541697,"about_ca_system_score_gemma":0.00005771875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002096564,"about_ca_topic_score_gemma":0.00001744763,"domain_scores_codex":[0.9986997,0.00004358998,0.0002844865,0.0005121974,0.0001061463,0.0003538464],"domain_scores_gemma":[0.9994318,0.0001172752,0.00006524263,0.0002405972,0.00006271385,0.00008230819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001298388,0.001153804,0.0000116991,0.00006405034,0.0003713967,0.00001452097,0.00004929725,0.690864,0.1749675,0.007510837,0.0007121356,0.1229823],"study_design_scores_gemma":[0.004050322,0.005595156,0.0001027973,0.0002493015,0.000108595,0.00005538679,0.00003161405,0.2633213,0.722951,0.001564583,0.001106005,0.0008639257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3531983,0.0000156259,0.6453133,0.0001695456,0.0009098132,0.0002631875,0.00001701619,0.00004861113,0.0000646046],"genre_scores_gemma":[0.9854094,0.00001232144,0.01215388,0.002151757,0.0001250355,0.00002415175,0.00003765656,0.000014641,0.00007111535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6331594,"threshold_uncertainty_score":0.8317527,"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."}}