{"id":"W3006504285","doi":"10.48550/arxiv.2002.06251","title":"The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity","year":2020,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; State Key Laboratory of Software Development Environment","keywords":"Computer science; Popularity; Probabilistic logic; Exploit; Markov chain; Dynamic web page; Content (measure theory); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Computer security","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001695615,0.0007453052,0.0009640593,0.0004653406,0.0005068724,0.001065987,0.002204565,0.00106035,0.0009058145],"category_scores_gemma":[0.00885327,0.0007038708,0.0004605236,0.0007343849,0.0008534392,0.001799027,0.001078297,0.001004571,0.000270215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001338063,"about_ca_system_score_gemma":0.002176393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003321594,"about_ca_topic_score_gemma":0.002860833,"domain_scores_codex":[0.9981943,0.0005587852,0.0001011248,0.0004580907,0.0004808357,0.0002068667],"domain_scores_gemma":[0.996492,0.001505679,0.0005094863,0.0004350177,0.0008823622,0.0001754526],"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.0001255876,0.00008312939,0.001467856,0.0001384484,0.00004878232,0.0001555724,0.0001217426,0.9037315,0.0128603,0.03735559,0.001309665,0.04260189],"study_design_scores_gemma":[0.00001014629,0.00003325853,0.00008593409,0.000004583665,0.00001196089,0.00005566628,0.000008885572,0.9945722,0.001442894,0.0032303,0.0005365874,0.000007456118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009024419,0.0001000396,0.9896426,0.0001110231,0.00001713067,0.00005054743,0.00002176215,0.0002236555,0.0008090289],"genre_scores_gemma":[0.848428,0.0002975606,0.1494337,0.0001322,0.00004158154,0.0002321038,0.00006913092,0.00006984369,0.001295937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003321594,"threshold_uncertainty_score":0.009708405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08948868830741302,"score_gpt":0.2511127412159275,"score_spread":0.1616240529085144,"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."}}