{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001163038,0.0003614275,0.0004641154,0.0008722876,0.0002385705,0.0001990218,0.002711137,0.0001584541,0.00005619764],"category_scores_gemma":[0.00002356786,0.0002486316,0.0001515608,0.00166879,0.0004769953,0.0004663482,0.0009168555,0.0007743606,0.000006107615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002048447,"about_ca_system_score_gemma":0.0003051856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001059573,"about_ca_topic_score_gemma":0.0001360953,"domain_scores_codex":[0.9968454,0.0001141113,0.0005766939,0.001008163,0.001040411,0.0004152638],"domain_scores_gemma":[0.9978154,0.0002622753,0.0004373325,0.00123978,0.0001786981,0.00006655443],"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.00002846364,0.0001318608,0.0003743581,0.0001134879,0.00003501182,0.00008249882,0.004597701,0.4002974,0.00019213,0.09814158,0.00010605,0.4958994],"study_design_scores_gemma":[0.0003663146,0.0002669014,0.0001758809,0.0005302582,0.000005939557,0.0001425009,9.661065e-7,0.9529213,0.0004012285,0.04369145,0.001042134,0.000455155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003700299,0.0002162363,0.9939467,0.0003539588,0.001576597,0.0005640752,0.000006060117,0.00005549971,0.002910817],"genre_scores_gemma":[0.7798114,0.00006274894,0.2159801,0.001820203,0.0005843069,0.0001127884,0.00001607674,0.0001041137,0.00150816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7794414,"threshold_uncertainty_score":0.9999966,"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."}}