{"id":"W1890828259","doi":"","title":"A trajectory splitting model for efficient spatio-temporal indexing","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Search engine indexing; Trajectory; Bounding overwatch; Computer science; Range (aeronautics); Set (abstract data type); Dynamic programming; Range query (database); Algorithm; Linear programming; Tree (set theory); Mathematical optimization; Mathematics; Combinatorics; Search engine; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003606632,0.0000910046,0.00008471375,0.00008715399,0.000109773,0.0001856161,0.0005567206,0.00002176937,0.00001051049],"category_scores_gemma":[0.00001286228,0.00008150485,0.00005267432,0.0001391524,0.00001122874,0.0004826797,0.0002104966,0.00004562332,0.00002597188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003178988,"about_ca_system_score_gemma":0.0000267779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001057237,"about_ca_topic_score_gemma":0.00002758577,"domain_scores_codex":[0.9991012,0.000008148095,0.000172472,0.000298661,0.0001712901,0.0002482117],"domain_scores_gemma":[0.999531,0.00003126416,0.00004976068,0.0003095127,0.00002897374,0.00004944679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007585862,0.0001746652,0.0002887064,0.00003752465,0.00002181907,0.000002185012,0.001225547,0.2985354,0.00006032782,0.2638384,0.007952649,0.4278552],"study_design_scores_gemma":[0.00027007,0.00001376672,0.00005050319,0.000005891521,0.000002634267,4.150957e-7,0.00001700521,0.9911224,0.0001885006,0.0004645445,0.007744285,0.0001200363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007160222,0.0000164966,0.9867736,0.0007923591,0.0001069619,0.0002212114,0.000003035972,0.0002132028,0.004712962],"genre_scores_gemma":[0.4719246,4.952166e-7,0.5248477,0.0003766911,0.0001009293,0.0000180687,0.00001017588,0.000005427235,0.002715824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.692587,"threshold_uncertainty_score":0.3323671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03033275801181353,"score_gpt":0.2600813327572613,"score_spread":0.2297485747454478,"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."}}