{"id":"W2406179673","doi":"","title":"Note On odd path extendable graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Computer science; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.000651043,0.0007727558,0.0005428997,0.001093488,0.001378338,0.001124684,0.001045149,0.0006649626,0.01695271],"category_scores_gemma":[0.002118689,0.0002080642,0.0006346264,0.001243292,0.001824356,0.003985932,0.002800781,0.002957688,0.001872153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000504135,"about_ca_system_score_gemma":0.0003733748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001415709,"about_ca_topic_score_gemma":0.002192331,"domain_scores_codex":[0.9996952,0.00005316535,0.0000135776,0.00008770008,0.00009656498,0.0000538217],"domain_scores_gemma":[0.9983793,0.0009495416,0.00007964343,0.0002486915,0.0001662277,0.0001765279],"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.0001438453,0.00005603422,0.0007232896,0.0004217607,0.00002734315,0.001242038,0.0003308128,0.001289647,0.003289916,0.8912568,0.05114467,0.05007391],"study_design_scores_gemma":[0.00001237529,0.00004956891,0.001007909,0.0000586204,0.00002959209,0.000836247,0.0001137518,0.0008887566,0.0009396149,0.8692941,0.1267516,0.00001787583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0641589,0.01210611,0.1238595,0.02573372,0.01532687,0.0001440547,0.001309827,0.0009908141,0.7563702],"genre_scores_gemma":[0.6704915,0.03081713,0.1005161,0.01326676,0.01264209,0.0002295696,0.001646861,0.0006206797,0.1697694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01695271,"threshold_uncertainty_score":0.05671239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01409033504502936,"score_gpt":0.2849480019081853,"score_spread":0.2708576668631559,"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."}}