{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008010013,0.0003109435,0.0004142956,0.002944972,0.0006020425,0.0003976627,0.001631026,0.0004118948,0.00001364367],"category_scores_gemma":[0.00005559447,0.0003515948,0.0002346205,0.002549068,0.00007566416,0.0004266353,0.0001638187,0.001647082,0.00006008758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009004746,"about_ca_system_score_gemma":0.0005324867,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02443423,"about_ca_topic_score_gemma":0.04483405,"domain_scores_codex":[0.9960166,0.0008114387,0.0003872762,0.001014558,0.0009026846,0.0008674473],"domain_scores_gemma":[0.9980869,0.0004478202,0.0002148435,0.0008331254,0.0002415623,0.0001757962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0007717594,0.0005810634,0.02099289,0.000428836,0.0002061376,0.01166016,0.001823768,0.002040247,0.002768502,0.9262331,0.02636951,0.006124039],"study_design_scores_gemma":[0.01077888,0.007971012,0.4495184,0.009939403,0.0001325256,0.000566549,0.01271274,0.09838555,0.05230888,0.1010084,0.2475275,0.009150213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5186224,0.00008442147,0.0005993078,0.0000868036,0.002623975,0.0003864708,0.000001646185,0.0001461026,0.4774489],"genre_scores_gemma":[0.891925,0.00001924672,0.00002705492,0.000006872404,0.0002642888,0.000004816992,0.00002802312,0.00002801649,0.1076967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8252247,"threshold_uncertainty_score":0.9998936,"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."}}