| paper | d4-journals-mss-2026-0038 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The paper’s named results are existence impossibilities or a characterization, not computational results under the stated test. The proposed high-multiplicity allocation setting is a possible follow-up, but it is not a continuous analogue of a computational result established here.
fails bit a — no named computational result to mirror
The proposed case considers Theorems 6, 7, and 9; none states an algorithm, complexity bound, or hardness result, and the paper’s query-complexity discussion is only a future question.
The strongest honest case for a continuous mirror is a research opening, not one anchored in this paper’s computational results: the paper contains no named computational result of the kind your anchor rule requires.
The closest candidates do not qualify. Theorem 6, proved here, says that for every \(n\geq5\), some valuations admit no connected division of a pie that is both \((n-1)\)-proportional and equitable. Theorem 7, also proved here, says that some valuations admit no connected division of a cake that is both \((n-1)\)-proportional and Pareto optimal. These are existence impossibilities, not claims about computational complexity. Theorem 9, proved here, characterizes when a strong \(k\)-proportional division exists: exactly when every set of \(k\) players includes two with different measures. It does not state a complexity bound for deciding or constructing such a division. The paper’s conclusion raises algorithm and query-complexity questions, but does not answer them.
There is a plausible high-multiplicity setting to investigate: a large allocation market with a finite number \(\tau\) of recurring valuation types, where type \(t\) has population share \(\mu_t\). The paper’s conclusion points toward asking how hard it is to construct fair divisions as the population grows. But the paper’s conditions concern individually assigned, connected pieces and coalitions of \(k\) players; converting those into conditions on type masses requires substantive modeling choices. The paper provides no computational anchor to validate those choices.
The weakest point is therefore decisive: the paper already makes the *cake* and its valuation measures continuous while keeping the number of players finite. Its central theorems concern mathematical existence, not computation over a continuous population. A high-multiplicity mirror may be worth developing, but claiming that any theorem here establishes its computational landscape would overstate the paper.
The strongest case against a ChoCo mirror is that the paper supplies no computational result to mirror. Theorem 6 proves an existence impossibility for connected, \((n-1)\)-proportional equitable divisions; Theorem 7 proves one for connected, \((n-1)\)-proportional Pareto-optimal divisions; Theorem 9 characterizes when a strong \(k\)-proportional division exists. None claims a complexity bound for deciding or constructing a division. The conclusion does raise query complexity as a future question, but that is an opening for new work, not a computational result whose landscape this paper establishes.
The best continuizations of Theorems 6 and 7 also expose a scaling problem in their witnesses. In Theorem 6, the exceptional valuation types have population shares \(1/n,1/n\), with the remaining share \((n-2)/n\) uniform. In Theorem 7, the exceptional type has share \(1/n\), and the rest is uniform. As \(n\) grows, the exceptional types disappear from the limiting society. Both results also use \(k=n-1\): excluding one player becomes excluding zero population mass. These are signs of continuum degeneration in the particular results, not arguments that their answers would be unchanged. Replacing the vanishing exceptional shares with positive-mass groups might be a sensible new model, but the paper proves nothing about that regime.
Connected pieces make the translation harder. In an atomless population, a partition cannot give uncountably many individuals distinct positive-length intervals: only countably many disjoint intervals can have positive length. A type-level block, a lottery over pieces, or a per-capita average can give a continuous population a meaningful allocation, but each changes the individual connected-piece object on which Theorems 6 and 7 rely. Such models may be worth studying; these theorems do not anchor their computational questions.
Theorem 9 offers the best candidate for a positive-mass type mirror. But strong \(k\)-proportionality quantifies over every \(k\)-person subset and uses strict, individual comparisons. With fixed finite type support, a positive-mass type represents arbitrarily many people, so finite-\(k\) comparisons can be dominated by repeated identical types. Letting \(k\) scale with population size produces a different parameter, such as \(k/n\), and a group-level fairness question. Either version may have a clean formulation, but neither supplies the computational result this paper lacks.
There is a plausible follow-up: a large rationing market with a finite catalogue of valuation types, asking for algorithms to construct fair allocations. The paper’s conclusion itself points toward algorithmic questions, so I would not rule out that project, and high-multiplicity work would support the plausibility of its regime. But that is the case’s weak point against the user’s universal claim: the follow-up could be worthwhile. The narrower negative judgment is stronger: this paper does not establish a computational mirror, and its central impossibility witnesses depend on individual-level connected partitions and constraints that do not pass cleanly to population masses.
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.