{"id":"W2169487918","doi":"10.1016/j.disc.2011.10.018","title":"Upper bounds for the bondage number of graphs on topological surfaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Upper and lower bounds; Genus; Mathematical proof; Domination analysis; Planar graph; Discrete mathematics; Surface (topology); Geometry; Botany; Biology","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.0006352629,0.000135638,0.0002024174,0.00004514004,0.0001594283,0.00004764294,0.001184969,0.00005564091,0.0001006544],"category_scores_gemma":[0.0001929261,0.00007528215,0.0001597967,0.0002526179,0.0003365611,0.0001482047,0.0002185557,0.0001271361,0.00003514704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008935966,"about_ca_system_score_gemma":0.0000178394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004106842,"about_ca_topic_score_gemma":0.000001514126,"domain_scores_codex":[0.9988592,0.00005151479,0.0002596189,0.0002200717,0.0003094212,0.0003001702],"domain_scores_gemma":[0.9980416,0.0009018194,0.0001187819,0.000798606,0.00008384055,0.00005529574],"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.00001633197,0.00008191093,0.0003701294,0.00003905297,0.00002494072,0.000001431841,0.002344012,0.000005476424,0.0001094897,0.9963298,0.0001160254,0.0005614398],"study_design_scores_gemma":[0.0001749409,0.0001505913,0.0005228918,0.00002375125,0.000009575031,0.00000738632,0.0004912965,0.008148975,0.004756204,0.9850935,0.0004991593,0.0001217626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2042528,0.0001155431,0.7648405,0.0004438715,0.0001997236,0.0007358497,0.00002601598,0.0001182209,0.02926753],"genre_scores_gemma":[0.8236727,0.00001850688,0.1754798,0.0000688419,0.00001063655,0.00004901674,8.454332e-7,0.00001421541,0.0006854633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6194199,"threshold_uncertainty_score":0.3069917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06550048523045542,"score_gpt":0.3397857713035316,"score_spread":0.2742852860730762,"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."}}