{"id":"W786724073","doi":"10.1016/j.dam.2015.05.004","title":"On the complexity of the shortest-path broadcast problem","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Shortest path problem; Multiplicative function; Longest path problem; Mathematics; Combinatorics; Time complexity; Computer science; Discrete mathematics; Graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006466247,0.0001369013,0.0002024398,0.00002073325,0.000126407,0.00009212,0.001084107,0.00004534743,0.00001021543],"category_scores_gemma":[0.00003738162,0.0000652419,0.00008679907,0.0002559548,0.0001812673,0.00005276026,0.0002749136,0.0001539508,0.00004238292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002925114,"about_ca_system_score_gemma":0.00004151774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034857,"about_ca_topic_score_gemma":0.000006576839,"domain_scores_codex":[0.998821,0.00004456749,0.0003425662,0.0001818314,0.0004232643,0.0001868222],"domain_scores_gemma":[0.99853,0.0001632556,0.0002313499,0.0009359033,0.00008393027,0.00005559064],"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.000002234709,0.00004303724,0.000004608611,0.00001704048,0.00001265296,2.587077e-7,0.002732361,0.000475217,0.0001229967,0.9913573,0.004999759,0.0002324805],"study_design_scores_gemma":[0.000251277,0.00007442417,0.00003719108,0.000129596,0.00001269448,0.00001775269,0.00133264,0.2104372,0.001443774,0.7842841,0.00179048,0.0001888882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02142119,0.00002526028,0.7655443,0.002135266,0.0005047845,0.001178391,0.000009100673,0.00012746,0.2090542],"genre_scores_gemma":[0.9843781,6.932196e-7,0.01504378,0.0002631378,0.00005244683,0.00004844372,8.592799e-7,0.00001106058,0.0002014643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9629569,"threshold_uncertainty_score":0.2660488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06746691470365561,"score_gpt":0.2504173971662269,"score_spread":0.1829504824625713,"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."}}