{"id":"W3193727411","doi":"10.1109/icip42928.2021.9506441","title":"A Simple Supervised Hashing Algorithm Using Projected Gradient and Oppositional Weights","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Vector Institute; University of Waterloo","funders":"","keywords":"Computer science; Hash function; K-independent hashing; Binary code; Algorithm; Feature hashing; Locality-sensitive hashing; Binary number; Artificial intelligence; Theoretical computer science; Mathematics; Hash table; Perfect hash function; Double hashing","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.00008577973,0.0001064551,0.0001210223,0.00006816437,0.0001803991,0.0002199308,0.0001759814,0.00003755191,0.00002478513],"category_scores_gemma":[0.00002827795,0.00009325516,0.00003807623,0.0003920646,0.00002995263,0.0008362711,0.0002707058,0.00008817559,0.000001942748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003831493,"about_ca_system_score_gemma":0.0000955579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002732941,"about_ca_topic_score_gemma":0.000002974622,"domain_scores_codex":[0.9990588,0.00004434777,0.000148994,0.0003534169,0.0001866926,0.0002077066],"domain_scores_gemma":[0.9994335,0.00005228941,0.00002964111,0.0002356948,0.0001655156,0.00008334553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001011628,0.0003074816,0.0008835575,0.0000565112,0.00006939539,0.0007170534,0.001079786,0.000009959714,0.1528508,0.1028617,0.0008126424,0.740341],"study_design_scores_gemma":[0.0004730076,0.00009585016,0.001103076,0.00005010752,0.00001062377,0.0004311985,0.00006633374,0.4744385,0.4758678,0.04311609,0.00397652,0.0003708811],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02008557,0.0002265432,0.978623,0.0001994885,0.00004556831,0.0001100316,0.00000380505,0.0002690282,0.0004369722],"genre_scores_gemma":[0.04351683,0.00004337298,0.9557798,0.000466662,0.00004593949,0.000005828275,0.00001186813,0.000007467573,0.0001222497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7399701,"threshold_uncertainty_score":0.3802835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03082642788893333,"score_gpt":0.293982738510325,"score_spread":0.2631563106213917,"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."}}