{"id":"W2081923266","doi":"10.1016/j.disopt.2005.11.001","title":"Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Edmond de Rothschild Foundation; University of Haifa","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Transitive relation; Vertex (graph theory); Discrete mathematics; Time complexity; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008963331,0.00111531,0.001667456,0.002066431,0.001087355,0.002177133,0.001923908,0.001311532,0.005562891],"category_scores_gemma":[0.005916356,0.00123265,0.00108259,0.001996716,0.001087786,0.00380431,0.001524634,0.00158139,0.0003739166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001239608,"about_ca_system_score_gemma":0.001123024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002782868,"about_ca_topic_score_gemma":0.006309702,"domain_scores_codex":[0.9994549,0.0001538443,0.00003378087,0.0001717534,0.00008910978,0.00009655872],"domain_scores_gemma":[0.9952528,0.003121852,0.0004496333,0.0004133631,0.0003067901,0.0004554611],"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.001122861,0.0006254485,0.006453107,0.001170106,0.0003613048,0.000750878,0.00103203,0.4009295,0.01013407,0.4409981,0.008318515,0.1281039],"study_design_scores_gemma":[0.0001072836,0.0001309168,0.0008426612,0.00007117749,0.00007745277,0.0001323654,0.0002427657,0.5455662,0.002660786,0.4485568,0.001585294,0.00002643388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6039449,0.0004160546,0.3847873,0.0005140217,0.00006484451,0.0002567594,0.001285538,0.000389561,0.008341034],"genre_scores_gemma":[0.7873074,0.0003657086,0.2013041,0.0001777746,0.00004661439,0.0002051372,0.001539651,0.0002277161,0.008825887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005562891,"threshold_uncertainty_score":0.01860976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01092403794040013,"score_gpt":0.2639048718195904,"score_spread":0.2529808338791902,"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."}}