{"id":"W2083970526","doi":"10.1016/s0304-3975(02)00048-8","title":"Structuring the elementary components of graphs having a perfect internal matching","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Structuring; Computer science; Mathematics; Matching (statistics); Combinatorics; Theoretical computer science","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003374293,0.0002066834,0.0002448721,0.0002893523,0.0006670573,0.0002992622,0.004268822,0.00002924764,0.00004928155],"category_scores_gemma":[0.0001079736,0.0001394336,0.0001157535,0.001319154,0.003526523,0.0007596892,0.001562518,0.0004157758,0.00001096062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005640222,"about_ca_system_score_gemma":0.00007337795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001227967,"about_ca_topic_score_gemma":8.993962e-7,"domain_scores_codex":[0.9966094,0.0004559612,0.0003833397,0.0006681341,0.001138529,0.0007445851],"domain_scores_gemma":[0.9978272,0.0006045015,0.0001188818,0.001087683,0.0001563708,0.0002053427],"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.000009362927,0.00003195003,0.0005005238,0.000009725582,0.000008859989,0.000009106717,0.0006719968,0.0003245145,0.01024611,0.9739652,0.000002225858,0.01422047],"study_design_scores_gemma":[0.0002679069,0.0001489976,0.002095617,0.00006400295,0.000004106267,0.0001089872,0.00004337726,0.06995916,0.03320054,0.893888,0.0000265237,0.0001927802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4010546,0.00003551456,0.5973966,0.000105373,0.0002971795,0.0001404592,8.370433e-7,0.00005157391,0.0009178547],"genre_scores_gemma":[0.8622688,0.000004681071,0.1375208,0.000167233,0.0000218063,0.000004966398,2.598342e-7,0.000008736574,0.000002659903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4612142,"threshold_uncertainty_score":0.9991853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01473154606041251,"score_gpt":0.2815980219321642,"score_spread":0.2668664758717517,"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."}}