{"id":"W2480249651","doi":"10.1142/s0129054119500060","title":"Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Graph; Combinatorics; Running time; Vertex (graph theory); Binary logarithm; Time complexity; Graph algorithms; Mathematics; Algorithm; Path (computing); Computer science; Discrete mathematics","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.0008235188,0.001656405,0.001381069,0.001410137,0.0008837622,0.001240592,0.002223762,0.001728579,0.01001327],"category_scores_gemma":[0.006018291,0.0009340967,0.001149869,0.002279147,0.0009421427,0.004005969,0.003095119,0.001607567,0.002523279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001101498,"about_ca_system_score_gemma":0.001242721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001998542,"about_ca_topic_score_gemma":0.003724769,"domain_scores_codex":[0.9990745,0.0001788433,0.00006254062,0.000266628,0.0002551836,0.0001623496],"domain_scores_gemma":[0.9976175,0.001318611,0.0002142342,0.0005488505,0.0001992203,0.0001015438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007886583,0.0002416592,0.001672921,0.0006521133,0.0000751496,0.0002472433,0.0004244005,0.3455902,0.01322062,0.06084193,0.02188822,0.5543569],"study_design_scores_gemma":[0.0001683993,0.0002071603,0.0003790476,0.00005384921,0.00004059997,0.0002065765,0.0001701456,0.8022889,0.007527697,0.1772477,0.01167721,0.000032622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04915382,0.0008596263,0.9357433,0.0005282825,0.0001382944,0.0002550337,0.0006576292,0.005760761,0.006903262],"genre_scores_gemma":[0.1073076,0.0002758354,0.887827,0.00007616884,0.000047576,0.0002293797,0.001077892,0.0005442918,0.002614292],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01001327,"threshold_uncertainty_score":0.03349775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0305006373762955,"score_gpt":0.3227517377298996,"score_spread":0.2922511003536041,"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."}}