{"id":"W2951937026","doi":"10.48550/arxiv.1510.04347","title":"Processing Regular Path Queries on Arbitrarily Distributed Data","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Query optimization; Path (computing); Graph; Distributed database; Matching (statistics); Path expression; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Process (computing); Data mining; Query language; Database; Mathematics; 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.004916283,0.0008530843,0.001296829,0.001264323,0.001064816,0.002023263,0.002430529,0.001506877,0.001675261],"category_scores_gemma":[0.03202797,0.0004608413,0.0008095364,0.00251414,0.001927102,0.005657633,0.003127369,0.001786702,0.0004233548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001317038,"about_ca_system_score_gemma":0.001490074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003933604,"about_ca_topic_score_gemma":0.003673404,"domain_scores_codex":[0.9934396,0.001980585,0.0005546974,0.00138806,0.00210519,0.0005319235],"domain_scores_gemma":[0.9677902,0.02063644,0.002213094,0.006542637,0.002283095,0.0005345691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001635279,0.000509567,0.01047614,0.000493977,0.000255064,0.0009133262,0.001423539,0.6193915,0.04267508,0.08496126,0.01340795,0.2238573],"study_design_scores_gemma":[0.00008358389,0.0001568059,0.0007637392,0.0000124678,0.0000367884,0.0002580147,0.0003661672,0.8744753,0.01397064,0.1071727,0.002676589,0.00002729625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1571532,0.0003407303,0.8358729,0.001342625,0.00008584715,0.000258974,0.0005275452,0.002993474,0.001424888],"genre_scores_gemma":[0.6850526,0.000229979,0.310732,0.0003318596,0.00009978163,0.000190833,0.001081547,0.0004509403,0.001830394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004916283,"threshold_uncertainty_score":0.02600008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1321838184135458,"score_gpt":0.2147207815815157,"score_spread":0.0825369631679699,"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."}}