| paper | d4-journals-mss-2012-0017 |
| 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 states no numbered theorem, lemma, corollary, or proposition asserting a computational result, so it fails the computational-result requirement. Both cases identify the large-federation divisor question as an unanchored extension rather than a mirror of a result in this article.
fails bit a — no named computational result to mirror
No computational result is covered; the article describes the base-plus-proportional rule and divisor procedure without a computational guarantee.
The strongest honest positive case is limited by the anchor requirement: this paper contains no numbered theorem, lemma, corollary, or proposition asserting a computational result. Sections 3.1–3.4 describe the base-plus-proportional method, its rounding choices, and its equivalence to a divisor procedure; the article does not analyze the complexity of an underlying problem. So it has no qualifying anchor, and no per-anchor continuous problem can be supplied.
The nearest exploratory mirror would be apportionment in a large federation with many jurisdictions but relatively few exact jurisdiction profiles. A type \(t\) would specify a jurisdiction’s population \(p_t\) and applicable seat limits; \(\mu_t\) would be the fraction of jurisdictions of that type. Given a target average house size \(h\), ask whether there is a divisor \(d\) such that the base-plus-proportional rule assigns \(q_d(t)=\lceil\min\{5+p_t/d,96\}\rceil\) seats to each jurisdiction of type \(t\), with \(\sum_t\mu_tq_d(t)=h\); a solution is such a divisor and the resulting allocation. This would cover the divisor-selection procedure, and appears tractable by checking its finitely many rounding breakpoints. But it is an unanchored extension, not a complexity result from the paper.
Its main weakness is that the paper studies a finite set of 27 member states, while the proposed regime treats jurisdictions as the agents and requires many to share exact profiles. The continuous seat-share function \(A_d(p)\) does not itself make the society continuous: it varies continuously with a population input while the set of states remains finite. Thus I would not present this as a strong, assignment-valid mirror of the paper’s results.
This paper has no computational result to mirror. Its contribution is a policy recommendation, an account of the criteria behind it, and a description of the base-plus-proportional rule. It states no complexity theorem about choosing a divisor, finding an allocation, or optimizing over apportionment rules. The instruction to adjust \(d\) until the house size matches, and the equivalence with a D’Hondt procedure, define the method; they do not establish a computational result.
The proposed distribution over jurisdiction types is the strongest nearby possibility, but it turns that method into a new problem. With \(q_d(t)=\lceil\min\{5+p_t/d,96\}\rceil\), the aggregate allocation changes only at finitely many divisor breakpoints. There are at most 91 seat levels per type under the paper’s cap, so the weighted divisor question can be handled by sorting those breakpoints and resolving a boundary tie. If jurisdiction mass cannot be split, a requested average house size may be infeasible; if it can, splitting mass at a threshold handles the remainder. Either way, the model may be coherent, but it yields a simple extension of the procedure rather than a complexity landscape the paper left open.
Treating citizens as the continuous agents does not supply the missing problem. The rule already takes each state’s population as a numerical input; it assigns seats to a finite set of states, not to the citizens. Making citizens nonatomic leaves those state-level decision units and their rounding thresholds intact. A robustness question about how much population must move to change an allocation could be worth studying, but it adds an optimization objective absent from the paper. With the EU’s fixed set of states, that would be sensitivity analysis of a divisor rule; with a large, repeated population of jurisdictions, it would concern a different institution and a newly introduced computational question.
The negative case is strongest for the paper as written: there is no anchor, and the nearest proposed mirror is straightforward once stated. It cannot establish that no apportionment problem involving a continuous population would ever be worth studying. A large federation with many genuinely interchangeable jurisdictions could motivate one. But that would be a new research direction, not a continuous mirror of a computational result in this article.
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.