{"id":"W2799267740","doi":"10.1007/978-3-319-78825-8_18","title":"Improved Lower Bound on Broadcast Function Based on Graph Partition","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Computer science; Graph; Discrete mathematics; Broadcasting (networking); Connectivity; 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.002549767,0.002954481,0.004129454,0.00350411,0.002282469,0.005003678,0.006364436,0.002868571,0.02147705],"category_scores_gemma":[0.01100116,0.0009944342,0.0024274,0.004743486,0.002498711,0.009203402,0.004626258,0.005590816,0.003958113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006031878,"about_ca_system_score_gemma":0.004231628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004198692,"about_ca_topic_score_gemma":0.004818473,"domain_scores_codex":[0.9965459,0.0008017193,0.00009534967,0.0005843912,0.001070066,0.0009026644],"domain_scores_gemma":[0.9918804,0.005477239,0.000229106,0.001211411,0.0008108235,0.0003910397],"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.002900999,0.0008641678,0.001729959,0.0023267,0.000333819,0.000383405,0.0007580934,0.2373063,0.01957502,0.4147223,0.09493176,0.2241676],"study_design_scores_gemma":[0.0001972574,0.000273949,0.001007387,0.0002071512,0.0003483681,0.0003543042,0.0001888431,0.7522517,0.006098324,0.2259692,0.01301965,0.00008396079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06420839,0.01084766,0.8289111,0.004126194,0.001519406,0.0004658712,0.001954034,0.004009223,0.08395816],"genre_scores_gemma":[0.6602939,0.007117547,0.268693,0.002104913,0.002207482,0.001383038,0.00428074,0.00219012,0.05172929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02147705,"threshold_uncertainty_score":0.07184786,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01533656119422659,"score_gpt":0.2250350101974963,"score_spread":0.2096984490032697,"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."}}