{"id":"W1938119559","doi":"10.1109/sct.1990.113958","title":"Perfect hashing, graph entropy, and circuit complexity","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Boolean function; Entropy (arrow of time); Perfect hash function; Discrete mathematics; Graph; Boolean circuit; Computer science; Upper and lower bounds; Time complexity; Mathematics; Combinatorics; Hash table","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.0007930823,0.0004175264,0.0005113619,0.001415406,0.0005631217,0.001957524,0.0009915521,0.0009350423,0.003731786],"category_scores_gemma":[0.009912064,0.0003459542,0.0003990352,0.001910157,0.002713513,0.006288838,0.001617377,0.001364915,0.0004064712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001891204,"about_ca_system_score_gemma":0.0006443624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008042625,"about_ca_topic_score_gemma":0.0008408577,"domain_scores_codex":[0.9990457,0.0001925237,0.00003975319,0.0001826658,0.0003713806,0.0001679856],"domain_scores_gemma":[0.992582,0.005522754,0.0006487574,0.0008477793,0.000250927,0.0001477266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001956565,0.0000477844,0.002078859,0.000170522,0.00003019887,0.0001081911,0.0001297277,0.117358,0.003467225,0.8282351,0.003199123,0.04497961],"study_design_scores_gemma":[0.00001445314,0.00004090044,0.0007186282,0.00002125474,0.0000136639,0.0001507709,0.00003768934,0.1770716,0.002552937,0.8174205,0.001939516,0.00001814849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3105827,0.007212984,0.628419,0.004335047,0.0002277997,0.0000868072,0.0009068814,0.001018478,0.04721026],"genre_scores_gemma":[0.965546,0.001669589,0.02782466,0.0002354722,0.0002103306,0.00007403309,0.0004062608,0.0000882141,0.003945363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003731786,"threshold_uncertainty_score":0.01372176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05915089932611687,"score_gpt":0.2331720587606091,"score_spread":0.1740211594344922,"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."}}