{"id":"W4400404039","doi":"10.1007/s00778-024-00860-1","title":"Minimum motif-cut: a workload-aware RDF graph partitioning strategy","year":2024,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Motif (music); RDF; Computer science; Workload; Graph; Parallel computing; Theoretical computer science; Artificial intelligence; Operating system; Art; Semantic Web","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001028327,0.0001501013,0.0001251028,0.0001708545,0.0006185409,0.001379666,0.0009802816,0.0000484748,0.0001363181],"category_scores_gemma":[0.0000142388,0.0000944668,0.0001891191,0.0007697914,0.00009843123,0.0006651719,0.0001159216,0.0006208968,0.0001790031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000206631,"about_ca_system_score_gemma":0.00009521174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001926978,"about_ca_topic_score_gemma":0.000004084367,"domain_scores_codex":[0.9986172,0.0002044469,0.0002620857,0.0002265862,0.0003062317,0.0003833932],"domain_scores_gemma":[0.9992418,0.0001554644,0.00006993097,0.0003307927,0.000058218,0.000143739],"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.00006980171,0.000172541,0.0001951522,0.00006979134,0.0004408599,0.001905193,0.008729089,0.007274892,0.001216932,0.5152762,0.01663759,0.448012],"study_design_scores_gemma":[0.0003149975,0.0003989216,0.0006185207,0.0006063091,0.00004615689,0.003037249,0.0006529272,0.08024298,0.001207422,0.9078227,0.004687979,0.0003638732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1257935,0.008362527,0.8491322,0.007364978,0.004234648,0.0001714848,0.000006974517,0.0004720986,0.004461501],"genre_scores_gemma":[0.9971019,0.0001909276,0.001135261,0.0002604917,0.0005505976,0.000005314096,5.34709e-7,0.00001259658,0.0007423658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8713084,"threshold_uncertainty_score":0.999657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01798901487496369,"score_gpt":0.2505109329032429,"score_spread":0.2325219180282793,"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."}}