{"id":"W2402601247","doi":"","title":"A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Combinatorics; Domination analysis; Graph; Physics","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.001402618,0.001341213,0.001187175,0.002752455,0.002556829,0.003574547,0.003210993,0.001829848,0.01884755],"category_scores_gemma":[0.007393308,0.0006369787,0.001114846,0.002725936,0.001905017,0.006367422,0.00309776,0.003603945,0.003113811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002534222,"about_ca_system_score_gemma":0.001239503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001179073,"about_ca_topic_score_gemma":0.002767258,"domain_scores_codex":[0.9985437,0.0001865076,0.00005672031,0.000345172,0.000435985,0.0004319029],"domain_scores_gemma":[0.9942934,0.003898684,0.00033688,0.0005778839,0.0002879993,0.0006051465],"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.001658038,0.0006004015,0.008014486,0.002239993,0.0003549355,0.0008862179,0.001117833,0.05964869,0.03956766,0.698342,0.0802068,0.107363],"study_design_scores_gemma":[0.0001406897,0.0002232796,0.006773044,0.0002893516,0.0002889552,0.001283363,0.0003749296,0.10999,0.01593096,0.8203463,0.04421249,0.0001466088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4434438,0.01094747,0.20168,0.009194937,0.001424142,0.0004070404,0.006794929,0.002199163,0.3239086],"genre_scores_gemma":[0.9103446,0.003848354,0.05607188,0.001047041,0.0007338492,0.0004953596,0.003223417,0.0004407424,0.02379474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01884755,"threshold_uncertainty_score":0.06305134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02837197971230739,"score_gpt":0.2975330119646403,"score_spread":0.2691610322523329,"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."}}