{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485772,0.0006114041,0.0009184417,0.0007641194,0.001034955,0.001306804,0.001521168,0.001211848,0.002656415],"category_scores_gemma":[0.00499252,0.0004408632,0.0004617262,0.001167523,0.001105445,0.003447785,0.002083022,0.001553184,0.0006632904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001813908,"about_ca_system_score_gemma":0.0008325093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00078207,"about_ca_topic_score_gemma":0.001013283,"domain_scores_codex":[0.9987693,0.0002513019,0.00008727301,0.0003145853,0.0004057723,0.0001716831],"domain_scores_gemma":[0.9958237,0.001516732,0.0005589298,0.001601081,0.0003007439,0.0001988073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002723446,0.0002788429,0.002159701,0.0005786619,0.00006715357,0.0003361562,0.0008372805,0.2860672,0.124195,0.2181853,0.01093879,0.3536323],"study_design_scores_gemma":[0.0002055213,0.0007468171,0.0008086918,0.00007662621,0.00004773632,0.0003957172,0.000167547,0.7542213,0.04771314,0.1854385,0.01010004,0.0000783215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2030334,0.0005878411,0.7853176,0.0007636347,0.00009304102,0.0001633729,0.001012366,0.002976303,0.00605234],"genre_scores_gemma":[0.6800376,0.000216788,0.3158236,0.0002057583,0.00006644985,0.0002158822,0.0009828757,0.000205968,0.002245084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002656415,"threshold_uncertainty_score":0.01316082,"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."}}