{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.006057511,0.0006943059,0.0009885185,0.0006870767,0.000423714,0.001752363,0.006076805,0.0002786256,0.0000377146],"category_scores_gemma":[0.0002925294,0.0005907749,0.0002232603,0.001733192,0.004275311,0.001006556,0.01462005,0.001593843,0.00006463801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001874379,"about_ca_system_score_gemma":0.0003241737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001351794,"about_ca_topic_score_gemma":0.000002573598,"domain_scores_codex":[0.9930233,0.0004334266,0.000981993,0.002400379,0.001730188,0.001430663],"domain_scores_gemma":[0.9948632,0.001122762,0.000324572,0.002954655,0.0002641166,0.0004706923],"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.000008262909,0.0001059684,0.0005462196,0.0003951439,0.00001125078,0.00003102079,0.002537031,0.001229203,0.0002654623,0.9913109,0.000003243009,0.003556307],"study_design_scores_gemma":[0.0001650013,0.00002970671,0.0003172076,0.0003054541,0.000005316341,0.00003902247,0.00004354684,0.4182554,0.0002509543,0.5801651,0.000002531872,0.0004207566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3270794,0.00004531938,0.66953,0.0002817005,0.0006361287,0.000694911,0.00001292478,0.0001554464,0.001564248],"genre_scores_gemma":[0.5994388,0.00002499003,0.4003416,0.00006569359,0.00004313823,0.00003816614,0.000003526012,0.00002864984,0.00001542809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4170261,"threshold_uncertainty_score":0.9996544,"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."}}