{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006203814,0.000431166,0.0007439893,0.0006132103,0.0001604075,0.0001271051,0.001335465,0.0001941676,0.000340951],"category_scores_gemma":[0.00001675034,0.0004056576,0.0001933459,0.0003060174,0.0002405903,0.0003785488,0.0007680077,0.0008583308,0.00001134688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000182195,"about_ca_system_score_gemma":0.00008052388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001769181,"about_ca_topic_score_gemma":0.00006501303,"domain_scores_codex":[0.9973879,0.00001412305,0.0006970042,0.0008353689,0.0006868062,0.0003787876],"domain_scores_gemma":[0.9983954,0.00006403675,0.0006539907,0.0004562674,0.0003395296,0.00009072914],"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.0000441772,0.00004293593,0.0005506389,0.0002255066,0.00006754268,0.00001795617,0.0007333995,0.00004594894,0.00004928127,0.994344,0.0006552796,0.003223326],"study_design_scores_gemma":[0.003983977,0.002949195,0.006010331,0.005212666,0.0001485828,0.000843128,0.0006257072,0.03276413,0.001122659,0.4070628,0.5341033,0.00517346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.007862709,0.000383265,0.003451813,0.0002071191,0.001093511,0.000718839,0.00001895607,0.0003091189,0.9859546],"genre_scores_gemma":[0.9144263,0.0001716617,0.02053081,0.0003340111,0.0004265634,0.0001294719,0.00001558216,0.0001725851,0.06379301],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9221616,"threshold_uncertainty_score":0.9998395,"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."}}