{"id":"W2883406596","doi":"10.23638/dmtcs-21-3-1","title":"Binding Number, Toughness and General Matching Extendability in Graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Matching (statistics); Graph; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.001532172,0.00103001,0.001222001,0.002539761,0.001500666,0.002630404,0.002289213,0.00134158,0.008321608],"category_scores_gemma":[0.008314614,0.001039794,0.001592015,0.002377369,0.00450682,0.007270851,0.00386775,0.003959546,0.0006796865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001766814,"about_ca_system_score_gemma":0.0008431126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002346392,"about_ca_topic_score_gemma":0.002265495,"domain_scores_codex":[0.9979292,0.0002552511,0.0001407147,0.0007480528,0.0004496211,0.0004770156],"domain_scores_gemma":[0.9880458,0.006984737,0.001538987,0.001142165,0.0004566727,0.001831789],"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.001045051,0.0003601488,0.01016929,0.000624349,0.0001579089,0.000850249,0.001865064,0.07251148,0.02076168,0.8393603,0.007096794,0.04519777],"study_design_scores_gemma":[0.0000834966,0.0001743411,0.007395837,0.00007700655,0.00007615623,0.0007536915,0.0003732974,0.06419666,0.003496893,0.9167153,0.006559898,0.00009743615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7539853,0.001290143,0.2052795,0.002542993,0.0001831727,0.0001401867,0.001483652,0.0007756157,0.03431952],"genre_scores_gemma":[0.956026,0.0008971192,0.03207835,0.0004236018,0.0002510435,0.0002254264,0.000953988,0.0001117961,0.009032616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008321608,"threshold_uncertainty_score":0.02783859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02073836180585886,"score_gpt":0.3185557908663956,"score_spread":0.2978174290605368,"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."}}