{"id":"W4389179369","doi":"10.1016/j.compeleceng.2023.109048","title":"An approximation algorithm for high-dimensional table compression on balanced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.svg\" display=\"inline\" id=\"d1e169\"><mml:mi>K</mml:mi></mml:math>-partite graph","year":2023,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Table (database); Compression (physics); Approximation algorithm; Algorithm; Mathematics; Combinatorics; Data compression; Graph; Discrete mathematics; Computer science; Data mining; Physics","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004028901,0.0003272339,0.0002581154,0.0003082882,0.0004391501,0.00032162,0.0008623078,0.0002344435,0.000002807491],"category_scores_gemma":[0.00006842413,0.0003802782,0.0002247029,0.001152802,0.00006465642,0.0005514147,0.0003646062,0.0004467326,0.00008475086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002812868,"about_ca_system_score_gemma":0.00008525229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000315884,"about_ca_topic_score_gemma":0.000001570358,"domain_scores_codex":[0.997341,0.00004391757,0.0004590282,0.0007346859,0.0006347664,0.000786574],"domain_scores_gemma":[0.9983258,0.0005146365,0.0001849552,0.0006465237,0.00006844622,0.000259663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002800176,0.0001178962,8.664541e-7,0.00006735952,0.00005897177,0.00004125848,0.0001036405,0.1074243,0.002301836,0.8581936,0.0006191997,0.03104302],"study_design_scores_gemma":[0.0006022194,0.0005218954,0.000105443,0.0001768786,0.00002610454,0.00004628222,0.00000502812,0.9894196,0.006570713,0.001428069,0.0007218065,0.0003759665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3661177,0.00007117538,0.6320959,0.0001170377,0.0009385985,0.00008454833,0.00002229263,0.0005375173,0.00001515813],"genre_scores_gemma":[0.7423819,0.00004412302,0.2557876,0.0004012422,0.0006448712,0.0002384926,0.0003964791,0.0000914998,0.0000138439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8819953,"threshold_uncertainty_score":0.9998649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01386289608177232,"score_gpt":0.2317022944909012,"score_spread":0.2178393984091289,"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."}}