{"id":"W4313372307","doi":"10.1007/978-3-031-17658-6_3","title":"Broadcast Graphs with Nodes of Limited Memory","year":2022,"lang":"en","type":"book-chapter","venue":"Springer proceedings in complexity","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Hypercube; Communication source; Graph; Vertex (graph theory); Theoretical computer science; Upper and lower bounds; Computer network; 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.0001523907,0.0003763238,0.0004238413,0.0005477259,0.0006415093,0.001134685,0.0009471204,0.0005040171,0.01165717],"category_scores_gemma":[0.001132835,0.0004603904,0.0002562262,0.0009685986,0.0006050282,0.002086629,0.0007154666,0.001086584,0.001871607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008114498,"about_ca_system_score_gemma":0.0005060667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121831,"about_ca_topic_score_gemma":0.001999157,"domain_scores_codex":[0.9998783,0.00002974665,0.000005190132,0.00002977884,0.00003598535,0.00002097614],"domain_scores_gemma":[0.9992644,0.0003753677,0.00004797056,0.0001736728,0.00008879735,0.00004979626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001124984,0.00003308406,0.0001258337,0.0003039787,0.00002067321,0.0001445176,0.0001834465,0.02492366,0.006494899,0.8720065,0.03190348,0.06374739],"study_design_scores_gemma":[0.00003579258,0.00003670475,0.0002468838,0.00007820511,0.00003396095,0.0002405955,0.000108649,0.04790154,0.003585992,0.8827547,0.06495952,0.0000174108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147085,0.006132168,0.5318243,0.005701023,0.001134572,0.0002001576,0.001927413,0.002183881,0.336188],"genre_scores_gemma":[0.6122305,0.0067831,0.1242638,0.001005221,0.0006337207,0.0003912227,0.001350939,0.0006675156,0.2526739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01165717,"threshold_uncertainty_score":0.03899717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04348887798121863,"score_gpt":0.2305114781229854,"score_spread":0.1870226001417667,"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."}}