{"id":"W4401631702","doi":"10.22215/etd/2024-16106","title":"Efficient Computations of Interesting Paths","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Completeness (order theory); Computer science; Computation; Algorithm; Approximation algorithm; Class (philosophy); Directed acyclic graph; Theoretical computer science; Mathematical optimization; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001343191,0.0001211287,0.0002339105,0.0005273431,0.00003809345,0.00009318862,0.0006774316,0.00008530325,0.0001093627],"category_scores_gemma":[0.0001269934,0.00008630319,0.0001528196,0.001756733,0.00001559297,0.00002894426,0.0001528138,0.0001531343,0.0001745381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001408957,"about_ca_system_score_gemma":0.00004477223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001127331,"about_ca_topic_score_gemma":0.00004197691,"domain_scores_codex":[0.9989309,0.00002166212,0.0003300985,0.0003451044,0.0002487219,0.0001235283],"domain_scores_gemma":[0.9992453,0.000169201,0.0001266107,0.000297309,0.0001172011,0.0000443786],"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.000005262214,0.0003243463,0.00006636459,0.0005412076,0.0003151697,0.00006164279,0.002734282,0.01421659,0.0001824472,0.6703076,0.005660928,0.3055841],"study_design_scores_gemma":[0.00008286413,0.00009846193,0.001703265,0.0002385181,0.00012864,0.000004268815,0.0007710269,0.9802405,0.0004866741,0.01438425,0.001528024,0.0003334714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1103332,0.001615102,0.7927567,0.0003382729,0.002187755,0.0001903447,0.00004875882,0.0004526132,0.09207723],"genre_scores_gemma":[0.9643816,0.000009429524,0.02391818,0.00003671622,0.00003348737,0.000006467487,0.0002996741,0.000006634637,0.01130783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9660239,"threshold_uncertainty_score":0.3519342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0200865792474819,"score_gpt":0.2907320810999133,"score_spread":0.2706455018524314,"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."}}