{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004851635,0.0004236842,0.0004227198,0.0001512262,0.001190952,0.0001710425,0.001551427,0.00005545294,0.000006427642],"category_scores_gemma":[0.0001186879,0.0002974091,0.00006417018,0.0005293275,0.0006661617,0.002088215,0.002240571,0.0002792566,0.00002287784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003264607,"about_ca_system_score_gemma":0.0001199533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000571864,"about_ca_topic_score_gemma":0.00006092508,"domain_scores_codex":[0.9967008,0.0002852431,0.0005231802,0.001344589,0.0005710971,0.0005750544],"domain_scores_gemma":[0.9957431,0.0002240532,0.0002909663,0.003455014,0.00009332835,0.0001935383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008684944,0.005384007,0.02724169,0.001752185,0.00120709,0.002255755,0.01784918,0.00576622,0.2073474,0.5508279,0.09266538,0.08683468],"study_design_scores_gemma":[0.005170471,0.0009520325,0.00710323,0.002220391,0.0002167135,0.007964483,0.002952703,0.3804474,0.0490425,0.0002097024,0.5392077,0.004512711],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1143137,0.001395286,0.8771772,0.0008056549,0.0007573287,0.000773626,0.002595188,0.0006431493,0.001538849],"genre_scores_gemma":[0.8014929,0.0006318811,0.1937733,0.000757126,0.0004868458,0.00002949728,0.002478617,0.00006959299,0.0002802212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6871792,"threshold_uncertainty_score":0.9999478,"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."}}