{"id":"W1911800350","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"preprint","venue":"Filomat","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Limiting; Order (exchange)","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.0006875127,0.0003762998,0.0003402433,0.001738027,0.001033376,0.001107475,0.0006399451,0.0004080161,0.003905532],"category_scores_gemma":[0.006011528,0.000232271,0.0004677873,0.001662194,0.001714716,0.001991709,0.001121407,0.001107189,0.0003905316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510124,"about_ca_system_score_gemma":0.0004191977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003825225,"about_ca_topic_score_gemma":0.002937723,"domain_scores_codex":[0.9994555,0.0001126229,0.0000106661,0.00008917819,0.0001447769,0.0001872591],"domain_scores_gemma":[0.9965876,0.002310989,0.0003037083,0.00019178,0.0002755019,0.0003304878],"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.0002589618,0.00007314557,0.004316573,0.0001266841,0.00002405361,0.0003553465,0.001548093,0.0371573,0.007939969,0.9046198,0.002785953,0.04079424],"study_design_scores_gemma":[0.00004419642,0.00006409859,0.004486241,0.00003775672,0.0000213951,0.0005216605,0.0004007386,0.1196338,0.003136208,0.8636373,0.007975205,0.0000414599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8606048,0.0008875912,0.0919441,0.0008954605,0.00003898693,0.00003988158,0.0003357897,0.0001358842,0.04511758],"genre_scores_gemma":[0.9903937,0.0004548091,0.004346718,0.0000484818,0.0000718392,0.0000158593,0.0001195676,0.00002993736,0.004519091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003905532,"threshold_uncertainty_score":0.01306534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03332738700759024,"score_gpt":0.3040263962590281,"score_spread":0.2706990092514379,"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."}}