{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002007379,0.0002094605,0.0002177257,0.000217305,0.0003136804,0.0002874931,0.002225539,0.0001573756,0.000006816576],"category_scores_gemma":[0.00002685812,0.0002128393,0.0000537497,0.0003607587,0.0000759748,0.0005841717,0.006478104,0.0002369897,0.000002493891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000986473,"about_ca_system_score_gemma":0.0002118248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002070052,"about_ca_topic_score_gemma":0.0001111969,"domain_scores_codex":[0.9984105,0.00005214362,0.0001259209,0.001120432,0.00007485952,0.0002161731],"domain_scores_gemma":[0.9975291,0.00007326809,0.0001426978,0.001957232,0.0001354093,0.0001623084],"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.0001201304,0.0001642349,0.0004841319,0.0002729286,0.0004098433,0.0001399131,0.0004110198,0.08320748,0.00003157248,0.8208457,0.0834597,0.01045336],"study_design_scores_gemma":[0.0003368926,0.00003394476,0.0001719789,0.00002253653,0.00004018769,0.000004489439,0.00002551644,0.6149787,0.000003635138,0.3791024,0.005083764,0.0001959543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01669574,0.0002520665,0.9806374,0.00008621055,0.0008509708,0.000461694,0.000508629,0.0001464081,0.000360942],"genre_scores_gemma":[0.9275819,0.0005369514,0.06839363,0.0000682059,0.00005339146,0.00000327368,0.0006555584,0.00002059078,0.002686526],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9122437,"threshold_uncertainty_score":0.8679335,"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."}}