{"id":"W2739962508","doi":"10.24963/ijcai.2017/611","title":"Lossy Compression of Pattern Databases Using Acyclic Random Hypergraphs","year":2017,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Heuristics; Computer science; Heuristic; Bloom filter; Compression (physics); Data compression; Directed acyclic graph; Lossy compression; Algorithm; Database; Filter (signal processing); Theoretical computer science; Artificial intelligence","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.0005450371,0.0004300113,0.0004889227,0.001871729,0.0003524737,0.0007002905,0.001044778,0.0004244526,0.001581638],"category_scores_gemma":[0.003762535,0.0002082654,0.0002757617,0.003579314,0.0004147852,0.002112417,0.0008076971,0.0003902248,0.0004547104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006942195,"about_ca_system_score_gemma":0.0006404314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002038261,"about_ca_topic_score_gemma":0.002160957,"domain_scores_codex":[0.9992386,0.0001548454,0.00008539166,0.0001227971,0.0003222411,0.00007610713],"domain_scores_gemma":[0.9972489,0.0009973135,0.0002022494,0.001104669,0.0003950693,0.0000517584],"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.001019288,0.0001720277,0.003736748,0.0003391112,0.00009884542,0.0008294407,0.000369171,0.09704884,0.05994758,0.02150395,0.01238572,0.8025493],"study_design_scores_gemma":[0.0001273369,0.0003408695,0.003018035,0.00007593317,0.00006876371,0.001394777,0.0003442328,0.7554869,0.1900631,0.03100435,0.01801761,0.00005808051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.279825,0.002256657,0.7009817,0.0006379519,0.0001322078,0.0002601939,0.001977881,0.008704294,0.005224116],"genre_scores_gemma":[0.7101581,0.0009477386,0.2817383,0.0002845547,0.0000419353,0.0002102512,0.003285499,0.0003267932,0.003006976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002038261,"threshold_uncertainty_score":0.005291104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06606738627133817,"score_gpt":0.3277021385232198,"score_spread":0.2616347522518816,"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."}}