{"id":"W2602646780","doi":"10.1109/iccv.2017.55","title":"MIHash: Online Hashing with Mutual Information","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Hash function; Double hashing; Computer science; Dynamic perfect hashing; Hash table; Mutual information; Universal hashing; Feature hashing; Consistent hashing; Data mining; Theoretical computer science; Hash chain; Information retrieval; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008072459,0.00006896366,0.0000678412,0.00004201018,0.000264782,0.0005681256,0.0007889232,0.00002478729,0.000007248424],"category_scores_gemma":[0.00008398106,0.00004779602,0.00001665298,0.00004940945,0.00004009926,0.007012562,0.0002209257,0.00007929276,0.00003875873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001339016,"about_ca_system_score_gemma":0.00002620893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002650594,"about_ca_topic_score_gemma":0.00001089397,"domain_scores_codex":[0.999516,0.000005112032,0.0001022997,0.00009988005,0.0001490154,0.0001277008],"domain_scores_gemma":[0.9991184,0.00001596143,0.0001084265,0.000632806,0.00008292803,0.0000414699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001542598,0.00003686274,0.001009396,0.00001156565,0.000008041844,0.00001072832,0.0004369607,0.000006465141,0.0004738399,0.05123976,0.001951333,0.9447996],"study_design_scores_gemma":[0.002959464,0.001721013,0.05671443,0.0003678534,0.00001790079,0.0002101649,0.0003744098,0.09930184,0.3829617,0.0328918,0.4207344,0.001744957],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004704149,0.000005680734,0.9802763,0.0009124852,0.00003543444,0.00007567531,0.000001240475,0.0003152549,0.01367373],"genre_scores_gemma":[0.4594904,0.00001017858,0.5393549,0.0005795226,0.00003390697,0.000002818046,0.000003513272,0.000002817415,0.00052192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9430547,"threshold_uncertainty_score":0.5478448,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01878905510008598,"score_gpt":0.2896238537027163,"score_spread":0.2708347986026303,"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."}}