{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002239387,0.0001373643,0.0002728455,0.0001368575,0.00006576597,0.00002123453,0.0008076711,0.00003949904,0.000009149911],"category_scores_gemma":[0.00004013975,0.000123127,0.00008950567,0.0006867832,0.0002395532,0.0001845633,0.0001899645,0.0001081041,0.000008823265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002477971,"about_ca_system_score_gemma":0.00005625621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002141447,"about_ca_topic_score_gemma":0.000002960785,"domain_scores_codex":[0.9986008,0.00001169829,0.0004461712,0.000236308,0.0004510776,0.0002539553],"domain_scores_gemma":[0.9986151,0.0001630921,0.0002701331,0.0007858687,0.00009241988,0.00007339222],"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.000006716215,0.0001081358,0.00001415702,0.0001468777,0.00001977663,0.000001471656,0.002452835,0.001381335,0.01094392,0.9845263,0.000004507283,0.0003940052],"study_design_scores_gemma":[0.0005272423,0.00005042955,0.00004865885,0.00005520097,0.000008599442,0.000001997332,0.0006423493,0.001758582,0.05366568,0.9430854,0.00002063438,0.0001352785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04122626,0.00003076722,0.9480187,0.00003736156,0.00003396824,0.0003037105,0.00002310428,0.00004641235,0.01027968],"genre_scores_gemma":[0.7200426,0.000008330487,0.2798688,0.000006319815,0.00000387998,0.00002570704,0.000004119982,0.00001089174,0.00002925064],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6788164,"threshold_uncertainty_score":0.5020974,"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."}}