{"id":"W3084173750","doi":"","title":"Time-space tradeoffs for all-nearest-larger-neighbors problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pointer (user interface); Upper and lower bounds; Monotone polygon; Mathematics; Combinatorics; Time complexity; Perfect hash function; Space (punctuation); String (physics); Computer science; Theoretical computer science; Discrete mathematics; Algorithm; Cryptography; Artificial intelligence","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.004633352,0.001475522,0.002112821,0.001021862,0.002257795,0.003961402,0.004728367,0.002394264,0.01076511],"category_scores_gemma":[0.02492511,0.0008726851,0.0014849,0.002432325,0.002439987,0.01639648,0.004629274,0.003654484,0.001859816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002673394,"about_ca_system_score_gemma":0.002619256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002198158,"about_ca_topic_score_gemma":0.004068053,"domain_scores_codex":[0.9925777,0.002102968,0.000518948,0.001690061,0.00208268,0.001027671],"domain_scores_gemma":[0.9780241,0.01420337,0.001224775,0.004795607,0.00105724,0.0006948442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002652308,0.001325629,0.003307189,0.001337984,0.0001727113,0.000322332,0.001376161,0.3041469,0.01351113,0.2352734,0.03289676,0.4036775],"study_design_scores_gemma":[0.0003555573,0.0003043608,0.0007110573,0.00007126672,0.00008332059,0.0005637245,0.0006797404,0.7451168,0.009711839,0.229798,0.01253201,0.00007236755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1885916,0.003286317,0.7642033,0.006657006,0.0005478334,0.0005017216,0.000905404,0.002948039,0.03235872],"genre_scores_gemma":[0.4518479,0.001167683,0.5316099,0.0008635436,0.0005118176,0.000502642,0.001596442,0.000842791,0.01105727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01076511,"threshold_uncertainty_score":0.03601289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01694174337681547,"score_gpt":0.2343406682457628,"score_spread":0.2173989248689474,"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."}}