{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080177,0.0002055666,0.0002686587,0.0003022416,0.0001022688,0.0000806319,0.002521205,0.0001599429,0.0001420845],"category_scores_gemma":[0.0004841395,0.0001193462,0.0001864303,0.0002753402,0.000194926,0.0001448656,0.001517442,0.000364488,0.0001280136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005120586,"about_ca_system_score_gemma":0.00008971235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004658355,"about_ca_topic_score_gemma":0.000001150251,"domain_scores_codex":[0.9979466,0.00037498,0.0003088033,0.0005055882,0.0005671191,0.0002968633],"domain_scores_gemma":[0.9961285,0.00150945,0.0003115106,0.00183335,0.0001534206,0.00006374811],"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.00002477912,0.0000283885,0.00002962416,0.00003130066,0.00002354176,0.000003194114,0.0001876636,0.0000207549,0.001373444,0.9895566,0.001402906,0.007317868],"study_design_scores_gemma":[0.0001503355,0.0000566954,0.0006814236,0.0001528537,0.000003191939,0.00000198745,0.000007331628,0.0003663113,0.02558951,0.9724669,0.000380712,0.0001427245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2663106,0.0004662591,0.594036,0.01505462,0.003489174,0.002700214,0.0003435852,0.0005497047,0.1170498],"genre_scores_gemma":[0.9966018,0.00002345891,0.002762277,0.0001207732,0.00005300895,0.000106243,0.000005061406,0.00001712227,0.0003102149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7302912,"threshold_uncertainty_score":0.4866796,"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."}}