{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925952,0.0001290086,0.0003775085,0.0002766453,0.00006759969,0.00008557836,0.0005560368,0.00005603366,0.00001840801],"category_scores_gemma":[0.000237027,0.00007733673,0.0001588852,0.0004037928,0.0005124922,0.0005292039,0.0001304294,0.0002385825,8.646421e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009162894,"about_ca_system_score_gemma":0.00001190987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009933551,"about_ca_topic_score_gemma":0.000003282927,"domain_scores_codex":[0.998385,0.0004677797,0.0005790758,0.0001265277,0.0002713078,0.0001703646],"domain_scores_gemma":[0.9986507,0.0004403875,0.0004074445,0.000288965,0.0001378746,0.00007458625],"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.0002614386,0.00009536921,0.000406612,0.00001232866,0.00003694403,0.00001142307,0.004163595,0.000003992696,0.0004929299,0.9910529,0.0001145056,0.003348008],"study_design_scores_gemma":[0.002386734,0.0003782332,0.0005468276,0.0001060024,0.00001384076,0.00006278622,0.0002682972,0.000110198,0.001647472,0.9940973,0.0002900036,0.00009228283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806288,0.00543394,0.002811559,0.003518454,0.005943133,0.0002459396,0.000002418142,0.00003114909,0.001384556],"genre_scores_gemma":[0.9980497,0.0005383271,0.001252303,0.00010072,0.00002348012,0.00000273554,7.747126e-8,0.00000686508,0.00002577187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01742087,"threshold_uncertainty_score":0.31537,"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."}}