{"id":"W115874132","doi":"","title":"Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Disjoint sets; Graph","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.0004030433,0.0007032332,0.0005785773,0.001541802,0.001903984,0.001504122,0.001253326,0.001281949,0.008704733],"category_scores_gemma":[0.003899024,0.0005298965,0.0006044576,0.00219275,0.0008315445,0.002827789,0.001735833,0.000834545,0.001722243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006300993,"about_ca_system_score_gemma":0.0008070013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009940104,"about_ca_topic_score_gemma":0.002973666,"domain_scores_codex":[0.9993191,0.0001769705,0.00008605955,0.000157764,0.0001407099,0.0001195567],"domain_scores_gemma":[0.9969648,0.001069849,0.0006318002,0.0004970159,0.0005014977,0.0003350315],"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.001177408,0.0002024486,0.004054212,0.0007964578,0.0002049487,0.00266847,0.001156533,0.008761061,0.04885753,0.8272234,0.01478578,0.09011169],"study_design_scores_gemma":[0.00009222262,0.0002809933,0.002685488,0.0003131865,0.0002263851,0.002032647,0.001136503,0.02735125,0.04016647,0.8200098,0.1056093,0.00009572741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5750106,0.00260955,0.3369434,0.00110376,0.0008475567,0.0005888219,0.005812792,0.001414913,0.07566861],"genre_scores_gemma":[0.7892873,0.001308748,0.162403,0.0006088561,0.0001575913,0.0007118697,0.005823417,0.0004782755,0.03922102],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008704733,"threshold_uncertainty_score":0.02912021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02408683008824998,"score_gpt":0.2769357215780593,"score_spread":0.2528488914898093,"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."}}