{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001552919,0.002638856,0.002951695,0.001925489,0.002162118,0.004419754,0.007440153,0.002933193,0.02202987],"category_scores_gemma":[0.01066572,0.001032816,0.002051738,0.005742363,0.002258569,0.009922023,0.003983783,0.005593387,0.00455417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008288694,"about_ca_system_score_gemma":0.004689132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01017503,"about_ca_topic_score_gemma":0.01180363,"domain_scores_codex":[0.9977959,0.0003784543,0.00007565737,0.0005705632,0.0006345506,0.0005448089],"domain_scores_gemma":[0.9936492,0.003774985,0.0002882043,0.001446401,0.0003935957,0.0004475719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002636325,0.0009261417,0.001901543,0.002266673,0.0002970031,0.0002699559,0.001059031,0.2606342,0.01226198,0.3207365,0.1103301,0.2866807],"study_design_scores_gemma":[0.0004215442,0.0001630342,0.0006829638,0.0001848296,0.0002536455,0.0003462862,0.0002685662,0.5380033,0.004144846,0.4403996,0.01507043,0.0000609248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1753625,0.00869865,0.6910919,0.009614012,0.001214951,0.0007851343,0.00439808,0.009467117,0.09936754],"genre_scores_gemma":[0.5915208,0.005358668,0.3499436,0.001786297,0.0009955654,0.001019811,0.005209913,0.002521591,0.04164368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02202987,"threshold_uncertainty_score":0.07369727,"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."}}