{"id":"W1985797130","doi":"10.1016/j.dam.2004.01.005","title":"Minimum average distance of strong orientations of graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Multipartite; Upper and lower bounds; Eulerian path; Girth (graph theory); Planar graph; Graph; Connectivity; Discrete mathematics; Lagrangian","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105264,0.001067976,0.001579057,0.002476027,0.001664443,0.003942,0.002372804,0.00164268,0.004557946],"category_scores_gemma":[0.01055872,0.0009726704,0.0006450849,0.002149259,0.001922846,0.004800306,0.002116375,0.002201649,0.0007284318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001489091,"about_ca_system_score_gemma":0.0007012964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008697154,"about_ca_topic_score_gemma":0.001610165,"domain_scores_codex":[0.9990076,0.0002509668,0.00007339138,0.0002664713,0.0002339631,0.0001676202],"domain_scores_gemma":[0.9894494,0.005558749,0.001375874,0.0007622141,0.001014951,0.001838704],"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.002034845,0.0003032291,0.01492399,0.000656699,0.0001949361,0.0003710261,0.001229732,0.04749421,0.02178438,0.8449599,0.007707884,0.05833926],"study_design_scores_gemma":[0.0001086358,0.0001714499,0.004548701,0.0000431886,0.00006508646,0.0003118166,0.000545522,0.06565382,0.003972127,0.9214896,0.003051788,0.00003813169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8881137,0.0007136503,0.09766296,0.0008602299,0.0001115205,0.00004356904,0.0008368751,0.0002133466,0.01144421],"genre_scores_gemma":[0.9528783,0.0005924417,0.04036343,0.0001651393,0.0001743885,0.00009262752,0.00126662,0.0001734388,0.004293533],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004557946,"threshold_uncertainty_score":0.01524782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01800146533146364,"score_gpt":0.2891017829121568,"score_spread":0.2711003175806932,"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."}}