{"id":"W2886502899","doi":"10.48550/arxiv.1808.01984","title":"Time-Dependent Shortest Path Queries Among Growing Discs","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Binary logarithm; Path (computing); Computation; Mathematics; Discrete mathematics; Algorithm; Computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002030419,0.0001231881,0.000114457,0.0001157667,0.000284458,0.0001276816,0.0007721731,0.00005721761,0.000169335],"category_scores_gemma":[0.00002570853,0.0001275693,0.00005699049,0.0005769053,0.0002599756,0.001575216,0.0004031788,0.0001122207,0.0004602775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006065782,"about_ca_system_score_gemma":0.00005647954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005204982,"about_ca_topic_score_gemma":0.00004058774,"domain_scores_codex":[0.9989479,0.00008307689,0.00010676,0.0004623603,0.00009827933,0.0003015912],"domain_scores_gemma":[0.9991214,0.00004405576,0.00005461864,0.0004846233,0.0001327419,0.0001626054],"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.00004374127,0.0003418008,0.06879715,0.0000223387,0.000120401,0.0006155063,0.003105839,0.141701,0.001224147,0.7783937,0.00290562,0.002728762],"study_design_scores_gemma":[0.0003404312,0.0001374318,0.002853343,0.00002287982,0.000009577424,0.000004031252,0.0001562619,0.9912919,0.0005285703,0.003315928,0.001064293,0.0002753493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2266584,0.000005943194,0.7598717,0.0001326332,0.0001684316,0.0001336032,0.000002151865,0.0003017834,0.01272531],"genre_scores_gemma":[0.9914998,0.00001745039,0.001584189,0.0001375593,0.00005207821,3.474401e-7,0.000002798858,0.000009198608,0.006696575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.849591,"threshold_uncertainty_score":0.591609,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03763391399765716,"score_gpt":0.1743698258326707,"score_spread":0.1367359118350136,"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."}}