{"id":"W2911641194","doi":"10.1109/lcn.2018.8638116","title":"FCTree: A Space Efficient FIB Data Structure for NDN Routers","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bloom filter; Router; Computer network; Hash function; Routing table; Latency (audio); Data structure; Prefix; Hash table; Routing protocol; Distributed computing; Routing (electronic design automation); Operating system","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.0007415805,0.0004924627,0.0005798471,0.001901074,0.0009883021,0.001365572,0.002398676,0.0007914874,0.0050643],"category_scores_gemma":[0.003130617,0.0003664072,0.0004179956,0.002215767,0.0006130546,0.002445159,0.001573153,0.0006617652,0.001467066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001468338,"about_ca_system_score_gemma":0.001923282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004551985,"about_ca_topic_score_gemma":0.006412474,"domain_scores_codex":[0.9994735,0.00005938027,0.000069194,0.00006000109,0.0002831753,0.00005467128],"domain_scores_gemma":[0.9982224,0.0003447904,0.0001958596,0.0005494196,0.000589007,0.0000984583],"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.001413991,0.0002744597,0.004325098,0.0008908308,0.00009231272,0.0005331176,0.0006526582,0.03895697,0.08210707,0.05496171,0.07190857,0.7438832],"study_design_scores_gemma":[0.0005298941,0.001626378,0.003854231,0.0003363099,0.0001433408,0.00182084,0.000683401,0.5258279,0.1364262,0.04842799,0.2800091,0.0003144311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05454204,0.002055801,0.9127302,0.000743232,0.0003108071,0.000831431,0.00419643,0.014227,0.01036318],"genre_scores_gemma":[0.269981,0.001008623,0.7056186,0.0005899344,0.0001358489,0.001100348,0.01229308,0.0007293289,0.008543286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0050643,"threshold_uncertainty_score":0.01694179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03528415153386113,"score_gpt":0.2689739565103221,"score_spread":0.2336898049764609,"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."}}