| paper | d4-journals-geb-2015-0050 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Propositions 1 and 2 provide explicit finite-chain calculations, but the paper’s regions have distinct positions and upstream relations. A continuum over river position would require a new spatial input and transfer model, so no anchor yields a continuous-population computational question the authors would recognize as their result.
fails bit b-changes — the continuum limit changes the question
No result has a surviving mirror: Propositions 1 and 2 give finite-chain inference formulas, Theorem 1 is an axiomatic characterization, and Proposition 3 proves axiom independence.
I can’t make a valid anchor-based case for a continuous mirror from this paper: it contains no named computational result of the kind the task requires.
The nearest anchors are Proposition 1, which bounds the compatible transfer rate using the cost vector; Proposition 2, which gives lower and upper limits on each region’s responsibility for cleaning its own segment; Theorem 1, which characterizes the Upstream Responsibility rule \(\gamma\) by LR, NDR, CR, and MIT; and Proposition 3, which proves those axioms are independent. These are results about inference and axiomatic characterization. None establishes a problem’s complexity or gives an algorithmic result to mirror.
A plausible setting for a population continuum would be a river divided among many small jurisdictions, with mass representing the fraction of jurisdictions of each reach type and the allocation assigning cleaning costs among upstream jurisdictions. But reach position and the ordered chain affect the paper’s rule: types that retain enough information to reproduce it may grow with the number of regions. More fundamentally, the paper’s named results characterize a rule; they do not pose the computational problem required for a ChoCo anchor. Turning that setting into a continuous optimization or complexity question would add a new problem rather than mirror a named computational result here. The paper’s axiomatic continuization is therefore outside the programme’s stated scope.
The strongest negative case is that this paper has no computational result to mirror. Proposition 1 infers a bound on the transfer rate; Proposition 2 gives responsibility intervals; Theorem 1 characterizes the Upstream Responsibility rule; Proposition 3 establishes axiom independence. Each is an inference or axiomatic result. None asks for the complexity of a computational problem or supplies an algorithmic result of the kind ChoCo studies.
One could try to promote those results into computational questions. Computing the bound and intervals from a finite cost vector is already given by explicit formulas. Computing the characterized allocation is also a natural task, but the rule directly specifies each entry; asking for its continuous analogue would add a problem rather than mirror one of the paper’s results. Making rivers longer does not supply the missing population structure: in a single river, a region’s upstream position and local costs matter, so a complete type must preserve its position. Grouping repeated, identical river systems does permit multiplicity, but the systems are independent copies; their aggregate allocation just repeats the same calculation.
A continuous spatial model of a river could be a worthwhile project, but it would need its own input representation, computational question, and results. The paper’s discussion of networks, changing transfer rates, and alternative priors may motivate such an extension, yet it does not turn its axiomatic characterization into a computational result. I cannot prove that no useful continuous project could be built from these ideas. The narrower and stronger conclusion is that none of the paper’s named results supplies a ChoCo mirror without introducing a new computational problem.
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.