{"id":"W1966311297","doi":"10.1006/jctb.2001.2094","title":"Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Combinatorics; Eulerian path; Disjoint sets; Vertex (graph theory); Mathematics; Partition (number theory); Bipartite graph; Upper and lower bounds; Graph; Discrete mathematics; Lagrangian","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001763603,0.00082969,0.001671906,0.003231531,0.002462748,0.005211926,0.002092676,0.001872571,0.0044142],"category_scores_gemma":[0.01441676,0.001681943,0.0009144847,0.003485278,0.003688718,0.009162391,0.002563866,0.002308303,0.0004281901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00248558,"about_ca_system_score_gemma":0.0006685013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001257859,"about_ca_topic_score_gemma":0.001601589,"domain_scores_codex":[0.998826,0.0003706409,0.00009234474,0.000317623,0.000179533,0.000213792],"domain_scores_gemma":[0.9742563,0.01940301,0.002914942,0.001021364,0.0006385892,0.001765912],"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.0005104792,0.000114473,0.008323072,0.0002652303,0.00005249846,0.0002002209,0.001656297,0.02175423,0.003358363,0.9416834,0.005166508,0.01691515],"study_design_scores_gemma":[0.00006429932,0.00003902511,0.002463434,0.00006306227,0.00006202475,0.0003491807,0.0005737543,0.03618379,0.00141237,0.9538072,0.004948456,0.00003340026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8708398,0.00376221,0.08865102,0.003089576,0.0001629749,0.00006553,0.001384213,0.0002589795,0.03178562],"genre_scores_gemma":[0.9727077,0.002191843,0.0195391,0.0002836238,0.0003051557,0.0001136651,0.0007762141,0.000130384,0.003952247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005211926,"threshold_uncertainty_score":0.01803416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01272550380221581,"score_gpt":0.2055984673701304,"score_spread":0.1928729635679146,"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."}}