{"id":"W2963356118","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Limiting; Friendship graph; Voltage graph; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.0006210102,0.000290931,0.0003609878,0.0006063291,0.0002440856,0.0004573243,0.001975057,0.0001319835,0.0000850483],"category_scores_gemma":[0.0005194371,0.0002025923,0.0003433444,0.001072259,0.0005029169,0.006994562,0.0005117785,0.0002071489,0.00006499234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006310719,"about_ca_system_score_gemma":0.0003100113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004252659,"about_ca_topic_score_gemma":7.444478e-7,"domain_scores_codex":[0.9960738,0.0002824404,0.0008639103,0.0006781534,0.001704162,0.0003975252],"domain_scores_gemma":[0.9954476,0.002552168,0.000598734,0.0008217976,0.0004275973,0.0001520861],"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.0002190461,0.0002860885,0.00410918,0.00006194264,0.0001374556,0.00002205427,0.0002309953,0.00004729383,0.05424848,0.933127,0.003035892,0.004474536],"study_design_scores_gemma":[0.0006274932,0.0002403678,0.02933257,0.0002462502,0.000009304962,0.00003055194,0.00005902979,0.0001601321,0.416613,0.5515205,0.0008223003,0.0003384324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8669134,0.0002178612,0.006522258,0.002513025,0.00100873,0.0007787317,0.000196378,0.0002696596,0.1215799],"genre_scores_gemma":[0.99289,0.00001231837,0.0005624884,0.0001542991,0.0001039802,0.0000413757,0.00002076036,0.00003718122,0.006177619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3816065,"threshold_uncertainty_score":0.8261475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01464089567584804,"score_gpt":0.2417094565578392,"score_spread":0.2270685608819911,"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."}}