{"id":"W2128282831","doi":"10.1109/iv.2006.29","title":"Broadcasting in Optimal Bipartite Double Loop Graphs","year":2006,"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":"Bipartite graph; Vertex (graph theory); Combinatorics; Computer science; Complete bipartite graph; Graph; Algorithm; Discrete mathematics; Mathematics; Topology (electrical circuits)","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.0002537309,0.00007664945,0.0001013279,0.0001224722,0.00005686655,0.0001693748,0.0002647905,0.00003942774,0.0000353865],"category_scores_gemma":[0.000002197022,0.00006556644,0.0000444448,0.0004590458,0.00001155921,0.0003320297,0.00007353225,0.00007727493,0.00007384789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002011277,"about_ca_system_score_gemma":0.00001224864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001080886,"about_ca_topic_score_gemma":0.0004777161,"domain_scores_codex":[0.9991444,0.00002527813,0.000243654,0.0002275951,0.000114738,0.0002442762],"domain_scores_gemma":[0.9996582,0.00002790413,0.0000422884,0.0002072305,0.00003529733,0.00002912789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001179112,0.00008567733,0.01526136,0.000009861212,0.000005962168,0.00003070858,0.0002210619,0.0661933,0.0008681713,0.901795,0.01050849,0.005008648],"study_design_scores_gemma":[0.0009040986,0.00005759809,0.00299697,0.0000445958,0.000001163041,0.00004358029,0.00004998022,0.9819512,0.002477067,0.002292902,0.008918815,0.0002620332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4387757,0.00007899284,0.4845155,0.0002322419,0.0007725383,0.0001114883,1.378623e-7,0.0001946228,0.0753187],"genre_scores_gemma":[0.9903273,9.343895e-7,0.005638304,0.00009116258,0.0001036361,0.000009932231,5.975601e-7,0.000004175624,0.003823984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9157579,"threshold_uncertainty_score":0.2673722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01652679152352382,"score_gpt":0.2317679747675777,"score_spread":0.2152411832440539,"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."}}