| paper | d4-journals-mss-2012-0003 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The paper states no numbered theorem, lemma, corollary, or proposition with a computational guarantee or hardness result, so no result can anchor a computational mirror. Its exponent-range analysis and fixed EU exponent-selection procedure have no worst-case runtime claim. The proposed mass formulation also just rescales the paper’s existing aggregate apportionment inputs.
fails bit a — no named computational result to mirror
No result is mirrored: the exponent-range analysis, exponent-selection procedure, and constitutional discussion lack a numbered computational result to anchor.
There is a plausible high multiplicity setting: an EU scale population of \(501{,}103{,}425\) people grouped into \(27\) Member State types. A candidate mass formulation would use \(\mu_i=p_i/\sum_j p_j\) and ask for \(E,D>0\) and a seat vector \(x\) satisfying \(x_i=5+\lceil\mu_i^E/D\rceil\), \(\sum_i x_i=751\), and \(\max_i x_i=96\).
But that is only an unanchored candidate. The paper contains no numbered theorem, lemma, corollary, or proposition asserting a computational complexity result. Its exponent-range analysis in Section 2 and exponent-selection procedure in Section 3 are not named complexity results and give no worst-case runtime. So there are no eligible anchors to restate, and I can’t honestly assign this candidate a class under the programme’s trichotomy.
The weakness is deeper than missing labels: the paper already works directly with aggregate population figures, and its formula naturally accepts normalized masses. The candidate may therefore be a rescaling of the paper’s existing model rather than a distinct continuous mirror. The strongest positive case is that apportionment has a convincing high multiplicity regime; this paper supplies no named computational result to carry that case further.
The proponent’s concession about anchors is the strongest point against a mirror: the paper states no complexity result for a computational problem. Sections 2 and 3 analyze exponent intervals and give a procedure for choosing an exponent in the fixed EU case, but they do not define an input family or claim worst-case complexity. Studying complexity now would pose a new problem; it would not continuize a computational result in this paper.
The natural type interpretation is convincing: let citizens’ Member State determine their type, with \(\mu_i=p_i/P\). But then the proposed mirror is exactly the paper’s calculation in different units, since
\[
\frac{p_i^E}{D}=\frac{\mu_i^E}{D/P^E}.
\]
The rounding, seat vectors, exponent ranges, and 96-seat condition all remain the same. The paper already uses aggregate population figures as the inputs to its rule; it has no individual ballots or citizen-level choices left to relax. Growing the population at fixed membership types changes no underlying computation. The continuous exponent \(E\) is a parameter of the apportionment rule, not a continuized society.
A broader study over arbitrary rational masses and a variable number of jurisdictions could be a legitimate algorithms project. So could a new question about how much population-share change alters an allocation. But those would add a general input regime or objective absent from the paper. They do not supply the missing continuous mirror of a named computational result. The negative case is strong for this paper, though it does not rule out independent computational work on generalized apportionment.
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.