{"id":"W1568391928","doi":"10.37236/5180","title":"The Bondage Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Dominating set; Vertex (graph theory); Graph; Upper and lower bounds; Bound graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.001909815,0.001029186,0.001304416,0.002508712,0.001730697,0.003168788,0.002110376,0.001793428,0.006614885],"category_scores_gemma":[0.02172865,0.0007906032,0.0008663998,0.001508257,0.004109492,0.006630998,0.002829945,0.002857766,0.001003291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002180308,"about_ca_system_score_gemma":0.0007072799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001358183,"about_ca_topic_score_gemma":0.0009334979,"domain_scores_codex":[0.9982818,0.0005444214,0.00005408899,0.0004449377,0.0003947464,0.000279936],"domain_scores_gemma":[0.985257,0.01062943,0.001036421,0.0009655826,0.0007120177,0.001399557],"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.0002242554,0.00005188268,0.002216441,0.0001452091,0.00004810922,0.0002050992,0.0003701599,0.02874773,0.006750583,0.9440528,0.005699608,0.01148819],"study_design_scores_gemma":[0.00005315484,0.00007091845,0.001176963,0.00005724357,0.0000340094,0.0003502418,0.00009105848,0.1920734,0.003261123,0.7965612,0.006220917,0.00004980684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5005543,0.003934906,0.4111032,0.006711362,0.0002844082,0.0002263436,0.0009890744,0.0007334236,0.07546297],"genre_scores_gemma":[0.9456595,0.002974486,0.03224827,0.0006512062,0.0005150738,0.0004422161,0.000568772,0.0002844185,0.01665608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006614885,"threshold_uncertainty_score":0.022129,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01016525856528513,"score_gpt":0.2912161600533494,"score_spread":0.2810509014880643,"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."}}