{"id":"W4410403751","doi":"10.1007/s10878-025-01308-0","title":"Better approximating SONET k-edge partition for small capacity k","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Synchronous optical networking; Partition (number theory); Theory of computation; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Discrete mathematics; Parallel computing; Computer network; Algorithm; Telecommunications","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.0009345866,0.00009674616,0.0002019565,0.0001773733,0.0001528751,0.0001547459,0.0003607741,0.00007606208,0.000004340888],"category_scores_gemma":[0.0002216229,0.00008561727,0.0001233447,0.0003377009,0.00002451266,0.0005640832,0.00004309714,0.0001356137,7.783811e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004461749,"about_ca_system_score_gemma":0.00006705195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.127188e-7,"about_ca_topic_score_gemma":6.387486e-8,"domain_scores_codex":[0.9990168,0.0001073656,0.0004628269,0.0001191445,0.0001476985,0.000146212],"domain_scores_gemma":[0.9987978,0.0001628037,0.0004150151,0.0001454129,0.0004317908,0.00004711782],"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.00009397461,0.000286864,0.0001646564,0.00008237474,0.00008472179,0.000003029042,0.0005353944,0.0970379,0.0005411875,0.8896942,0.001304775,0.01017092],"study_design_scores_gemma":[0.001930873,0.0002269035,0.00005971385,0.00009604953,0.0000369207,0.000008739859,0.00001899633,0.4996078,0.00497025,0.4920588,0.0008585597,0.0001264616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006985934,0.00003072359,0.9868953,0.0007099036,0.00480189,0.0001617314,0.000001330511,0.00002706071,0.0003860937],"genre_scores_gemma":[0.1958101,0.000007457507,0.803435,0.000269736,0.0004154961,0.00001137778,0.000003851251,0.000007443046,0.00003952504],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4025699,"threshold_uncertainty_score":0.3491371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01526299948637402,"score_gpt":0.2321040588423008,"score_spread":0.2168410593559268,"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."}}