{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001533092,0.0002066677,0.0003494507,0.001205033,0.0001500329,0.001043543,0.002858022,0.00007604453,0.000004668169],"category_scores_gemma":[0.0002103218,0.0001994281,0.0002148884,0.0003911695,0.0002380291,0.00157005,0.001532175,0.0002416848,0.000002175489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001413395,"about_ca_system_score_gemma":0.001194073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007335704,"about_ca_topic_score_gemma":0.000002393248,"domain_scores_codex":[0.9970923,0.00004908579,0.0009299921,0.0004790961,0.001239628,0.0002098752],"domain_scores_gemma":[0.9940036,0.0004375729,0.001419864,0.0003684307,0.00365876,0.0001117805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002783778,0.0002347531,0.0004881357,0.00006129091,0.0002370089,0.000007708595,0.001036672,0.3580637,0.002495421,0.02558893,0.0003205604,0.611438],"study_design_scores_gemma":[0.0006755376,0.0003113716,0.005893986,0.0002787244,0.00002776946,0.000125234,0.00001487009,0.9745489,0.002122922,0.01470393,0.001055271,0.0002414474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03936523,0.0001809018,0.9518365,0.001228875,0.007006009,0.0002499537,0.00002763629,0.00001751149,0.00008735969],"genre_scores_gemma":[0.4111216,0.00004842233,0.5881866,0.00009518796,0.0004908114,0.000005790179,0.00001283958,0.000006081259,0.00003272892],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6164853,"threshold_uncertainty_score":0.9999934,"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."}}