{"id":"W2137551726","doi":"10.1214/15-aop1030","title":"Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree","year":2017,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Spanning tree; Euclidean minimum spanning tree; Metric space; Minimum spanning tree; Hausdorff dimension; Random walk; Simple (philosophy); Limit (mathematics); Euclidean space; Scaling limit; Tree (set theory); Space (punctuation); Hausdorff space; Euclidean distance; Law of large numbers; Limiting; Loop-erased random walk; Combinatorics; Scaling; Discrete mathematics; Mathematical analysis; Heterogeneous random walk in one dimension; Kruskal's algorithm; Geometry; Random variable; Computer science; Statistics","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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002842879,0.0001562832,0.0003891376,0.00001908402,0.0004223404,0.00003732834,0.0006933557,0.00005639214,0.00008259963],"category_scores_gemma":[0.01107081,0.0000808934,0.0001660781,0.00005929681,0.0003695367,0.00007061057,0.0001781347,0.0001983356,0.000004937528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001077841,"about_ca_system_score_gemma":0.00007516031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008413737,"about_ca_topic_score_gemma":0.00004918695,"domain_scores_codex":[0.9984273,0.0001240311,0.0005124289,0.0002075386,0.0004595983,0.0002690445],"domain_scores_gemma":[0.9949557,0.003021375,0.0005309352,0.001033468,0.0003999173,0.00005860645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008414778,0.0002611766,0.0000465917,0.0002396706,0.00008413483,0.000001507527,0.0003828503,0.0003420039,0.00117948,0.9893453,0.0003717335,0.006904113],"study_design_scores_gemma":[0.0006470151,0.0001406849,0.0004165451,0.0001213299,0.00005143984,0.000001892027,0.0000426291,0.01117096,0.02494956,0.9623532,0.00001483269,0.00008987772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9600518,0.00004647046,0.03305241,0.00373694,0.0001423854,0.0006942986,0.00008208285,0.00002428653,0.002169322],"genre_scores_gemma":[0.996115,0.000002850458,0.003626169,0.0001262908,0.00007074486,0.00001739492,0.000002058782,0.00001281037,0.00002671382],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03606316,"threshold_uncertainty_score":0.9972594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2692980894973042,"score_gpt":0.4089596156305167,"score_spread":0.1396615261332126,"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."}}