{"id":"W3004387713","doi":"10.22215/etd/2016-11226","title":"Discrete Geometric Path Analysis in Computational Geometry","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Natural Resources Canada","funders":"","keywords":"Mathematics; Measure (data warehouse); Similarity (geometry); Path (computing); Shortest path problem; Outlier; Computation; Similarity measure; Polygonal chain; Algorithm; Combinatorics; Geometry; Computer science; Artificial intelligence; Data mining; Graph","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.001107368,0.0008332934,0.0008396395,0.001657604,0.0006973772,0.002362526,0.0009493881,0.0009402555,0.004738766],"category_scores_gemma":[0.004693926,0.0004500881,0.0009896754,0.002416234,0.002717411,0.002666812,0.00188578,0.003019056,0.0009909029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849778,"about_ca_system_score_gemma":0.0008883523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002562335,"about_ca_topic_score_gemma":0.001531797,"domain_scores_codex":[0.9992281,0.00024359,0.00003615542,0.0001353497,0.0003087726,0.00004802869],"domain_scores_gemma":[0.9981832,0.001152973,0.0001122617,0.0002410408,0.0002389534,0.00007165451],"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.00001390171,0.0000145237,0.0003055517,0.0001640005,0.00002208012,0.00002575776,0.0001478262,0.07780662,0.0007886112,0.8794068,0.003529357,0.03777479],"study_design_scores_gemma":[0.000009544867,0.00002140043,0.0002239552,0.0000528848,0.000007872372,0.00002898346,0.00007018931,0.194909,0.0005603539,0.7839323,0.02017049,0.0000130478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01113763,0.005151983,0.9641168,0.001644017,0.0002621321,0.00006698461,0.0002312884,0.0002507874,0.01713833],"genre_scores_gemma":[0.3049746,0.01325994,0.6625509,0.0004565442,0.0007429171,0.0004213849,0.0009256035,0.0004727479,0.0161953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004738766,"threshold_uncertainty_score":0.01585281,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00854278346283061,"score_gpt":0.2631728112589435,"score_spread":0.2546300277961129,"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."}}