{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000165616,0.0001572979,0.0001602148,0.00006099191,0.0001302505,0.0003220692,0.000926014,0.00007502761,0.0003783219],"category_scores_gemma":[0.00002333441,0.0001145182,0.00007360522,0.000163554,0.00003261374,0.001163173,0.0002787126,0.00008592935,0.0009332635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001874948,"about_ca_system_score_gemma":0.00003927677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001272725,"about_ca_topic_score_gemma":0.000003308584,"domain_scores_codex":[0.9986974,0.00002634733,0.0001967485,0.0004434602,0.0002312373,0.0004047988],"domain_scores_gemma":[0.9989214,0.0001171158,0.0000639012,0.0006415188,0.00008701437,0.0001690309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005662985,0.000287535,0.0001035455,0.00005925407,0.00005342056,0.000004292882,0.0008175645,0.0003739875,0.01118897,0.06137201,0.8388934,0.08684039],"study_design_scores_gemma":[0.0003923477,0.0001347571,0.0004404771,0.00001987886,0.00000421938,0.000006803501,0.00001410031,0.7720264,0.001867775,0.007065312,0.2177578,0.0002701537],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001752745,0.0001070268,0.9869238,0.005168609,0.0002833861,0.0008086811,0.000009492705,0.0003833204,0.004562947],"genre_scores_gemma":[0.05860994,0.00003995725,0.911539,0.002373417,0.0003303553,0.0005329985,0.00007959436,0.00005157528,0.0264432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7716524,"threshold_uncertainty_score":0.9998446,"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."}}