{"id":"W2029440477","doi":"10.1109/glocom.2014.7036987","title":"A hierarchical hashing scheme to accelerate longest prefix matching","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Petro-Canada","funders":"","keywords":"Computer science; Hash table; Hash function; Bottleneck; Prefix; Routing table; Bitmap; Parallel computing; Matching (statistics); Routing (electronic design automation); Trie; Scheme (mathematics); Data structure; Algorithm; Computer network; Routing protocol; Mathematics","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.0004068797,0.0001101097,0.0001135566,0.00007775587,0.0002009671,0.0006973299,0.0005999904,0.00004752418,0.00001429182],"category_scores_gemma":[0.00005197513,0.00009417116,0.00002572397,0.0003905061,0.0000134671,0.0005857355,0.0002604727,0.0001485479,0.0001248446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001842817,"about_ca_system_score_gemma":0.00003067169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158505,"about_ca_topic_score_gemma":0.00001183984,"domain_scores_codex":[0.9989386,0.00005810092,0.0001579496,0.0003599224,0.0001986078,0.0002868214],"domain_scores_gemma":[0.9993344,0.00007274478,0.00003851152,0.0003429061,0.00005561443,0.0001558024],"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.00002268271,0.0001414469,0.001793555,0.00006950188,0.000022573,0.000008685754,0.004435571,0.0817515,0.002707919,0.3673717,0.007763263,0.5339115],"study_design_scores_gemma":[0.0002079175,0.0000693776,0.000713185,0.0000713065,0.000002103672,0.000009700906,0.000009511658,0.9799073,0.001114697,0.01229694,0.005325117,0.0002728727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0292627,0.00001151514,0.9518942,0.003962604,0.0001856362,0.00006483723,8.650993e-8,0.0003733762,0.01424505],"genre_scores_gemma":[0.5022498,0.000001465478,0.4947327,0.002106287,0.0001435291,0.000006386404,0.000001104711,0.000007908749,0.0007508305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8981557,"threshold_uncertainty_score":0.6724368,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0161179181038108,"score_gpt":0.2500201451878317,"score_spread":0.2339022270840209,"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."}}