| paper | d4-journals-mss-2005-0028 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s numbered results are structural statements about Plott functions, convex geometries, and their representations; none asserts an algorithm, computational hardness, or another qualifying computational result. Without an eligible anchor, a population model over choice rules would be a new computational question rather than a continuous mirror of a result in this paper.
fails bit a — no named computational result to mirror
No continuous mirror is anchored in the paper’s Theorems 1–4; a quantitative population model over choice rules would add a new aggregate and computational question.
I can’t make a qualifying anchor-based case for a continuous mirror: the paper has no named computational result claiming tractability, hardness, or a parameterized complexity classification. So there are no eligible anchors, and no per-anchor continuous problems to hand to a prover.
The nearest results are structural. Theorem 1, proved here, says every Plott function is the join of the linear Plott functions beneath it. Theorem 2, proved here, describes how basements behave under direct images. Theorem 3, proved here, constructs a canonical superset rationalization. Theorem 4, proved here, characterizes basements as precisely the convex subsets of \(SW(X)\). None studies an algorithmic problem or its complexity.
A possible extension would put mass on types that are simple words and aggregate their choices. But that adds a population of choice rules to a paper about individual choice functions on menus. If aggregation uses the paper’s join, only whether a type has positive mass matters; the mass proportions themselves do no work. If proportions affect the aggregate quantitatively, that is a further modeling choice, not a mirror anchored in these results.
The weakest point is therefore decisive: there is no computational result here whose discrete hardness or algorithmic status a continuization could illuminate. The paper may inspire computational questions, but calling one a mirror of its named results would overstate the connection.
The other analyst’s conclusion is right on the paper’s eligibility: it offers no computational result to mirror. Theorems 1–4 are structural characterizations and constructions. They specify no computational problem, input encoding, algorithm, or complexity claim. Under ChoCo’s remit, that leaves no anchor for a continuous complexity question. The paper may suggest new computational research, but that is a different claim from finding a continuous mirror of its results.
The strongest population interpretation of Theorem 1 would treat linear orders as voter types. Given masses \(\mu_t\), aggregate each menu by taking the union of the types’ top choices:
\[
f_\mu(A)=\bigcup_{t:\,\mu_t>0}\max_t(A).
\]
That is exactly a join of linear Plott functions, so the theorem applies. But the mass values do no work: only whether each type has positive mass matters. If instead the aggregate records the fraction choosing each alternative, it becomes a quantitative, possibly fractional choice object. That might support a new model, but its aggregation rule and computational questions are additions to the paper, not mirrors of Theorem 1.
The other structural results do not supply a better anchor. Theorem 2’s maps send alternatives to alternatives; they merge clones of alternatives, not repeated agents. Theorem 3’s pieces are aspects in a representation of an alternative, not population types. Theorem 4’s “convexity” is defined by melanges of words, not by real-valued mixtures of a society. Distributions over these objects are possible, but the paper’s results do not make their weights computationally meaningful.
A better proposed extension would put mass on Plott choice rules and average their choices menu by menu. That makes the population continuous, but requires a new quantitative aggregate and a new question—perhaps when the average remains Plott. It is conceivable that such a question would interest the authors. The paper gives no reason to treat it as a computational mirror, though, and it does not establish that this is the problem the authors would recognize as theirs.
So the negative case is strong for the claim that this paper has no worthwhile *computational mirror*: its contribution is structural mathematics on finite alternatives, with no computational result to continuize. It is weaker as the universal claim that no worthwhile population model could ever grow from this mathematics. That cannot be ruled out honestly; such a model would be new work inspired by the paper, rather than a mirror of its stated results.
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.