{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001018747,0.0005623261,0.0004409532,0.0009483214,0.00043785,0.0009056694,0.001513856,0.0004353106,0.0001304535],"category_scores_gemma":[0.00004840549,0.0004820622,0.0002239032,0.0006012315,0.0004536372,0.0004396178,0.0002435055,0.0008675118,0.0002060914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00035773,"about_ca_system_score_gemma":0.0002713281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002136004,"about_ca_topic_score_gemma":0.0000776953,"domain_scores_codex":[0.996069,0.00007191431,0.0005466726,0.001718888,0.0009552448,0.0006382628],"domain_scores_gemma":[0.9972415,0.000348145,0.0003488227,0.0015407,0.0003518416,0.0001689949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003342642,0.0003131799,0.00003059237,0.00009197681,0.00004979607,0.0001159546,0.000696103,0.1837466,0.0005206987,0.04830946,0.002536323,0.7632551],"study_design_scores_gemma":[0.0003779067,0.00228879,0.00003823111,0.0006448583,0.000007118976,0.00001840167,1.30829e-7,0.9452829,0.0005141431,0.04278839,0.007437694,0.0006014159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002000912,0.00004806177,0.9798898,0.0004553678,0.01233413,0.000443533,0.000004405695,0.0002110008,0.00641366],"genre_scores_gemma":[0.9594378,0.000011004,0.02563971,0.009751916,0.003618792,0.00004075113,0.00001606882,0.00007128495,0.001412701],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9592377,"threshold_uncertainty_score":0.9997631,"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."}}