{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951319,0.001264148,0.002098567,0.00349564,0.003348975,0.004372812,0.002797581,0.003561282,0.01228739],"category_scores_gemma":[0.02404442,0.001740543,0.002103524,0.003679115,0.004104414,0.01011449,0.003885541,0.004795269,0.00172894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002402985,"about_ca_system_score_gemma":0.002060334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00307248,"about_ca_topic_score_gemma":0.004176395,"domain_scores_codex":[0.9979031,0.0003668113,0.0001880669,0.0006460157,0.0003853473,0.000510664],"domain_scores_gemma":[0.967744,0.02150449,0.001820899,0.001964767,0.002918486,0.004047401],"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.000994408,0.0002405846,0.003984717,0.0005736676,0.00007915605,0.0006840081,0.001484199,0.01641331,0.01456272,0.93208,0.009308912,0.01959436],"study_design_scores_gemma":[0.0002151921,0.0001576752,0.001627321,0.0001211092,0.00007715721,0.0004732067,0.0004671755,0.0429305,0.004496354,0.9439915,0.005326092,0.0001166507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6498087,0.001450506,0.2658452,0.006080188,0.0007665124,0.0004828472,0.004826525,0.001296307,0.06944321],"genre_scores_gemma":[0.9445124,0.0009761206,0.03799288,0.001248385,0.0008244144,0.0004402772,0.002205822,0.0005565142,0.01124315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01228739,"threshold_uncertainty_score":0.04110539,"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."}}