{"id":"W1499353052","doi":"10.1007/978-3-642-12156-2_31","title":"Ordered Polyline Trees for Efficient Search of Objects Moving on a Graph","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rectangle; Computer science; Graph; Combinatorics; Object (grammar); Data structure; Line segment; Interval (graph theory); Bounding overwatch; Mathematics; Algorithm; Artificial intelligence; Geometry","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001130396,0.0004524184,0.0005199641,0.001403008,0.0002418162,0.0004027426,0.004066019,0.0002271336,0.00001057936],"category_scores_gemma":[0.0001118122,0.0003890661,0.0001798579,0.0007768821,0.0005918925,0.0002901872,0.001554337,0.0006544191,0.00001057059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000749377,"about_ca_system_score_gemma":0.0002910289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000289383,"about_ca_topic_score_gemma":0.0001065687,"domain_scores_codex":[0.9962742,0.00002099096,0.0004870039,0.001433063,0.001107104,0.0006776949],"domain_scores_gemma":[0.9971387,0.0006069079,0.0002577625,0.001598555,0.0002638419,0.0001342425],"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.00002317638,0.0001291361,0.00001199412,0.0001150713,0.00002466076,0.0000315112,0.0007245193,0.04851789,0.001687751,0.04449783,0.00002060324,0.9042159],"study_design_scores_gemma":[0.0006827362,0.0006221917,0.0001047926,0.0004576864,0.00001296729,0.000009325771,5.120003e-7,0.9364077,0.01499968,0.0451823,0.0008369524,0.000683151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003372626,0.0001207187,0.9951732,0.000484701,0.001610674,0.0007268766,0.00002992573,0.0001024885,0.001414124],"genre_scores_gemma":[0.1602752,0.00002703969,0.8377772,0.0007705227,0.0005073468,0.00002046562,0.00002570555,0.0000478847,0.0005486505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9035327,"threshold_uncertainty_score":0.9998561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01917459012517978,"score_gpt":0.2585484026330072,"score_spread":0.2393738125078274,"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."}}