{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730025,0.00009867393,0.0001113622,0.0005787431,0.0005454575,0.0002544161,0.0007217075,0.00004898687,0.00001738249],"category_scores_gemma":[0.00005215548,0.00008097792,0.00009305326,0.001645455,0.00008292951,0.0001165039,0.0001676891,0.0001600666,0.00006508089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000023695,"about_ca_system_score_gemma":0.00005046745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001184118,"about_ca_topic_score_gemma":0.000002156373,"domain_scores_codex":[0.9985451,0.0001272287,0.0001800292,0.0004249873,0.0003006958,0.0004219794],"domain_scores_gemma":[0.9985954,0.0006854783,0.00002695877,0.0004463338,0.0001779041,0.00006792336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009689277,0.0001088655,0.0000195044,0.00001411774,0.00001167139,0.000003044641,0.00008780182,0.002454,0.00005074176,0.9723141,0.002562017,0.02236441],"study_design_scores_gemma":[0.0007800196,0.0003482024,0.0006689812,0.0001288919,0.000007761416,0.000002789786,0.0004009568,0.4201081,0.0165479,0.5504841,0.01026268,0.000259634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01052979,0.0001259635,0.9688134,0.001400341,0.0005921542,0.0003360239,0.000003489713,0.0001935055,0.01800534],"genre_scores_gemma":[0.8888925,0.00001908952,0.1056793,0.0007202612,0.0001005758,0.0002376921,0.000003870561,0.000009212467,0.004337519],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8783627,"threshold_uncertainty_score":0.4195273,"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."}}