{"id":"W3018088442","doi":"10.1137/1.9781611976465.75","title":"Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications","year":2021,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Tree (set theory); Pruning; Algorithm; Computer science; Binary logarithm; Embedding; Combinatorics; Time complexity; Approximation algorithm; Probabilistic analysis of algorithms; Dynamic problem; Mathematics; Discrete mathematics; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192393,0.0009263067,0.001257935,0.0005209082,0.000955599,0.001960381,0.003619313,0.001887005,0.003848989],"category_scores_gemma":[0.01548633,0.0008889049,0.0007587542,0.001500586,0.001398241,0.01049656,0.006195817,0.002592112,0.001174393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114937,"about_ca_system_score_gemma":0.0008653661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000720229,"about_ca_topic_score_gemma":0.0008135375,"domain_scores_codex":[0.9978707,0.0004095868,0.0001846999,0.0006253824,0.0006295607,0.0002800343],"domain_scores_gemma":[0.9867634,0.005274138,0.001061702,0.005751818,0.0008015862,0.0003473382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00176376,0.0004143563,0.003141259,0.0007619277,0.0001197286,0.0004506438,0.0009690077,0.4136423,0.04925444,0.1150057,0.01256288,0.4019141],"study_design_scores_gemma":[0.00005877094,0.000244652,0.0003306835,0.00002984109,0.0000401555,0.0004048939,0.0001085266,0.8904626,0.01412267,0.08902141,0.005139118,0.00003675961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08514331,0.0009910683,0.9047517,0.001185335,0.00008806816,0.0001206352,0.0003182635,0.003875264,0.00352629],"genre_scores_gemma":[0.7055851,0.0004511076,0.2884209,0.0003239487,0.0001310709,0.0002080327,0.0006602714,0.0005446878,0.003674899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003848989,"threshold_uncertainty_score":0.01287621,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03287864480673584,"score_gpt":0.2499828280805961,"score_spread":0.2171041832738603,"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."}}