{"id":"W2155322527","doi":"10.1109/arrays.1988.18046","title":"New architectures for systolic hashing","year":2003,"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 Windsor","funders":"","keywords":"Hash function; Sorting; Computer science; Hash table; Dynamic perfect hashing; Double hashing; Constant (computer programming); Universal hashing; Theoretical computer science; Parallel computing; Linear hashing; Process (computing); Algorithm; Programming language","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.0000959683,0.00006059769,0.00006646865,0.0000358049,0.0000913093,0.000120594,0.0003895506,0.00002133868,0.00002460496],"category_scores_gemma":[0.00004024343,0.0000433881,0.00003287868,0.00008324345,0.000004306607,0.00008117516,0.00007033715,0.00003851209,0.00001539396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007042629,"about_ca_system_score_gemma":0.00005008774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004923809,"about_ca_topic_score_gemma":0.00000610253,"domain_scores_codex":[0.9994734,0.0000155559,0.00007837258,0.0001872798,0.00009118655,0.000154183],"domain_scores_gemma":[0.9995024,0.0000668764,0.00002117255,0.0003157652,0.00001474914,0.00007900927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000209559,0.00001586407,0.00005660116,0.00001197026,0.000007041184,0.000002330617,0.0002417491,0.0004129591,0.000512783,0.6794623,0.03637514,0.2828991],"study_design_scores_gemma":[0.001030882,0.0001406688,0.0006099913,0.00004884264,0.000006217003,0.00008556911,0.00002582664,0.203243,0.01860781,0.159387,0.6163527,0.0004614131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008313417,0.0001133249,0.9928309,0.0002380078,0.0002387405,0.00009942905,8.231185e-7,0.0001157218,0.005531671],"genre_scores_gemma":[0.08121603,7.925445e-7,0.9166088,0.0003600668,0.00006724719,0.000006468083,9.169088e-7,0.000004330584,0.00173533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5799776,"threshold_uncertainty_score":0.1769316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01726223846669052,"score_gpt":0.2539850074961375,"score_spread":0.236722769029447,"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."}}