{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00125918,0.0004077599,0.0007118431,0.0009844276,0.00008769421,0.0002362326,0.002635248,0.000322544,0.00001737396],"category_scores_gemma":[0.00003996872,0.00035448,0.0001441875,0.0006410147,0.0003972866,0.0003150809,0.000726249,0.0006171557,0.0000250066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001949948,"about_ca_system_score_gemma":0.0002510763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001052848,"about_ca_topic_score_gemma":0.0006272793,"domain_scores_codex":[0.9967001,0.00006405005,0.0008178084,0.001159488,0.0007249639,0.0005335934],"domain_scores_gemma":[0.9978223,0.0003699389,0.0003615497,0.001125412,0.0002191259,0.0001016041],"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.000007075181,0.00003513958,0.0003071067,0.00008836605,0.000009949042,0.00004387053,0.001419413,0.1020818,0.0002240592,0.08164202,0.00007530479,0.8140659],"study_design_scores_gemma":[0.000417512,0.0003536958,0.0002857524,0.001496581,0.000004306817,0.0001402887,4.109156e-7,0.9174484,0.0006164294,0.07172094,0.006793085,0.0007225971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002106724,0.0003159524,0.9871428,0.0002876229,0.001725989,0.0003356207,0.000001733105,0.00006737659,0.009912257],"genre_scores_gemma":[0.8484482,0.00003211113,0.14941,0.0005916643,0.000561584,0.00001205391,0.000002058568,0.00003225956,0.0009101516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8482375,"threshold_uncertainty_score":0.9998907,"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."}}