{"id":"W7110127072","doi":"10.4230/lipics.esa.2025.44","title":"Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Steiner tree problem; Vertex (graph theory); Upper and lower bounds; Graph; Connectivity; Vertex connectivity; Set (abstract data type); Spanning tree; Terminal (telecommunication)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007918389,0.000490817,0.000653489,0.0003063524,0.0009177036,0.0009705815,0.001873038,0.0002536667,0.00001933848],"category_scores_gemma":[0.0001954855,0.0004558057,0.0004678205,0.0006855642,0.0002317505,0.001806022,0.0007758257,0.0004336187,0.00005442699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001354457,"about_ca_system_score_gemma":0.0002227339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002867538,"about_ca_topic_score_gemma":0.00002827024,"domain_scores_codex":[0.9969435,0.00004943622,0.001060177,0.0004874605,0.0004486736,0.001010747],"domain_scores_gemma":[0.9972507,0.0005930583,0.000316886,0.001167455,0.0004723363,0.0001996074],"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.0005545579,0.001734243,0.002877845,0.002350346,0.00106652,0.0000140917,0.01382373,0.003733983,0.0001883659,0.7129101,0.04640848,0.2143378],"study_design_scores_gemma":[0.004406652,0.0003465409,0.0006098651,0.0001928173,0.00004612497,0.00002100522,0.000310673,0.773192,0.001078207,0.009234424,0.2099584,0.0006033317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09793478,0.00008252388,0.8925412,0.001197417,0.002350865,0.001816354,0.0005947183,0.0004104002,0.003071791],"genre_scores_gemma":[0.6974902,0.00002544566,0.2950133,0.004566794,0.0001895593,0.0006503128,0.0003345061,0.0000590942,0.001670778],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.769458,"threshold_uncertainty_score":0.9997894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01448897541334115,"score_gpt":0.2719693866260893,"score_spread":0.2574804112127481,"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."}}