{"id":"W2762847751","doi":"10.1109/infocom.2017.8057003","title":"BD-CAT: Balanced dynamic content addressing in trees","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Embedding; Greedy algorithm; Routing (electronic design automation); Content (measure theory); Scheme (mathematics); Upper and lower bounds; Point (geometry); Range (aeronautics); Distributed computing; Theoretical computer science; Mathematical optimization; Algorithm; Computer network; Mathematics; Artificial intelligence","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.0007795522,0.0004288451,0.0005538284,0.0007703747,0.0009300834,0.001281783,0.001437725,0.001029559,0.001628087],"category_scores_gemma":[0.003979128,0.0002362097,0.0002692937,0.001116359,0.0007556039,0.002630657,0.001950052,0.0007785844,0.0007599106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008797093,"about_ca_system_score_gemma":0.001076722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001984022,"about_ca_topic_score_gemma":0.00293212,"domain_scores_codex":[0.9995362,0.0001211745,0.00002692037,0.00007842934,0.0001506089,0.00008672367],"domain_scores_gemma":[0.9981329,0.0006294469,0.0001847849,0.000581469,0.0003129628,0.0001584432],"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.0007552191,0.0003376737,0.004242004,0.0003804527,0.0000806794,0.0003469063,0.0008244829,0.3603567,0.07200073,0.113593,0.01782316,0.429259],"study_design_scores_gemma":[0.00005165142,0.0001572548,0.0003890484,0.00002740119,0.00002251759,0.0002817689,0.0002065787,0.9353616,0.01558474,0.03839416,0.009496599,0.00002662954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1261279,0.0005843616,0.8633733,0.0004018122,0.0001348029,0.0002082709,0.0003380537,0.002831419,0.006000055],"genre_scores_gemma":[0.6460113,0.0002756557,0.348892,0.0001782837,0.0000433522,0.0001405118,0.0006628096,0.0002670173,0.003529189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001984022,"threshold_uncertainty_score":0.006382763,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08373228543276409,"score_gpt":0.2948293585801796,"score_spread":0.2110970731474155,"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."}}