{"id":"W30283385","doi":"10.3389/fpsyg.2018.01740","title":"Computing data cubes without redundant aggregated nodes and single graph paths: the sequential MCG approach","year":2008,"lang":"en","type":"article","venue":"Brazilian Symposium on Databases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Cuboid; Cube (algebra); Data cube; Computer science; Computation; Tuple; Graph; Hypercube; Base (topology); Algorithm; Reduction (mathematics); Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Data mining; Parallel computing","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003038349,0.001739918,0.002329467,0.004536993,0.00118546,0.002845853,0.004679103,0.001387064,0.00478009],"category_scores_gemma":[0.01603134,0.00162249,0.002963739,0.006752585,0.00189756,0.004383706,0.004602864,0.001737055,0.0009806836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001459453,"about_ca_system_score_gemma":0.003124398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02727493,"about_ca_topic_score_gemma":0.04597295,"domain_scores_codex":[0.9975963,0.0007857338,0.0002006939,0.0006475527,0.0005110662,0.0002585678],"domain_scores_gemma":[0.9899829,0.006064015,0.0007786609,0.001643964,0.001154977,0.0003754814],"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.000677874,0.0002832531,0.01138449,0.001071194,0.0006102443,0.0006305142,0.0008497443,0.553055,0.004188432,0.04875606,0.007961215,0.370532],"study_design_scores_gemma":[0.00005748782,0.00009457661,0.0008800579,0.00004828497,0.0000794454,0.00009165892,0.0002278117,0.9281982,0.0008158992,0.06596818,0.003511298,0.00002709699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01434127,0.000390318,0.9810159,0.00032852,0.0000471489,0.0002128231,0.000872975,0.00172272,0.001068325],"genre_scores_gemma":[0.09193062,0.0002954294,0.9040697,0.0001252227,0.00006197204,0.0003284849,0.002006873,0.0002686137,0.0009131523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02727493,"threshold_uncertainty_score":0.05423236,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07017860466193648,"score_gpt":0.282689483014899,"score_spread":0.2125108783529625,"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."}}