{"id":"W96860797","doi":"","title":"On K-broadcasting in graphs","year":2006,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Vertex (graph theory); Graph; Computer science; Combinatorics; Network topology; Upper and lower bounds; Connectivity; Mathematics; Discrete mathematics; Computer network","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.001268195,0.001805551,0.001505865,0.002278463,0.00213332,0.003141516,0.001561985,0.00142085,0.008611296],"category_scores_gemma":[0.005968988,0.0008429813,0.001332803,0.006120953,0.003690824,0.007031431,0.002459735,0.004451415,0.002982684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00328312,"about_ca_system_score_gemma":0.001291284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003636569,"about_ca_topic_score_gemma":0.002999803,"domain_scores_codex":[0.9985107,0.0004513812,0.00008526201,0.000343155,0.0004090138,0.0002005297],"domain_scores_gemma":[0.9954211,0.003295765,0.0002482758,0.0004657471,0.0003661353,0.0002030918],"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.00009996966,0.00005688001,0.000234016,0.0004762146,0.00003943176,0.0001307209,0.0004902176,0.04872533,0.00162543,0.8728613,0.01636993,0.05889054],"study_design_scores_gemma":[0.00003678197,0.00003555667,0.0002077004,0.00009184849,0.00002618074,0.0001393986,0.00009601546,0.03363173,0.0006780197,0.9376463,0.02738792,0.00002256535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.03517142,0.0104816,0.8173685,0.005800245,0.0006558372,0.0003369007,0.001254795,0.0009113092,0.1280194],"genre_scores_gemma":[0.4006861,0.04492688,0.4873615,0.003763467,0.002919567,0.001483663,0.004007951,0.001238868,0.05361203],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.008611296,"threshold_uncertainty_score":0.02880764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02373778545448986,"score_gpt":0.2686477532914049,"score_spread":0.2449099678369151,"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."}}