{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000300293,0.0001190778,0.0001781508,0.0001167852,0.000196057,0.0001315467,0.0004429046,0.00006640671,0.00006761398],"category_scores_gemma":[0.00001725692,0.0001049325,0.00008068928,0.0005618352,0.00004197698,0.0004412682,0.000128461,0.0001596471,0.00009429492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003068128,"about_ca_system_score_gemma":0.00005072908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002807541,"about_ca_topic_score_gemma":0.00003641857,"domain_scores_codex":[0.9987568,0.00006612275,0.0003217584,0.0003307098,0.0001866148,0.0003380222],"domain_scores_gemma":[0.999461,0.00005516417,0.00005875734,0.0002931312,0.00005567759,0.00007627084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001200296,0.0006712585,0.04037233,0.00005488114,0.0001003227,0.001549141,0.01932719,0.5800334,0.00116313,0.2428468,0.07215837,0.04160324],"study_design_scores_gemma":[0.0004563266,0.000093544,0.001096182,0.00001842177,6.98417e-7,0.0003214767,0.0001047223,0.9943145,0.0002095137,0.00005200803,0.003161135,0.0001714554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5879856,0.00006763157,0.4005691,0.0001162386,0.0007266494,0.0001117403,2.503942e-7,0.00015491,0.01026784],"genre_scores_gemma":[0.9571862,0.000007093665,0.03975902,0.000186565,0.00008345698,0.00001070116,6.439189e-7,0.000007424621,0.002758921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4142812,"threshold_uncertainty_score":0.4279025,"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."}}