{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912176,0.00122695,0.001329967,0.001985919,0.001636635,0.001497351,0.003036257,0.001156678,0.005010044],"category_scores_gemma":[0.005290814,0.0006117238,0.0009310477,0.002399194,0.0006264473,0.003235545,0.002441954,0.001069493,0.001114637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013361,"about_ca_system_score_gemma":0.001932646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004674595,"about_ca_topic_score_gemma":0.01160323,"domain_scores_codex":[0.9986976,0.0003026526,0.0000704815,0.0003360729,0.0004116413,0.0001814381],"domain_scores_gemma":[0.997609,0.000773254,0.0001178351,0.0007059043,0.0005754206,0.0002185348],"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.001016783,0.001002108,0.00506756,0.000742671,0.0002182056,0.0004969604,0.0008206304,0.1674549,0.05475771,0.04345569,0.03810595,0.6868609],"study_design_scores_gemma":[0.00006568529,0.0001676987,0.0008657371,0.00004021443,0.00008109883,0.0003752419,0.0005894233,0.9380485,0.01300333,0.03920215,0.007531337,0.00002961402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08073127,0.0006002677,0.9048095,0.0007730352,0.0001699568,0.0005960374,0.001311842,0.003634014,0.007374144],"genre_scores_gemma":[0.3717441,0.0002816989,0.6165549,0.000325877,0.00008760746,0.0003333645,0.00426219,0.0008868196,0.005523424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005010044,"threshold_uncertainty_score":0.01676023,"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."}}