{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003200043,0.003974525,0.00319945,0.001601142,0.001758294,0.004609778,0.007975317,0.003580046,0.01542769],"category_scores_gemma":[0.02281608,0.001443374,0.001884255,0.003494979,0.002534436,0.01387198,0.006645672,0.006924833,0.003412351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002914458,"about_ca_system_score_gemma":0.002215836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001969351,"about_ca_topic_score_gemma":0.004226463,"domain_scores_codex":[0.9951676,0.001068331,0.0001892511,0.001112239,0.001360965,0.001101648],"domain_scores_gemma":[0.9791531,0.01399074,0.001422208,0.003216385,0.0009783086,0.001239377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003255778,0.001125619,0.002870124,0.002073125,0.000361689,0.000655231,0.0006668767,0.4852506,0.01299173,0.3052598,0.06889875,0.1165906],"study_design_scores_gemma":[0.0002773658,0.0002773661,0.000897166,0.000112034,0.0001154677,0.0004966951,0.0002017082,0.5862082,0.003013204,0.399944,0.008408033,0.00004872867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1607482,0.004622215,0.7224971,0.01280877,0.0005980401,0.0003737312,0.007299265,0.005998348,0.08505426],"genre_scores_gemma":[0.7999932,0.00272023,0.1709497,0.003635091,0.0009781348,0.0006125608,0.00547016,0.001568987,0.01407191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01542769,"threshold_uncertainty_score":0.05161083,"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."}}