{"id":"W2121104987","doi":"10.46298/dmtcs.1264","title":"On the Meyniel condition for hamiltonicity in bipartite digraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Bipartite graph; Combinatorics; Mathematics; Hamiltonian (control theory); Discrete mathematics; Hamiltonian path; Strongly connected component; Graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005269203,0.0002568899,0.0003029376,0.0003211494,0.0005850093,0.0005431676,0.003442801,0.00006147017,0.00002792219],"category_scores_gemma":[0.001142083,0.0001628333,0.0001418922,0.001548043,0.003018135,0.0005270015,0.0007456932,0.0003212247,0.00005044519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005167206,"about_ca_system_score_gemma":0.00006260768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.820955e-7,"about_ca_topic_score_gemma":0.000001509204,"domain_scores_codex":[0.9967426,0.0002457042,0.0004343473,0.000781547,0.0009496149,0.000846156],"domain_scores_gemma":[0.9939827,0.004014186,0.0001257564,0.001475277,0.0001941612,0.0002078834],"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.00001040489,0.00008473432,0.000009683119,0.00002075076,0.000003791654,0.000001247661,0.0007902883,0.0002518317,0.0006053041,0.9965698,0.00003847881,0.001613686],"study_design_scores_gemma":[0.0001565891,0.0001589254,0.00004070217,0.00004702034,0.000001761743,0.000003224159,0.0000174695,0.4761099,0.003109451,0.5202013,0.00003140816,0.0001222399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0484057,0.000006644606,0.9448325,0.001830863,0.0001866882,0.0006635045,0.0000050529,0.0001115039,0.00395751],"genre_scores_gemma":[0.8627684,0.000002014721,0.13643,0.0006386177,0.00003632543,0.0001019957,0.000001369292,0.00001389325,0.000007443721],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8143626,"threshold_uncertainty_score":0.9996951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01944146827243976,"score_gpt":0.3031915034484831,"score_spread":0.2837500351760434,"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."}}