{"id":"W2019406253","doi":"10.1145/2484028.2484088","title":"Faster and smaller inverted indices with treaps","year":2013,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Merge (version control); Inverted index; Identifier; Computer science; ENCODE; Thresholding; Algorithm; Representation (politics); Data structure; Data compression; Theoretical computer science; Topology (electrical circuits); Mathematics; Artificial intelligence; Search engine indexing; Information retrieval; Combinatorics","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.00002713646,0.00006584637,0.00006158087,0.00003594749,0.00005132025,0.0002036866,0.000238017,0.00002285848,0.0001571463],"category_scores_gemma":[0.000001408632,0.00003618063,0.000005967588,0.00008545208,0.00002499962,0.0008716258,0.0002215205,0.00003990368,0.0001017057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002458784,"about_ca_system_score_gemma":0.000009277633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003057884,"about_ca_topic_score_gemma":0.00002585264,"domain_scores_codex":[0.9995296,0.0000114844,0.00005933862,0.0001879573,0.0001009392,0.0001106819],"domain_scores_gemma":[0.9996272,0.00001806924,0.00002208941,0.0002367371,0.00002540982,0.00007047127],"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.000008113402,0.0001101281,0.02256455,0.00001857326,0.00004186859,0.00001694984,0.00152284,0.00000610463,0.0009423877,0.01506596,0.04194593,0.9177566],"study_design_scores_gemma":[0.001952919,0.0005344448,0.3263596,0.00007530003,0.000009580002,0.00009109821,0.0002709316,0.6228943,0.002170872,0.004176988,0.0407489,0.0007150666],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3002647,0.00008407863,0.678818,0.001431705,0.00008038891,0.0002068946,0.000001044974,0.0001857277,0.01892752],"genre_scores_gemma":[0.8403693,0.00001432289,0.1550509,0.001443535,0.00003451633,0.00002044873,0.000003979213,0.000006369835,0.003056642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9170415,"threshold_uncertainty_score":0.1964155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00908660978927224,"score_gpt":0.1867291960035619,"score_spread":0.1776425862142897,"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."}}