| paper | d4-journals-geb-2022-0057 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
other→P discrete result → its continuous mirror
Answer: Every mass-MD execution terminates with exactly \(k\) candidates, and its possible outputs are exactly the size-\(k\) mass-PSC committees. · discrete side: other · adjudication: proved
full proof & adversarial review →
Lemma 1
statement extracted from the paper’s text layer
Given a rational distribution \(\mu\) over ranking types and a normalized quota \(q\in(1/(k+1),1/k]\), let \(M(S)\) be the mass of types whose \(|S|\)-prefix is exactly \(S\). Run MD by adding candidates to satisfy demands \(\min\{\lfloor M(S)/q\rfloor,|S|\}\); does this mass-based procedure terminate with a committee of size \(k\), and are its possible outputs exactly the committees satisfying mass-PSC?
The society is a rational distribution \(\mu\) over complete ranking types, with support size \(\tau\). The algorithm's state is the selected candidate set \(W\); it groups type mass by prefixes and adds candidates to meet the corresponding quota demands. There is no optimization objective: the output is a size-\(k\) committee.
The opponent's strongest point is that the mass-PSC equivalence is structural and the paper gives no runtime guarantee; this limits the mirror to an output guarantee and leaves its efficiency unproved.
fatal: False
The mirror covers Lemma 1's termination and committee-size guarantee, with the proposed mass-PSC range characterization corresponding to Lemmas 2 and 3 and Theorem 1. It does not supply a complexity classification or analyze other voting rules.
In the sense required for an anchor, this paper has no named computational result: it proves no complexity classification and gives no analyzed algorithm for a computational problem. Its results are structural. Lemma 1 (proved here) says MD terminates and outputs a committee of size \(k\). Lemmas 2 and 3 (proved here) show, respectively, that every MD outcome satisfies PSC and every PSC committee is an MD outcome. Theorem 1 (proved here) combines these into the equivalence: a committee satisfies PSC iff it is an outcome of a Dummett Tree path iff it is a possible MD outcome. These are not results that a problem is in P, hard, or otherwise computationally classified.
The closest population mirror would replace voters by rational masses on ranking types. With normalized quota \(q\in(1/(k+1),1/k]\), for each candidate set \(S\subseteq C\), let \(M(S)\) be the mass of types whose \(|S|\)-prefix is exactly \(S\). One could ask whether a size-\(k\) committee \(W\) satisfies mass-PSC: for every \(S\) and positive integer \(\ell\), if \(M(S)\ge \ell q\), then \(|W\cap S|\ge \min\{\ell,|S|\}\); and whether such committees coincide with outcomes of a mass version of MD.
That is a plausible population-level continuation of the paper’s characterization, but it is an axiomatic outcome question, not a computational one, and the paper supplies no named complexity result to anchor it. So the honest positive case is limited: the paper offers a natural object to continuize, but not a qualifying ChoCo computational mirror.
The paper offers no named computational result to continue. Lemma 1 proves that MD returns a committee of size \(k\); Lemmas 2 and 3, combined in Theorem 1, characterize PSC committees as exactly the outcomes MD can produce. These are structural claims about feasibility and outcomes. The paper gives no complexity classification, runtime analysis, or optimization result. None of those four results is a computational anchor.
The proposed mass-PSC version is a sensible high-multiplicity model: many voters can share rankings, and their proportions are meaningful. But the translation appears to preserve the paper’s structural question almost verbatim. For each candidate set \(S\), sum the mass of types whose \(|S|\)-prefix is \(S\), then apply the same quota demand. With support size \(\tau\), at most \(\tau m\) distinct prefix sets need consideration. Their masses and demands can be computed using rational arithmetic, and the corresponding MD procedure can fill those demands stage by stage. So checking a given committee, or constructing one by this procedure, looks polynomial in \(m,\tau\), and the input bit length. That is a useful implementation observation, but it supplies no pricing problem, optimization structure, or complexity boundary of the kind the programme is meant to map.
One could add a new task—count PSC committees, maximize an external score subject to PSC, or change the mass distribution as cheaply as possible to make a target committee PSC. Those might be worth studying. Each adds a computational objective absent from this paper; none is a continuous mirror of a result it proves. The negative case is therefore strong for ChoCo triage: this paper is an axiomatic characterization with a natural mass analogue, but no compelling computational mirror. The broader claim that no scenario could ever make a related continuous problem worthwhile is harder to defend; it depends on inventing a different problem, rather than finding a computational result in this one.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.