{"id":"W2227225096","doi":"10.20382/jocg.v13i1a2","title":"A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Beacon; Routing (electronic design automation); Robot; Computer science; Combinatorics; Obstacle; Electric beacon; Set (abstract data type); Mathematics; Computer network; Geography; Real-time computing; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.001093612,0.001527142,0.001130056,0.002048366,0.001723405,0.005122716,0.002331138,0.001324262,0.01724949],"category_scores_gemma":[0.00930919,0.000836431,0.001650999,0.002921991,0.002764025,0.006696212,0.004019543,0.004095527,0.003087722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002162054,"about_ca_system_score_gemma":0.0007934202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002367703,"about_ca_topic_score_gemma":0.002321461,"domain_scores_codex":[0.9984038,0.0003576533,0.00009309287,0.0003315066,0.0005216368,0.0002922736],"domain_scores_gemma":[0.9946209,0.003630723,0.000473699,0.0004233641,0.0004271502,0.0004241091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001068196,0.00006544264,0.000689588,0.0002857627,0.00002453947,0.0001706516,0.0002301192,0.04940468,0.00132024,0.8963395,0.01260184,0.03876092],"study_design_scores_gemma":[0.00003505376,0.00007440893,0.0003833522,0.00009390423,0.00003508426,0.0002858756,0.0001515532,0.1705292,0.0008985455,0.8024545,0.02501738,0.00004109675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04602044,0.001723778,0.813475,0.002648212,0.0005224056,0.0001971193,0.0009475019,0.0009458632,0.1335197],"genre_scores_gemma":[0.5458912,0.004380852,0.382245,0.001879005,0.001450537,0.001082622,0.002920081,0.001086715,0.05906399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01724949,"threshold_uncertainty_score":0.05770528,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02525107484599017,"score_gpt":0.255541776581067,"score_spread":0.2302907017350768,"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."}}