{"id":"W2404508046","doi":"","title":"xy-Monotone Path Existence Queries in a Rectilinear Environment.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Monotone polygon; Disjoint sets; Path (computing); Tree (set theory); Combinatorics; Computer science; Time complexity; Range tree; Binary logarithm; Data structure; Preprocessor; Computational geometry; Binary tree; Mathematics; Discrete mathematics; Interval tree; Algorithm; Tree structure; 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.0006925773,0.0007254895,0.00111918,0.000680351,0.001042117,0.001247536,0.001321386,0.001698417,0.01029402],"category_scores_gemma":[0.004489957,0.0007118816,0.0008409126,0.001783969,0.0007418642,0.005857053,0.002651598,0.0009432624,0.00198537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005244691,"about_ca_system_score_gemma":0.001062254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002785161,"about_ca_topic_score_gemma":0.005547218,"domain_scores_codex":[0.9987177,0.000210997,0.0001011248,0.000394599,0.0002756151,0.0003000228],"domain_scores_gemma":[0.9970094,0.001992203,0.0002837951,0.0004251953,0.0001692536,0.0001200727],"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.006370632,0.001241964,0.01567588,0.002678653,0.0002204765,0.003297853,0.002031877,0.1670195,0.110856,0.1228642,0.08692378,0.4808192],"study_design_scores_gemma":[0.001006707,0.001704246,0.0057975,0.0001892437,0.0001637643,0.002958252,0.003025308,0.6641333,0.07707133,0.1735748,0.07019096,0.0001846654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2899553,0.001893789,0.6595845,0.003161653,0.0001647743,0.0008121,0.01320918,0.01355029,0.01766845],"genre_scores_gemma":[0.5033297,0.0008014233,0.4733683,0.0003561754,0.00007279174,0.0003420249,0.01343045,0.0005810094,0.00771821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01029402,"threshold_uncertainty_score":0.03443694,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03309736335871667,"score_gpt":0.2452450391259678,"score_spread":0.2121476757672511,"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."}}