{"id":"W3168603277","doi":"10.1007/s11227-021-03872-8","title":"Node-to-set disjoint paths problem in cross-cubes","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Young Scientists Fund; Qinglan Project of Jiangsu Province of China; Secretário de Ciência, Tecnologia e Ensino Superior, Governo do Estado de Parana; National Natural Science Foundation of China; Ivey Foundation","keywords":"Hypercube; Disjoint sets; Computer science; Node (physics); Set (abstract data type); Multiprocessing; Binary logarithm; Combinatorics; Cube (algebra); Fault tolerance; Discrete mathematics; Algorithm; Parallel computing; Mathematics; Distributed computing","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485654,0.0001154023,0.0002607923,0.0001119753,0.0001648021,0.0003102987,0.0007610755,0.00004377392,0.0000139593],"category_scores_gemma":[0.00009505745,0.00007597813,0.0001134981,0.0005195137,0.00002388472,0.0004185846,0.0003341928,0.000370987,0.00002275095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007916308,"about_ca_system_score_gemma":0.00010052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005639366,"about_ca_topic_score_gemma":0.00003445613,"domain_scores_codex":[0.9982041,0.0003051376,0.000728592,0.000153957,0.0003135782,0.0002947006],"domain_scores_gemma":[0.9988449,0.0002699156,0.000152292,0.0002978594,0.0003481562,0.00008693285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000082867,0.0003623168,0.0513464,0.0001457469,0.0001606542,0.00111955,0.07091975,0.7726028,0.02038095,0.01816712,0.007051573,0.05766025],"study_design_scores_gemma":[0.001767816,0.0004539181,0.03855438,0.002052467,0.0000220821,0.007881524,0.004822286,0.9242213,0.006187343,0.004534711,0.008819983,0.000682234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7080579,0.0003006647,0.2883947,0.001549854,0.001014677,0.00006581072,4.812915e-7,0.00001728942,0.0005986475],"genre_scores_gemma":[0.9854541,0.00001380878,0.01343659,0.0005657062,0.0004451337,6.430205e-7,2.243e-7,0.000008623387,0.0000751459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2773962,"threshold_uncertainty_score":0.3098298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02239313908233203,"score_gpt":0.2764948250590445,"score_spread":0.2541016859767125,"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."}}