{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009257443,0.0006056259,0.0005434345,0.001040873,0.0007066992,0.001749658,0.001875781,0.0007467463,0.009167894],"category_scores_gemma":[0.001855024,0.0004808738,0.0005750308,0.001643864,0.0008014747,0.002908604,0.001602741,0.001177948,0.003220125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008587844,"about_ca_system_score_gemma":0.001098012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005014727,"about_ca_topic_score_gemma":0.001079806,"domain_scores_codex":[0.9994252,0.00007432268,0.00005919093,0.00007737385,0.0002906669,0.00007327334],"domain_scores_gemma":[0.9990569,0.0001885757,0.00006785584,0.0002272096,0.000396309,0.00006310209],"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.0003730657,0.0001343382,0.0008047275,0.000493501,0.00006075143,0.0002780837,0.0002716031,0.02698268,0.03781587,0.3324744,0.02366922,0.5766419],"study_design_scores_gemma":[0.0003334457,0.001042246,0.0008613266,0.0001995405,0.0001226694,0.001582213,0.000227281,0.3738048,0.055464,0.2833381,0.2828723,0.0001520571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01028896,0.001874663,0.96687,0.0003911967,0.0007289218,0.0001092642,0.0001525312,0.003251819,0.01633268],"genre_scores_gemma":[0.1439044,0.002265673,0.8326735,0.000473937,0.0006950897,0.0003607524,0.0007905709,0.0002557448,0.01858042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009167894,"threshold_uncertainty_score":0.03066963,"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."}}