{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383275,0.0003223025,0.0002930139,0.00155683,0.0009665167,0.000935865,0.0005375376,0.0003095581,0.003327842],"category_scores_gemma":[0.004914669,0.0001889601,0.0004042454,0.00149739,0.001436625,0.001497208,0.0008804628,0.00085593,0.0003412672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312544,"about_ca_system_score_gemma":0.000441734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004364823,"about_ca_topic_score_gemma":0.003358351,"domain_scores_codex":[0.9995793,0.00008999776,0.000008826147,0.0000705386,0.0001047676,0.0001466532],"domain_scores_gemma":[0.9974779,0.001641793,0.0002490625,0.0001441195,0.0002332069,0.0002537942],"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.0002650539,0.00007109941,0.004957881,0.0001371425,0.00002286539,0.0004452587,0.00172499,0.03667166,0.00861744,0.8968621,0.002775047,0.04744936],"study_design_scores_gemma":[0.00004898465,0.0000842441,0.007820535,0.00005406883,0.00002761466,0.000748467,0.0005480302,0.1426321,0.00383129,0.8329584,0.01119671,0.00004966805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8823341,0.0007105785,0.07548091,0.000608571,0.00003531199,0.0000373473,0.0003043399,0.0001158305,0.04037289],"genre_scores_gemma":[0.9910376,0.0004133538,0.004164348,0.00003786026,0.0000551749,0.00001614951,0.000123701,0.00002518079,0.004126709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004364823,"threshold_uncertainty_score":0.01113278,"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."}}