{"id":"W7128638588","doi":"10.1109/focs63196.2025.00014","title":"Almost Tight Additive Guarantees for k-Edge-Connectivity","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multigraph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Graph; Graph factorization; Connected component; Induced subgraph isomorphism problem; Time complexity; Connectivity","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007342633,0.0005180857,0.0006493698,0.0004300916,0.001146647,0.0006365901,0.001914378,0.0002398464,0.0006832063],"category_scores_gemma":[0.0004003336,0.0005095828,0.0005779502,0.001760495,0.0005071225,0.0008481971,0.001004234,0.0003900529,0.0001072267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133741,"about_ca_system_score_gemma":0.0004895139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000125569,"about_ca_topic_score_gemma":0.0002265652,"domain_scores_codex":[0.996497,0.0001885343,0.0006200203,0.001428605,0.0003434516,0.0009223771],"domain_scores_gemma":[0.9958239,0.002094243,0.0001715292,0.001208549,0.0005474162,0.0001543163],"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.00005675435,0.0003850908,0.00006889172,0.00009050906,0.0001907327,0.00000791764,0.0006754471,0.00000797588,0.00005646502,0.6244352,0.03249029,0.3415347],"study_design_scores_gemma":[0.001983793,0.0005187833,0.003637456,0.0004111264,0.000104565,0.00001422474,0.0003209042,0.4322275,0.01568447,0.2948292,0.2493407,0.0009272362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002042286,0.001034813,0.9182993,0.005676933,0.005278604,0.0012223,0.0002594781,0.0002626379,0.0659237],"genre_scores_gemma":[0.7918273,0.0003633285,0.1498904,0.005565798,0.000886112,0.0004260677,0.00003893298,0.00004263423,0.0509594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7897851,"threshold_uncertainty_score":0.9997356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02057121839299205,"score_gpt":0.282924901054808,"score_spread":0.262353682661816,"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."}}