{"id":"W2768096823","doi":"10.1109/tnet.2019.2926230","title":"SHIP: A Scalable High-Performance IPv6 Lookup Algorithm That Exploits Prefix Characteristics","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Trie; Prefix; Scalability; Parallel computing; IPv6; Data structure; Latency (audio); Exploit; Tree traversal; Algorithm; Operating system; The Internet","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006169564,0.0008158576,0.0008254747,0.0004013402,0.00072922,0.001150422,0.002457352,0.0007378511,0.00003059396],"category_scores_gemma":[0.00000773454,0.0008625545,0.0002384924,0.0008243046,0.0000897463,0.0008623459,0.0001548118,0.001977677,0.0001764453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000319417,"about_ca_system_score_gemma":0.0003480682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002970537,"about_ca_topic_score_gemma":0.000007273861,"domain_scores_codex":[0.9955851,0.0001944601,0.0007534608,0.001578336,0.0008508331,0.001037823],"domain_scores_gemma":[0.9960818,0.0002650787,0.000661589,0.002516596,0.0002423139,0.0002325788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002230058,0.0001264363,0.0001314871,0.0001912476,0.00008749849,0.000009037429,0.0003035716,0.5099972,0.000005971815,0.00001590405,0.0002769509,0.4888323],"study_design_scores_gemma":[0.0005249754,0.0001360178,0.0003242605,0.002387821,0.0001137104,0.00002478627,0.00001190486,0.9907238,0.001168442,0.0009984564,0.002529452,0.001056341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007760024,0.0004750257,0.9728574,0.0002766774,0.01652888,0.0006536987,0.00003364926,0.0009360163,0.0004786838],"genre_scores_gemma":[0.8242359,0.002720571,0.168544,0.0004100278,0.00169571,0.0002188217,0.00009099722,0.0001352,0.001948713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8164759,"threshold_uncertainty_score":0.9998865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03242803925384465,"score_gpt":0.2392706449452485,"score_spread":0.2068426056914038,"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."}}