{"id":"W15772922","doi":"10.1007/978-3-319-08016-1_1","title":"Broadcast Problem in Hypercube of Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Hypercube; Vertex (graph theory); Broadcasting (networking); Time complexity; Tree (set theory); Theoretical computer science; Node (physics); Spanning tree; K-ary tree; Graph; Discrete mathematics; Binary tree; Combinatorics; Algorithm; Computer network; Tree structure; Mathematics; Parallel computing","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.0005610848,0.0003792009,0.00111344,0.0006085226,0.001028809,0.002020555,0.001189,0.001497803,0.005422025],"category_scores_gemma":[0.002829391,0.0004155819,0.0004622754,0.001429792,0.0008064751,0.003020105,0.001152242,0.001692541,0.0005688971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001285937,"about_ca_system_score_gemma":0.0007633167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001873208,"about_ca_topic_score_gemma":0.001284482,"domain_scores_codex":[0.9995259,0.0001678416,0.00002423221,0.00009201899,0.00009827521,0.00009181457],"domain_scores_gemma":[0.9987205,0.0008903908,0.00008625278,0.0000867273,0.0001132476,0.0001029121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007896114,0.0001669926,0.0006467131,0.001610064,0.00009762723,0.000410108,0.0006047828,0.2191458,0.006863022,0.6176329,0.05451515,0.09751727],"study_design_scores_gemma":[0.0001679131,0.00008226998,0.0004150414,0.0001177088,0.00003995686,0.0002558594,0.0004167354,0.312763,0.002694855,0.6676077,0.01541176,0.00002718552],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2966781,0.01219443,0.5476876,0.009305223,0.001149057,0.0003576942,0.002229678,0.0008627796,0.1295355],"genre_scores_gemma":[0.8177617,0.007966996,0.1097286,0.0006667116,0.00108959,0.0004184318,0.002223099,0.0003351271,0.05980971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005422025,"threshold_uncertainty_score":0.01813847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01462545395019798,"score_gpt":0.2249918386913692,"score_spread":0.2103663847411712,"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."}}