{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003783552,0.0001259545,0.000125024,0.00008863161,0.00008184447,0.0001186479,0.0007432235,0.00003869066,0.00003472811],"category_scores_gemma":[0.00002596507,0.00009112277,0.0000853626,0.0003279725,0.00003189132,0.0008753407,0.0005072589,0.0001105714,0.00004577821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733144,"about_ca_system_score_gemma":0.00001229843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000183685,"about_ca_topic_score_gemma":0.00000145518,"domain_scores_codex":[0.998851,0.000005533761,0.0002435744,0.0002960567,0.0003843234,0.0002195185],"domain_scores_gemma":[0.9994087,0.00002088011,0.0002333479,0.0002097469,0.00008906383,0.00003828408],"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.000006531156,0.000268037,0.1718948,0.00004293268,0.00005624243,4.235593e-7,0.0005922656,0.00008882503,0.005448272,0.8096076,0.002112792,0.009881196],"study_design_scores_gemma":[0.003004755,0.0001995438,0.3146127,0.0002777655,0.00006413156,0.000007211438,0.0004409049,0.6583411,0.006341008,0.00939721,0.006796488,0.0005171219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7148809,0.0002322647,0.2213642,0.001983369,0.004135265,0.00424825,0.00007326063,0.0005403269,0.0525422],"genre_scores_gemma":[0.9913014,0.00001501766,0.007853547,0.0001334726,0.00001915084,0.00001662937,0.00000636806,0.000007083472,0.0006473093],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8002104,"threshold_uncertainty_score":0.3715879,"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."}}