{"id":"W2153332319","doi":"10.1109/pccc.1988.10100","title":"Effective algorithms for partitioning distributed programs","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Dataflow; Computer science; Distributed algorithm; Partition (number theory); Algorithm; Graph partition; Simulated annealing; Software; Graph; Theoretical computer science; Distributed computing; Parallel computing; Programming language; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002666071,0.00007540196,0.00008395893,0.00003139845,0.0001470984,0.0001373789,0.0001975317,0.0000345144,0.000003217887],"category_scores_gemma":[0.00008266216,0.00006623309,0.00004768471,0.00024447,0.00001642273,0.0001565498,0.00003005564,0.00003946087,0.000006102269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002300459,"about_ca_system_score_gemma":0.00001958433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003619999,"about_ca_topic_score_gemma":6.700037e-7,"domain_scores_codex":[0.9993489,0.0000514542,0.000111396,0.0002204326,0.00007816964,0.0001896318],"domain_scores_gemma":[0.9995314,0.00008381066,0.00004086675,0.0001864012,0.0001094076,0.00004808594],"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.00000310063,0.0001628409,0.0007667023,0.00001464481,0.00002537494,0.000001938024,0.0001658879,0.004374293,0.00003654306,0.8455027,0.00466576,0.1442802],"study_design_scores_gemma":[0.0005463256,0.0003107738,0.0002621215,0.00002340917,0.000005231061,0.00001191371,0.00001340639,0.8987305,0.01864915,0.03926955,0.04189067,0.0002869627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001377637,0.00002337975,0.9950092,0.0001127382,0.00009870228,0.000456786,0.000001178867,0.0008725317,0.003287666],"genre_scores_gemma":[0.1878498,0.000001550327,0.8115948,0.00009096981,0.00001628785,0.0002212014,0.00001521152,0.000004473126,0.0002056716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8943562,"threshold_uncertainty_score":0.2700907,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02162528306342611,"score_gpt":0.2811582664663851,"score_spread":0.259532983402959,"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."}}