{"id":"W2405736458","doi":"10.5441/002/edbt.2016.10","title":"Providing Serializability for Pregel-like Graph Processing Systems","year":2016,"lang":"en","type":"article","venue":"Movebank","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Serializability; Computer science; Two-phase locking; Correctness; Distributed computing; Graph; Theoretical computer science; Parallel computing; Transaction processing; Algorithm; Online transaction processing; Programming language; Distributed transaction; Database transaction","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.0007869885,0.0001494055,0.0001748348,0.00007552815,0.0002280027,0.0002723512,0.0006744573,0.0000689298,0.000004509346],"category_scores_gemma":[0.00008269642,0.00009726695,0.00009992282,0.0002574995,0.00007381043,0.0008828472,0.000114488,0.00004125786,0.000009401653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003540303,"about_ca_system_score_gemma":0.00005813586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006567372,"about_ca_topic_score_gemma":8.444371e-7,"domain_scores_codex":[0.9986305,0.00009030035,0.0002525488,0.000492804,0.0001771904,0.000356636],"domain_scores_gemma":[0.9990147,0.0001445852,0.0001177354,0.0005065136,0.0001309365,0.00008557377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009498318,0.0002340388,0.004188204,0.00081818,0.00005925615,0.000009735706,0.001280568,0.0001589851,0.03095481,0.6542698,0.000870392,0.307061],"study_design_scores_gemma":[0.005513936,0.0008483432,0.005304574,0.00141398,0.0000573464,0.00008664593,0.0001349397,0.1116738,0.06882282,0.7525063,0.05137771,0.002259583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03189821,0.0002672276,0.9649227,0.0002720406,0.001354667,0.0005812913,0.00001188802,0.0003236884,0.0003683188],"genre_scores_gemma":[0.989203,0.000002735153,0.009440985,0.00008596661,0.0001770869,0.0001949891,0.000001096231,0.00001439148,0.0008797208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9573048,"threshold_uncertainty_score":0.3966431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01629989491537868,"score_gpt":0.2334018277599278,"score_spread":0.2171019328445491,"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."}}