{"id":"W172494826","doi":"","title":"Maximum Number of Contractible Edges on Longest Cycles of a 3-Connected Graph.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics; 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.0003947705,0.0004846707,0.0004541442,0.001077802,0.001314477,0.001460827,0.0009734069,0.001091156,0.009822915],"category_scores_gemma":[0.003079876,0.0003757997,0.0004622573,0.0009222763,0.0008457268,0.002012333,0.0008402566,0.0005801113,0.0008533449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005780562,"about_ca_system_score_gemma":0.0005712204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008740927,"about_ca_topic_score_gemma":0.002100048,"domain_scores_codex":[0.9995731,0.00009034566,0.0000371287,0.00009288298,0.00009091706,0.0001155692],"domain_scores_gemma":[0.9964609,0.001709301,0.0005588143,0.0002872357,0.0003467096,0.0006370743],"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.003785337,0.0004088105,0.02180036,0.002255357,0.0003592733,0.002008896,0.001910292,0.05007865,0.1168871,0.5842484,0.02740357,0.1888539],"study_design_scores_gemma":[0.0002944293,0.0005055237,0.01988662,0.0004454095,0.0003181226,0.003069155,0.001499916,0.0793393,0.04805151,0.794139,0.05230502,0.000146001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9272417,0.000954185,0.03265642,0.0008357264,0.0001074593,0.00008974868,0.003333953,0.0002268597,0.03455402],"genre_scores_gemma":[0.9613866,0.0006389826,0.02670349,0.0001407664,0.00006715023,0.0001204851,0.001739644,0.0000902482,0.009112651],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009822915,"threshold_uncertainty_score":0.03286088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01364929213711896,"score_gpt":0.2501468123098791,"score_spread":0.2364975201727601,"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."}}