{"id":"W2284790019","doi":"10.1007/978-3-319-48472-3_53","title":"Processing Regular Path Queries on Arbitrarily Distributed Data","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Path (computing); Query optimization; Graph; Path expression; Distributed database; Theoretical computer science; Matching (statistics); Node (physics); Enhanced Data Rates for GSM Evolution; Data mining; Query language; Distributed computing; Artificial intelligence; Mathematics","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.00172722,0.00109037,0.002059715,0.001115554,0.001058698,0.002297476,0.002087515,0.001526321,0.005029093],"category_scores_gemma":[0.008896429,0.0006614074,0.0007683288,0.002981181,0.001346709,0.005369888,0.003992697,0.001962777,0.001787845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007823816,"about_ca_system_score_gemma":0.001100662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001357304,"about_ca_topic_score_gemma":0.001837524,"domain_scores_codex":[0.9971877,0.0004117573,0.0002224191,0.000509374,0.001306397,0.0003623647],"domain_scores_gemma":[0.9924703,0.004530645,0.0002824961,0.002009501,0.0005286476,0.0001784735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002972676,0.0005593759,0.003936594,0.0009425614,0.0002489358,0.001082285,0.001395686,0.1637667,0.07827483,0.07995824,0.03555864,0.6313035],"study_design_scores_gemma":[0.0001404961,0.0002491371,0.0004557299,0.00003341311,0.00005045228,0.0005158904,0.000413445,0.8071185,0.02803148,0.155236,0.007724118,0.00003133128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1749033,0.001026729,0.8072562,0.00096348,0.0002769874,0.0003412768,0.0007834359,0.008404655,0.006043973],"genre_scores_gemma":[0.5596518,0.0006800102,0.4223171,0.0003022852,0.0003385115,0.0003101841,0.003134348,0.001202657,0.01206313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005029093,"threshold_uncertainty_score":0.01682395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02557981989891778,"score_gpt":0.2560736317503194,"score_spread":0.2304938118514016,"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."}}