{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002995647,0.001430743,0.003103397,0.00185122,0.002138021,0.006682588,0.003574186,0.003166647,0.01638924],"category_scores_gemma":[0.03604354,0.001050043,0.00165257,0.003622348,0.002939984,0.01549336,0.00360456,0.006262868,0.001216019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00469214,"about_ca_system_score_gemma":0.003536743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006468339,"about_ca_topic_score_gemma":0.005085547,"domain_scores_codex":[0.9962187,0.001240191,0.0001776951,0.0006187747,0.001056556,0.0006879902],"domain_scores_gemma":[0.9382955,0.05526505,0.001869164,0.001804552,0.001520988,0.001244746],"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.001587836,0.0004777727,0.00325317,0.001021274,0.0002408232,0.0003647614,0.0007644315,0.3072306,0.002361147,0.5860009,0.04231258,0.05438471],"study_design_scores_gemma":[0.0001531611,0.0000461924,0.000595656,0.00004853051,0.00005406112,0.0001031245,0.0001778003,0.3416393,0.0003713993,0.6541972,0.002581571,0.00003213409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3941509,0.009810385,0.4286939,0.04029216,0.001321875,0.0004365494,0.005971835,0.00105606,0.1182663],"genre_scores_gemma":[0.9125282,0.005361402,0.0566415,0.001409317,0.001914792,0.0004450885,0.003531219,0.0005839486,0.01758456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01638924,"threshold_uncertainty_score":0.05482739,"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."}}