{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000483176,0.0002364629,0.0002176412,0.0009587655,0.0002060648,0.0001724093,0.0005035554,0.0001102348,0.0002635272],"category_scores_gemma":[0.0001153769,0.0002652607,0.00006100718,0.001073037,0.00007680284,0.0007497531,0.00008000853,0.0002636193,0.000479495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003957985,"about_ca_system_score_gemma":0.0007539613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002089087,"about_ca_topic_score_gemma":0.001397252,"domain_scores_codex":[0.9979327,0.0001213814,0.0003624403,0.0004769909,0.0004796553,0.0006268775],"domain_scores_gemma":[0.9986256,0.0002386545,0.0001036604,0.0003300434,0.0001207978,0.0005811926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001845621,0.0002237625,0.01073106,0.00002084101,0.0000266376,0.00004051635,0.0009474214,0.07154649,0.00009726195,0.8614641,0.001227945,0.05365552],"study_design_scores_gemma":[0.001324073,0.0003581201,0.3232808,0.000133038,0.00001190574,0.000125943,0.000294722,0.5654414,0.0005104554,0.05978408,0.04728391,0.001451533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3381068,0.0006902926,0.6362005,0.004572496,0.001536145,0.0006763695,0.00008293177,0.0001724688,0.01796205],"genre_scores_gemma":[0.9625553,0.00002452881,0.03541685,0.001298435,0.0001664039,0.00004199863,0.00009161195,0.00001227236,0.0003925566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.80168,"threshold_uncertainty_score":0.99998,"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."}}