{"id":"W2950907886","doi":"10.48550/arxiv.0907.2071","title":"Layered Working-Set Trees","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Binary search tree; Binary tree; Element (criminal law); Upper and lower bounds; Multiplicative function; Set (abstract data type); Combinatorics; Amortized analysis; Mathematics; Ternary search tree; Logarithm; Tree (set theory); Binary number; Property (philosophy); Search tree; Computer science; Discrete mathematics; Data structure; Search algorithm; Algorithm; Tree structure; Interval tree; Arithmetic","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.002030591,0.0007257495,0.001520468,0.002154287,0.001653024,0.003740492,0.003281666,0.001603804,0.006719259],"category_scores_gemma":[0.01629281,0.0008411779,0.001272953,0.004169361,0.00163275,0.01123775,0.005305721,0.002525441,0.002773305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001385724,"about_ca_system_score_gemma":0.001568533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001208554,"about_ca_topic_score_gemma":0.001678046,"domain_scores_codex":[0.9969534,0.0003968237,0.0003356538,0.0004276379,0.001358405,0.0005280969],"domain_scores_gemma":[0.9903019,0.003106957,0.0006301652,0.004093358,0.001372824,0.0004947737],"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":[0.0006785144,0.0002340939,0.002953843,0.0005023648,0.0001286837,0.0003065087,0.0007506771,0.09427951,0.01964648,0.5430532,0.01999475,0.3174714],"study_design_scores_gemma":[0.00005879834,0.0002095449,0.0006099835,0.0001076826,0.00009781968,0.000649007,0.0001684043,0.358991,0.01386065,0.5963664,0.02880958,0.0000710449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05300572,0.001604414,0.9298493,0.0007530173,0.0001483734,0.0001641269,0.001184043,0.002670141,0.01062093],"genre_scores_gemma":[0.417053,0.001533421,0.5673888,0.0006744153,0.0002366901,0.000609608,0.002452531,0.000822945,0.009228566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006719259,"threshold_uncertainty_score":0.02247816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07937149507237835,"score_gpt":0.2889921351770572,"score_spread":0.2096206401046789,"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."}}