{"id":"W2949802744","doi":"10.48550/arxiv.1503.05977","title":"Dynamic Data Structures for Document Collections and Graphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Search engine indexing; Dynamism; Bottleneck; Rank (graph theory); Matching (statistics); Data structure; Sequence (biology); Theoretical computer science; Information retrieval; Combinatorics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087214,0.0007743199,0.001143816,0.004792009,0.00156129,0.003986395,0.002502185,0.001545581,0.003922486],"category_scores_gemma":[0.01764519,0.0009247508,0.001149838,0.01135394,0.00275364,0.009909482,0.003978682,0.003262622,0.00145955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003118222,"about_ca_system_score_gemma":0.00183539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003385218,"about_ca_topic_score_gemma":0.004098135,"domain_scores_codex":[0.9966716,0.0007784067,0.000346836,0.0006326513,0.001422892,0.0001476633],"domain_scores_gemma":[0.9911629,0.003542647,0.0009112111,0.003158772,0.001011393,0.0002131005],"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.00008794003,0.00007009172,0.0006071949,0.0003662425,0.00003641161,0.0001601687,0.0004187322,0.03655413,0.001995235,0.7920528,0.01725411,0.150397],"study_design_scores_gemma":[0.00002393283,0.00002466534,0.0002684432,0.00005957528,0.00001872425,0.0003276271,0.0001592203,0.1236355,0.001815765,0.8388124,0.03482755,0.00002654475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009576916,0.001881292,0.9759464,0.002519984,0.0001524122,0.0002866639,0.00305933,0.001671801,0.004905254],"genre_scores_gemma":[0.1327648,0.003152005,0.8469334,0.0007401359,0.0003883898,0.001101437,0.00791041,0.0006232944,0.006386145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004792009,"threshold_uncertainty_score":0.02262437,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08947125315930614,"score_gpt":0.229409194970172,"score_spread":0.1399379418108658,"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."}}