{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00227212,0.0004884605,0.0005326327,0.000416443,0.0007153765,0.0005749317,0.002065852,0.0003618873,0.000007800179],"category_scores_gemma":[0.00003470289,0.0004110792,0.0002170155,0.0003399564,0.00004231105,0.0008273089,0.0008187536,0.003172416,0.00003519646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006368695,"about_ca_system_score_gemma":0.001888368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001192422,"about_ca_topic_score_gemma":0.0000372024,"domain_scores_codex":[0.9947574,0.0002194057,0.000647198,0.001084055,0.0009154477,0.002376485],"domain_scores_gemma":[0.9974968,0.0001442845,0.0006740979,0.001149978,0.0003002239,0.0002345579],"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.0001631732,0.0007169454,0.00003414894,0.00007745571,0.0003346647,0.00001941207,0.0001491489,0.05799434,0.001794213,0.2115633,0.006460701,0.7206925],"study_design_scores_gemma":[0.0007762259,0.0005012167,0.0001218132,0.0002121117,0.00002100897,0.00004575113,0.00002047805,0.5567153,0.0005502466,0.4403728,0.0003076395,0.0003554149],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004628402,0.0005484423,0.9904211,0.0005379878,0.002709986,0.0006373885,0.0001397599,0.0003591921,0.00001770981],"genre_scores_gemma":[0.2057182,0.003812646,0.7775112,0.000749314,0.005085517,0.0006551875,0.003767736,0.0003382507,0.002361941],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.720337,"threshold_uncertainty_score":0.9998341,"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."}}