{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005113271,0.0002665424,0.0004622505,0.0006995761,0.000748152,0.0009855166,0.0005718812,0.0005416498,0.00211973],"category_scores_gemma":[0.003418747,0.0003819415,0.0002788391,0.001001534,0.0006950218,0.00153774,0.0007621043,0.0004592017,0.0003415711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001571908,"about_ca_system_score_gemma":0.0007598375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003200006,"about_ca_topic_score_gemma":0.002576037,"domain_scores_codex":[0.9993016,0.0001957332,0.00002970965,0.0001475002,0.0001468411,0.0001786183],"domain_scores_gemma":[0.998445,0.0007062127,0.0002854873,0.0001603931,0.000229858,0.0001730582],"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.001409749,0.0002474279,0.003774717,0.000418052,0.00006273673,0.0003846809,0.0006211185,0.4046532,0.03641345,0.4583095,0.01224067,0.08146476],"study_design_scores_gemma":[0.0001441125,0.0001958196,0.00167839,0.00004501957,0.0000353716,0.0002776009,0.0002752582,0.5587895,0.008728317,0.4200811,0.009711809,0.00003778456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7128385,0.0007573695,0.2624508,0.000588974,0.0000381884,0.0001002596,0.0008480721,0.0006765596,0.02170127],"genre_scores_gemma":[0.9519204,0.0005107397,0.04122626,0.0001414244,0.00003912444,0.00009980835,0.001133658,0.0001210548,0.004807596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003200006,"threshold_uncertainty_score":0.01140505,"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."}}