| paper | d4-journals-mss-2019-0022 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named theorems establish structural properties of individual preferences and their constructions, but do not state an algorithmic or complexity result for a population problem. Studying feasible character-frequency mixtures would add an electorate-design objective that this paper does not formulate.
fails bit a — no named computational result to mirror
The theorems cover nesting and the character effects of the stack and weave constructions for individual preferences; they do not establish results about populations or character frequencies.
I can make a narrow positive case for the *setting*: a large referendum electorate could have many voters drawn from a relatively small menu of complete preference orders over the \(2^n\) outcomes. A continuous society would assign each order type a rational mass \(\mu_t\), with the number of voters large and the number of distinct types small. That is a plausible high-multiplicity regime for election simulation, which the paper identifies as a potential application.
But it does not give me a qualifying anchor for the computational mirror you asked for. Theorem 8, proved here, says that any two separable question sets in a cubic preference are nested. Theorem 13, also proved here, characterizes the character produced by stacking two preferences; Theorem 18 does the same for weaving. These are named structural results, but none asserts a complexity classification or gives a computational formulation the paper analyzes. The paper’s mention that Hamiltonian-path existence is NP-complete is a cited general fact, not a numbered result of this paper about its character-admissibility problem.
A continuous electorate of these types could support questions about how much population has a given character, or whether a character occurs in the support. But those are new aggregate questions: the paper studies which characters an individual preference can have and how to construct such preferences. Theorems 8, 13, and 18 do not establish results about those population questions. Turning them into the requested anchors would overstate the connection.
So the honest positive case is limited to a plausible population regime and possible use in simulation. I cannot state a continuous problem per qualifying anchor without inventing a new problem the paper does not compute with. The paper has named mathematical results, but no named computational result of the kind required here; that is the main weakness, and it prevents a strong computational-social-choice mirror.
The strongest objection is that the paper gives no named computational result to continuize. Theorem 8 is a structural statement about one preference order; Theorems 13 and 18 describe how particular constructions change that order’s character. None analyzes an electorate, an algorithmic problem, or its complexity. The cited NP-completeness of Hamiltonian-path existence is background motivation for enumeration, not a result about the paper’s character-admissibility problem.
There is a natural population-level restatement of Theorem 8. Let \(\alpha_S\) be the mass of voters whose preference makes \(S\) separable. For incomparable \(A,B\), the theorem implies \(\alpha_A+\alpha_B\leq 1\). But given the society’s explicit support, computing these masses is just a sum over types. To make this a substantial computational question, one would need to ask which vectors of character frequencies can be produced by mixtures of cubic preferences, or how to design a mixture with specified frequencies. That could connect to the paper’s simulation motivation, but it adds an electorate-design problem the paper does not formulate. It is the most plausible repaired mirror, and the simulation discussion makes this the weak point in a categorical negative case.
The same distinction defeats the best repairs of Theorems 13 and 18. One could push a distribution of preferences through the stack or weave construction and ask how character frequencies change. Those constructions act on individual rankings; they do not combine or transform voters. For an explicit distribution, the resulting frequencies follow by applying the stated character formulas to its support. A harder task—choosing a distribution or construction to achieve target frequencies—again introduces a new population-design objective.
The proponent is right that a large electorate with many repeated complete preference types is plausible. But that supplies a setting, not a computational result from this paper to mirror. A worthwhile project on the feasible mixtures of cubic preferences remains conceivable; the case against is that it would be a new computational study motivated by the paper’s application, rather than the continuous-population version of a computational problem the paper actually studies.
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.