{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008111008,0.0009161936,0.001447143,0.0008135108,0.001123377,0.001544139,0.003314353,0.001598446,0.003160282],"category_scores_gemma":[0.009087845,0.0005464376,0.000924986,0.002396438,0.0008007075,0.003906365,0.002153071,0.001319455,0.000765343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001582246,"about_ca_system_score_gemma":0.001456189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006106579,"about_ca_topic_score_gemma":0.00624086,"domain_scores_codex":[0.9986328,0.0002016255,0.0001134526,0.0004842116,0.0003658539,0.0002020175],"domain_scores_gemma":[0.9957483,0.002451168,0.0004498788,0.0007491587,0.000333416,0.0002680783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001636377,0.0002466817,0.004540669,0.0006028443,0.0001507273,0.0006443839,0.0007990767,0.7966762,0.02008846,0.03802094,0.01284793,0.1237458],"study_design_scores_gemma":[0.00008083331,0.0001218149,0.0006625977,0.00001548184,0.00001901225,0.0001996963,0.0002418093,0.960676,0.005931181,0.02889092,0.003137377,0.00002328208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4166276,0.001269675,0.5676048,0.001242166,0.000181127,0.0003393314,0.002494803,0.003672943,0.006567507],"genre_scores_gemma":[0.759753,0.0003288837,0.2324633,0.0001589673,0.00005771423,0.0001795875,0.003465763,0.0002755713,0.003317267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006106579,"threshold_uncertainty_score":0.01214206,"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."}}