{"id":"W2059447100","doi":"10.4153/cmb-2015-021-4","title":"On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold","year":2015,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Monopoly; Integer (computer science); Upper and lower bounds; Degree (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","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.002151187,0.0009261876,0.001783905,0.001966967,0.001412716,0.003364417,0.002098023,0.001193613,0.006530779],"category_scores_gemma":[0.01134238,0.0009708859,0.0008266257,0.002492709,0.00161126,0.004975872,0.00186045,0.00148127,0.0003897461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002585197,"about_ca_system_score_gemma":0.001081031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002032835,"about_ca_topic_score_gemma":0.002350958,"domain_scores_codex":[0.9986652,0.0003741824,0.00006111684,0.0003539977,0.0001730276,0.0003726115],"domain_scores_gemma":[0.9890029,0.007220361,0.001341115,0.0007071648,0.000398566,0.001329818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002187323,0.0006844309,0.009328216,0.001262854,0.0002929647,0.0009556154,0.001083647,0.4499904,0.03147819,0.4177038,0.01891579,0.06611676],"study_design_scores_gemma":[0.000173308,0.000210951,0.002962867,0.00009090202,0.00007583105,0.0007139573,0.000575936,0.5854151,0.004931163,0.4003125,0.004480298,0.00005713671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8067805,0.001099784,0.1678292,0.002006338,0.00006575837,0.0002812434,0.002098703,0.0004625448,0.01937593],"genre_scores_gemma":[0.9537187,0.0004345069,0.04125232,0.0001842335,0.0001048456,0.0001868366,0.0007856399,0.0001616911,0.003171216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006530779,"threshold_uncertainty_score":0.02184767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0221388638266732,"score_gpt":0.2591739011194038,"score_spread":0.2370350372927306,"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."}}