{"id":"W2917106292","doi":"10.14778/3303753.3303756","title":"Correlation constraint shortest path over large multi-relation graphs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relation (database); Theoretical computer science; Computer science; Reachability; Vertex (graph theory); Tree traversal; Enhanced Data Rates for GSM Evolution; Shortest path problem; Longest path problem; Mathematics; Discrete mathematics; Graph; Algorithm; Data mining; Artificial intelligence","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.001703048,0.0008879293,0.001332721,0.001495367,0.001051661,0.00154793,0.001867257,0.001227148,0.002186405],"category_scores_gemma":[0.01127103,0.00067295,0.0008618105,0.004853969,0.001070576,0.006254167,0.001950606,0.001797035,0.0002743341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002075499,"about_ca_system_score_gemma":0.001608752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006650717,"about_ca_topic_score_gemma":0.009261714,"domain_scores_codex":[0.9973374,0.000944526,0.0001767876,0.0007293909,0.0005805996,0.0002312805],"domain_scores_gemma":[0.9892029,0.00766222,0.001123774,0.001098996,0.0005613024,0.0003506904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002028551,0.000134073,0.002538973,0.0003905185,0.0001024703,0.0008799752,0.0003775811,0.8110193,0.005774776,0.09066295,0.004381991,0.08353452],"study_design_scores_gemma":[0.00002842767,0.00003552161,0.0004845891,0.00001697136,0.00002146906,0.0002282007,0.0001421015,0.9050405,0.00188832,0.08996712,0.002131013,0.00001573844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1204833,0.0005549997,0.8736378,0.00100227,0.00003247619,0.0001633146,0.00125459,0.0009740181,0.001897397],"genre_scores_gemma":[0.5382194,0.0005780685,0.4561052,0.0002535979,0.00004681283,0.000227294,0.00231388,0.0002702518,0.001985533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006650717,"threshold_uncertainty_score":0.01505882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01023515333424801,"score_gpt":0.2181015650240609,"score_spread":0.2078664116898129,"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."}}