{"id":"W103588595","doi":"","title":"Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","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.0007438308,0.0007078747,0.0008020194,0.001364771,0.001313582,0.002292674,0.001323009,0.001640655,0.003914242],"category_scores_gemma":[0.009170501,0.0007285512,0.0005044189,0.001211497,0.0009640359,0.003112491,0.001523746,0.0009626114,0.001045301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009498676,"about_ca_system_score_gemma":0.0006050568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006708899,"about_ca_topic_score_gemma":0.001447271,"domain_scores_codex":[0.9992673,0.0001814095,0.00008245664,0.0002128605,0.00009394598,0.0001620479],"domain_scores_gemma":[0.9913074,0.004687497,0.001499119,0.0007252988,0.0006714103,0.00110917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.01003922,0.0006604282,0.06410895,0.004920964,0.0006874908,0.002539804,0.004616654,0.09827479,0.121935,0.4172278,0.05263618,0.2223528],"study_design_scores_gemma":[0.000576157,0.0008532949,0.01870581,0.0006089846,0.0004629035,0.003653965,0.002343755,0.1301432,0.05832276,0.7455568,0.03860539,0.0001669524],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9293687,0.002234057,0.04310315,0.001798878,0.0001332407,0.0001181121,0.005602923,0.0005196327,0.01712123],"genre_scores_gemma":[0.9547111,0.001391103,0.03242988,0.0002953037,0.000121004,0.0001926633,0.004640831,0.0002940666,0.005924171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003914242,"threshold_uncertainty_score":0.01309443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02281584283864667,"score_gpt":0.2748316275715963,"score_spread":0.2520157847329496,"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."}}