{"id":"W3189232707","doi":"10.1109/tnet.2021.3094839","title":"Graph-Based Namespaces and Load Sharing for Efficient Information Dissemination","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Institute of Standards and Technology; National Science Foundation","keywords":"Computer science; Scalability; Namespace; Distributed computing; Graph; Dissemination; Load balancing (electrical power); Computer network; Workload; Theoretical computer science; Operating system; Grid","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594502,0.0001163646,0.0001084927,0.0001304336,0.0003899401,0.0003492221,0.0002359103,0.00005497637,0.00000212932],"category_scores_gemma":[0.00001878577,0.0001229664,0.00009218795,0.0003615809,0.00001827253,0.0003537683,0.000008159397,0.0001300983,0.000002834871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007220552,"about_ca_system_score_gemma":0.00005275613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001379492,"about_ca_topic_score_gemma":0.00002810815,"domain_scores_codex":[0.9990952,0.00002542226,0.0001891401,0.0002603501,0.0002257843,0.0002041116],"domain_scores_gemma":[0.9991068,0.0002593542,0.0000711267,0.0003608682,0.0001447349,0.00005714062],"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.0000447859,0.0001063778,0.0001263876,0.00006818186,0.00004135283,0.000004718179,0.001135554,0.436987,0.001479399,0.0009343537,0.0001619006,0.55891],"study_design_scores_gemma":[0.0004308354,0.00005266688,0.0001512636,0.0002201152,0.00002236626,0.00000962083,0.00009225008,0.9933421,0.003314342,0.0004404395,0.001741729,0.0001822896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04294349,0.0001992699,0.9545763,0.0007751415,0.001097928,0.0001474816,0.000004957929,0.000150123,0.0001053345],"genre_scores_gemma":[0.9933813,0.00003641421,0.006139012,0.0002449482,0.00006364006,0.00004535485,0.000006840205,0.000006607502,0.00007586677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9504378,"threshold_uncertainty_score":0.5014425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01649825172211187,"score_gpt":0.245204148871408,"score_spread":0.2287058971492962,"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."}}