{"id":"W2953197276","doi":"10.48550/arxiv.cs/0309033","title":"Lower bounds for predecessor searching in the cell probe model","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Centre National de la Recherche Scientifique; National Science Foundation","keywords":"Computer science; 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.001524855,0.0002979451,0.0002835231,0.0001241028,0.0002367125,0.0004364926,0.002335197,0.0001881123,0.000005464627],"category_scores_gemma":[0.0001143434,0.0002197098,0.0001777967,0.0002178278,0.00004533135,0.0001739917,0.0008393255,0.001355435,0.00002695857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005424539,"about_ca_system_score_gemma":0.0002750737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009516971,"about_ca_topic_score_gemma":0.0000149758,"domain_scores_codex":[0.9976858,0.0002573932,0.0003284186,0.0008245815,0.0003725901,0.0005312357],"domain_scores_gemma":[0.9982867,0.0002038382,0.0001742874,0.001188883,0.00007420142,0.00007204598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008313401,0.002283896,0.1207087,0.002295964,0.0001483699,0.00014531,0.03594181,0.7738179,0.001094352,0.01994931,0.01181004,0.03172119],"study_design_scores_gemma":[0.0003832278,0.00007476973,0.003736152,0.00009969497,0.00001032189,0.000004704204,0.00002786402,0.9777234,0.0001988038,0.01399928,0.003374914,0.000366874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2997975,0.0001892932,0.692219,0.002260955,0.0006445906,0.0007704045,0.000007755031,0.000119612,0.00399084],"genre_scores_gemma":[0.9225426,0.00002316249,0.07170023,0.0009166393,0.0002007099,0.0003243277,0.00001551053,0.00003536338,0.004241414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6227451,"threshold_uncertainty_score":0.8959506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04996953184438188,"score_gpt":0.3045535340682103,"score_spread":0.2545840022238285,"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."}}