{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008431176,0.0006480812,0.0005731178,0.0004607531,0.0004807147,0.001062812,0.008793867,0.0003412719,0.00001700641],"category_scores_gemma":[0.00013529,0.000461859,0.0000767493,0.0004875655,0.0007951853,0.002057727,0.005403867,0.0007711122,0.00005382377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002254603,"about_ca_system_score_gemma":0.0008558625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001097999,"about_ca_topic_score_gemma":0.00001273989,"domain_scores_codex":[0.9946094,0.00004081621,0.0005559777,0.002629733,0.001391524,0.0007725664],"domain_scores_gemma":[0.9942912,0.0003296931,0.0003995745,0.004521403,0.000229586,0.0002285064],"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.00001125092,0.00003094687,0.000007342049,0.0000358011,0.000006471828,0.000129809,0.0001109836,0.0006610673,0.00007093654,0.02666437,0.0002608647,0.9720101],"study_design_scores_gemma":[0.0004912246,0.0002804491,0.0001224122,0.002874945,0.00001211269,0.00009933346,1.738091e-7,0.700038,0.0008522966,0.2539774,0.03991543,0.00133624],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000008824892,0.0007610997,0.9939412,0.001232153,0.001374057,0.0002984937,0.0002500945,0.000268052,0.001865988],"genre_scores_gemma":[0.0312375,0.0001903046,0.9627428,0.002785915,0.001877338,0.0000157471,0.0003650922,0.0001018741,0.0006834462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9706739,"threshold_uncertainty_score":0.9999742,"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."}}