{"id":"W4206978675","doi":"10.1007/978-3-030-95018-7_24","title":"Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph","year":2022,"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; Time complexity; Butterfly graph; Vertex (graph theory); Algorithm; Discrete mathematics; Graph; Theoretical computer science; Combinatorics; Line graph; Voltage graph; Mathematics","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.00312037,0.002473565,0.00274986,0.001984647,0.00233162,0.005565408,0.007076382,0.003678102,0.009777632],"category_scores_gemma":[0.01777763,0.001615118,0.00255185,0.005872836,0.002049672,0.01067831,0.002969548,0.005820092,0.002650781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006417124,"about_ca_system_score_gemma":0.004842353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007243039,"about_ca_topic_score_gemma":0.01080653,"domain_scores_codex":[0.9970469,0.0007204496,0.0001351234,0.0008667306,0.0005619221,0.0006688396],"domain_scores_gemma":[0.9827752,0.01206364,0.0007373699,0.003088385,0.0007246024,0.0006108274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002732559,0.0008693002,0.00233696,0.001163124,0.0003337672,0.0002053785,0.000850027,0.4831068,0.004119085,0.1871377,0.05375709,0.2633882],"study_design_scores_gemma":[0.0002736489,0.000112448,0.0004606132,0.00009651211,0.0001497157,0.0001797154,0.0002051577,0.7204393,0.002584632,0.270479,0.004987515,0.00003174799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09289359,0.005735771,0.8523505,0.00536837,0.0007081435,0.0002849357,0.001861244,0.004415168,0.03638225],"genre_scores_gemma":[0.4735579,0.003711063,0.4913731,0.001044565,0.0009980707,0.0004710366,0.003744413,0.001756677,0.02334316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009777632,"threshold_uncertainty_score":0.04655975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01089420861709012,"score_gpt":0.2061494124993838,"score_spread":0.1952552038822936,"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."}}