{"id":"W2043112783","doi":"10.1016/j.tcs.2008.09.061","title":"Fault-tolerant computation of distributed regular path queries","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computation; Computer science; Path (computing); Fault tolerance; Theoretical computer science; Parallel computing; Distributed computing; Algorithm; Mathematics; Programming language","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009524528,0.000240869,0.000425142,0.0001466725,0.0005345785,0.0001637842,0.002044447,0.00007496316,0.00000799825],"category_scores_gemma":[0.00007708198,0.0001997561,0.000112812,0.001722181,0.003707293,0.0008239156,0.0006104463,0.0001731618,0.00002877821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006277022,"about_ca_system_score_gemma":0.0002207375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001382053,"about_ca_topic_score_gemma":3.454047e-7,"domain_scores_codex":[0.9968485,0.0001386216,0.0005996456,0.0007450131,0.001083291,0.0005849649],"domain_scores_gemma":[0.9979835,0.0001260571,0.0002107161,0.0008523127,0.0005573721,0.0002700918],"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.00001224617,0.0001161307,0.0002334902,0.0000229991,0.000007089927,0.00004796508,0.0007212833,0.002490568,0.0009194528,0.9872577,0.0002344115,0.007936718],"study_design_scores_gemma":[0.0004914998,0.0002801506,0.006784495,0.0001135705,0.000004657557,0.0002399494,0.00001743979,0.9553971,0.005406959,0.0304936,0.0004112157,0.0003593334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1187965,0.00007632314,0.8792905,0.0003604028,0.0005101873,0.0001810492,0.0000238672,0.0002002653,0.0005609915],"genre_scores_gemma":[0.9287913,0.000006704143,0.07098944,0.00011541,0.00006835923,0.000006948535,0.000008511853,0.000007527544,0.000005732978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.956764,"threshold_uncertainty_score":0.9990041,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0103279312169427,"score_gpt":0.2333992794955134,"score_spread":0.2230713482785707,"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."}}