{"id":"W2082940000","doi":"10.1145/1989493.1989513","title":"Brief announcement","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Cache; Competitive analysis; CPU cache; Cache algorithms; Parallel computing; Multi-core processor; Metric (unit); Time complexity; Online algorithm; Upper and lower bounds; Operating system; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009399497,0.00002668694,0.00002491066,0.00002343,0.00003065347,0.00003477484,0.000282043,0.000009215449,0.0006330921],"category_scores_gemma":[0.000003726333,0.0000210525,0.00001057849,0.0001105202,0.000009723598,0.0002141868,0.00008942934,0.00002112682,0.0002119521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005485182,"about_ca_system_score_gemma":0.00001751354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002767164,"about_ca_topic_score_gemma":0.000002769009,"domain_scores_codex":[0.9996452,0.00001106852,0.00005478745,0.00009826497,0.00009463176,0.00009608661],"domain_scores_gemma":[0.9997196,0.000003494343,0.000008998411,0.0001854571,0.00003729407,0.00004519681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.751642e-7,0.00004504169,0.0003061132,0.000001190842,0.00000269054,0.000002375765,0.0008651744,0.00002048755,0.00004406616,0.9772123,0.007208616,0.01429135],"study_design_scores_gemma":[0.001088935,0.0004864728,0.007983307,0.00001164544,0.000002276501,0.0000162921,0.0001029276,0.4959964,0.008418652,0.04852638,0.4368226,0.0005442082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004493818,0.000004019127,0.6633022,0.0002356697,0.00004898355,0.00003236519,6.586535e-8,0.0000821193,0.3362496],"genre_scores_gemma":[0.2013026,0.00001781564,0.7794986,0.002747012,0.00001568187,0.00001049643,9.621617e-7,0.000003357095,0.01640342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.928686,"threshold_uncertainty_score":0.6931915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0693261546613576,"score_gpt":0.2431635765058054,"score_spread":0.1738374218444478,"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."}}