{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003329489,0.0002077986,0.0003185992,0.0002245464,0.00009597782,0.00004865706,0.001127729,0.00007385091,0.00002912304],"category_scores_gemma":[0.00009740205,0.000177951,0.00006175579,0.001593515,0.0002852602,0.0008637186,0.0003812907,0.000213748,0.000030897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007557562,"about_ca_system_score_gemma":0.00005137569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006571662,"about_ca_topic_score_gemma":0.0001001716,"domain_scores_codex":[0.9979303,0.0001689383,0.0003323209,0.0005143075,0.0005335953,0.0005204611],"domain_scores_gemma":[0.998134,0.0005996794,0.0001298213,0.000916196,0.0001212874,0.00009899195],"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.0003028739,0.0003065082,0.1200418,0.000022659,0.00004274147,0.0001384813,0.001141224,0.00008334519,0.001547915,0.8746493,0.0003972205,0.001325981],"study_design_scores_gemma":[0.002134895,0.0004541145,0.03615284,0.00007590601,0.00000660297,0.00002035526,0.0001332164,0.0007348417,0.01605303,0.9427227,0.001183011,0.0003284773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917818,0.0003001517,0.001479469,0.0003111805,0.0003329014,0.0002682659,0.000001768256,0.00007644641,0.00544803],"genre_scores_gemma":[0.9948719,0.0001543025,0.00461917,0.0001060082,0.000003080475,0.00002335774,0.000001859736,0.00002167014,0.000198632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08388895,"threshold_uncertainty_score":0.7256629,"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."}}