| paper | d4-journals-geb-2017-0111 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named theorems give axiomatic characterizations, not computational results that could anchor a continuous mirror. Section 2.2 analyzes an optimization choice, but it supplies no named computational result or computational question over a society given as a distribution over types.
fails bit a — no named computational result to mirror
The paper's named results characterize transfer rules for linear hierarchies, branch hierarchies, and joint ownership; none supplies a computational result to mirror. The endogenous-hierarchy analysis in Section 2.2 is also not covered by a qualifying named computational result.
The strongest honest positive point is that the paper’s setting can plausibly have high multiplicity. Its examples include crowdsourcing, social mobilization, and multi-level marketing, where many participants could share a role, revenue, and recruitment pattern. A mirror might describe the population as a distribution over such roles and revenues, with mass representing the fraction of participants of each type and allocations representing per-capita revenue shares.
But the paper supplies no qualifying computational anchor for that mirror. Theorem 1, proved here, characterizes the transfer-rule family for linear hierarchies by four axioms. Theorem 4, proved here, extends that characterization to branch hierarchies; Theorem 5, also proved here, extends it to joint ownership. These are axiomatic classification results. They do not establish complexity or algorithmic results for a computational problem, and the paper gives no computational formulation that it then solves.
Section 2.2 comes closest to an optimization problem: a boss chooses a transfer parameter to maximize expected revenue under a probabilistic recruitment process. But it is not a numbered computational result, and its analysis does not make the population a continuous object. Turning it into a continuum-of-types optimization problem would be a new problem inspired by the paper, not a mirror anchored in one of its named computational results.
So the plausible high-multiplicity scenario does not yield a valid ChoCo case here. Under the programme’s requirements, there is no continuous computational question to hand a prover as the mirror of a named computational result. The paper studies allocation rules and their axiomatic foundations; continuizing those questions would be outside scope.
The appended case offers no affirmative computational anchor: it points to plausible high multiplicity, then concedes that the paper states no computational result. That is the strongest objection here. Theorem 1 characterizes a family of rules by axioms; Theorems 4 and 5 extend that characterization to branch hierarchies and joint ownership. Theorems 2 and 3 likewise characterize rules. A continuous version of any of them would ask for an axiomatic characterization over a continuous model, outside ChoCo’s scope.
The best rescue is to aggregate repeated participants by revenue and hierarchical role, while retaining a measure of who reports to whom. That could be a coherent model: repeated roles or parallel branches make high multiplicity plausible. But it would still be a continuous version of an axiomatic allocation problem, not a computational question established by these theorems. A type distribution alone may also lose the hierarchy’s incidence structure; retaining that structure calls for an additional network-valued model. Neither issue makes a continuous model impossible, but neither supplies the missing computational result.
Section 2.2 is the closest candidate. It optimizes the boss’s expected revenue over the transfer parameter \( \lambda \) under specified recruitment assumptions. A stronger proposed mirror might allow several participant types, each with its own revenue and recruitment behavior, and optimize over their population distribution. That could be a worthwhile new optimization problem. But the heterogeneity and distribution are new ingredients, and the paper does not study an algorithmic input family or a complexity question for this objective. It is inspired by the section, rather than a continuous mirror of a named computational result.
I would not argue that hierarchy participants cannot have high multiplicity; repeated recruiting cohorts or symmetric branches are credible. The negative case is narrower: even granting those scenarios, the paper’s results are axiomatic, and its endogenous-hierarchy optimization does not provide a computational anchor. So I see no worthwhile ChoCo mirror of this paper as written, while leaving open that its ideas could motivate a separate computational study.
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.