{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714948,0.0001237925,0.0002239343,0.00006829877,0.0004401849,0.0001905665,0.001630994,0.0000314221,0.00004775656],"category_scores_gemma":[0.00004189371,0.00008792734,0.00006835278,0.00005292973,0.00009141246,0.001407456,0.001584601,0.00007801871,0.00001120618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006034689,"about_ca_system_score_gemma":0.00002521428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001200734,"about_ca_topic_score_gemma":0.00001723317,"domain_scores_codex":[0.9989285,0.00004478946,0.0002311759,0.0003266199,0.0002787398,0.0001901739],"domain_scores_gemma":[0.9976252,0.00007736863,0.000251412,0.001905721,0.00005929436,0.00008096959],"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.00009744684,0.0006026998,0.08029473,0.0001358896,0.00008421628,0.00009018883,0.0003159729,0.000301576,0.1164321,0.009227,0.006899538,0.7855186],"study_design_scores_gemma":[0.003504623,0.00005845247,0.0363602,0.0004177945,0.00002052846,0.0000346415,0.00002269994,0.8922054,0.05901934,0.0009911442,0.006928925,0.0004362689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1210517,0.0001215925,0.8771483,0.0001013878,0.0003911685,0.0000954834,0.00002337759,0.0000545629,0.001012444],"genre_scores_gemma":[0.9265282,0.00004157742,0.07320848,0.00007624794,0.00006076918,0.000001876074,0.00001134656,0.000006524478,0.00006504338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8919038,"threshold_uncertainty_score":0.3585573,"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."}}