{"id":"W7110418722","doi":"10.4230/lipics.icalp.2025.10","title":"On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Bounded function; Pathwidth; Vertex (graph theory); Cactus; Simple (philosophy); Indifference graph; Broadcasting (networking); Clique-sum","routes":{"ca_aff":true,"ca_fund":true,"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.0007038046,0.0004085519,0.0005575379,0.0004388428,0.000709644,0.0004620556,0.002452371,0.000142792,0.00003897038],"category_scores_gemma":[0.0003070804,0.0003170873,0.0003534826,0.001242202,0.0004154879,0.0006735511,0.0009806281,0.0005071351,0.00005337227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001010848,"about_ca_system_score_gemma":0.0001237678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002588482,"about_ca_topic_score_gemma":0.0001049061,"domain_scores_codex":[0.9970735,0.0000832201,0.001147659,0.0003867896,0.0006208487,0.0006879282],"domain_scores_gemma":[0.9967207,0.000882962,0.0004325503,0.001477871,0.0003192891,0.0001666098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000161065,0.0005183586,0.001241428,0.0002261597,0.0003108915,0.000003732501,0.009289864,0.0001669366,0.0002705604,0.9453501,0.008262938,0.03419794],"study_design_scores_gemma":[0.004330869,0.0007360124,0.009893387,0.001062643,0.00007633404,0.00001741275,0.002153442,0.179973,0.01330658,0.7471325,0.04013789,0.001179892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4066203,0.00004347677,0.5779939,0.002730577,0.001746109,0.001589985,0.0008626045,0.0002740666,0.008138991],"genre_scores_gemma":[0.9130776,0.000009471157,0.08207694,0.004425724,0.00006075898,0.0001032177,0.0001042239,0.00002151706,0.0001205694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5064573,"threshold_uncertainty_score":0.9999281,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03859456165889973,"score_gpt":0.268461803456187,"score_spread":0.2298672417972873,"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."}}