{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774942,0.001543019,0.002167806,0.001250452,0.002371932,0.004602939,0.003660881,0.003057885,0.01180328],"category_scores_gemma":[0.02263219,0.0009013295,0.001776761,0.00281847,0.002849935,0.009166483,0.003059416,0.005065972,0.001148284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006277361,"about_ca_system_score_gemma":0.003251082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01916095,"about_ca_topic_score_gemma":0.01345279,"domain_scores_codex":[0.9974445,0.0006888006,0.00009934685,0.0006161386,0.0005195607,0.000631487],"domain_scores_gemma":[0.9603639,0.03388836,0.001656385,0.001812015,0.001150175,0.001129139],"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.002255616,0.0006129069,0.008052481,0.001886941,0.0002739633,0.0008692276,0.002780579,0.6122133,0.008171722,0.2242537,0.06545687,0.07317282],"study_design_scores_gemma":[0.0002677844,0.00009313023,0.002030515,0.0001028148,0.000108338,0.0004152301,0.000515716,0.6417851,0.001697236,0.3474812,0.005445814,0.00005719455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7252734,0.006223626,0.1837582,0.02054713,0.0003840328,0.0005974857,0.007878377,0.002712268,0.05262557],"genre_scores_gemma":[0.917339,0.003388329,0.05935502,0.002198671,0.0006004628,0.0005024793,0.006634261,0.0008210332,0.009160826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01916095,"threshold_uncertainty_score":0.0455457,"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."}}