{"id":"W4415004213","doi":"10.1109/caibda65784.2025.11183378","title":"Research on Efficient Graph Partitioning Algorithms for Sparse Matrices","year":2025,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Key Research and Development Program of China","keywords":"Graph partition; Sparse matrix; Graph; Computation; Graph algorithms; Partition (number theory); Dense graph; Convergence (economics)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314553,0.001178625,0.001028829,0.001162026,0.000799661,0.001311742,0.001328635,0.0008097485,0.002377416],"category_scores_gemma":[0.006429305,0.000658872,0.0007215339,0.002640337,0.001086918,0.003061172,0.0008845271,0.001955515,0.0008982414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001094265,"about_ca_system_score_gemma":0.00134227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003180073,"about_ca_topic_score_gemma":0.003031464,"domain_scores_codex":[0.9990251,0.000302262,0.00003847289,0.0002321161,0.0003293224,0.00007279305],"domain_scores_gemma":[0.9968619,0.001818784,0.0001682096,0.0004272105,0.0006617163,0.00006230175],"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.0001315133,0.0001757461,0.0009819525,0.00116141,0.0001486822,0.0000749644,0.0003076337,0.3690315,0.01803647,0.2269365,0.008608361,0.3744053],"study_design_scores_gemma":[0.00003948863,0.000117045,0.0004927235,0.0001014914,0.0000388703,0.0001586224,0.00009657998,0.8744736,0.009465449,0.09361849,0.0213721,0.00002555798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009802565,0.003918383,0.9807279,0.0005047933,0.000113626,0.00007008117,0.00006800102,0.0003218373,0.004472721],"genre_scores_gemma":[0.1479475,0.01000633,0.836172,0.0004280295,0.0003251036,0.0001965475,0.000717337,0.000403847,0.003803341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003180073,"threshold_uncertainty_score":0.007953286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06708949888104136,"score_gpt":0.3688071102769035,"score_spread":0.3017176113958622,"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."}}