| paper | d4-journals-mss-2019-0002 |
| 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 theorems establish axiomatic implications and structural characterizations, not algorithms, complexity results, or computational formulations. Adding a population and an aggregation rule would introduce the central model and task, rather than continuize a result of this paper.
fails bit a — no named computational result to mirror
No result has a computational mirror; Theorem 1 and Theorem 4 concern preference-relation implications and mixture-space structure, and the remaining results are likewise axiomatic or representational.
I can’t make a valid positive case under the requested standard: the paper has no named computational result establishing hardness, polynomial time, FPT, or another complexity classification. It therefore has no eligible anchor, and there is no per-anchor computational mirror to hand to a prover.
The closest result is Theorem 1, proved in the paper: on a generalized mixture set, a non-trivial, reflexive, semi-transitive, mixture-continuous, Archimedean relation with a transitive symmetric part must be complete and transitive. Theorem 4 gives a structural characterization of the mixture set under stronger assumptions. These are axiomatic results about a relation on a space of mixed alternatives. The continuous object is the outcome space, not a population distribution; the paper defines no agent types, population masses, computational task, or objective. A model with many agents grouped by preference type would add a social aggregation problem, rather than mirror a result here.
The strongest case is that this paper has no computational result to mirror. Theorem 1 proves an implication about one binary relation: under stated assumptions, that relation is complete and transitive. Theorem 4 characterizes the mixture space and order under stronger assumptions. Neither defines an input to an algorithm, a computational task, or a complexity question. There is no named computational anchor here; that is decisive for a paper-specific mirror.
The best attempt to add a population would make each type a person’s preference relation \(\succeq_t\) on the mixture set, give those types masses \(\mu_t\), and choose an aggregation rule to form a social relation. One could then ask whether the aggregate satisfies the assumptions of Theorem 1 or inherits its conclusions. But the paper supplies no aggregation rule, and its theorem concerns the resulting relation itself, not how a society generates one. If the aggregate is assumed to satisfy the theorem’s hypotheses, the conclusion follows directly; if the task is to determine whether it does, its content depends on the newly chosen aggregator and encoding. That is a different computational social choice problem.
Theorem 4 does not provide a stronger population anchor. Its mixture operation combines alternatives: \(x\lambda y\) is a mixture of \(x\) and \(y\), not a fraction of people holding either preference. Treating the choice space as a society would confuse outcome-space continuity with population continuity. Repeating people with the same preference relation leaves the theorem unchanged; allowing different preference types requires the new aggregation model.
I cannot prove that no future paper could build a worthwhile computational social choice problem from these ideas. The negative case is strongest at the paper level: any such project would add a population, an aggregator, and a computational task that this paper does not study. It would be inspired by these results, but it would not be their continuous-population mirror.
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.