{"id":"W1725687346","doi":"10.1007/s00453-011-9542-1","title":"Layered Working-Set Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary search tree; Binary tree; Combinatorics; Element (criminal law); Mathematics; Upper and lower bounds; Amortized analysis; Multiplicative function; Theory of computation; Set (abstract data type); Ternary search tree; Tree (set theory); Search tree; Binary number; Data structure; Discrete mathematics; Logarithm; Computer science; Search algorithm; Algorithm; Tree structure; Interval tree; Arithmetic","routes":{"ca_aff":true,"ca_fund":true,"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.0001500637,0.00008275829,0.00008756005,0.00007687438,0.00008273521,0.00007697998,0.0006977045,0.000042742,0.0001923145],"category_scores_gemma":[0.0000158184,0.00007394942,0.0000397287,0.0003081262,0.00003329091,0.0002264808,0.0001723637,0.0000918322,0.0003133912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001246344,"about_ca_system_score_gemma":0.00003361004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002842534,"about_ca_topic_score_gemma":0.000007968317,"domain_scores_codex":[0.9991886,0.00004564957,0.000113125,0.0002396426,0.0001700565,0.0002429448],"domain_scores_gemma":[0.9993972,0.00002670065,0.00003708959,0.0003869904,0.00004778199,0.000104261],"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.00001379594,0.0002816356,0.001398313,0.000009027884,0.00007539125,0.00009044431,0.007946416,0.0002314817,0.0002868281,0.2571955,0.0217816,0.7106895],"study_design_scores_gemma":[0.001464062,0.0003850411,0.00648253,0.0000476788,0.000009370533,0.00005138461,0.0001348334,0.7982403,0.008502676,0.03261021,0.1512033,0.000868627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003489546,0.00005447381,0.9482616,0.0006622951,0.0002930524,0.0001240018,0.000001421894,0.0003082145,0.04994596],"genre_scores_gemma":[0.532722,0.00002427463,0.4645042,0.0006133867,0.00007710076,0.00001904975,0.000004082199,0.0000118325,0.002024086],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7980088,"threshold_uncertainty_score":0.4028115,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0813956022466798,"score_gpt":0.2568467713904636,"score_spread":0.1754511691437838,"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."}}