{"id":"72c43968-dbbc-44ec-babd-a47f6449ccea","arxiv_id":"2502.10068","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves that the Expanding Approvals Rule yields (2+√5)-proportionally fair clusterings from ordinal information, a tight bound, and connects Droop proportionality to beta-plurality points.","lead":"The paper proves a tight (2+√5) fairness guarantee for clusterings chosen from ordinal preference data, resolving an open question, and connects proportional clustering to beta-plurality points. It also claims the Plurality Veto rule selects strong plurality points from ordinal data, but that claim appears false as stated.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4 is false: PluralityVeto as defined in §4 can select a candidate with the highest plurality score that is not a (√5−2)-plurality point, so a central abstract claim collapses.","rationale":"The reader's stated weakest assumption is the unproved EAR rank-JR remark, and that is a genuine missing proof. But the single most load-bearing defect is Theorem 4: not merely an omitted justification but a false statement that is directly advertised in the abstract. The counterexample above is robust: it uses only the rule as written, a line metric, and positions with all distances satisfying the triangle inequality. Fixing the EAR gap would still leave a false central theorem; removing or correcting Theorem 4 is therefore the minimum necessary change. The REJECT verdict is unchanged, and my read agrees with the reader's overall evaluation, though not exactly with their choice of weakest assumption. Independently, Theorem 5's derivation appears internally consistent given a valid rank-JR premise; the problem is the missing EAR premise, which the paper itself flags only as a remark.","tokens_in":8459,"tokens_out":21719,"duration_ms":207474,"concrete_test":"Implement PluralityVeto exactly as in §4 for the line instance: 40 agents at 0 and candidate p at 0; ε=0.1; candidates r_t at 1+t·0.01 (t=1..6); q at 1−ε; 10 agents at each 1+t·0.01. Use any consistent tie-breaking. Verify that p is selected and |{i:(√5−2)d(i,p)>d(i,q)}|=60>50. Also re-derive the inequality d(i,p)≤d(i,r) used in the proof of Theorem 4 from the formal definition of the rule; if it does not follow, the theorem has no valid derivation.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 4 ('plurality veto always selects a (√5−2)-plurality point') is false under the rule as described in §4. In that rule the winner is the candidate whose score is driven to zero last; with standard tie-breaking this is the highest-plurality candidate. A highest-plurality candidate need not be any constant plurality point. 1D counterexample: p at 0, 40 agents at 0; put candidate q at 1−ε and six candidates r_1,...,r_6 at 1+γ_t with 0<γ_t≤0.05 and ε=0.1, with 10 agents at each 1+γ_t. Initial scores are p=40, each r_t=10, q=0. The r_t are decremented to 0 first (60 decrements), then the remaining 40 decrements reduce p to 0, so p is the last point decremented and wins. Yet each of the 60 agents at 1+γ_t has d(p)=1+γ_t≥1 and d(q)=γ_t+ε≤0.15, so (√5−2)d(p)≥0.236>0.15≥d(q); hence all 60 prefer q over p by a factor larger than 1/(√5−2), and p is not a (√5−2)-plurality point. The proof's unjustified step is the asserted inequality d(i,p)≤d(i,r) for the S-agent that decrements r; no property of PluralityVeto implies that metric inequality. Since this false theorem is advertised in the abstract, the paper cannot be accepted as is.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper connects two lines of work: proportional clustering with the Droop quota and the β-plurality problem. It proves an equivalence for k=1 (Theorem 2), gives a distortion bound for β-plurality points (Theorem 3), and makes two algorithmic claims: that Plurality Veto selects a (√5−2)-plurality point using only ordinal information (Theorem 4), and that any committee satisfying ℓ-rank-JR is (2+√5)-approximately ℓ-proportional, which together with an asserted property of the Expanding Approvals Rule would resolve an open question of Kalaycı et al. (Theorem 5). An appendix extends the rank-based approach to a core notion.","tokens_in":8763,"tokens_out":12139,"duration_ms":104186,"significance":"If the algorithmic claims were correct, the paper would make a valuable contribution: it would give an ordinal voting rule with a constant plurality guarantee and resolve an open question in ordinal proportional clustering. The simple equivalence in Theorem 2 is correct and nicely bridges two literatures, and the conditional Theorem 5 is a useful structural statement. However, the central Theorem 4 is false as stated, and the resolution of the open question rests on an unproved, load-bearing assertion about the Expanding Approvals Rule. The paper's headline results are therefore not established, and the current version cannot be accepted.","major_comments":[{"comment":"","section":"Section 4, Theorem 4"},{"comment":"The claim that 'an outcome returned by EAR satisfies ℓ-rank-JR with ℓ ≥ n/k' is stated as a remark with no proof and no citation. This property is exactly what is needed to turn the conditional Theorem 5 into an actual ordinal algorithm achieving (2+√5)-proportionality, thereby resolving the open question of Kalaycı et al. The cited references do not establish it: Aziz and Lee predate the rank-JR notion, and Brill and Peters do not state this quota version for EAR. Without a proof of this property, the paper's main contribution to the open question is conditional only. This is a load-bearing gap, not a presentation issue.","section":"Section 5, remark before Theorem 5"}],"minor_comments":[{"comment":"The definition of ℓ-rank-JR contains a variable error: 'for each j ∈ N′' should be 'for each i ∈ N′' with 'rank(i,c) ≤ r', or equivalently the condition should read 'rank(j,c) ≤ r for each j ∈ N′'. As written, the quantifier is ambiguous and the proof of Theorem 5 silently reinterprets the axiom.","section":"Section 5, Definition of ℓ-rank-JR"},{"comment":"The proof of Theorem 3 skips the justification that ∑_{N\\N′} d(q,p) ≤ ∑_{N′} d(q,p), which follows from |N\\N′| ≤ |N′| and d(q,p) ≥ 0. The step as written is confusing and should be spelled out.","section":"Section 3, Theorem 3 proof"},{"comment":"In the proof of Theorem 5, the agent j obtained from the rank-JR axiom is said to belong to N, whereas the axiom as stated guarantees an agent in N′; since N′ ⊆ N this is harmless, but it should be stated consistently to avoid confusion.","section":"Section 5, Theorem 5 proof"},{"comment":"There are several typos and formatting issues, e.g., 'asgents' in Section 2.1, 'D roop' in the abstract, and the footnote 'Droop quota' spacing. These should be cleaned up in a revision.","section":"Throughout"}],"recommendation":"reject","confidential_remarks":"The counterexample to Theorem 4 is decisive and shows that the paper's central advertised claim is false under the paper's own definitions. Even if the authors could remove Theorem 4, the open-question resolution in Section 5 depends on an unproved assertion about EAR, which would at minimum require a full proof or a precise citation. Given that the false theorem is central to the abstract and the introduction, rejection is appropriate."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper has one genuinely useful result and one broken headline claim. The equivalence between Droop proportional clustering for k=1 and β-plurality points (Theorem 2) is simple, correct, and worth having. The distortion bound for β-plurality points (Theorem 3) is a clean generalization of the known Condorcet-winner bound. And the rank-JR to (2+√5)-approximate proportionality proof (Theorem 5) looks right, and it is a real step toward the Kalaycı et al. open question — provided the unproven remark that Expanding Approvals satisfies ℓ-rank-JR for ℓ ≥ n/k is true. That remark is load-bearing and currently has no proof or citation.\n\nThe problem is Theorem 4. As stated, the Plurality Veto rule selects the last point whose score is decremented, which with standard tie-breaking is the highest-plurality candidate. The theorem claims that point is always a (√5−2)-plurality point. The stress-test counterexample is valid: put 40 agents at 0, six candidates r_1..r_6 at 1+γ_t with 10 agents each, and one candidate q at 0.9. Scores are p=40, r_t=10, q=0. The r's get decremented to zero first, then p, so p wins. But the 60 agents near 1+γ_t all prefer q over p by a factor larger than 1/(√5−2), so p is not a (√5−2)-plurality point. The proof's step 'd(i,p) ≤ d(i,r)' for the agent that decrements r is unjustified; nothing in the rule implies that metric inequality. Since this false theorem is advertised in the abstract, the paper cannot be accepted as is.\n\nAlso worth flagging: the paper's resolution of the open question depends on the EAR rank-JR remark, which is asserted without proof. That is a fragile premise; it should be either proved or cited to a published result.\n\nOverall, the core idea — connecting Droop proportionality to β-plurality and using rank-JR for ordinal proportional clustering — is sound and likely correct. But the false plurality-veto claim needs to be removed or fixed, and the EAR remark needs support. This deserves a serious referee, but the current version is not publishable. I'd suggest the authors revise and resubmit; the referee time is justified by Theorem 5.","headline":"A solid rank-JR result undermined by a false plurality-veto theorem and an unsupported EAR assumption.","tokens_in":9289,"tokens_out":3070,"would_cite":false,"duration_ms":25701,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68W25","91B14"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper establishes that fair clustering with a single center using the Droop quota is exactly the β-plurality problem, and that pure preference rankings suffice to obtain (2+√5)-proportionally fair clusterings for any number of centers.","keywords":["proportional clustering","β-plurality point","Droop quota","metric distortion","ordinal information","rank-JR","Expanding Approvals Rule","multiwinner voting"],"falsifier":"A concrete counterexample would be a finite metric space with an ordinal preference profile where either (a) the Expanding Approvals Rule returns a committee that violates $\\ell$-rank-JR for $\\ell \\ge n/k$, or (b) some $\\ell$-rank-JR committee admits a coalition $N'$ of at least $\\ell$ agents and an unchosen candidate $c$ such that every member's distance to the committee exceeds $(2+\\sqrt{5})$ times their distance to $c$. Constructing either by exhaustive search over small profiles would settle the theorem.","tokens_in":8214,"feed_emoji":"🗳️","tokens_out":6328,"duration_ms":60406,"temperature":0.7,"pith_summary":"The paper's central claim is that two previously separate fairness notions are the same problem viewed through different quotas: with a single center and the Droop quota, proportional clustering is exactly the β-plurality problem, with the proportionality factor equal to 1/β. Building on that bridge, the paper proves two algorithmic facts from ordinal preference data alone. First, the plurality veto rule always selects a $(\\sqrt{5}-2)$-plurality point, giving a constant-factor plurality guarantee without knowing distances. Second, any committee satisfying a rank-based fairness condition called $\\ell$-rank-JR is a $(2+\\sqrt{5})$-approximate $\\ell$-proportional clustering; since the Expanding Approvals Rule is asserted to satisfy that condition, this closes the gap in the ordinal proportional-clustering problem at exactly $(2+\\sqrt{5})$. A sympathetic reader should care because this replaces exact-distance access with preference rankings, which is the information realistically available in voting and participatory settings.","feed_headline":"Ordinal preferences suffice for fair clustering at 2+√5","feed_subtitle":"A rank-only rule guarantees proportionally fair cluster centers and closes the gap between the known upper and lower bounds.","key_machinery":"The central object is the $\\ell$-rank-JR condition, a fairness property for committees that depends only on preference rankings: for every rank $r$ and every group of at least $\\ell$ agents all having some candidate within their top $r$, the committee must contain a winner within the top $r$ of at least one group member. This condition is what lets the proof transfer an ordinal guarantee into a metric one, because it bounds how far a committee member can be from any candidate that many agents prefer collectively. The proof machinery also includes the ratio-optimization identity $\\max_{x\\ge 0} \\min(3+2/x, 1+2x) = 2+\\sqrt{5}$, which converts pairwise distance inequalities into the final approximation factor.","core_discovery":"The discovery is a chain of equivalences and reductions. For $k=1$, a point is a $\\beta$-plurality point if and only if the singleton clustering satisfies $1/\\beta$-Droop proportionality, so the two research programs are literally the same question. The paper then shows that plurality veto, a rule designed for metric distortion, always returns a $(\\sqrt{5}-2)$-plurality point from ordinal information alone. Finally, Theorem 5 proves that any committee satisfying $\\ell$-rank-JR is $(2+\\sqrt{5})$-approximate $\\ell$-proportional for every $\\ell > n/(k+1)$; because the Expanding Approvals Rule is stated to satisfy $\\ell$-rank-JR for $\\ell \\geq n/k$, this yields an ordinal algorithm for proportional clustering. The proof is driven by a worst-case ratio optimization: for any unchosen candidate and any large coalition, rank-JR guarantees a committee member whose relative distances to the coalition and the candidate satisfy $\\min(3+2/x, 1+2x) \\le 2+\\sqrt{5}$ for some nonnegative ratio $x$.","pith_inferences":["One can read Theorem 5 as a template: any future rule, not necessarily EAR, that supplies $\\ell$-rank-JR inherits the same $(2+\\sqrt{5})$ guarantee; this decouples the approximation proof from the algorithmic rule.","The $k=1$ equivalence suggests a strategy for proportional clustering: settle tighter bounds for the simpler plurality problem first, then try to lift them to multiple centers; the paper's authors explicitly float this possibility as an open direction.","The core-approximation result (Theorem 6) hints that ordinal information may also suffice for $q$-core guarantees in committee selection and sortition, but the paper does not provide an explicit ordinal rule for that setting; testing this would require a rank-PJR rule with an ordinal implementation."],"forward_implications":["For $k=1$, any improvement in $\\beta$-plurality bounds immediately improves Droop proportional clustering, and any lower-bound example transfers as well.","Plurality veto gives a purely ordinal method to find a point that no alternative beats by a factor better than $1/(\\sqrt{5}-2)=2+\\sqrt{5}$, i.e., constant-factor Condorcet fairness from rankings only.","Every $\\beta$-plurality point has metric distortion at most $2/\\beta+1$, so $\\beta$-plurality guarantees translate directly into social-cost guarantees; this generalizes the known distortion-3 bound for Condorcet winners.","The rank-JR theorem applies to every quota $\\ell>n/(k+1)$, so the $(2+\\sqrt{5})$ proportionality guarantee is not tied to the Hare quota and covers Droop-style thresholds.","Combined with the asserted EAR property, this gives an ordinal algorithm matching the known lower bound, so the approximation factor $(2+\\sqrt{5})$ is the best possible among ordinal rules."],"supporting_citations":[{"why":"Introduces the proportional clustering problem and the greedy capture algorithm, providing the baseline $(1+\\sqrt{2})$ upper bound that the paper generalizes.","marker":"[Chen et al., 2019]"},{"why":"Introduces $\\beta$-plurality points and gives the first existence and lower-bound results that the paper relates to proportional clustering.","marker":"[Aronov et al., 2021]"},{"why":"Supplies the modern definition of $\\beta$-plurality points and the best-known bounds in arbitrary metric spaces, which the paper's equivalence connects to clustering.","marker":"[Filtser and Filtser, 2024]"},{"why":"Introduces the plurality veto rule whose ordinal guarantee Theorem 4 strengthens from distortion to plurality.","marker":"[Kızılkaya and Kempe, 2022]"},{"why":"Poses the open question of ordinal proportional clustering and provides the lower bound of $2+\\sqrt{5}$ that Theorem 5 matches.","marker":"[Kalaycı et al., 2024]"},{"why":"Introduces the Expanding Approvals Rule, which the paper asserts satisfies the $\\ell$-rank-JR condition needed to turn Theorem 5 into an actual ordinal algorithm.","marker":"[Aziz and Lee, 2020]"},{"why":"Conceptually introduces rank-JR, the fairness axiom that carries the proof of Theorem 5.","marker":"[Brill and Peters, 2023]"}],"fun_headline_variants":["Rankings alone guarantee (2+√5)-fair clustering","Plurality Veto achieves 2+√5 proportional clustering","Ordinal info suffices for (2+√5)-fair clusters","Fair clustering from preferences: 2+√5 bound"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The sole unproved step needed for the main algorithm is the remark that the Expanding Approvals Rule always produces a committee satisfying the rank-based fairness condition for quotas at least $n/k$; if that remark is false for some preference profile, the paper's ordinal $(2+\\sqrt{5})$-proportionality guarantee does not follow from Theorem 5.","fun_headline_variants_meta":{"raw":{"variants":["Rankings alone guarantee (2+√5)-fair clustering","Plurality Veto achieves 2+√5 proportional clustering","Ordinal info suffices for (2+√5)-fair clusters","Fair clustering from preferences: 2+√5 bound"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000266,"raw_usage":{"total_tokens":1571,"prompt_tokens":865,"completion_tokens":706,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":481,"completion_tokens_details":{"reasoning_tokens":633}},"tokens_in":481,"tokens_out":706,"duration_ms":7935,"temperature":1.0,"reasoning_tokens":633,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T19:33:29.344380+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete counterexample would be a finite metric space with an ordinal preference profile where either (a) the Expanding Approvals Rule returns a committee that violates $\\ell$-rank-JR for $\\ell \\ge n/k$, or (b) some $\\ell$-rank-JR committee admits a coalition $N'$ of at least $\\ell$ agents and an unchosen candidate $c$ such that every member's distance to the committee exceeds $(2+\\sqrt{5})$ times their distance to $c$. Constructing either by exhaustive search over small profiles would settle the theorem.","supporting_citations":[],"review_version":1}