{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009650835,0.00009235065,0.0001021255,0.00005032631,0.0001834154,0.0002384707,0.0004460705,0.00002953352,0.0003992934],"category_scores_gemma":[0.00001039762,0.00007116814,0.00003067502,0.0001349598,0.00006302624,0.0005296736,0.0003529058,0.00008620819,0.00008522843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008016534,"about_ca_system_score_gemma":0.000003406014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008395858,"about_ca_topic_score_gemma":0.000006444365,"domain_scores_codex":[0.9992002,0.00003358561,0.0001031847,0.0003020616,0.0001714922,0.0001895326],"domain_scores_gemma":[0.9993932,0.00003751108,0.00003018026,0.0004142613,0.00002145225,0.0001033426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001338686,0.0001519083,0.003269038,0.0000153957,0.00001668411,0.00002937106,0.0008169488,0.000004808402,0.0009012139,0.7555223,0.04660913,0.1926619],"study_design_scores_gemma":[0.000924048,0.0002037657,0.02515149,0.0000310281,0.000008376441,0.0001372133,0.00003682702,0.8397043,0.000688441,0.06765497,0.06491459,0.0005449814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01667279,0.0004482282,0.9662165,0.0006759786,0.00021472,0.00009210818,0.000004123071,0.0002549014,0.01542065],"genre_scores_gemma":[0.947719,0.00009487791,0.05061603,0.0005582487,0.00007061917,0.000003792644,0.000003223226,0.00000582234,0.0009283533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9310462,"threshold_uncertainty_score":0.4371983,"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."}}