{"id":"e137eb0d-0190-403e-98bf-051c0a736d7c","arxiv_id":"2505.15826","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":0.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A survey of existing results on parking problems on random trees, with no new theorems, that lists open directions for future research.","lead":"This paper surveys recent results on parking functions on random trees, including phase transitions and scaling limits. It is a review that points to open problems in metric topologies and connections to random planar maps, but contains many transcription errors.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Section 5's central open direction is contradicted by Theorem 4 it cites: fully parked trees already converge in the Gromov-Hausdorff-Prokhorov topology.","rationale":"The paper is a survey, so there is no new theorem whose proof can be stress-tested. The strongest load-bearing assertion is that it identifies genuinely open directions. The weakest link in that assertion is Section 5's claim about metric topologies, which is contradicted by the very theorem it reports in Section 4. This is more concrete than the reader's general concern about completeness, because it is internal to the manuscript. The rest of the survey, including the enumeration formulas, the phase transition at m about n/2, and the scaling limits from Contat and coauthors, is reported with many typos but appears consistent with the cited literature; I do not see a mathematical error that would invalidate the underlying results. The correct response remains conditional acceptance: the survey can be useful after correcting Section 5 to state precisely which metric-topological questions are open and after a copy edit. I therefore do not change the reader's verdict, but I locate the concern differently.","tokens_in":12686,"tokens_out":5588,"duration_ms":56136,"concrete_test":"Check the original Contat-Curien (2025) paper, arXiv:2503.17348, for the topology in Theorem 4. If it indeed states convergence in the Gromov-Hausdorff-Prokhorov hypograph topology, then Section 5's sentence that parking problems in different metric topologies remain largely unaddressed must be revised to name only genuinely untreated cases, such as heavy-tailed arrivals or Gromov-weak topology. If the original theorem does not use GHP, then the survey's Section 4 misstates it, which is an equally factual error. Either way, direct comparison of Section 4, Section 5, and the original theorem settles whether the central open-direction claim is supported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The survey's advertised open direction is \"the study of problem in different metric topologies\" (Abstract and Section 5), and Section 5 says such questions \"remains largely unaddressed.\" But Section 4 quotes Theorem 4 of Contat and Curien (2025) as proving convergence of critical parking trees in the Gromov-Hausdorff-Prokhorov hypograph topology. GHP is a metric-topological convergence framework and is exactly the kind of topology the survey proposes as open. Thus the paper's own cited theorem falsifies its central novelty claim for the open-problems agenda. If the intended open problem is narrower, e.g., heavy-tailed arrivals or topologies other than GHP, the survey does not state that, and the abstract still presents \"different metric topologies\" as the key direction. This is an internal inconsistency, not merely a missing reference, and it undercuts the stated purpose of the survey. The typographical noise elsewhere in the manuscript is secondary; this contradiction would survive a copy edit.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper is a short survey of parking problems on random trees. It begins in Section 2 with classical combinatorial parking functions, including the Konheim-Weiss occupancy model, Pollak's bijection, and representation-theoretic connections (Haiman; Berget-Rhoades). Section 3 summarizes Lackner and Panholzer's enumeration results for tree and mapping parking functions, including the phase transition near m ≈ n/2 and their list of open problems. Section 4 surveys recent work by Contat and coauthors: phase transitions on Bienaymé-Galton-Watson trees, the frozen Erdős-Rényi/Cayley-tree coupling, parking on the infinite binary tree, geometric BGW trees, random recursive trees, and the Contat-Curien scaling limit of fully parked trees to the Brownian growth-fragmentation tree. Section 5 proposes future directions, most prominently the study of parking problems in different metric topologies, connections to random planar maps, total displacement, defective parking functions, and various enumeration problems.","tokens_in":12886,"tokens_out":11300,"duration_ms":108253,"significance":"The survey is timely: it collects the main recent papers in an active area and highlights the conceptual bridge between parking functions, multiplicative coalescents, and random planar maps. It is useful as a starting bibliography. However, the paper as written does not yet function as a reliable survey. The central advertised open direction is contradicted by a theorem quoted in the paper itself, and at least one key theorem statement from the recent literature is transcribed with corrupted assumptions. These are fixable, but they are not cosmetic: they concern the paper's main message. The manuscript also makes several unsupported claims about which topics 'remain underaddressed.' With careful revision, the survey could be a valuable resource.","major_comments":[{"comment":"The abstract and Section 5 present 'the study of problem in different metric topologies' as the key open direction, and Section 5 states that 'issues of studying parking problems in different metric topologies remains largely unaddressed.' Yet Section 4 quotes Theorem 4 of Contat and Curien (2025) as establishing convergence of fully parked critical trees to the Brownian growth-fragmentation tree 'for the Gromov-Hausdorff-Prokhorov hypograph convergence.' GHP hypograph convergence is precisely a metric-topology convergence framework, so the cited theorem directly contradicts the claim that this direction is unaddressed. If the intended open problem is more specific (e.g., other topologies, heavy-tailed arrivals, or convergence of objects other than fully parked trees), the text must state that. As written, the paper's central novelty claim is internally inconsistent.","section":"§5 vs. §4 (Theorem 4)"},{"comment":"The statement of the phase-transition theorem for the frozen configuration model is corrupted. The assumptions read 'with E_υ[m] ≤ 1 and Eυ[m] ≤ 1', which is redundant, and the displayed formula 'Θ = (1 − Eυ [m])2−Σ2Eυ [σ 2+m2−m]' is missing parentheses and exponents, making the phase-transition criterion unreadable. Since the theorem is one of the main results surveyed, the author must verify the statement against the original paper and correct it. This is not a mere typo: the criterion 'Cλ = 0 if and only if Θ ≥ 0' is the content of the result.","section":"§4, Theorem 2 (Contat, 2023)"},{"comment":"The displayed universality result uses F(x,y), [y^p]F(x,y), W_x^p, and the auxiliary quantities x_cr and y_x^cr without defining them anywhere in the survey. A reader cannot understand the statement or its role in the subsequent scaling-limit theorem. At minimum, the survey should say that F is the relevant bivariate generating function of fully parked trees (or for the catalytic equation) and should list the 'standing assumptions' that are invoked. As it stands, the theorem is presented as a black box with undefined notation.","section":"§4, Corollary 3 (Contat and Curien, 2025)"},{"comment":"The survey does not substantiate its claims that certain problems 'remain underaddressed.' For example, Section 5 lists total displacement, individual displacement, defective parking functions, and restricted enumeration, but it only repeats Lackner and Panholzer's 2016 open problems without reporting what has happened since and without citing the substantial ordinary-parking-functions literature on these quantities. A survey of open problems should either document prior partial results or state explicitly that the open question is whether these quantities can be analyzed in the random-tree setting. Without that, the reader cannot judge the novelty of the proposed agenda.","section":"§5, open-problems list"}],"minor_comments":[{"comment":"'My intent it to point' is ungrammatical; 'problem in different metric topologies' should be plural. The reference to Aldous's n^{2/3} result should be phrased as a scaling of component sizes at criticality, not of the random graphs themselves.","section":"Abstract and §1"},{"comment":"The author names are misspelled: 'Kovalinka and Towari' should be Konvalinka and Tewari, and 'Foata in Riorda' should be Foata and Riordan.","section":"§2"},{"comment":"There are LaTeX artifacts in the text, including 'quotesingle.ts1s' and '/integerdivide', and several displayed formulas (e.g., Theorem 1's expression for E{s_k}) are typeset ambiguously with missing parentheses and fraction bars. These must be cleaned before the paper can be read.","section":"§2"},{"comment":"There is a typo 'there esists' in the paragraph after Theorem 2, and the phrase 'Benjamini-Schramm quenched' should probably be 'Benjamini-Schramm convergence, quenched' or similar.","section":"§4"},{"comment":"Several entries have corrupted page ranges or missing separators, for example [3] '647706', [15] '4452', and [18] '1776'. In addition, [22] (Kung and Yan) and [24] (Macdonald) are listed but never cited in the text; either cite them or remove them.","section":"References"},{"comment":"The phrase 'provide an at present blank field of research' is awkward; consider 'remain largely unexplored' or similar.","section":"§5"}],"recommendation":"major_revision","confidential_remarks":"The manuscript appears to be an early draft; the number of TeX errors is unusually high. The most urgent issue is the contradiction between Section 5 and Theorem 4. If the author can clarify the intended scope of the open direction and correct the corrupted theorem statements, the paper might be suitable as a short survey. I do not see grounds for rejecting the topic itself, but the current text is not publishable as is."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a short survey with a genuinely useful bibliography, but it is not publishable as is. The advertised open direction—parking problems in different metric topologies—is undercut by Theorem 4 in the paper's own Section 4, where the cited Contat–Curien result proves convergence in Gromov–Hausdorff–Prokhorov hypograph topology. Section 5 says such questions are \"largely unaddressed\" and the abstract offers them as the main future direction. That is an internal contradiction, and it survives any copy edit.\n\nWhat is new here is limited to the packaging. The survey does reasonably gather the recent Contat and coauthor results and places them next to Lackner and Panholzer, and it points to connections with random planar maps, frozen Erdős–Rényi models, and growth-fragmentation trees. Those pointers are useful for someone entering the area. But the actual content is a compilation, with no new theorems, derivations, or data. The open-problems list in Section 5 largely restates Lackner–Panholzer items 4–6 with slight reframing.\n\nThe soft spots are not minor. The manuscript has many transcription errors ('integerdivide', 'quotesingle.ts1s', repeated 'E_υ[m] ≤ 1' in Contat's Theorem 2, the Pollak map garbled, and a reference to the map from PF_n to Z_{n+1}^{n-1} that doesn't match the written formula). These are not just cosmetic: they make the survey untrustworthy for a reader who does not already know the literature. It also does not establish systematically that the open problems are still open; several references appear in the list but are never cited in the text.\n\nWho should read it? A newcomer to the area might use it as a rough map, but only with the original papers open next to it. As a submitted survey, I would not send it to a referee in this state. It needs a careful revision: fix the contradiction about GHP topology, clean up the LaTeX damage, verify each theorem statement against the source, and prune or cite the dangling references. After that, a shorter or more careful version could be a useful contribution. My recommendation: desk reject with an invitation to resubmit after major revisions.","headline":"Useful bibliography but the paper's central open-problem claim is contradicted by a theorem it cites; needs major revision before it can serve as a survey.","tokens_in":13389,"tokens_out":3160,"would_cite":false,"duration_ms":32191,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60-02"],"pacs":[],"model":"deepseek-v4-flash","headline":"The parking problem on random trees undergoes a sharp phase transition when the number of drivers approaches half the number of vertices, and its critical scaling limit is the Brownian growth-fragmentation tree.","keywords":["parking functions","random trees","phase transition","scaling limits","Brownian growth-fragmentation tree","Gromov-Hausdorff-Prokhorov topology","frozen Erdős-Rényi model","Bienaymé-Galton-Watson trees"],"falsifier":"A reader could settle the claimed universality by computing the singularity exponent of the flux generating function at criticality for Poisson car arrivals on critical Cayley trees with $m=n/2$; if the exponent is not $p^{-5/2}$, or if the reconstructed rooted metric tree converges to Aldous's Brownian continuum random tree instead of the Brownian growth-fragmentation tree, the claim fails.","tokens_in":12495,"feed_emoji":"🚗","tokens_out":10885,"duration_ms":95331,"temperature":0.7,"pith_summary":"This survey assembles the known results on parking problems on random trees and presents them as a single storyline with a sharp phase transition. If $m$ drivers arrive on a random tree with $n$ vertices, almost all park when $m\\lesssim n/2$; once $m$ crosses $n/2$, a positive fraction of drivers fail, and at the critical point the fully parked tree has a universal scaling limit. The survey's forward-looking claim is that the natural next step is to study these limits under other metric topologies, especially Gromov–Hausdorff–Prokhorov convergence, and to connect the results to random planar maps. A careful reader would care because the same transition and the same limiting objects appear across several different random-tree models, which points to a robust underlying mechanism.","feed_headline":"Parking on random trees has a sharp phase transition at m≈n/2","feed_subtitle":"The critical window is universal, and the next open questions concern how the limit depends on how we measure distance between trees.","key_machinery":"The central object is the tree parking function: a length-$m$ sequence of preferred vertices on a rooted tree in which every driver can move toward the root and eventually reach a vacant vertex. The phase transition is located by comparing $m$ with $n/2$, and the counting formulas of Lackner and Panholzer make this comparison exact for Cayley trees. At the scaling level the argument is carried by catalytic functional equations for the flux of cars: universal singularity exponents $p^{-3/2}$ and $p^{-5/2}$ select the limiting trees $\\mathcal{T}_{1/2}$ and $\\mathcal{T}_{3/2}$, where $\\mathcal{T}_{3/2}$ is the Brownian growth-fragmentation tree. Convergence is stated in the Gromov–Hausdorff–Prokhorov hypograph topology, and the accompanying frozen Erdős–Rényi coupling explains why the same critical objects reappear across models.","core_discovery":"The central discovery is that the parking process on a random tree changes behavior at $m\\approx n/2$: in the subcritical regime almost every driver parks, at criticality the number of unsuccessful drivers fluctuates on scale $n^{1/6}$, and in the supercritical regime a positive fraction of drivers never park. When critical trees are conditioned to be fully parked, their scaling limit is the Brownian growth-fragmentation tree $\\mathcal{T}_{3/2}$, a self-similar Markov tree associated with the $3/2$-stable process, rather than Aldous's Brownian continuum random tree; the limit is stated under Gromov–Hausdorff–Prokhorov hypograph convergence and rests on universal asymptotics $p^{-3/2}$ below criticality and $p^{-5/2}$ at criticality. The paper's own contribution is to make this collection of results visible as a research program and to name the missing pieces, especially the behavior of parking limits in other metric topologies and the connection to random planar maps.","pith_inferences":["A testable extension would be to run the parking process on critical Cayley trees with power-law car arrivals and compare the reconstructed metric tree with the Brownian growth-fragmentation tree; the survey identifies heavy tails as a boundary case but does not predict the outcome.","If the Gromov–Hausdorff–Prokhorov program succeeds, the critical parking tree could become a standard example of a random metric space that is not the Brownian continuum random tree yet arises from a simple discrete parking rule.","The survey's hint at queueing theory can be made concrete by reading total displacement as a waiting-time or busy-period statistic in a rooted queue, which would bring queueing results to bear on parking problems; the paper does not develop this mapping.","The contrast between the $n/2$ transition on Cayley trees and the density-zero transition on random recursive trees suggests that degree growth changes the critical window fundamentally; one could test whether intermediate degree sequences interpolate between these two regimes."],"forward_implications":["Below $m\\approx n/2$ the parking process is subcritical: almost all drivers park, and the number of parked cars is close to $m$.","At criticality, the number of drivers who fail to park fluctuates on scale $n^{1/6}$, and a conditioned fully parked tree converges to the Brownian growth-fragmentation tree $\\mathcal{T}_{3/2}$ rather than to Aldous's Brownian continuum random tree.","The singularity exponents $p^{-3/2}$ (subcritical) and $p^{-5/2}$ (critical) are universal across a broad class of car-arrival laws, not just the specific cases computed so far.","If the metric-topology program goes through, parking on random trees will connect to inhomogeneous continuum random trees and to the literature on random planar maps.","The open problems inherited from Lackner and Panholzer—total displacement, defective parking functions, and restricted parking functions—remain natural targets for probabilistic analysis."],"supporting_citations":[{"why":"introduces tree and mapping parking functions, gives the counting formulas, and establishes the phase transition at $m\\approx n/2$.","marker":"Lackner and Panholzer (2016)"},{"why":"proves that the phase transition on Bienaymé–Galton–Watson trees is sharp via a large-deviations result for the flux of exiting cars.","marker":"Contat (2022)"},{"why":"supplies the multiplicative coalescent and the Brownian continuum random tree background used in the critical-window analysis.","marker":"Aldous (1997)"},{"why":"couples parking on Cayley trees with the frozen Erdős–Rényi model and conjectures the growth-fragmentation tree as the scaling limit of critical parked clusters.","marker":"Contat and Curien (2023)"},{"why":"develops self-similar Markov trees and the Gromov–Hausdorff–Prokhorov hypograph topology used to state the limit theorems.","marker":"Bertoin, Curien and Riera (2024)"},{"why":"proves the universal $\\mathcal{T}_{1/2}$ and $\\mathcal{T}_{3/2}$ scaling limits for fully parked trees under the standing assumptions.","marker":"Contat and Curien (2025)"},{"why":"characterizes the subcritical and supercritical regimes of parking on the infinite binary tree, including a discontinuous transition.","marker":"Aldous et al. (2023)"},{"why":"studies parking on random recursive trees and finds that the phase transition appears at density zero, providing the main contrast case.","marker":"Contat and Laulin (2025)"}],"fun_headline_variants":["Random tree parking: sharp phase transition at m=n/2","Tree parking: critical window at m≈n/2","Parking on random trees: m=n/2 marks a phase transition","Random tree parking: open problems at the m=n/2 transition","Tree parking: critical window and open metric limits"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The survey's agenda assumes that the open problems it lists are still open—particularly parking limits under other ways of measuring distance between trees—and it does not systematically show that the wider literature has not already addressed them.","fun_headline_variants_meta":{"raw":{"variants":["Random tree parking: sharp phase transition at m=n/2","Tree parking: critical window at m≈n/2","Parking on random trees: m=n/2 marks a phase transition","Random tree parking: open problems at the m=n/2 transition","Tree parking: critical window and open metric limits"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001067,"raw_usage":{"total_tokens":4459,"prompt_tokens":918,"completion_tokens":3541,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":534,"completion_tokens_details":{"reasoning_tokens":3456}},"tokens_in":534,"tokens_out":3541,"duration_ms":24586,"temperature":1.0,"reasoning_tokens":3456,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T21:53:08.728439+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A reader could settle the claimed universality by computing the singularity exponent of the flux generating function at criticality for Poisson car arrivals on critical Cayley trees with $m=n/2$; if the exponent is not $p^{-5/2}$, or if the reconstructed rooted metric tree converges to Aldous's Brownian continuum random tree instead of the Brownian growth-fragmentation tree, the claim fails.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"introduces tree and mapping parking functions, gives the counting formulas, and establishes the phase transition at $m\\approx n/2$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"proves that the phase transition on Bienaymé–Galton–Watson trees is sharp via a large-deviations result for the flux of exiting cars."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"characterizes the subcritical and supercritical regimes of parking on the infinite binary tree, including a discontinuous transition."}],"review_version":1}