{"id":"W2118812633","doi":"10.1109/aina.2008.83","title":"Near Optimal Broadcasting in Optimal Triple Loop Graphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Loop (graph theory); Mathematics; Vertex (graph theory); 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.0007368771,0.0004329954,0.0008987812,0.0006813665,0.0009969106,0.001284601,0.0009733827,0.0006805255,0.002565308],"category_scores_gemma":[0.006407102,0.0004244207,0.0004125017,0.001146401,0.0008166361,0.002658877,0.001319904,0.0009507005,0.0004031309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144636,"about_ca_system_score_gemma":0.0008572016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002239006,"about_ca_topic_score_gemma":0.002941123,"domain_scores_codex":[0.9992024,0.0001746629,0.00003730009,0.0001571516,0.0001719805,0.0002565345],"domain_scores_gemma":[0.9959929,0.002774916,0.0003248829,0.0003878895,0.0002991603,0.0002201675],"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.001082748,0.0001922712,0.00249337,0.0006651275,0.00007777274,0.0004273876,0.0007809102,0.5822561,0.05578559,0.2326271,0.01290329,0.1107083],"study_design_scores_gemma":[0.00006645327,0.0001531726,0.0006909919,0.00003862156,0.00003726678,0.0002476455,0.0002216058,0.7661064,0.01757011,0.2100913,0.004751752,0.00002473595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4508673,0.001590522,0.5222893,0.0008804813,0.00007062792,0.00009600927,0.0004759791,0.00102137,0.02270839],"genre_scores_gemma":[0.8966409,0.0009098705,0.09828063,0.0002025098,0.00006671165,0.0000923483,0.0005532355,0.0001819193,0.003071806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002565308,"threshold_uncertainty_score":0.01049417,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02690282669708582,"score_gpt":0.2363748432827748,"score_spread":0.209472016585689,"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."}}