{"id":"W2097734862","doi":"10.1007/978-3-319-14974-5_3","title":"Constant Approximation for Broadcasting in k-cycle Graph","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Computer science; Time complexity; Vertex (graph theory); Discrete mathematics; Graph; Butterfly graph; Mathematics; Line graph; Voltage graph","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.001739387,0.0004527434,0.0005434323,0.001289102,0.0002270826,0.0004665383,0.002584571,0.0002629482,0.000006540227],"category_scores_gemma":[0.0001962352,0.0004479619,0.0001437093,0.0009771506,0.0006782246,0.0006809439,0.0009454737,0.0006369286,0.000008661415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003025263,"about_ca_system_score_gemma":0.0005641413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003107437,"about_ca_topic_score_gemma":0.0001407626,"domain_scores_codex":[0.9963724,0.000034348,0.0006369463,0.001396717,0.0008498828,0.0007097036],"domain_scores_gemma":[0.9975724,0.0006432705,0.0003032683,0.0009812999,0.0003369632,0.0001627716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008106721,0.00003753803,0.00002869772,0.00005934216,0.000005848732,0.00003137863,0.0008013134,0.03298127,0.00003469549,0.183653,0.00002586877,0.782333],"study_design_scores_gemma":[0.0002949993,0.00008513071,0.00001429427,0.0002366136,0.000002225303,0.00002798361,2.806318e-7,0.4981445,0.00009818765,0.5001819,0.0005928231,0.0003210329],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006035429,0.0005549705,0.9929278,0.00041588,0.001523759,0.000716409,0.00001256357,0.0001443709,0.003643845],"genre_scores_gemma":[0.05430977,0.00002064963,0.9446334,0.0005075257,0.0003476822,0.00003604377,0.00001151044,0.00003286817,0.0001005912],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7820119,"threshold_uncertainty_score":0.9997972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04373649800825521,"score_gpt":0.2718830829612063,"score_spread":0.2281465849529511,"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."}}