{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002636812,0.0003618387,0.0003912073,0.000132215,0.000165955,0.0003165039,0.002758692,0.0003125443,0.00003959219],"category_scores_gemma":[0.00003615454,0.0003168733,0.0001689904,0.0002250977,0.00003935134,0.0002750474,0.003405514,0.0007111699,0.0003285538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005690713,"about_ca_system_score_gemma":0.0001251585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008658333,"about_ca_topic_score_gemma":0.00002193273,"domain_scores_codex":[0.9977664,0.00009771778,0.0003198573,0.001000885,0.0003859936,0.0004290866],"domain_scores_gemma":[0.9973245,0.00006691989,0.0002499797,0.002128498,0.00006859783,0.0001614804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00005377879,0.0006260491,0.2280544,0.0001332904,0.0002378479,0.0006412017,0.001845189,0.004285336,0.001206441,0.009864242,0.1254859,0.6275663],"study_design_scores_gemma":[0.0009798799,0.0001975493,0.6624534,0.001123835,0.00004526538,0.00003620165,0.00002949385,0.08104072,0.001956373,0.01846498,0.231723,0.001949343],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3421025,0.002517026,0.6393553,0.003121301,0.004308634,0.0005584074,0.0000501455,0.00120009,0.006786627],"genre_scores_gemma":[0.9575014,0.0002620207,0.03974281,0.0007645254,0.0007612965,0.00002684849,0.0001237386,0.00002463796,0.0007927154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.625617,"threshold_uncertainty_score":0.9999284,"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."}}