{"id":"b8c6f514-0221-4e5b-a9b6-b76898bd105e","arxiv_id":"2607.16098","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For any fixed set of taken parking spots, the parking completions are precisely the x-parking functions whose cumulative bounds are the unoccupied spots.","lead":"This paper proves that parking completions — preference lists that let the remaining cars park after some spots are already taken — are exactly the x-parking functions built from the gaps between the empty spots. It answers an open problem from Adeniran et al. about the connection between parking completions and Pitman-Stanley polytope volumes.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 2.7 reduces to the cited but unproved Lemma 2.4; the promised proof is absent, and a failure of that characterization would collapse the main result.","rationale":"The reader's weakest-assumption identification matches mine: the theorem hinges on Lemma 2.4. I checked the surrounding proof structure: Proposition 2.6 uses Lemma 2.4 in both containments, and Theorem 2.7 invokes Proposition 2.6 and permutation invariance, so without Lemma 2.4 the proof is incomplete. However, the lemma is a well-known characterization and appears in the cited paper, and small cases (e.g., n=3, t=(1); n=4, t=(2,3)) confirm the set equality. The paper's flaws — the false promise of a proof, the circular alternate proof, mislabeled references — are real and warrant conditional acceptance, but they do not undermine the main result. Thus the verdict should remain CONDITIONAL, i.e., unchanged from the reader.","tokens_in":7287,"tokens_out":11220,"duration_ms":89585,"concrete_test":"Prove Lemma 2.4 directly from Definition 1.2 and the parking-function inequality (1.1): show that (t|c)^\\up_i ≤ i for all i ∈ [n] iff c^\\up_j ≤ u_j for all j ∈ [n−m], where u is the increasing list of [n]\\con(t), by partitioning [n] into the m+1 gaps around the elements of t. If the equivalence holds, the theorem's cited foundation is sound; if a counterexample exists, the central claim is false.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central Claim (Theorem 2.7) is essentially Lemma 2.4 restated under x_i = u_i - u_{i-1}: PC_n(t) = PF_{n-m}(x) is exactly the assertion that c is a parking completion for t iff c^\\up_i ≤ u_i for the unoccupied spots u. Lemma 2.4 is quoted from [1, Definition 2.1] and is never proved in the paper; the introduction even promises 'we include a proof of this equivalence' that never appears. Both directions of Proposition 2.6 invoke this lemma, so the gap is load-bearing, not peripheral. If the characterization were false or mis-copied, Theorem 2.7 and Corollary 2.8 would fail. The main result is almost certainly true — the lemma is a standard generalization of the parking-function inequality — but as written the paper's proof is incomplete. Separately, the 'alternate proof' of Lemma 2.3 is circular ('By Lemma 2.3'), though the first proof is valid. These are fixable exposition issues, not evidence of a false theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper establishes that parking completions for a fixed occupied set t are exactly x-parking functions, where x is the vector of gaps between the unoccupied spots: x = (u_1, u_2-u_1, ..., u_{n-m}-u_{n-m-1}). This is Theorem 2.7, with Proposition 2.6 treating the weakly increasing case and Corollary 2.8 concluding that |PC_n(t)| = P_{n-m}(x), thereby giving a volume formula and resolving an open problem posed by Adeniran et al.","tokens_in":7613,"tokens_out":4789,"duration_ms":39983,"significance":"If fully justified, the result is a clean resolution of the open problem: it gives an identity-map bijection between parking completions and x-parking functions, explains the numerical agreements observed in [1], and connects parking completions to Pitman-Stanley volume polynomials. The exposition is readable and the computational verification for small n is a useful check. However, the main theorem is essentially a restatement of Lemma 2.4 under a change of variables, and Lemma 2.4 is quoted without proof; the paper also contains a circular alternate proof. The claimed equality is very likely correct, but as written the central proof is incomplete.","major_comments":[{"comment":"Lemma 2.4 is the key characterization that c is a parking completion iff c^↑_i ≤ u_i for the unoccupied spots u. It is quoted from [1, Definition 2.1] but not proved, although the Introduction promises 'we include a proof of this equivalence.' This is load-bearing: with x_i = u_i - u_{i-1}, the defining condition of PF_{n-m}(x) is a^↑_i ≤ x_1+...+x_i = u_i, which is exactly Lemma 2.4. Thus Theorem 2.7 is Lemma 2.4 rewritten, and Corollary 2.8 follows immediately. Proposition 2.6 also invokes 'the inequality characterization of parking completions' in its induction step, so it does not supply the missing proof. The manuscript must either prove Lemma 2.4 from the parking algorithm or explicitly state that the main result depends on this known characterization; as written, the proof is incomplete.","section":"§2, Lemma 2.4 and Theorem 2.7"},{"comment":"The double-containment argument is not rigorous as written. The induction hypothesis is stated as 'if c=(c1,...,ck)∈PC↑_{m+k}(t), then c∈PF↑_k(x)', but PC_{m+k}(t) is not defined for a prefix of length k when t has length m; the intended total length is unclear. The step from a length-(k+1) completion d to its prefix also requires an argument that the first k entries form a parking completion for the same t. More importantly, both directions of the proof ultimately rely on Lemma 2.4: the forward direction uses it to assert d_{k+1} ≤ u_{k+1}, and the reverse direction concludes that a is a parking completion from a_i ≤ u_i, which is exactly the unproved characterization. The proposition therefore does not provide an independent derivation of the main result.","section":"§2, Proposition 2.6"}],"minor_comments":[{"comment":"The alternate proof says 'By Lemma 2.3' but the intended reference is Lemma 2.4. As printed, the alternate proof is circular. The first proof of Lemma 2.3 is fine.","section":"§2, Alternate proof of Lemma 2.3"},{"comment":"The proof refers to 'Theorem 2.6' and 'Theorem 2.3'; these should be 'Proposition 2.6' and 'Lemma 2.3' respectively.","section":"§2, Proof of Theorem 2.7"},{"comment":"In the first containment, the conclusion is written as 'PC↑_n(x)⊆PF↑_{n-m}(x)' but should be 'PC↑_n(t)⊆PF↑_{n-m}(x)'. Later in the same proof, 'PC↑_n(x)' is again used where 'PC↑_n(t)' is meant.","section":"§2, Proposition 2.6"},{"comment":"The conversion between u-parking functions and x-parking functions is stated correctly, but it would help to explicitly note that x_i ∈ N since the u_i are strictly increasing positive integers; this ensures consistency with Definition 1.1.","section":"§2, Remark 2.5 and Definition 2.1"}],"recommendation":"major_revision","confidential_remarks":"The main result is almost certainly true and the paper addresses an open problem, but as written the key lemma is simply quoted and the promised proof is absent. This is fixable within the manuscript's scope by adding a proof of Lemma 2.4 and cleaning up the induction in Proposition 2.6. I do not see grounds for rejection; the result is correct and useful, but the exposition overstates the independence of the proof."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know two things about arXiv:2607.16098. First, the main theorem is correct and answers the open problem from Adeniran et al.: parking completions for t are exactly x-parking functions under the change of variables x_i = u_i - u_{i-1}, where u is the increasing list of unoccupied spots. That is a genuine result, and it gives the connection to Pitman-Stanley volumes as a corollary. Second, the way the paper gets there is mostly a restatement of a lemma it never proves. Lemma 2.4 — the characterization that c is a parking completion iff its sorted entries satisfy c_i^↑ ≤ u_i — is quoted from [1, Definition 2.1] and is load-bearing. The introduction even promises a proof of this equivalence, but none appears. The main theorem is that lemma written in x-coordinates. Since the lemma is standard and true, the result stands, but the paper as written is incomplete.\n\nWhat the paper does well: the double-containment proof of Proposition 2.6 is fine, and the observation that the right change of variables is exactly the telescoping differences x_i = u_i - u_{i-1} is the key insight. The corollary |PC_n(t)| = P_n(x) follows immediately and connects the enumerative formula to Pitman-Stanley volumes. That's a legitimate, if small, contribution to the parking-function program.\n\nSoft spots, in order of concern. The missing proof of Lemma 2.4 is the real one. The paper leans on it for every direction of the main argument, and if the characterization were mis-copied or false, Theorem 2.7 would collapse. It's not false, but the authors should either prove it or stop promising to. Second, the 'alternate proof' of Lemma 2.3 is circular: it cites Lemma 2.3 itself. The first proof is valid and sufficient, so delete the alternate. Third, there are small notational slips: PC_n^↑(x) where it should be (t), 'Theorem 2.6' where it should be Proposition 2.6, and the appendix code calls functions that are never defined. These are all fixable.\n\nWho is this for? Specialists in parking functions, and maybe people interested in polytope volumes as parking-function enumerators. It won't reorient the field, but it closes a stated open problem.\n\nMy recommendation: send it to peer review, not desk reject, but require the revision. The missing proof of Lemma 2.4 and the circular alternate proof are not fatal to the truth of the result, but they are fatal to the paper as a self-contained proof. A serious referee should see it, but the authors should be told to fix the gap and clean up the exposition.","headline":"Answers the open problem, but the main theorem is basically the unproved Lemma 2.4 in new notation; correct and worth refereeing, though it needs a real proof of that lemma and cleanup.","tokens_in":7985,"tokens_out":3465,"would_cite":true,"duration_ms":26831,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A19"],"pacs":[],"model":"deepseek-v4-flash","headline":"Parking completions — preference lists that park around pre-occupied spots — are x-parking functions under a gap-coordinate change, and this identifies their counts with Pitman-Stanley volume polynomials.","keywords":["parking functions","parking completions","x-parking functions","Pitman-Stanley polytopes","volume polynomials","combinatorial enumeration","permutation invariance","gap vector"],"falsifier":"Compute both sides for a small case by hand: for n=4 and t=(2,4), the theorem predicts |PC_4((2,4))|=P_2((1,2))=5; list the 16 preference pairs and apply the original parking rule — any count other than 5, or any successful completion whose sorted entries exceed the free-spot bounds (1,3), would refute the claim.","tokens_in":7237,"feed_emoji":"🚗","tokens_out":12052,"duration_ms":100520,"temperature":0.7,"pith_summary":"Parking completions are the preference lists that let n−m cars all find spots after m spots have already been taken. The paper proves that these completions form exactly the same set as x-parking functions, the classic generalization of parking functions in which the i-th smallest preference is bounded by the i-th prefix sum of a vector x. The connecting x is built from the gaps between the unoccupied spots: if u is the increasing list of free spots, then x=(u1, u2−u1, ..., u_{n−m}−u_{n−m−1}). Because the count of x-parking functions is known to equal a homogeneous polynomial that also computes Pitman-Stanley polytope volumes, this set equality gives a direct explanation for why the two enumeration formulas agree, answering the open problem raised in earlier work. The proof is short: the two defining inequalities become identical under the gap substitution, and permutation invariance lifts the equality from sorted lists to all lists.","feed_headline":"Parking completions equal x-parking functions","feed_subtitle":"Gaps between taken spots tie completions to Pitman-Stanley polytope volumes.","key_machinery":"The load-bearing object is the gap vector x derived from the set of unoccupied spots: with u the increasing list of free spots, set x_1=u_1 and x_i=u_i−u_{i−1}. The identity ∑_{j=1}^i x_j = u_i converts the parking-completion inequality c^↑_i ≤ u_i into the defining inequality of an x-parking function, a_i≤x1+...+xi. The second piece is permutation invariance: both parking completions and x-parking functions are unchanged as sets under reordering entries, so proving that the weakly increasing members coincide is enough to identify the full sets.","core_discovery":"On the paper's terms, the central claim is Theorem 2.7: for any increasing list t of already occupied spots in [n], let u be the increasing list of the remaining spots and set x=(u1, u2−u1, ..., u_{n−m}−u_{n−m−1}). Then the set PC_n(t) of parking completions equals the set PF_{n−m}(x) of x-parking functions. The proof establishes the equality first for weakly increasing sequences, where the parking-completion condition c_i≤u_i and the x-parking-function condition a_i≤x1+...+xi are the same inequality after the telescoping substitution; it then uses that both families are closed under permuting entries. Corollary 2.8 records the enumeration consequence |PC_n(t)|=P_n(x), where P_n(x)=n!·V_n(x)","pith_inferences":["Because the occupied pattern t and the gap vector x determine each other once n is fixed, the theorem makes parking completions and x-parking functions two labelings of one family; results can be translated between them without a new proof.","The enumeration consequence suggests a geometric reading the paper leaves implicit: since P_n(x) is n! times a Pitman-Stanley volume, |PC_n(t)| is an integer multiple of a polytope volume, so parking completions are a whole-number count attached to a polytope even before a lattice-point model is found.","A testable extension would be to compare the term counts of the two enumeration formulas as the gap vector x varies; small gaps versus large gaps likely determine which formula is shorter, giving a path to the paper's open question about computational cost."],"forward_implications":["The number of parking completions for t equals P_n(x), where x is the gap vector of the unoccupied spots; in particular it is n! times the volume of a Pitman-Stanley polytope.","The two seemingly different enumeration formulas from earlier work count the same set, so their agreement is no longer numerical coincidence.","Known structural facts about x-parking functions transfer to parking completions, and vice versa, because the identification is a set equality rather than a statistic-preserving accident.","Counting completions reduces to counting weakly increasing sequences bounded by the cumulative gaps u_i; permutation symmetry contributes the multinomial factors."],"fun_headline_variants":["Parking completions are x-parking functions","Theorem: Parking completions = x-parking functions","Parking completions solve to x-parking functions","Now proven: Parking completions equal x-parking functions","x-parking functions capture all parking completions"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The argument rests on Lemma 2.4, cited from earlier work without proof in this paper: a list c is a parking completion for occupied spots t exactly when its increasing rearrangement satisfies c^↑_i ≤ u_i, where u is the increasing list of unoccupied spots; if that characterization fails for some t, the main set equality fails with it.","fun_headline_variants_meta":{"raw":{"variants":["Parking completions are x-parking functions","Theorem: Parking completions = x-parking functions","Parking completions solve to x-parking functions","Now proven: Parking completions equal x-parking functions","x-parking functions capture all parking completions"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000216,"raw_usage":{"total_tokens":1273,"prompt_tokens":754,"completion_tokens":519,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":498,"completion_tokens_details":{"reasoning_tokens":454}},"tokens_in":498,"tokens_out":519,"duration_ms":4413,"temperature":1.0,"reasoning_tokens":454,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T21:20:27.775881+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute both sides for a small case by hand: for n=4 and t=(2,4), the theorem predicts |PC_4((2,4))|=P_2((1,2))=5; list the 16 preference pairs and apply the original parking rule — any count other than 5, or any successful completion whose sorted entries exceed the free-spot bounds (1,3), would refute the claim.","supporting_citations":[],"review_version":1}