{"id":"W3211937876","doi":"10.48550/arxiv.1701.06884","title":"Combination Networks with End-user-caches: Novel Achievable and Converse\\n Bounds under Uncoded Cache Placement","year":2017,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Converse; Computer science; Cache; Linear network coding; Computer network; Upper and lower bounds; CPU cache; Mathematics; Network packet","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.004910913,0.004246375,0.002724142,0.002309564,0.002669278,0.005631723,0.003732271,0.002973928,0.00445356],"category_scores_gemma":[0.02698363,0.001700221,0.001644695,0.002659462,0.004882817,0.008884395,0.008480262,0.005042927,0.001249666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004357351,"about_ca_system_score_gemma":0.002096998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002892971,"about_ca_topic_score_gemma":0.00368694,"domain_scores_codex":[0.9950553,0.001569823,0.0001742128,0.0006638368,0.001377033,0.00115967],"domain_scores_gemma":[0.9682369,0.02374561,0.002034398,0.001935746,0.003022961,0.001024392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000946945,0.0003185729,0.001915222,0.001148984,0.0002395226,0.001581563,0.001135598,0.4673027,0.01604861,0.4574021,0.0133304,0.03862976],"study_design_scores_gemma":[0.00002870729,0.0001516918,0.0002589149,0.0001450568,0.0001124629,0.0006553475,0.0002137168,0.8465269,0.00463624,0.1438245,0.003348985,0.00009746297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07368355,0.00559842,0.8550265,0.003074416,0.0003439853,0.0002067297,0.0006996731,0.0006844616,0.06068225],"genre_scores_gemma":[0.9016457,0.004882221,0.08184464,0.00111606,0.0006223879,0.0005144523,0.000535553,0.000190255,0.008648829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005631723,"threshold_uncertainty_score":0.03161496,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06834338848647915,"score_gpt":0.1798205628557237,"score_spread":0.1114771743692445,"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."}}