{"id":"W1568102860","doi":"10.1007/978-3-540-73545-8_37","title":"Linear Algorithm for Broadcasting in Unicyclic Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Broadcasting (networking); Graph; Time complexity; Graph algorithms; Algorithm; Upper and lower bounds; Connectivity; Theoretical computer science; Combinatorics; Discrete mathematics; Computer network; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002195465,0.0005107283,0.0006293659,0.001544171,0.0002477035,0.0003853984,0.002547709,0.0004599389,0.000009312743],"category_scores_gemma":[0.00007296082,0.0004811013,0.0002156986,0.001040227,0.0003101408,0.0004751068,0.000675747,0.0008826648,0.0000165895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003236405,"about_ca_system_score_gemma":0.0002732621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007637795,"about_ca_topic_score_gemma":0.0003595166,"domain_scores_codex":[0.9959275,0.00003957823,0.0008649676,0.001543936,0.000697618,0.0009263805],"domain_scores_gemma":[0.9973115,0.0008856904,0.0003461349,0.0009980561,0.0002998746,0.0001587895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002358859,0.00001695433,0.00002162387,0.00002053087,0.000006489201,0.00005566837,0.000357689,0.01745122,0.00001120735,0.01254815,0.00002171285,0.9694864],"study_design_scores_gemma":[0.0003523841,0.0001651149,0.0000208584,0.000540733,0.000002968772,0.0000965804,3.403902e-7,0.9540834,0.0001559205,0.03987641,0.004178964,0.000526317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003108547,0.0004238992,0.9912388,0.0001538795,0.004330888,0.0006283389,0.000004553027,0.0001356044,0.003052985],"genre_scores_gemma":[0.0208023,0.00003605556,0.9751356,0.001528532,0.001486979,0.00002645056,0.000006934142,0.00005744903,0.0009196572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9689601,"threshold_uncertainty_score":0.9997641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03335498008116616,"score_gpt":0.2787867915580713,"score_spread":0.2454318114769052,"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."}}