{"id":"W4385434808","doi":"10.2139/ssrn.4526745","title":"An Approximation Algorithm for High-Dimensional Table Compression on Balanced K-Partite Graph","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Compression (physics); Table (database); Graph; Algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Data mining; Physics","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.0005283036,0.001169182,0.001558586,0.002170054,0.001056357,0.002435544,0.002511139,0.00154743,0.0117844],"category_scores_gemma":[0.003946091,0.0005305176,0.0009177314,0.005750936,0.0006690143,0.003470473,0.002351332,0.001544274,0.003573946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001658805,"about_ca_system_score_gemma":0.002235642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004955253,"about_ca_topic_score_gemma":0.007955294,"domain_scores_codex":[0.9990026,0.0001261873,0.00007657579,0.0001993204,0.000404704,0.0001906601],"domain_scores_gemma":[0.9980488,0.0006349415,0.0001124545,0.0008099022,0.0002939858,0.00009996451],"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.001029494,0.0004232156,0.001598575,0.0004045086,0.0001052684,0.0001977032,0.0003379103,0.1061468,0.01209751,0.02966368,0.051615,0.7963805],"study_design_scores_gemma":[0.0002934849,0.0002317405,0.0007816236,0.00005066167,0.00008362636,0.0004503962,0.0002576615,0.919521,0.009338601,0.05928992,0.009660508,0.00004071719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1021115,0.002065408,0.8647719,0.001787003,0.000530171,0.0004910323,0.003129407,0.009605345,0.01550839],"genre_scores_gemma":[0.2913978,0.0007295597,0.690176,0.0004216726,0.0002638522,0.0005571248,0.005688087,0.0005595452,0.01020635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0117844,"threshold_uncertainty_score":0.03942275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171977537185013,"score_gpt":0.2713848927044734,"score_spread":0.2541871389859721,"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."}}