{"id":"W168997024","doi":"","title":"The Greedy Algorithm for Domination in Cubic Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Greedy algorithm; Mathematics; Cubic graph; Combinatorics; Algorithm; Graph; Line graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009014597,0.0006889169,0.0006532983,0.001073026,0.001576961,0.001668413,0.001834021,0.001131714,0.009187823],"category_scores_gemma":[0.005542916,0.0004351286,0.0007203261,0.001901306,0.001248046,0.002774917,0.002475194,0.001839401,0.002996927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001910101,"about_ca_system_score_gemma":0.004369367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01010035,"about_ca_topic_score_gemma":0.01612563,"domain_scores_codex":[0.9991531,0.0002074064,0.00003351304,0.0001217609,0.000244232,0.0002399631],"domain_scores_gemma":[0.9981254,0.0009127202,0.00009661308,0.0004564865,0.0002313679,0.0001774404],"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.0008947037,0.0002382253,0.002308001,0.0005490411,0.0001163482,0.0001886045,0.0005640095,0.05745208,0.007482063,0.2864354,0.09098443,0.5527869],"study_design_scores_gemma":[0.0004804207,0.0001420252,0.001100699,0.0001131236,0.0001023934,0.0003754205,0.0002843535,0.3698775,0.006496727,0.5749624,0.04599891,0.00006609203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06726803,0.002213191,0.8363113,0.003172878,0.0004463732,0.0004705719,0.001337418,0.004801263,0.08397894],"genre_scores_gemma":[0.4253546,0.001357172,0.5298322,0.0009154133,0.0002382485,0.0004859677,0.001982615,0.00102587,0.03880783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01010035,"threshold_uncertainty_score":0.03073633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01334515208870171,"score_gpt":0.2831954101280781,"score_spread":0.2698502580393763,"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."}}