{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035673,0.0001453076,0.0003265984,0.0001116717,0.00006488683,0.00003836538,0.0005125456,0.00010051,0.00004937287],"category_scores_gemma":[0.00005049833,0.0001327197,0.000122287,0.0003969947,0.00005986715,0.0002856584,0.00006872098,0.0001391421,0.00005815506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003077928,"about_ca_system_score_gemma":0.00003415962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001046943,"about_ca_topic_score_gemma":0.00002625106,"domain_scores_codex":[0.9987005,0.0001059047,0.0004262271,0.0002694801,0.0002679234,0.0002299943],"domain_scores_gemma":[0.9986259,0.0002683677,0.0002775369,0.0005286924,0.0002317502,0.00006772861],"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.00002900866,0.0003375361,0.004596228,0.00002399181,0.00005713173,0.000004471368,0.0003981593,0.0001625796,0.000878509,0.9841734,0.003268175,0.006070792],"study_design_scores_gemma":[0.007111806,0.001545596,0.03962157,0.0008468641,0.00006269712,0.0001854661,0.0004052215,0.0213612,0.1867622,0.7224347,0.0183478,0.001314861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9827253,0.0001165997,0.001790754,0.0004423028,0.002798547,0.0001843156,0.000003230916,0.00009695413,0.01184199],"genre_scores_gemma":[0.9991186,0.00001642122,0.0005690813,0.00008475579,0.00003219562,0.0000105699,0.00000136217,0.00001108129,0.0001558869],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2617387,"threshold_uncertainty_score":0.5412154,"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."}}