{"id":"W4364322167","doi":"10.1109/tsusc.2023.3263172","title":"Critical Path Awareness Techniques for Large-Scale Graph Partitioning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Graph partition; Computer science; Critical path method; Longest path problem; Graph; Partition (number theory); Theoretical computer science; Parallel computing; Algorithm; Mathematics; Shortest path problem; Combinatorics; Engineering","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005064504,0.0002165874,0.0002352945,0.0004088195,0.0007388158,0.0001217997,0.00015759,0.0001512568,0.00002113336],"category_scores_gemma":[0.00002126915,0.000246354,0.0001592496,0.0007885989,0.00003669985,0.0002409106,0.000003178547,0.0002692196,0.00001338653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236344,"about_ca_system_score_gemma":0.0000366586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001670253,"about_ca_topic_score_gemma":0.000004279875,"domain_scores_codex":[0.9984104,0.0000359625,0.0002974901,0.0002864863,0.0001590753,0.0008106105],"domain_scores_gemma":[0.9990963,0.0003325833,0.00002151059,0.0002386528,0.0002124785,0.00009846532],"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.0001473884,0.0009157066,0.0003129398,0.007661114,0.0003559706,0.0004304969,0.006955015,0.6898416,0.01521779,0.02895901,0.0313655,0.2178375],"study_design_scores_gemma":[0.0004491945,0.0002579205,0.00007461991,0.0003067034,0.00006723339,0.00001856216,0.004378219,0.7729696,0.202633,0.0105028,0.007577051,0.0007650512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007540721,0.00003993026,0.9849538,0.00007638805,0.0003063415,0.0004881121,0.00003340011,0.005890393,0.0006709665],"genre_scores_gemma":[0.9864771,0.00003568691,0.01267645,0.00005434328,0.0001057547,0.0002996069,0.00001191206,0.00008061055,0.0002585558],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9789364,"threshold_uncertainty_score":0.9999989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01474360344344892,"score_gpt":0.2775236043878273,"score_spread":0.2627800009443784,"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."}}