{"id":"W4413104855","doi":"10.1109/tifs.2025.3597501","title":"Toward Efficient and Secure Hypercube Tree Building for Vertically Distributed Data in Cloud","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Hypercube; Distributed computing; Distributed database; Tree (set theory); Computer security; Parallel computing; Operating system","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.001833775,0.0004070726,0.0007598845,0.0008103247,0.001648573,0.001740304,0.001510342,0.0008979513,0.001307614],"category_scores_gemma":[0.003960968,0.0003416364,0.0008085064,0.001777021,0.001507212,0.004634443,0.004515921,0.001382513,0.0005133496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00149863,"about_ca_system_score_gemma":0.002688682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002019025,"about_ca_topic_score_gemma":0.001505632,"domain_scores_codex":[0.9973589,0.000754318,0.0002118003,0.0003028314,0.001028017,0.0003442844],"domain_scores_gemma":[0.9967948,0.0006335791,0.0003757199,0.001520201,0.0004949424,0.0001807802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000992632,0.0003011203,0.00380694,0.00035963,0.0001203825,0.0005851515,0.001256963,0.2969452,0.08023619,0.3627928,0.01009306,0.24251],"study_design_scores_gemma":[0.00009627432,0.0001655575,0.0003872455,0.00002266353,0.00002226477,0.0002682829,0.0002850428,0.8801438,0.03107587,0.07913431,0.00834938,0.00004946499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05652845,0.0003534212,0.9382927,0.0005291955,0.00005354771,0.0002416096,0.0001728996,0.0007634865,0.003064664],"genre_scores_gemma":[0.6766683,0.0003383509,0.320282,0.0001727262,0.0000382905,0.0002245831,0.0004137366,0.00007502989,0.001786908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002019025,"threshold_uncertainty_score":0.01087332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01535002324143416,"score_gpt":0.2452531821420352,"score_spread":0.229903158900601,"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."}}