{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002378845,0.0001681373,0.0001815248,0.0003509352,0.0001581628,0.0001427614,0.000308198,0.00007022441,0.00001222357],"category_scores_gemma":[0.00002639554,0.0001656767,0.00004182166,0.0008952197,0.000114734,0.0008711408,0.00009719954,0.0001544143,0.000003300742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004638874,"about_ca_system_score_gemma":0.00002251941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006630516,"about_ca_topic_score_gemma":0.00005940466,"domain_scores_codex":[0.9985307,0.0001463612,0.0002480313,0.0004708122,0.0002464992,0.000357607],"domain_scores_gemma":[0.9993797,0.0001377321,0.00007079874,0.0002805372,0.00006411535,0.00006714257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000197766,0.0003867597,0.01526835,0.00008641653,0.00004626711,0.0001115356,0.002767106,0.2750591,0.0139191,0.6678979,0.00007437456,0.02418538],"study_design_scores_gemma":[0.000729121,0.00007212375,0.01401504,0.00005993808,0.000004274228,0.00001042733,0.00008096675,0.9417709,0.001491013,0.04147549,0.00002782129,0.0002628807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05734142,0.0001963737,0.9398792,0.0002699375,0.00005178426,0.0002731009,0.00001022944,0.0001172734,0.00186065],"genre_scores_gemma":[0.9238585,0.00007779236,0.07584306,0.0000399538,0.00001531463,0.00002508715,0.00006502044,0.00001713652,0.00005809456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8665171,"threshold_uncertainty_score":0.6756099,"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."}}