{"id":"W1980634280","doi":"10.1016/j.disc.2011.11.032","title":"A degree condition for cycles of maximum length in bipartite digraphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Digraph; Mathematics; Combinatorics; Degree (music); Hamiltonian (control theory); Discrete mathematics; Graph; Physics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004581705,0.0001182101,0.0002212302,0.0002293485,0.00004165915,0.00002274196,0.000640361,0.00004707479,0.00001781953],"category_scores_gemma":[0.0001361829,0.0001009653,0.00009620326,0.0003956065,0.0001309606,0.0003437204,0.0001337458,0.00008094719,0.000009871976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000133807,"about_ca_system_score_gemma":0.00002139582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005409725,"about_ca_topic_score_gemma":0.00001898835,"domain_scores_codex":[0.9989034,0.00004006995,0.0003469911,0.0002123369,0.000211553,0.0002856548],"domain_scores_gemma":[0.998953,0.0002321719,0.0001492733,0.000529461,0.00007797041,0.00005806165],"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.00002199975,0.0001666822,0.0008095918,0.0002419171,0.00002104895,0.000004827492,0.00654157,0.000008438367,0.001996258,0.985658,0.00002462069,0.004505061],"study_design_scores_gemma":[0.0004078732,0.0001313572,0.001214668,0.00009475635,0.000006260459,0.000004204797,0.0004224493,0.0186645,0.03062713,0.9482474,0.00003380957,0.0001455332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1664741,0.00006306039,0.8281071,0.00003919282,0.00004605571,0.0004852356,0.00002419656,0.00005983183,0.004701186],"genre_scores_gemma":[0.7683159,0.00001196271,0.2315316,0.0000104856,0.00000586318,0.00007913388,0.000003915009,0.00001298657,0.0000281547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6018417,"threshold_uncertainty_score":0.4117246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08954373980614025,"score_gpt":0.3256156053587312,"score_spread":0.2360718655525909,"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."}}